Charles E. Leiserson

	2012
90		Charles E. Leiserson, Tao B. Schardl, Jim Sukha: Deterministic parallel random-number generation for dynamic-multithreading platforms. PPOPP 2012: 193-204
89		Matteo Frigo, Charles E. Leiserson, Harald Prokop, Sridhar Ramachandran: Cache-Oblivious Algorithms. ACM Transactions on Algorithms 8(1): 4 (2012)
	2011
88		Yuan Tang, Rezaul Alam Chowdhury, Bradley C. Kuszmaul, Chi-Keung Luk, Charles E. Leiserson: The pochoir stencil compiler. SPAA 2011: 117-128
87		Jeremy T. Fineman, Charles E. Leiserson: Race Detectors for Cilk and Cilk++ Programs. Encyclopedia of Parallel Computing 2011: 1706-1719
86		Charles E. Leiserson: Cilk. Encyclopedia of Parallel Computing 2011: 273-288
	2010
85		Charles E. Leiserson, Liyun Li, Marc Moreno Maza, Yuzhen Xie: Efficient Evaluation of Large Polynomials. ICMS 2010: 342-353
84		Kunal Agrawal, Charles E. Leiserson, Jim Sukha: Executing task graphs using work-stealing. IPDPS 2010: 1-12
83		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
82		Charles E. Leiserson, Marc Moreno Maza, Liyun Li, Yuzhen Xie: Parallel computation of the minimal elements of a poset. PASCO 2010: 53-62
81		Kunal Agrawal, Charles E. Leiserson, Jim Sukha: Helper locks for fork-join parallel programming. PPOPP 2010: 245-256
80		Yuxiong He, Charles E. Leiserson, William M. Leiserson: The Cilkview scalability analyzer. SPAA 2010: 145-156
79		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
78		Charles E. Leiserson: The Cilk++ concurrency platform. The Journal of Supercomputing 51(3): 244-257 (2010)
	2009
77		Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Introduction to Algorithms (3. ed.). MIT Press 2009: I-XIX, 1-1292
76		Charles E. Leiserson: The Cilk++ concurrency platform. DAC 2009: 522-527
75		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
74		Matteo Frigo, Pablo Halpern, Charles E. Leiserson, Stephen Lewin-Berlin: Reducers and other Cilk++ hyperobjects. SPAA 2009: 79-90
	2008
73		Edya Ladan-Mozes, Charles E. Leiserson: A consistency architecture for hierarchical shared caches. SPAA 2008: 11-22
72		Kunal Agrawal, Charles E. Leiserson, Yuxiong He, Wen-Jing Hsu: Adaptive work-stealing with parallelism feedback. ACM Trans. Comput. Syst. 26(3): (2008)
71		Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson: Provably Efficient Online Nonclairvoyant Adaptive Scheduling. IEEE Trans. Parallel Distrib. Syst. 19(9): 1263-1279 (2008)
	2007
70		Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson: Provably Efficient Online Non-clairvoyant Adaptive Scheduling. IPDPS 2007: 1-10
69		Kunal Agrawal, Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson: Adaptive Scheduling with Parallelism Feedback. IPDPS 2007: 1-7
68		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
67		Kunal Agrawal, Yuxiong He, Charles E. Leiserson: Adaptive work stealing with parallelism feedback. PPOPP 2007: 112-120
	2006
66		Kunal Agrawal, Yuxiong He, Charles E. Leiserson: An Empirical Evaluation ofWork Stealing with Parallelism Feedback. ICDCS 2006: 19
65		Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson: Provably Efficient Two-Level Adaptive Scheduling. JSSPP 2006: 1-32
64		Kunal Agrawal, Charles E. Leiserson, Jim Sukha: Memory models for open-nested transactions. Memory System Performance and Correctness 2006: 70-81
63		Kunal Agrawal, Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson: Adaptive scheduling with parallelism feedback. PPOPP 2006: 100-109
62		C. Scott Ananian, Krste Asanovic, Bradley C. Kuszmaul, Charles E. Leiserson, Sean Lie: Unbounded Transactional Memory. IEEE Micro 26(1): 59-69 (2006)
61		John S. Danaher, I.-Ting Angelina Lee, Charles E. Leiserson: Programming with exceptions in JCilk. Sci. Comput. Program. 63(2): 147-171 (2006)
	2005
