Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharles E. Leiserson
Person information
- affiliation: MIT, Cambridge, US
- award (2013): Paris Kanellakis Award
- award (1985): Presidential Young Investigator Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c79]Bradley C. Kuszmaul
, Charles E. Leiserson:
The Connection Machine CM-5, Moore's Law, and the Future of Computational Performance. SPAA 2023: 285-286- [i10]Tim Kaler, Alexandros-Stavros Iliopoulos, Philip Murzynowski, Tao B. Schardl, Charles E. Leiserson, Jie Chen:
Communication-Efficient Graph Neural Networks with Probabilistic Neighborhood Expansion Analysis and Caching. CoRR abs/2305.03152 (2023) - 2022
- [c78]Rocío Carratalá-Sáez, Arturo González-Escribano, Alexandros-Stavros Iliopoulos, Charles E. Leiserson, Charlotte Park, Isabel Rosa, Tao B. Schardl, Yuri Torres, David P. Bunde:
Peachy Parallel Assignments (EduHPC 2022). EduHPC@SC 2022: 50-56 - [c77]Tim Kaler, Nickolas Stathas, Anne Ouyang, Alexandros-Stavros Iliopoulos, Tao B. Schardl, Charles E. Leiserson, Jie Chen:
Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and Pipelining. MLSys 2022 - [p3]Charles E. Leiserson, Tao B. Schardl:
A Work-Efficient Parallel Breadth-First Search Algorithm (or How To Cope With the Nondeterminism of Reducers). Massive Graph Analytics 2022: 3-33 - [p2]William Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson:
Ordering Heuristics for Parallel Graph Coloring. Massive Graph Analytics 2022: 193-221 - [p1]Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson:
Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling. Massive Graph Analytics 2022: 397-429 - 2021
- [c76]Helen Xu, Sean Fraser, Charles E. Leiserson:
Multidimensional Included and Excluded Sums. ACDA 2021: 182-192 - [c75]Tim Kaler, Tao B. Schardl, Brian Xie, Charles E. Leiserson, Jie Chen, Aldo Pareja, Georgios Kollias:
PARAD: A Work-Efficient Parallel Algorithm for Reverse-Mode Automatic Differentiation. APOCS 2021: 144-158 - [c74]William Kuszmaul, Charles E. Leiserson:
Floors and Ceilings in Divide-and-Conquer Recurrences. SOSA 2021: 133-141 - [i9]Helen Xu, Sean Fraser, Charles E. Leiserson:
Multidimensional Included and Excluded Sums. CoRR abs/2106.00124 (2021) - [i8]Tim Kaler, Nickolas Stathas, Anne Ouyang, Alexandros-Stavros Iliopoulos, Tao B. Schardl, Charles E. Leiserson, Jie Chen:
Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and Pipelining. CoRR abs/2110.08450 (2021) - 2020
- [c73]Aldo Pareja, Giacomo Domeniconi, Jie Chen, Tengfei Ma, Toyotaro Suzumura, Hiroki Kanezashi, Tim Kaler, Tao B. Schardl, Charles E. Leiserson:
EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs. AAAI 2020: 5363-5370 - [c72]Sean Fraser, Helen Xu, Charles E. Leiserson:
Work-Efficient Parallel Algorithms for Accurate Floating-Point Prefix Sums. HPEC 2020: 1-7
2010 – 2019
- 2019
- [j35]Tao B. Schardl, William S. Moses, Charles E. Leiserson:
Tapir: Embedding Recursive Fork-join Parallelism into LLVM's Intermediate Representation. ACM Trans. Parallel Comput. 6(4): 19:1-19:33 (2019) - [i7]Aldo Pareja, Giacomo Domeniconi, Jie Chen, Tengfei Ma, Toyotaro Suzumura, Hiroki Kanezashi, Tim Kaler, Charles E. Leiserson:
EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs. CoRR abs/1902.10191 (2019) - [i6]Mark Weber, Giacomo Domeniconi, Jie Chen, Daniel Karl I. Weidele, Claudio Bellei, Tom Robinson, Charles E. Leiserson:
Anti-Money Laundering in Bitcoin: Experimenting with Graph Convolutional Networks for Financial Forensics. CoRR abs/1908.02591 (2019) - 2018
- [c71]Tao B. Schardl, Tyler Denniston, Damon Doucet, Bradley C. Kuszmaul, I-Ting Angelina Lee, Charles E. Leiserson:
The CSI Framework for Compiler-Inserted Program Instrumentation. SIGMETRICS (Abstracts) 2018: 100-102 - [c70]Charles E. Leiserson:
The Resurgence of Software Performance Engineering. SPAA 2018: 53 - [c69]Tao B. Schardl, I-Ting Angelina Lee, Charles E. Leiserson:
Brief Announcement: Open Cilk. SPAA 2018: 351-353 - [i5]Warut Suksompong, Charles E. Leiserson, Tao B. Schardl:
On the Efficiency of Localized Work Stealing. CoRR abs/1804.04773 (2018) - [i4]Mark Weber, Jie Chen, Toyotaro Suzumura, Aldo Pareja, Tengfei Ma, Hiroki Kanezashi, Tim Kaler, Charles E. Leiserson, Tao B. Schardl:
Scalable Graph Learning for Anti-Money Laundering: A First Look. CoRR abs/1812.00076 (2018) - 2017
- [j34]Ekanathan Palamadai Natarajan, Maryam Mehri Dehnavi, Charles E. Leiserson:
Autotuning divide-and-conquer stencil computations. Concurr. Comput. Pract. Exp. 29(17) (2017) - [j33]Tao B. Schardl, Tyler Denniston, Damon Doucet, Bradley C. Kuszmaul, I-Ting Angelina Lee, Charles E. Leiserson:
The CSI Framework for Compiler-Inserted Program Instrumentation. Proc. ACM Meas. Anal. Comput. Syst. 1(2): 43:1-43:25 (2017) - [j32]Rezaul Chowdhury, Pramod Ganapathi, Stephen L. Tschudi, Jesmin Jahan Tithi, Charles Bachmeier, Charles E. Leiserson, Armando Solar-Lezama, Bradley C. Kuszmaul, Yuan Tang:
Autogen: Automatic Discovery of Efficient Recursive Divide-8-Conquer Algorithms for Solving Dynamic Programming Problems. ACM Trans. Parallel Comput. 4(1): 4:1-4:30 (2017) - [c68]Tao B. Schardl, William S. Moses, Charles E. Leiserson:
Tapir: Embedding Fork-Join Parallelism into LLVM's Intermediate Representation. PPoPP 2017: 249-265 - [i3]Charles E. Leiserson, Tao B. Schardl, Warut Suksompong:
Upper Bounds on Number of Steals in Rooted Trees. CoRR abs/1706.03184 (2017) - 2016
- [j31]Warut Suksompong, Charles E. Leiserson, Tao B. Schardl:
On the efficiency of localized work stealing. Inf. Process. Lett. 116(2): 100-106 (2016) - [j30]Charles E. Leiserson:
A simple deterministic algorithm for guaranteeing the forward progress of transactions. Inf. Syst. 57: 69-74 (2016) - [j29]Charles E. Leiserson, Tao B. Schardl, Warut Suksompong:
Upper Bounds on Number of Steals in Rooted Trees. Theory Comput. Syst. 58(2): 223-240 (2016) - [j28]Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson:
Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling. ACM Trans. Parallel Comput. 3(1): 2:1-2:31 (2016) - [c67]Shachar Itzhaky, Rohit Singh, Armando Solar-Lezama, Kuat Yessenov, Yongquan Lu, Charles E. Leiserson, Rezaul Alam Chowdhury:
Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations. OOPSLA 2016: 145-164 - [c66]Rezaul Alam Chowdhury, Pramod Ganapathi, Jesmin Jahan Tithi, Charles Bachmeier, Bradley C. Kuszmaul, Charles E. Leiserson, Armando Solar-Lezama, Yuan Tang:
AUTOGEN: automatic discovery of cache-oblivious parallel recursive algorithms for solving dynamic programs. PPoPP 2016: 10:1-10:12 - 2015
- [j27]I-Ting Angelina Lee, Charles E. Leiserson, Tao B. Schardl, Zhunping Zhang, Jim Sukha:
On-the-Fly Pipeline Parallelism. ACM Trans. Parallel Comput. 2(3): 17:1-17:42 (2015) - [c65]Tao B. Schardl, Bradley C. Kuszmaul, I-Ting Angelina Lee, William M. Leiserson, Charles E. Leiserson:
The Cilkprof Scalability Profiler. SPAA 2015: 89-100 - 2014
- [c64]Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson:
Executing dynamic data-graph computations deterministically using chromatic scheduling. SPAA 2014: 154-165 - [c63]William Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson:
Ordering heuristics for parallel graph coloring. SPAA 2014: 166-177 - [i2]Tim Mattson, David A. Bader, Jonathan W. Berry, Aydin Buluç, Jack J. Dongarra, Christos Faloutsos, John Feo, John R. Gilbert, Joseph Gonzalez, Bruce Hendrickson, Jeremy Kepner, Charles E. Leiserson, Andrew Lumsdaine, David A. Padua, Stephen W. Poole, Steven P. Reinhardt, Mike Stonebraker, Steve Wallach, Andrew Yoo:
Standards for Graph Algorithm Primitives. CoRR abs/1408.0393 (2014) - 2013
- [c62]Tim Mattson, David A. Bader, Jonathan W. Berry, Aydin Buluç, Jack J. Dongarra, Christos Faloutsos, John Feo, John R. Gilbert, Joseph Gonzalez, Bruce Hendrickson, Jeremy Kepner, Charles E. Leiserson, Andrew Lumsdaine, David A. Padua, Stephen Poole, Steven P. Reinhardt, Mike Stonebraker, Steve Wallach, Andrew Yoo:
Standards for graph algorithm primitives. HPEC 2013: 1-2 - [c61]I-Ting Angelina Lee, Charles E. Leiserson, Tao B. Schardl, Jim Sukha, Zhunping Zhang:
On-the-fly pipeline parallelism. SPAA 2013: 140-151 - 2012
- [j26]Matteo Frigo, Charles E. Leiserson, Harald Prokop, Sridhar Ramachandran:
Cache-Oblivious Algorithms. ACM Trans. Algorithms 8(1): 4:1-4:22 (2012) - [c60]Charles E. Leiserson, Tao B. Schardl, Jim Sukha:
Deterministic parallel random-number generation for dynamic-multithreading platforms. PPoPP 2012: 193-204 - [c59]Kunal Agrawal, Jeremy T. Fineman, Jordan Krage, Charles E. Leiserson, Sivan Toledo:
Cache-conscious scheduling of streaming applications. SPAA 2012: 236-245 - [c58]I-Ting Angelina Lee, Aamir Shafi, Charles E. Leiserson:
Memory-mapping support for reducer hyperobjects. SPAA 2012: 287-297 - 2011
- [c57]Yuan Tang, Rezaul Alam Chowdhury, Bradley C. Kuszmaul, Chi-Keung Luk, Charles E. Leiserson:
The pochoir stencil compiler. SPAA 2011: 117-128 - [r2]Charles E. Leiserson:
Cilk. Encyclopedia of Parallel Computing 2011: 273-288 - [r1]Jeremy T. Fineman, Charles E. Leiserson:
Race Detectors for Cilk and Cilk++ Programs. Encyclopedia of Parallel Computing 2011: 1706-1719 - 2010
- [j25]Charles E. Leiserson:
The Cilk++ concurrency platform. J. Supercomput. 51(3): 244-257 (2010) - [c56]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 - [c55]Charles E. Leiserson, Marc Moreno Maza, Liyun Li, Yuzhen Xie:
Parallel computation of the minimal elements of a poset. PASCO 2010: 53-62 - [c54]Charles E. Leiserson, Liyun Li, Marc Moreno Maza, Yuzhen Xie:
Efficient Evaluation of Large Polynomials. ICMS 2010: 342-353 - [c53]Kunal Agrawal, Charles E. Leiserson, Jim Sukha:
Executing task graphs using work-stealing. IPDPS 2010: 1-12 - [c52]Kunal Agrawal, Charles E. Leiserson, Jim Sukha:
Helper locks for fork-join parallel programming. PPoPP 2010: 245-256 - [c51]Yuxiong He, Charles E. Leiserson, William M. Leiserson:
The Cilkview scalability analyzer. SPAA 2010: 145-156 - [c50]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, 3rd Edition. MIT Press 2009, ISBN 978-0-262-03384-8, pp. I-XIX, 1-1292 - [c49]Charles E. Leiserson:
The Cilk++ concurrency platform. DAC 2009: 522-527 - [c48]Matteo Frigo, Pablo Halpern, Charles E. Leiserson, Stephen Lewin-Berlin:
Reducers and other Cilk++ hyperobjects. SPAA 2009: 79-90 - [c47]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
- [j24]Kunal Agrawal, Charles E. Leiserson, Yuxiong He, Wen-Jing Hsu:
Adaptive work-stealing with parallelism feedback. ACM Trans. Comput. Syst. 26(3): 7:1-7:32 (2008) - [j23]Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson:
Provably Efficient Online Nonclairvoyant Adaptive Scheduling. IEEE Trans. Parallel Distributed Syst. 19(9): 1263-1279 (2008) - [c46]Edya Ladan-Mozes, Charles E. Leiserson:
A consistency architecture for hierarchical shared caches. SPAA 2008: 11-22 - 2007
- [c45]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 - [c44]Kunal Agrawal, Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson:
Adaptive Scheduling with Parallelism Feedback. IPDPS 2007: 1-7 - [c43]Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson:
Provably Efficient Online Non-clairvoyant Adaptive Scheduling. IPDPS 2007: 1-10 - [c42]Kunal Agrawal, Yuxiong He, Charles E. Leiserson:
Adaptive work stealing with parallelism feedback. PPoPP 2007: 112-120 - 2006
- [j22]C. Scott Ananian, Krste Asanovic, Bradley C. Kuszmaul, Charles E. Leiserson, Sean Lie:
Unbounded Transactional Memory. IEEE Micro 26(1): 59-69 (2006) - [j21]John S. Danaher, I-Ting Angelina Lee, Charles E. Leiserson:
Programming with exceptions in JCilk. Sci. Comput. Program. 63(2): 147-171 (2006) - [c41]Kunal Agrawal, Charles E. Leiserson, Jim Sukha:
Memory models for open-nested transactions. Memory System Performance and Correctness 2006: 70-81 - [c40]Kunal Agrawal, Yuxiong He, Charles E. Leiserson:
An Empirical Evaluation ofWork Stealing with Parallelism Feedback. ICDCS 2006: 19 - [c39]Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson:
Provably Efficient Two-Level Adaptive Scheduling. JSSPP 2006: 1-32 - [c38]Kunal Agrawal, Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson:
Adaptive scheduling with parallelism feedback. PPoPP 2006: 100-109 - 2005
- [c37]C. Scott Ananian, Krste Asanovic, Bradley C. Kuszmaul, Charles E. Leiserson, Sean Lie:
Unbounded Transactional Memory. HPCA 2005: 316-327 - [c36]Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson:
Adversarial contention resolution for simple channels. SPAA 2005: 325-332 - [e4]Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn:
Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004. Dagstuhl Seminar Proceedings 04301, IBFI, Schloss Dagstuhl, Germany 2005 [contents] - 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]Charles E. Leiserson:
Design and Analysis of Dynamic Multithreaded Algorithms. SWAT 2004: 1-2 - [i1]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 - 2003
- [c32]Charles E. Leiserson:
Cache-Oblivious Algorithms. CIAC 2003: 5 - 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
- [j20]Robert D. Blumofe, Charles E. Leiserson:
Scheduling Multithreaded Computations by Work Stealing. J. ACM 46(5): 720-748 (1999) - [j19]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
- [j18]Guy E. Blelloch, Charles E. Leiserson:
An Experimental Analysis of Parallel Sorting Algorithms. Theory Comput. Syst. 31(2): 135-167 (1998) - [j17]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
- [j16]Alexander T. Ishii, Charles E. Leiserson, Marios C. Papaefthymiou:
Optimizing two-phase, level-clocked circuitry. J. ACM 44(1): 148-199 (1997) - [j15]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) - [j14]Charles E. Leiserson, Keith H. Randall:
Parallel Algorithms for the Circuit Value Update Problem. Theory Comput. Syst. 30(6): 583-597 (1997) - [c26]Charles E. Leiserson:
Programming Irregular Parallel Applications in Cilk. IRREGULAR 1997: 61-71 - [c25]Charles E. Leiserson:
Algorithmic Analysis of Multithreaded Algorithms (Abstract). ISAAC 1997: 132 - [c24]Mingdong Feng, Charles E. Leiserson:
Efficient Detection of Determinacy Races in Cilk Programs. SPAA 1997: 1-11 - [e3]Charles E. Leiserson, David E. Culler:
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '97, Newport, RI, USA, June 23-25, 1997. ACM 1997, ISBN 0-89791-890-8 [contents] - 1996
- [j13]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) - [j12]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 Distributed Comput. 33(2): 145-158 (1996) - [j11]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 Distributed 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 - [e2]Charles E. Leiserson:
7th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '95, Santa Barbara, California, USA, July 17-19, 1995. ACM 1995, ISBN 0-89791-717-0 [contents] - 1994
- [e1]Lawrence Snyder, Charles E. Leiserson:
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '94, Cape May, New Jersey, USA, June 27-29, 1994. ACM 1994, ISBN 0-89791-671-9 [contents] - 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
- [j10]Charles E. Leiserson, James B. Saxe:
Retiming Synchronous Circuitry. Algorithmica 6(1): 5-35 (1991) - [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
- [j9]Thomas H. Cormen, Charles E. Leiserson:
A Hyperconcentrator Swith for Routing Bit-Serial Messages. J. Parallel Distributed Comput. 10(3): 193-204 (1990) - [j8]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 - [j7]Ronald L. Greenberg, Charles E. Leiserson:
Randomized Routing on Fat-Trees. Adv. Comput. Res. 5: 345-374 (1989) - 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]Charles E. Leiserson, James B. Saxe:
Optimizing Synchronous Systems. FOCS 1981: 23-36 - 1980
- [c1]Charles E. Leiserson:
Area-Efficient Graph Layouts (for VLSI). FOCS 1980: 270-281
Coauthor Index
a service of 
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 2024-04-25 05:54 CEST 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:
