Cormen, Thomas H.
Overview
Works:  66 works in 338 publications in 10 languages and 7,254 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Contributor, Editor, Other 
Classifications:  QA76.6, 005.1 
Publication Timeline
.
Most widely held works by
Thomas H Cormen
Introduction to algorithms by
Thomas H Cormen(
Book
)
177 editions published between 1 and 2018 in 4 languages and held by 3,392 WorldCat member libraries worldwide
The book covers a broad range of algorithms in depth, yet makes their design and analysis acessible to all levels of readers. Each chapter is relatively selfcontained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor
177 editions published between 1 and 2018 in 4 languages and held by 3,392 WorldCat member libraries worldwide
The book covers a broad range of algorithms in depth, yet makes their design and analysis acessible to all levels of readers. Each chapter is relatively selfcontained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor
Algorithms unlocked by
Thomas H Cormen(
Book
)
19 editions published between 2013 and 2016 in 5 languages and held by 709 WorldCat member libraries worldwide
"This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen coauthor of the leading college textbook on the subject provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simples ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order ("sorting"); how to solve basic problems that can be modeled in a computer with a mathematical structure called a "graph" (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; the fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time."Back cover
19 editions published between 2013 and 2016 in 5 languages and held by 709 WorldCat member libraries worldwide
"This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen coauthor of the leading college textbook on the subject provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simples ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order ("sorting"); how to solve basic problems that can be modeled in a computer with a mathematical structure called a "graph" (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; the fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time."Back cover
Introduction à l'algorithmique by
Thomas H Cormen(
Book
)
12 editions published between 1994 and 2004 in French and held by 305 WorldCat member libraries worldwide
12 editions published between 1994 and 2004 in French and held by 305 WorldCat member libraries worldwide
Algorithmique cours avec 957 exercices et 158 problèmes by
Thomas H Cormen(
Book
)
5 editions published in 2010 in French and held by 145 WorldCat member libraries worldwide
Une introduction complète à l'algorithmique, du tri aux algorithmes parallèles. Des notions élémentaires aux thèmes plus pointus, étudiants et professionnels trouveront dans les exercices proposés, dans un code proche des langages Pascal, C et Fortan, des outils de compréhension simples.[Memento]
5 editions published in 2010 in French and held by 145 WorldCat member libraries worldwide
Une introduction complète à l'algorithmique, du tri aux algorithmes parallèles. Des notions élémentaires aux thèmes plus pointus, étudiants et professionnels trouveront dans les exercices proposés, dans un code proche des langages Pascal, C et Fortan, des outils de compréhension simples.[Memento]
Performing outof core FFTS on parallel disk systems by
Thomas H Cormen(
Book
)
5 editions published in 1996 in English and held by 82 WorldCat member libraries worldwide
Abstract: "The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most onedimensional FFT problems can be solved entirely in main memory, some important classes of applications require outofcore techniques. For these, use of parallel I/O systems can improve performance considerably. This paper shows how to perform onedimensional FFTs using a parallel disk system with independent disk accesses. We present both analytical and experimental results for performing outofcore FFTs in two ways: using traditional virtual memory with demand paging, and using a provably asymptotically optimal algorithm for the Parallel Disk Model (PDM) of Vitter and Shriver. When run on a DEC 2100 server with a large memory and eight parallel disks, the optimal algorithm for the PDM runs up to 144.7 times faster than incore methods under demand paging. Moreover, even including I/O costs, the normalized times for the optimal PDM algorithm are competitive, or better than, those for incore methods even when they run entirely in memory."
5 editions published in 1996 in English and held by 82 WorldCat member libraries worldwide
Abstract: "The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most onedimensional FFT problems can be solved entirely in main memory, some important classes of applications require outofcore techniques. For these, use of parallel I/O systems can improve performance considerably. This paper shows how to perform onedimensional FFTs using a parallel disk system with independent disk accesses. We present both analytical and experimental results for performing outofcore FFTs in two ways: using traditional virtual memory with demand paging, and using a provably asymptotically optimal algorithm for the Parallel Disk Model (PDM) of Vitter and Shriver. When run on a DEC 2100 server with a large memory and eight parallel disks, the optimal algorithm for the PDM runs up to 144.7 times faster than incore methods under demand paging. Moreover, even including I/O costs, the normalized times for the optimal PDM algorithm are competitive, or better than, those for incore methods even when they run entirely in memory."
Introduzione agli algoritmi e strutture dati(
Book
)
3 editions published between 2005 and 2010 in Italian and held by 34 WorldCat member libraries worldwide
3 editions published between 2005 and 2010 in Italian and held by 34 WorldCat member libraries worldwide
Introduzione agli algoritmi by
Thomas H Cormen(
Book
)
3 editions published between 1994 and 1999 in Italian and held by 24 WorldCat member libraries worldwide
3 editions published between 1994 and 1999 in Italian and held by 24 WorldCat member libraries worldwide
Wprowadzenie do algorytmów by
Thomas H Cormen(
Book
)
12 editions published between 1997 and 2015 in Polish and held by 17 WorldCat member libraries worldwide
12 editions published between 1997 and 2015 in Polish and held by 17 WorldCat member libraries worldwide
Algorithmes notions de base by
Thomas H Cormen(
)
1 edition published in 2013 in French and held by 17 WorldCat member libraries worldwide
1 edition published in 2013 in French and held by 17 WorldCat member libraries worldwide
Efficient multichip partial concentrator switches by
Thomas H Cormen(
Book
)
4 editions published in 1987 in English and held by 8 WorldCat member libraries worldwide
Due to chip area and pin count constraints, large concentrator switches sometimes must be partitioned among several chips. This paper presents designs for two multichip partial concentrator switches, both of which follow from a lemma showing that an epsilon nearsorter is also an (n, m, 1epsilon/m) partial concentrator. Keywords include: nearsorting, message routing network, bitserial message, concentrator switch, hyperconcentrator switch, partial concentrator switch, revsort, and columnsort
4 editions published in 1987 in English and held by 8 WorldCat member libraries worldwide
Due to chip area and pin count constraints, large concentrator switches sometimes must be partitioned among several chips. This paper presents designs for two multichip partial concentrator switches, both of which follow from a lemma showing that an epsilon nearsorter is also an (n, m, 1epsilon/m) partial concentrator. Keywords include: nearsorting, message routing network, bitserial message, concentrator switch, hyperconcentrator switch, partial concentrator switch, revsort, and columnsort
A hyperconcentrator switch for routing bitserial messages by
Thomas H Cormen(
Book
)
3 editions published in 1987 in English and held by 6 WorldCat member libraries worldwide
In highly parallel message routing networks, it is sometimes desirable to concentrate relatively few messages on many wires onto fewer wires. We have designed a VLSI chip for this purpose which is capable of concentrating bitserial messages quickly. This hyperconcerntrator switch has a highly regular layout using ratioed nMOS and takes advantage of the relatively fast performance of large fanin NOR gates in this technology. A signal incurs exactly 21gn gate delays through the switch, where n is the number of inputs to the circuit. The architecture generalizes to domino CMOS as well. Keywords include: Message routing network, bitserial message, concentrator switch, hyperconcentrator switch, superconcentrator switch butterfly network, merge sort, and VLSI
3 editions published in 1987 in English and held by 6 WorldCat member libraries worldwide
In highly parallel message routing networks, it is sometimes desirable to concentrate relatively few messages on many wires onto fewer wires. We have designed a VLSI chip for this purpose which is capable of concentrating bitserial messages quickly. This hyperconcerntrator switch has a highly regular layout using ratioed nMOS and takes advantage of the relatively fast performance of large fanin NOR gates in this technology. A signal incurs exactly 21gn gate delays through the switch, where n is the number of inputs to the circuit. The architecture generalizes to domino CMOS as well. Keywords include: Message routing network, bitserial message, concentrator switch, hyperconcentrator switch, superconcentrator switch butterfly network, merge sort, and VLSI
Algoritmusok by
Thomas H Cormen(
Book
)
5 editions published between 1990 and 2003 in Hungarian and held by 5 WorldCat member libraries worldwide
5 editions published between 1990 and 2003 in Hungarian and held by 5 WorldCat member libraries worldwide
Virtual memory for dataparallel computing by
Thomas H Cormen(
Book
)
4 editions published between 1992 and 1993 in English and held by 5 WorldCat member libraries worldwide
4 editions published between 1992 and 1993 in English and held by 5 WorldCat member libraries worldwide
Arugorizumu intorodakushon : sekai hyōjun emuaitī kyōkasho(
Book
)
6 editions published between 2007 and 2012 in Japanese and held by 4 WorldCat member libraries worldwide
6 editions published between 2007 and 2012 in Japanese and held by 4 WorldCat member libraries worldwide
Concentrator switches for routing messages in parallel computers by
Thomas H Cormen(
)
3 editions published in 1986 in English and Undetermined and held by 3 WorldCat member libraries worldwide
3 editions published in 1986 in English and Undetermined and held by 3 WorldCat member libraries worldwide
Arugorizumu no sekkei to kaiseki shuho(
Book
)
2 editions published between 1995 and 2007 in Japanese and held by 3 WorldCat member libraries worldwide
2 editions published between 1995 and 2007 in Japanese and held by 3 WorldCat member libraries worldwide
Algoritmos : teoria e prática(
Book
)
2 editions published between 2002 and 2012 in Portuguese and held by 3 WorldCat member libraries worldwide
2 editions published between 2002 and 2012 in Portuguese and held by 3 WorldCat member libraries worldwide
Sugakuteki kiso to deta kozo(
Book
)
2 editions published between 1995 and 2007 in Japanese and held by 3 WorldCat member libraries worldwide
2 editions published between 1995 and 2007 in Japanese and held by 3 WorldCat member libraries worldwide
Proceedings of the IOPADS, Sixth Workshop on I/O in Parallel and Distributed Systems : part of FCRC '99 : the ACM Federated
Computing Research Conference : May 5, 1999, Atlanta, Georgia by
Thomas H Cormen(
Book
)
3 editions published in 1999 in English and held by 2 WorldCat member libraries worldwide
3 editions published in 1999 in English and held by 2 WorldCat member libraries worldwide
Proceedings of the IOPADS, Fifth Workshop on I/O in Parallel and Distributed Systems : colocated with SC97: High Performance
Networking and Computing : November 17, 1997 San Jose, California by
Thomas H Cormen(
)
2 editions published in 1997 in English and held by 0 WorldCat member libraries worldwide
2 editions published in 1997 in English and held by 0 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Leiserson, Charles Eric Other
 Rivest, Ronald L. Other
 Cazin, Xavier Translator
 Chrétienne, Philippe
 Kocher, GeorgesLouis Translator
 Soulard, Hervé Translator
 Stein, Clifford (1965 ...) Other
 Lippert, Karin
 Nicol, David
 Institute for Computer Applications in Science and Engineering
