default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas H. Cormen
Person information
- affiliation: Dartmouth College, Hanover, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c18]Jessica C. Fan, Thomas H. Cormen:
Dense gray codes in mixed radices. ISIT 2017: 1013-1017- 2016
- [c17]Thomas H. Cormen, Jessica C. Fan:
Dense Gray codes, or easy ways to generate cyclic and non-cyclic Gray codes for the first n whole numbers. Allerton 2016: 355-362 - 2013
- [b4]Thomas H. Cormen:
Algorithms Unlocked. MIT Press 2013, ISBN 978-0-262-51880-2, pp. I-XIII, 1-222 - 2012
- [c16]Peter C. Johnson, Thomas H. Cormen:
Networks beat pipelines: the design of FG 2.0. PMAM 2012: 168-175 - 2010
- [c15]Priya Natarajan, Thomas H. Cormen, Elena Riccio Strange:
Out-of-core distribution sort in the FG programming environment. IPDPS Workshops 2010: 1-8
2000 – 2009
- 2009
- [b3]Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein:
Introduction to Algorithms, 3rd Edition. MIT Press 2009, ISBN 978-0-262-03384-8, pp. I-XIX, 1-1292 - 2007
- [r2]Thomas H. Cormen, Elena Riccio Davidson:
Using FG to Reduce the Effect of Latency in Parallel Programs Running on Clusters. Handbook of Parallel Computing 2007 - 2006
- [j11]Geeta Chaudhry, Thomas H. Cormen:
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters. Algorithmica 45(3): 483-508 (2006) - 2005
- [c14]Geeta Chaudhry, Thomas H. Cormen:
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation. ESA 2005: 317-328 - [c13]Elena Riccio Davidson, Thomas H. Cormen:
Building on a Framework: Using FG for More Flexibility and Improved Performance in Parallel Programs. IPDPS 2005 - 2004
- [c12]Thomas H. Cormen, Elena Riccio Davidson:
FG: A Framework Generator for Hiding Latency in Parallel Programs Running on Clusters. PDCS 2004: 137-144 - [c11]Thomas H. Cormen:
Edna St. Vincent Millay Was Right. PDCS 2004: 596 - 2003
- [c10]Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Cormen:
Relaxing the problem-size bound for out-of-core columnsort. SPAA 2003: 250-251 - 2002
- [c9]Geeta Chaudhry, Thomas H. Cormen:
Getting More from Out-of-Core Columnsort. ALENEX 2002: 143-154 - 2001
- [b2]Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein:
Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company 2001, ISBN 0-262-03293-7 - [c8]Geeta Chaudhry, Thomas H. Cormen, Leonard F. Wisniewski:
Columnsort lives! an efficient out-of-core sorting program. SPAA 2001: 169-178 - 2000
- [j10]Thomas H. Cormen, Frank K. H. A. Dehne, Pierre Fraigniaud, Yossi Matias:
Guest Editors' Foreword. Theory Comput. Syst. 33(5/6): 335 (2000)
1990 – 1999
- 1999
- [j9]Thomas H. Cormen, James C. Clippinger:
Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI. Algorithmica 24(3-4): 349-370 (1999) - [c7]Lauren M. Baptist, Thomas H. Cormen:
Multidimensional, Multiprocessor, Out-of-Core FFTs. SPAA 1999: 242-250 - [r1]William I. Gasarch, Arto Salomaa, Thomas H. Cormen, Lane A. Hemaspaandra, Milena Mihail:
Theoretical Computer Science. Handbook of Discrete and Combinatorial Mathematics 1999 - 1998
- [j8]Thomas H. Cormen, Kristin Bruhl:
Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2. Theory Comput. Syst. 31(3): 251-278 (1998) - [j7]Thomas H. Cormen, David M. Nicol:
Performing Out-of Core FFTs on Parallel Disk Systems. Parallel Comput. 24(1): 5-20 (1998) - [j6]Thomas H. Cormen, Thomas Sundquist, Leonard F. Wisniewski:
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems. SIAM J. Comput. 28(1): 105-136 (1998) - [c6]Alex Colvin, Thomas H. Cormen:
ViC*: A Compiler for Virtual-Memory C*. HIPS 1998: 23-33 - 1997
- [j5]Thomas H. Cormen, Melissa Hirschl:
Early Experiences in Evaluating the Parallel Disk Model with the ViC* Implementation. Parallel Comput. 23(4-5): 571-600 (1997) - [j4]Thomas H. Cormen, David M. Nicol:
Out-of-Core FFTs with Parallel Disks. SIGMETRICS Perform. Evaluation Rev. 25(3): 3-12 (1997) - [c5]Thomas H. Cormen, Jake Wegmann, David M. Nicol:
Multiprocessor Out-of-core FFTs with Distributed Memory and Parallel Disks (extended abstract). IOPADS 1997: 68-78 - 1996
- [j3]Thomas H. Cormen, Michael T. Goodrich:
A Bridging Model for Parallel Computation, Communication, and I/O. ACM Comput. Surv. 28(4es): 208 (1996) - 1995
- [c4]Thomas H. Cormen, Kristin Bruhl:
Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2. SPAA 1995: 288-297 - 1993
- [j2]Thomas H. Cormen:
Fast Permuting on Disk Arrays. J. Parallel Distributed Comput. 17(1-2): 41-57 (1993) - [c3]Thomas H. Cormen, Leonard F. Wisniewski:
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems. SPAA 1993: 130-139 - 1990
- [j1]Thomas H. Cormen, Charles E. Leiserson:
A Hyperconcentrator Swith for Routing Bit-Serial Messages. J. Parallel Distributed Comput. 10(3): 193-204 (1990)
1980 – 1989
- 1989
- [b1]Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest:
Introduction to Algorithms. The MIT Press and McGraw-Hill Book Company 1989, ISBN 0-262-03141-8 - 1987
- [c2]Thomas H. Cormen:
Efficient Multichip Partial Concentrator Switches. ICPP 1987: 525-532 - 1986
- [c1]Thomas H. Cormen, Charles E. Leiserson:
A Hyperconcentrator Switch for Routing Bit-Serial Messages. ICPP 1986: 721-728
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