60		Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn: Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 IBFI, Schloss Dagstuhl, Germany 2005
59		C. Scott Ananian, Krste Asanovic, Bradley C. Kuszmaul, Charles E. Leiserson, Sean Lie: Unbounded Transactional Memory. HPCA 2005: 316-327
58		Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson: Adversarial contention resolution for simple channels. SPAA 2005: 325-332
	2004
57		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
56		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
55		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
54		Charles E. Leiserson: Design and Analysis of Dynamic Multithreaded Algorithms. SWAT 2004: 1-2
	2003
53		Charles E. Leiserson: Cache-Oblivious Algorithms. CIAC 2003: 5
	2001
52		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
	2000
51		Ching Law, Charles E. Leiserson: A New Competitive Analysis of Randomized Caching. ISAAC 2000: 35-46
	1999
50		Matteo Frigo, Charles E. Leiserson, Harald Prokop, Sridhar Ramachandran: Cache-Oblivious Algorithms. FOCS 1999: 285-298
49		Charles E. Leiserson: Design and Analysis of Algorithms for Shared-Memory Multiprocessors (Abstract). WADS 1999: 55
48		Robert D. Blumofe, Charles E. Leiserson: Scheduling Multithreaded Computations by Work Stealing. J. ACM 46(5): 720-748 (1999)
47		Mingdong Feng, Charles E. Leiserson: Efficient Detection of Determinacy Races in Cilk Programs. Theory Comput. Syst. 32(3): 301-326 (1999)
	1998
46		Matteo Frigo, Charles E. Leiserson, Keith H. Randall: The Implementation of the Cilk-5 Multithreaded Language. PLDI 1998: 212-223
45		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
44		Robert D. Blumofe, Charles E. Leiserson: Space-Efficient Scheduling of Multithreaded Computations. SIAM J. Comput. 27(1): 202-229 (1998)
43		Guy E. Blelloch, Charles E. Leiserson: An Experimental Analysis of Parallel. Theory Comput. Syst. 31(2): 135-167 (1998)
	1997
42		Charles E. Leiserson: Programming Irregular Parallel Applications in Cilk. IRREGULAR 1997: 61-71
41		Charles E. Leiserson: Algorithmic Analysis of Multithreaded Algorithms (Abstract). ISAAC 1997: 132
40		Mingdong Feng, Charles E. Leiserson: Efficient Detection of Determinacy Races in Cilk Programs. SPAA 1997: 1-11
39		Alexander T. Ishii, Charles E. Leiserson, Marios C. Papaefthymiou: Optimizing two-phase, level-clocked circuitry. J. ACM 44(1): 148-199 (1997)
38		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)
37		Charles E. Leiserson, Keith H. Randall: Parallel Algorithms for the Circuit Value Update Problem. Theory Comput. Syst. 30(6): 583-597 (1997)
	1996
36		Robert D. Blumofe, Matteo Frigo, Christopher F. Joerg, Charles E. Leiserson, Keith H. Randall: Dag-Consistent Distributed Shared Memory. IPPS 1996: 132-141
35		Charles E. Leiserson: Can Multithreaded Programming Save Massively Parallel Computing? IPPS 1996: 2-3
34		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
33		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)
32		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)
31		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)
	1995
30		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
29		Charles E. Leiserson, Keith H. Randall: Parallel Algorithms for the Circuit Value Update Problem. SPAA 1995: 13-20
	1993
