#5,213

Most Influential Person

American computer scientist

According to Wikipedia, Thomas H. Cormen is the co-author of Introduction to Algorithms, along with Charles Leiserson, Ron Rivest, and Cliff Stein. In 2013, he published a new book titled Algorithms Unlocked. He is a professor of computer science at Dartmouth College and former Chairman of the Dartmouth College Department of Computer Science. Between 2004 and 2008 he directed the Dartmouth College Writing Program. His research interests are algorithm engineering, parallel computing, speeding up computations with high latency.

- Introduction to Algorithms (12993)
- Introduction to Algorithms, 2nd edition. (3867)
- Introduction to Algorithms, Second Edition (2952)
- Introduction to Algorithms, third edition (2762)
- Introduction to algorithms [2nd ed.] (2589)
- Introduction to Algorithms, 3rd Edition (875)
- The Design and Analysis of Computer Algorithms (213)
- Introduction to algorithms. Chapter 16. 2nd Edition (88)
- Integrating Theory and Practice in Parallel File Systems (78)
- A bridging model for parallel computation, communication, and I/O (67)
- Virtual memory for data-parallel computing (61)
- Introduction to Algorithms -3/Ed. (59)
- Asymptotically tight bounds for performing BMMC permutations on parallel disk systems (57)
- Fast Permuting on Disk Arrays (55)
- Introduction to Algorithms and Java CD-ROM (55)
- ViC*: A Preprocessor for Virtual-Memory C* (53)
- Algorithms Unlocked (39)
- Early Experiences in Evaluating the Parallel Disk Model with the ViC* Implementation (39)
- Performing Out-of Core FFTs on Parallel Disk Systems (38)
- Columnsort lives! an efficient out-of-core sorting program (34)
- Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems (29)
- Multiprocessor out-of-core FFTs with distributed memory and parallel disks (extended abstract) (24)
- ViC*: a compiler for virtual-memory C* (24)
- Getting More from Out-of-Core Columnsort (24)
- FG: A Framework Generator for Hiding Latency in Parallel Programs Running on Clusters (19)
- Acknowledgments We Thank (18)
- Proceedings of the Sixth Workshop on I/O in Parallel and Distributed Systems, IOPADS 1999, May 5, 1999, Atlanta, GA, USA (15)
- Model-based Learning of Interaction Strategies in Multi-agent Systems (15)
- Max-flow Min-cut Theorem (14)
- Out-of-core FFTs with parallel disks (13)
- Building on a framework: using FG for more flexibility and improved performance in parallel programs (13)
- The Scalable I/O Initiative (12)
- Multidimensional, multiprocessor, out-of-core FFTs with distributed memory and parallel disks (extended abstract) (11)
- Asynchronous Buffered Computation Design and Engineering Framework Generator ( ABCDEFG ) (9)
- Parallel out-of-core sorting: the third way (8)
- Determining an Out-of-Core FFT Decomposition Strategy for Parallel Disks by Dynamic Programming (7)
- Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation (7)
- Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters (6)
- Efficient design and implementation of permutation algorithms on the memory hierarchy (6)
- Relaxing the problem-size bound for out-of-core columnsort (6)
- Stupid Columnsort Tricks (5)
- Theoretical Computer Science (5)
- A Hyperconcentrator Swith for Routing Bit-Serial Messages (5)
- Parallel computing in a Python-based computer science course (4)
- Don't be too clever: routing BMMC permutations on the MasPar MP-2 (4)
- Performing BMMC permutations in two passes through the expanded delta network and MasPar MP-2 (4)
- The FG Programming Environment : Reducing Source Code Size for Parallel Programs Running on Clusters (4)
- Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2 (4)
- Multidimensional, Multiprocessor, Out-of-Core FFTs. (3)
- A Hyperconcentrator Switch for Routing Bit-Serial Messages (Extended Abstract), (3)
- Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI (3)
- Algorithms for Sorting and Searching (2)
- Efficient Multichip Partial Concentrator Switches (2)
- Out-of-core distribution sort in the FG programming environment (2)
- DartCVL: The Dartmouth C Vector Library (2)
- Networks beat pipelines: the design of FG 2.0 (1)
- Directed Acyclic Graphs (1)
- Dense Gray codes, or easy ways to generate cyclic and non-cyclic Gray codes for the first n whole numbers (1)
- Edna St. Vincent Millay Was Right (1)
- Dense gray codes in mixed radices (1)
- ViC*: A Compiler for Virtual-Memory C* (Extended Abstract) (1)
- When One Pipeline Is Not Enough Dartmouth Computer Science Technical Report TR 2007-596 (0)
- Acknowledgement to Referees (0)
- We must be doing something right: or is it the Facebook movie? (0)
- Foundations of Cryptography (0)
- When One Pipeline Is Not Enough (0)
- 6 Related Work Pbe from Computation Traces 7 Concluding Remarks (0)
- 16. Greedy-Algorithmen (0)
- What Are Algorithms and Why Should You Care (0)
- Proceedings of the Fifth Workshop on I/O in Parallel and Distributed Systems, IOPADS 1997, November 17, 1997, San Jose, CA, USA (0)
- US 6 , 282 , 546 B 1 Page 3 “ A Unix Network Protocol Security Study : Network Infor mation Service ' (0)
- How to Describe and Evaluate Computer Algorithms (0)
- USING RANDOM SAMPLING ON VERY LARGE DATABASES (0)
- Algorithms on Strings (0)
- Proof: Theorem 3 and Lemmas 1 and 2 Remain Valid (0)
- A Lower Bound for Sorting and How to Beat It (0)
- GAMING Connected Gaming : What Making Video Games (0)
- 5. Discussion 4. Fast Multipole Algorithm Figure 2. Initial Code for N-body Calculation 3. Refinement Prototyping Parallel Algorithms (0)
- Using FG to Reduce the Effect of Latency in Parallel Programs Running on Clusters (0)
- Workshop Reviewers (0)
- An Analyzer for Message Sequence Charts 15 Lemma 4.1 the Timed M S C M Is Timing Inconsistent I the Graph G M 5 an Msc Analysis Tool 4 Mscs with Timing Constraints (0)
- Eecient Multichip Partial Concentrator Switches (0)
- Guest Editors' Foreword (0)
- Dartcvl: the Dartmouth C Vector Library Currently with Digital Equipment Corporation. Work Performed While at Dartmouth College. Supported in Part by the Nasa Ames Research C Enter under Agreement N Umber Ncc 2-849 (0)
- An Analyzer for Message Sequence Charts 15 Acknowledgements: We Thank 5 an Msc Analysis Tool 4 Mscs with Timing Constraints (0)
- Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference (0)
- Binary GCD Algorithm (0)
- Enhancing Asynchronous Parallel Computing (0)
- Performing B M M C P Ermutations E Ciently on D Istributed-memory Multiprocessors with Mpi (0)

This paper list is powered by the following services:

Thomas H. Cormen is affiliated with the following schools:

Thomas H. Cormen is most known for their academic work in the field of computer science. They are also known for their academic work in the fields of and engineering.

Thomas H. Cormen has made the following academic contributions:

This website uses cookies to enhance the user experience. Privacy Policy

Get the latest Academic Influence news, information, and rankings with our upcoming newsletter.

Stay informed!