Thomas H. Cormen

According to our database1, Thomas H. Cormen authored at least 34 papers between 1986 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Dense gray codes in mixed radices.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Dense Gray codes, or easy ways to generate cyclic and non-cyclic Gray codes for the first n whole numbers.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2013
Algorithms Unlocked.
MIT Press, ISBN: 978-0-262-51880-2, 2013

2012
Networks beat pipelines: the design of FG 2.0.
Proceedings of the 2012 PPOPP International Workshop on Programming Models and Applications for Multicores and Manycores, 2012

2010
Out-of-core distribution sort in the FG programming environment.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009
Introduction to Algorithms, 3rd Edition.
MIT Press, ISBN: 9780262533058, 2009

2007
Using FG to Reduce the Effect of Latency in Parallel Programs Running on Clusters.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

2006
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters.
Algorithmica, 2006

2005
Building on a Framework: Using FG for More Flexibility and Improved Performance in Parallel Programs.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation.
Proceedings of the Algorithms, 2005

2004
FG: A Framework Generator for Hiding Latency in Parallel Programs Running on Clusters.
Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

Edna St. Vincent Millay Was Right.
Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

2003
Relaxing the problem-size bound for out-of-core columnsort.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002
Getting More from Out-of-Core Columnsort.
Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001
Columnsort lives! an efficient out-of-core sorting program.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Introduction to Algorithms, Second Edition
The MIT Press and McGraw-Hill Book Company, ISBN: 0-07-013151-1, 2001

2000
Guest Editors' Foreword.
Theory Comput. Syst., 2000

1999
Theoretical Computer Science.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI.
Algorithmica, 1999

Multidimensional, Multiprocessor, Out-of-Core FFTs.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

1998
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems.
SIAM J. Comput., 1998

Performing Out-of Core FFTs on Parallel Disk Systems.
Parallel Comput., 1998

Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2.
Theory Comput. Syst., 1998

ViC*: A Compiler for Virtual-Memory C*.
Proceedings of the 3rd International Workshop on High-Level Programming Models and Supportive Environments (HIPS '98), 30 March, 1998

1997
Out-of-Core FFTs with Parallel Disks.
SIGMETRICS Perform. Evaluation Rev., 1997

Early Experiences in Evaluating the Parallel Disk Model with the ViC* Implementation.
Parallel Comput., 1997

Multiprocessor Out-of-core FFTs with Distributed Memory and Parallel Disks (extended abstract).
Proceedings of the Fifth Workshop on I/O in Parallel and Distributed Systems, 1997

1996
A Bridging Model for Parallel Computation, Communication, and I/O.
ACM Comput. Surv., 1996

1993
Fast Permuting on Disk Arrays.
J. Parallel Distributed Comput., 1993

Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

1990
A Hyperconcentrator Swith for Routing Bit-Serial Messages.
J. Parallel Distributed Comput., 1990

1989
Introduction to Algorithms
The MIT Press and McGraw-Hill Book Company, ISBN: 0-07-013143-0, 1989

1987
Efficient Multichip Partial Concentrator Switches.
Proceedings of the International Conference on Parallel Processing, 1987

1986
A Hyperconcentrator Switch for Routing Bit-Serial Messages.
Proceedings of the International Conference on Parallel Processing, 1986


  Loading...