Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Charles E. Leiserson
2010 – today
- 2013
[c62]I.-Ting Angelina Lee, Charles E. Leiserson, Tao B. Schardl, Jim Sukha, Zhunping Zhang: On-the-fly pipeline parallelism. SPAA 2013: 140-151- 2012
- [j25]Matteo Frigo, Charles E. Leiserson, Harald Prokop, Sridhar Ramachandran: Cache-Oblivious Algorithms. ACM Transactions on Algorithms 8(1): 4 (2012)
- [c61]Charles E. Leiserson, Tao B. Schardl, Jim Sukha: Deterministic parallel random-number generation for dynamic-multithreading platforms. PPOPP 2012: 193-204
- [c60]Kunal Agrawal, Jeremy T. Fineman, Jordan Krage, Charles E. Leiserson, Sivan Toledo: Cache-conscious scheduling of streaming applications. SPAA 2012: 236-245
- [c59]I.-Ting Angelina Lee, Aamir Shafi, Charles E. Leiserson: Memory-mapping support for reducer hyperobjects. SPAA 2012: 287-297
- 2011
- [c58]Yuan Tang, Rezaul Alam Chowdhury, Bradley C. Kuszmaul, Chi-Keung Luk, Charles E. Leiserson: The pochoir stencil compiler. SPAA 2011: 117-128
- [r2]
- [r1]Jeremy T. Fineman, Charles E. Leiserson: Race Detectors for Cilk and Cilk++ Programs. Encyclopedia of Parallel Computing 2011: 1706-1719
- 2010
- [j24]Charles E. Leiserson: The Cilk++ concurrency platform. The Journal of Supercomputing 51(3): 244-257 (2010)
- [c57]I.-Ting Angelina Lee, Silas Boyd-Wickizer, Zhiyi Huang, Charles E. Leiserson: Using memory mapping to support cactus stacks in work-stealing runtime systems. PACT 2010: 411-420
- [c56]Charles E. Leiserson, Marc Moreno Maza, Liyun Li, Yuzhen Xie: Parallel computation of the minimal elements of a poset. PASCO 2010: 53-62
- [c55]Charles E. Leiserson, Liyun Li, Marc Moreno Maza, Yuzhen Xie: Efficient Evaluation of Large Polynomials. ICMS 2010: 342-353
- [c54]Kunal Agrawal, Charles E. Leiserson, Jim Sukha: Executing task graphs using work-stealing. IPDPS 2010: 1-12
- [c53]Kunal Agrawal, Charles E. Leiserson, Jim Sukha: Helper locks for fork-join parallel programming. PPOPP 2010: 245-256
- [c52]Yuxiong He, Charles E. Leiserson, William M. Leiserson: The Cilkview scalability analyzer. SPAA 2010: 145-156
- [c51]Charles E. Leiserson, Tao B. Schardl: A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). SPAA 2010: 303-314
2000 – 2009
- 2009
- [b3]Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Introduction to Algorithms (3. ed.). MIT Press 2009, ISBN 978-0-262-03384-8, pp. I-XIX, 1-1292
- [c50]
- [c49]Matteo Frigo, Pablo Halpern, Charles E. Leiserson, Stephen Lewin-Berlin: Reducers and other Cilk++ hyperobjects. SPAA 2009: 79-90
- [c48]Aydin Buluç, Jeremy T. Fineman, Matteo Frigo, John R. Gilbert, Charles E. Leiserson: Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. SPAA 2009: 233-244
- 2008
- [j23]Kunal Agrawal, Charles E. Leiserson, Yuxiong He, Wen-Jing Hsu: Adaptive work-stealing with parallelism feedback. ACM Trans. Comput. Syst. 26(3) (2008)
- [j22]Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson: Provably Efficient Online Nonclairvoyant Adaptive Scheduling. IEEE Trans. Parallel Distrib. Syst. 19(9): 1263-1279 (2008)
- [c47]Edya Ladan-Mozes, Charles E. Leiserson: A consistency architecture for hierarchical shared caches. SPAA 2008: 11-22
- 2007
- [c46]Chris Hill, Bradley C. Kuszmaul, Charles E. Leiserson, John Marshall: Planet-in-a-Bottle: A Numerical Fluid-Laboratory System. International Conference on Computational Science (1) 2007: 1163-1170
- [c45]Kunal Agrawal, Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson: Adaptive Scheduling with Parallelism Feedback. IPDPS 2007: 1-7
- [c44]Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson: Provably Efficient Online Non-clairvoyant Adaptive Scheduling. IPDPS 2007: 1-10
- [c43]Kunal Agrawal, Yuxiong He, Charles E. Leiserson: Adaptive work stealing with parallelism feedback. PPOPP 2007: 112-120
- 2006
- [j21]C. Scott Ananian, Krste Asanovic, Bradley C. Kuszmaul, Charles E. Leiserson, Sean Lie: Unbounded Transactional Memory. IEEE Micro 26(1): 59-69 (2006)
- [j20]John S. Danaher, I.-Ting Angelina Lee, Charles E. Leiserson: Programming with exceptions in JCilk. Sci. Comput. Program. 63(2): 147-171 (2006)
- [c42]Kunal Agrawal, Charles E. Leiserson, Jim Sukha: Memory models for open-nested transactions. Memory System Performance and Correctness 2006: 70-81
- [c41]Kunal Agrawal, Yuxiong He, Charles E. Leiserson: An Empirical Evaluation ofWork Stealing with Parallelism Feedback. ICDCS 2006: 19
- [c40]Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson: Provably Efficient Two-Level Adaptive Scheduling. JSSPP 2006: 1-32
- [c39]Kunal Agrawal, Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson: Adaptive scheduling with parallelism feedback. PPOPP 2006: 100-109
- 2005
- [c38]C. Scott Ananian, Krste Asanovic, Bradley C. Kuszmaul, Charles E. Leiserson, Sean Lie: Unbounded Transactional Memory. HPCA 2005: 316-327
- [c37]Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson: Adversarial contention resolution for simple channels. SPAA 2005: 325-332
- [e1]Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn (Eds.): Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004. Dagstuhl Seminar Proceedings 04301, IBFI, Schloss Dagstuhl, Germany 2005
- 2004
- [c36]Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn: 04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. Cache-Oblivious and Cache-Aware Algorithms 2004
- [c35]Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson: Adversarial Analyses of Window Backoff Strategies. IPDPS Next Generation Software Program - NSFNGS - PI Workshop 2004
- [c34]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson: On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. SPAA 2004: 133-144
- [c33]
- 2003
- [c32]
- 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
- 2000
- [c31]Ching Law, Charles E. Leiserson: A New Competitive Analysis of Randomized Caching. ISAAC 2000: 35-46
1990 – 1999
- 1999
- [j19]Robert D. Blumofe, Charles E. Leiserson: Scheduling Multithreaded Computations by Work Stealing. J. ACM 46(5): 720-748 (1999)
- [j18]Mingdong Feng, Charles E. Leiserson: Efficient Detection of Determinacy Races in Cilk Programs. Theory Comput. Syst. 32(3): 301-326 (1999)
- [c30]Matteo Frigo, Charles E. Leiserson, Harald Prokop, Sridhar Ramachandran: Cache-Oblivious Algorithms. FOCS 1999: 285-298
- [c29]Charles E. Leiserson: Design and Analysis of Algorithms for Shared-Memory Multiprocessors (Abstract). WADS 1999: 55
- 1998
- [j17]Guy E. Blelloch, Charles E. Leiserson: An Experimental Analysis of Parallel Sorting Algorithms. Theory Comput. Syst. 31(2): 135-167 (1998)
- [j16]Robert D. Blumofe, Charles E. Leiserson: Space-Efficient Scheduling of Multithreaded Computations. SIAM J. Comput. 27(1): 202-229 (1998)
- [c28]Matteo Frigo, Charles E. Leiserson, Keith H. Randall: The Implementation of the Cilk-5 Multithreaded Language. PLDI 1998: 212-223
- [c27]Guang-Ien Cheng, Mingdong Feng, Charles E. Leiserson, Keith H. Randall, Andrew F. Stark: Detecting Data Rase in Cilk Programs That use Locks. SPAA 1998: 298-309
- 1997
- [j15]Alexander T. Ishii, Charles E. Leiserson, Marios C. Papaefthymiou: Optimizing two-phase, level-clocked circuitry. J. ACM 44(1): 148-199 (1997)
- [j14]Charles E. Leiserson, Satish Rao, Sivan Toledo: Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers. J. Comput. Syst. Sci. 54(2): 332-344 (1997)
- [j13]Charles E. Leiserson, Keith H. Randall: Parallel Algorithms for the Circuit Value Update Problem. Theory Comput. Syst. 30(6): 583-597 (1997)
- [c26]
- [c25]
- [c24]Mingdong Feng, Charles E. Leiserson: Efficient Detection of Determinacy Races in Cilk Programs. SPAA 1997: 1-11
- 1996
- [j12]Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha: A Comparison of Sorting Algorithms for the Connection Machine CM-2. Commun. ACM 39(12es): 273-297 (1996)
- [j11]Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C. Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong-Chan, Shaw-Wen Yang, Robert Zak: The Network Architecture of the Connection Machine CM-5. J. Parallel Distrib. Comput. 33(2): 145-158 (1996)
- [j10]Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, Yuli Zhou: Cilk: An Efficient Multithreaded Runtime System. J. Parallel Distrib. Comput. 37(1): 55-69 (1996)
- [c23]Charles E. Leiserson: Can Multithreaded Programming Save Massively Parallel Computing? IPPS 1996: 2-3
- [c22]Robert D. Blumofe, Matteo Frigo, Christopher F. Joerg, Charles E. Leiserson, Keith H. Randall: Dag-Consistent Distributed Shared Memory. IPPS 1996: 132-141
- [c21]Robert D. Blumofe, Matteo Frigo, Christopher F. Joerg, Charles E. Leiserson, Keith H. Randall: An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms. SPAA 1996: 297-308
- 1995
- [c20]Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, Yuli Zhou: Cilk: An Efficient Multithreaded Runtime System. PPOPP 1995: 207-216
- [c19]Charles E. Leiserson, Keith H. Randall: Parallel Algorithms for the Circuit Value Update Problem. SPAA 1995: 13-20
- 1993
- [c18]Charles E. Leiserson, Satish Rao, Sivan Toledo: Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract). FOCS 1993: 704-713
- [c17]Robert D. Blumofe, Charles E. Leiserson: Space-efficient scheduling of multithreaded computations. STOC 1993: 362-371
- 1992
- [c16]Charles E. Leiserson: The Networks of the Connection Machine CM-5. Heinz Nixdorf Symposium 1992: 66-67
- [c15]Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C. Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong, Shaw-Wen Yang, Robert Zak: The Network Architecture of the Connection Machine CM-5 (Extended Abstract). SPAA 1992: 272-285
- 1991
- [j9]
- [c14]Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha: A Comparison of Sorting Algorithms for the Connection Machine CM-2. SPAA 1991: 3-16
- 1990
- [j8]Thomas H. Cormen, Charles E. Leiserson: A Hyperconcentrator Swith for Routing Bit-Serial Messages. J. Parallel Distrib. Comput. 10(3): 193-204 (1990)
- [j7]Joe Kilian, Shlomo Kipnis, Charles E. Leiserson: The Organization of Permutation Architectures with Bused Interconnections. IEEE Trans. Computers 39(11): 1346-1358 (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
- 1988
- [j6]Charles E. Leiserson, Bruce M. Maggs: Communication-Efficient Parallel Algorithms for Distributed Random-Access Machines. Algorithmica 3: 53-77 (1988)
- [j5]Charles E. Leiserson, James B. Saxe: A Mixed-Integer Linear Programming Problem which is Efficiently Solvable. J. Algorithms 9(1): 114-128 (1988)
- 1987
- [c13]Joe Kilian, Shlomo Kipnis, Charles E. Leiserson: The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract). FOCS 1987: 305-315
- [c12]Charles E. Leiserson, John G. Lewis: Orderings for Parallel Sparse Symmetric Factorization. PPSC 1987: 27-31
- 1986
- [j4]Benny Chor, Charles E. Leiserson, Ronald L. Rivest, James B. Shearer: An application of number theory to the organization of raster-graphics memory. J. ACM 33(1): 86-104 (1986)
- [c11]Richard E. Zippel, Paul Penfield Jr., Lance A. Glasser, Charles E. Leiserson, John L. Wyatt Jr., Jonathan Allen: Recent Results in VLSI CAD at MIT. FJCC 1986: 871-877
- [c10]Thomas H. Cormen, Charles E. Leiserson: A Hyperconcentrator Switch for Routing Bit-Serial Messages. ICPP 1986: 721-728
- [c9]Charles E. Leiserson, Bruce M. Maggs: Communication-Efficient Parallel Graph Algorithms. ICPP 1986: 861-868
- 1985
- [j3]Frank Thomson Leighton, Charles E. Leiserson: Wafer-Scale Integration of Systolic Arrays. IEEE Trans. Computers 34(5): 448-461 (1985)
- [j2]Charles E. Leiserson: Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing. IEEE Trans. Computers 34(10): 892-901 (1985)
- [c8]Ronald I. Greenberg, Charles E. Leiserson: Randomized Routing on Fat-Trees (Preliminary Version). FOCS 1985: 241-249
- [c7]Charles E. Leiserson: Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing. ICPP 1985: 393-402
- [c6]Charles E. Leiserson, F. Miller Maley: Algorithms for Routing and Testing Routability of Planar VLSI Layouts. STOC 1985: 69-78
- 1983
- [j1]Charles E. Leiserson, Ron Y. Pinter: Optimal Placement for River Routing. SIAM J. Comput. 12(3): 447-462 (1983)
- 1982
- [c5]Benny Chor, Charles E. Leiserson, Ronald L. Rivest: An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract). FOCS 1982: 92-99
- [c4]Frank Thomson Leighton, Charles E. Leiserson: Wafer-Scale Integration of Systolic Arrays (Extended Abstract). FOCS 1982: 297-311
- [c3]Sandeep N. Bhatt, Charles E. Leiserson: How to Assemble Tree Machines (Extended Abstract). STOC 1982: 77-84
- 1981
- [c2]
- 1980
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:03 CEST by the dblp team