Useful Links
Associated Subjects
Algorithms Computer algorithms Computer inputoutput equipment Computer programming Computer science Data structures (Computer science) Electronic data processingDistributed processing Fourier transformations Integrated circuitsVery large scale integration Magnetic disks Parallel processing (Electronic computers) Sorting (Electronic computers) Switched capacitor circuits
Alternative Names
Cormen, T.
Cormen, T. H.
Cormen, Th. H.
Cormen, Thomas
Cormen, Tom
Cormen, Tom H.
Thomas H. Cormen American computer scientist
Thomas H. Cormen Amerikaans informaticus
Thomas H. Cormen amerikansk ingeniør og informatikar
Thomas H. Cormen amerikansk ingeniør og informatiker
Thomas H. Cormen amerikansk ingenjör och datavetare
Thomas H. Cormen informaticien américain
Thomas H. Cormen informatico statunitense
Кормен, Т.
Кормен, Томас
Томас Кормен
Томас Х. Кормен
קארמאן, תומס ה.
קורמאן, תומס ה.
קורמן, תומאס.
توماس اچ کورمن دانشمند علوم کامپیوتر و مهندس آمریکایی
コルメン, T.
コルメン, T. H.
コルメン, トーマス・H.
寇孟
托馬斯·科爾曼
Languages
English
(197)
French (22)
Japanese (12)
Polish (12)
German (6)
Italian (6)
Hungarian (5)
Chinese (4)
Portuguese (3)
Spanish (3)
French (22)
Japanese (12)
Polish (12)
German (6)
Italian (6)
Hungarian (5)
Chinese (4)
Portuguese (3)
Spanish (3)
Covers