28		Charles E. Leiserson, Satish Rao, Sivan Toledo: Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract) FOCS 1993: 704-713
27		Robert D. Blumofe, Charles E. Leiserson: Space-efficient scheduling of multithreaded computations. STOC 1993: 362-371
	1992
26		Charles E. Leiserson: The Networks of the Connection Machine CM-5. Heinz Nixdorf Symposium 1992: 66-67
25		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
24		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
23		Charles E. Leiserson, James B. Saxe: Retiming Synchronous Circuitry. Algorithmica 6(1): 5-35 (1991)
	1990
22		Joe Kilian, Shlomo Kipnis, Charles E. Leiserson: The Organization of Permutation Architectures with Bused Interconnections. IEEE Trans. Computers 39(11): 1346-1358 (1990)
21		Thomas H. Cormen, Charles E. Leiserson: A Hyperconcentrator Swith for Routing Bit-Serial Messages. J. Parallel Distrib. Comput. 10(3): 193-204 (1990)
	1989
20		Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest: Introduction to Algorithms The MIT Press and McGraw-Hill Book Company 1989
	1988
19		Charles E. Leiserson, Bruce M. Maggs: Communication-Efficient Parallel Algorithms for Distributed Random-Access Machines. Algorithmica 3: 53-77 (1988)
18		Charles E. Leiserson, James B. Saxe: A Mixed-Integer Linear Programming Problem which is Efficiently Solvable. J. Algorithms 9(1): 114-128 (1988)
	1987
17		Joe Kilian, Shlomo Kipnis, Charles E. Leiserson: The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract) FOCS 1987: 305-315
16		Charles E. Leiserson, John G. Lewis: Orderings for Parallel Sparse Symmetric Factorization. PPSC 1987: 27-31
	1986
15		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
14		Thomas H. Cormen, Charles E. Leiserson: A Hyperconcentrator Switch for Routing Bit-Serial Messages. ICPP 1986: 721-728
13		Charles E. Leiserson, Bruce M. Maggs: Communication-Efficient Parallel Graph Algorithms. ICPP 1986: 861-868
12		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)
	1985
11		Ronald I. Greenberg, Charles E. Leiserson: Randomized Routing on Fat-Trees (Preliminary Version) FOCS 1985: 241-249
10		Charles E. Leiserson: Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing. ICPP 1985: 393-402
9		Charles E. Leiserson, F. Miller Maley: Algorithms for Routing and Testing Routability of Planar VLSI Layouts STOC 1985: 69-78
8		Charles E. Leiserson: Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing. IEEE Trans. Computers 34(10): 892-901 (1985)
7		Frank Thomson Leighton, Charles E. Leiserson: Wafer-Scale Integration of Systolic Arrays. IEEE Trans. Computers 34(5): 448-461 (1985)
	1983
6		Charles E. Leiserson, Ron Y. Pinter: Optimal Placement for River Routing. SIAM J. Comput. 12(3): 447-462 (1983)
	1982
5		Frank Thomson Leighton, Charles E. Leiserson: Wafer-Scale Integration of Systolic Arrays (Extended Abstract) FOCS 1982: 297-311
4		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
3		Sandeep N. Bhatt, Charles E. Leiserson: How to Assemble Tree Machines (Extended Abstract) STOC 1982: 77-84
	1981
2		Charles E. Leiserson, James B. Saxe: Optimizing Synchronous Systems FOCS 1981: 23-36
	1980
1		Charles E. Leiserson: Area-Efficient Graph Layouts (for VLSI) FOCS 1980: 270-281

Coauthor Index

