| 2012 | ||
|---|---|---|
| 30 | Peter C. Johnson, Thomas H. Cormen: Networks beat pipelines: the design of FG 2.0. PMAM 2012: 168-175 | |
| 2010 | ||
| 29 | Priya Natarajan, Thomas H. Cormen, Elena Riccio Strange: Out-of-core distribution sort in the FG programming environment. IPDPS Workshops 2010: 1-8 | |
| 2009 | ||
| 28 | Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Introduction to Algorithms (3. ed.). MIT Press 2009: I-XIX, 1-1292 | |
| 2006 | ||
| 27 | 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 | ||
| 26 | Geeta Chaudhry, Thomas H. Cormen: Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation. ESA 2005: 317-328 | |
| 25 | Elena Riccio Davidson, Thomas H. Cormen: Building on a Framework: Using FG for More Flexibility and Improved Performance in Parallel Programs. IPDPS 2005 | |
| 2004 | ||
| 24 | Thomas H. Cormen, Elena Riccio Davidson: FG: A Framework Generator for Hiding Latency in Parallel Programs Running on Clusters. ISCA PDCS 2004: 137-144 | |
| 23 | Thomas H. Cormen: Edna St. Vincent Millay Was Right. ISCA PDCS 2004: 596 | |
| 2003 | ||
| 22 | Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Cormen: Relaxing the problem-size bound for out-of-core columnsort. SPAA 2003: 250-251 | |
| 2002 | ||
| 21 | Geeta Chaudhry, Thomas H. Cormen: Getting More from Out-of-Core Columnsort. ALENEX 2002: 143-154 | |
| 2001 | ||
| 20 | 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 | |
| 19 | Geeta Chaudhry, Thomas H. Cormen, Leonard F. Wisniewski: Columnsort lives! an efficient out-of-core sorting program. SPAA 2001: 169-178 | |
| 2000 | ||
| 18 | Thomas H. Cormen, Frank K. H. A. Dehne, Pierre Fraigniaud, Yossi Matias: Guest Editors' Foreword. Theory Comput. Syst. 33(5/6): 335 (2000) | |
| 1999 | ||
| 17 | Lauren M. Baptist, Thomas H. Cormen: Multidimensional, Multiprocessor, Out-of-Core FFTs. SPAA 1999: 242-250 | |
| 16 | Thomas H. Cormen, James C. Clippinger: Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI. Algorithmica 24(3-4): 349-370 (1999) | |
| 1998 | ||
| 15 | Alex Colvin, Thomas H. Cormen: ViC*: A Compiler for Virtual-Memory C*. HIPS 1998: 23-33 | |
| 14 | Thomas H. Cormen, David M. Nicol: Performing Out-of Core FFTs on Parallel Disk Systems. Parallel Computing 24(1): 5-20 (1998) | |
| 13 | 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) | |
| 12 | 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) | |
| 1997 | ||
| 11 | 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 | |
| 10 | Thomas H. Cormen, Melissa Hirschl: Early Experiences in Evaluating the Parallel Disk Model with the ViC* Implementation. Parallel Computing 23(4-5): 571-600 (1997) | |
| 9 | Thomas H. Cormen, David M. Nicol: Out-of-Core FFTs with Parallel Disks. SIGMETRICS Performance Evaluation Review 25(3): 3-12 (1997) | |
| 1996 | ||
| 8 | Thomas H. Cormen, Michael T. Goodrich: A Bridging Model for Parallel Computation, Communication, and I/O. ACM Comput. Surv. 28(4es): 208 (1996) | |
| 1995 | ||
| 7 | Thomas H. Cormen, Kristin Bruhl: Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2. SPAA 1995: 288-297 | |
| 1993 | ||
| 6 | Thomas H. Cormen, Leonard F. Wisniewski: Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems. SPAA 1993: 130-139 | |
| 5 | Thomas H. Cormen: Fast Permuting on Disk Arrays. J. Parallel Distrib. Comput. 17(1-2): 41-57 (1993) | |
| 1990 | ||
| 4 | Thomas H. Cormen, Charles E. Leiserson: A Hyperconcentrator Swith for Routing Bit-Serial Messages. J. Parallel Distrib. Comput. 10(3): 193-204 (1990) | |
| 1989 | ||
| 3 | Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest: Introduction to Algorithms The MIT Press and McGraw-Hill Book Company 1989 | |
| 1987 | ||
| 2 | Thomas H. Cormen: Efficient Multichip Partial Concentrator Switches. ICPP 1987: 525-532 | |
| 1986 | ||
| 1 | Thomas H. Cormen, Charles E. Leiserson: A Hyperconcentrator Switch for Routing Bit-Serial Messages. ICPP 1986: 721-728 | |
| 1 | Lauren M. Baptist | [17] |
| 2 | Kristin Bruhl | [7] [12] |
| 3 | Geeta Chaudhry | [19] [21] [22] [26] [27] |
| 4 | James C. Clippinger | [16] |
| 5 | Alex Colvin | [15] |
| 6 | Elena Riccio Davidson | [24] [25] |
| 7 | Frank K. H. A. Dehne (Frank Dehne) | [18] |
| 8 | Pierre Fraigniaud | [18] |
| 9 | Michael T. Goodrich | [8] |
| 10 | Elizabeth A. Hamon | [22] |
| 11 | Melissa Hirschl | [10] |
| 12 | Peter C. Johnson | [30] |
| 13 | Charles E. Leiserson | [1] [3] [4] [20] [28] |
| 14 | Yossi Matias | [18] |
| 15 | Priya Natarajan | [29] |
| 16 | David M. Nicol | [9] [11] [14] |
| 17 | Ronald L. Rivest | [3] [20] [28] |
| 18 | Clifford Stein | [20] [28] |
| 19 | Elena Riccio Strange | [29] |
| 20 | Thomas Sundquist | [13] |
| 21 | Jake Wegmann | [11] |
| 22 | Leonard F. Wisniewski | [6] [13] [19] |
Colors in the list of coauthors
Last update Wed May 16 23:21:41 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page