1	Zahi S. Abuhamdeh	[25] [32]
2	Kunal Agrawal	[63] [64] [66] [67] [69] [72] [81] [84]
3	Jonathan Allen	[15]
4	C. Scott Ananian	[59] [62]
5	Lars Arge	[57] [60]
6	Krste Asanovic	[59] [62]
7	Michael A. Bender	[55] [56] [57] [58] [60]
8	Sandeep N. Bhatt	[3]
9	Guy E. Blelloch	[24] [33] [43]
10	Robert D. Blumofe	[27] [30] [31] [34] [36] [44] [48]
11	Silas Boyd-Wickizer	[83]
12	Aydin Buluç	[75]
13	Guang-Ien Cheng	[45]
14	Benny Chor	[4] [12]
15	Rezaul Alam Chowdhury	[88]
16	Thomas H. Cormen	[14] [20] [21] [52] [77]
17	John S. Danaher	[61]
18	Erik D. Demaine	[57] [60]
19	David C. Douglas	[25] [32]
20	Martin Farach-Colton (Martin Farach)	[56] [58]
21	Mingdong Feng	[40] [45] [47]
22	Carl R. Feynman	[25] [32]
23	Jeremy T. Fineman	[55] [75] [87]
24	Matteo Frigo	[34] [36] [46] [50] [74] [75] [89]
25	Mahesh N. Ganmukhi	[25] [32]
26	John R. Gilbert	[75]
27	Seth Gilbert	[55]
28	Lance A. Glasser	[15]
29	Ronald I. Greenberg	[11]
30	Pablo Halpern	[74]
31	Simai He	[56] [58]
32	Yuxiong He	[63] [65] [66] [67] [69] [70] [71] [72] [80]
33	Chris Hill	[68]
34	Jeffrey V. Hill	[25] [32]
35	W. Daniel Hillis	[25] [32]
36	Wen-Jing Hsu	[63] [65] [69] [70] [71] [72]
37	Zhiyi Huang	[83]
38	Alexander T. Ishii	[39]
39	Christopher F. Joerg	[30] [31] [34] [36]
40	Joe Kilian	[17] [22]
41	Shlomo Kipnis	[17] [22]
42	Bradley C. Kuszmaul	[25] [30] [31] [32] [56] [58] [59] [62] [68] [88]
43	Edya Ladan-Mozes	[73]
44	Ching Law	[51]
45	I.-Ting Angelina Lee	[61] [83]
46	Frank Thomson Leighton (Tom Leighton)	[5] [7]
47	William M. Leiserson	[80]
48	Stephen Lewin-Berlin	[74]
49	John G. Lewis	[16]
50	Liyun Li	[82] [85]
51	Sean Lie	[59] [62]
52	Chi-Keung Luk	[88]
53	Bruce M. Maggs	[13] [19] [24] [33]
54	F. Miller Maley	[9]
55	John Marshall	[68]
56	Marc Moreno Maza	[82] [85]
57	Kurt Mehlhorn	[57] [60]
58	Marios C. Papaefthymiou	[39]
59	Paul Penfield Jr.	[15]
60	Margaret A. St. Pierre	[25] [32]
61	Ron Y. Pinter	[6]
62	C. Greg Plaxton	[24] [33]
63	Harald Prokop	[50] [89]
64	Sridhar Ramachandran	[50] [89]
65	Keith H. Randall	[29] [30] [31] [34] [36] [37] [45] [46]
66	Satish Rao	[28] [38]
67	Ronald L. Rivest	[4] [12] [20] [52] [77]
68	James B. Saxe	[2] [18] [23]
69	Tao B. Schardl	[79] [90]
70	James B. Shearer	[12]
71	Stephen J. Smith	[24] [33]
72	Andrew F. Stark	[45]
73	Clifford Stein	[52] [77]
74	Jim Sukha	[64] [81] [84] [90]
75	Yuan Tang	[88]
76	Sivan Toledo	[28] [38]
77	David S. Wells	[25] [32]
78	Monica C. Wong	[25]
79	Monica C. Wong-Chan	[32]
80	John L. Wyatt Jr.	[15]
81	Yuzhen Xie	[82] [85]
82	Shaw-Wen Yang	[25] [32]
83	Marco Zagha	[24] [33]
84	Robert Zak	[25] [32]
85	Yuli Zhou	[30] [31]
86	Richard E. Zippel	[15]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page