Area-Efficient Graph Layouts (for VLSI) - Charles E. Leiserson (FOCS, 1980)

Optimizing Synchronous Systems - Charles E. Leiserson; James B. Saxe (FOCS, 1981)

An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract) - Benny Chor; Charles E. Leiserson; Ronald L. Rivest (FOCS, 1982)

Wafer-Scale Integration of Systolic Arrays (Extended Abstract) - Frank Thomson Leighton; Charles E. Leiserson (FOCS, 1982)

How to Assemble Tree Machines (Extended Abstract) - Sandeep N. Bhatt; Charles E. Leiserson (STOC, 1982)

Optimal Placement for River Routing. - Charles E. Leiserson; Ron Y. Pinter (SIAM J. Comput., 1983)

Randomized Routing on Fat-Trees (Preliminary Version) - Ronald I. Greenberg; Charles E. Leiserson (FOCS, 1985)

Algorithms for Routing and Testing Routability of Planar VLSI Layouts - Charles E. Leiserson; F. Miller Maley (STOC, 1985)

Wafer-Scale Integration of Systolic Arrays. - Frank Thomson Leighton; Charles E. Leiserson (IEEE Trans. Computers, 1985)

Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing. - Charles E. Leiserson (IEEE Trans. Computers, 1985)

Recent Results in VLSI CAD at MIT. - Richard E. Zippel; Paul Penfield Jr.; Lance A. Glasser; Charles E. Leiserson; John L. Wyatt Jr.; Jonathan Allen (FJCC, 1986)

A Hyperconcentrator Switch for Routing Bit-Serial Messages. - Thomas H. Cormen; Charles E. Leiserson (ICPP, 1986)

Communication-Efficient Parallel Graph Algorithms. - Charles E. Leiserson; Bruce M. Maggs (ICPP, 1986)

An application of number theory to the organization of raster-graphics memory. - Benny Chor; Charles E. Leiserson; Ronald L. Rivest; James B. Shearer (J. ACM, 1986)

The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract) - Joe Kilian; Shlomo Kipnis; Charles E. Leiserson (FOCS, 1987)

Orderings for Parallel Sparse Symmetric Factorization. - Charles E. Leiserson; John G. Lewis (PP, 1987)

Communication-Efficient Parallel Algorithms for Distributed Random-Access Machines. - Charles E. Leiserson; Bruce M. Maggs (Algorithmica, 1988)

A Mixed-Integer Linear Programming Problem which is Efficiently Solvable. - Charles E. Leiserson; James B. Saxe (J. Algorithms, 1988)

Introduction to Algorithms - Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest (The MIT Press and McGraw-Hill Book Company, 1989)

Randomized Routing on Fat-Trees. - Ronald L. Greenberg; Charles E. Leiserson (Adv. Comput. Res., 1989)

A Hyperconcentrator Swith for Routing Bit-Serial Messages. - Thomas H. Cormen; Charles E. Leiserson (J. Parallel Distributed Comput., 1990)

The Organization of Permutation Architectures with Bused Interconnections. - Joe Kilian; Shlomo Kipnis; Charles E. Leiserson (IEEE Trans. Computers, 1990)

Retiming Synchronous Circuitry. - Charles E. Leiserson; James B. Saxe (Algorithmica, 1991)

The Networks of the Connection Machine CM-5. - Charles E. Leiserson (Heinz Nixdorf Symposium, 1992)

The Network Architecture of the Connection Machine CM-5 (Extended Abstract). - 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; et al. (SPAA, 1992)

Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract) - Charles E. Leiserson; Satish Rao; Sivan Toledo (FOCS, 1993)

Dag-Consistent Distributed Shared Memory. - Robert D. Blumofe; Matteo Frigo; Christopher F. Joerg; Charles E. Leiserson; Keith H. Randall (IPPS, 1996)

Can Multithreaded Programming Save Massively Parallel Computing? - Charles E. Leiserson (IPPS, 1996)

An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms. - Robert D. Blumofe; Matteo Frigo; Christopher F. Joerg; Charles E. Leiserson; Keith H. Randall (SPAA, 1996)

A Comparison of Sorting Algorithms for the Connection Machine CM-2. - Guy E. Blelloch; Charles E. Leiserson; Bruce M. Maggs; C. Greg Plaxton; Stephen J. Smith; Marco Zagha (Commun. ACM, 1996)

Cilk: An Efficient Multithreaded Runtime System. - Robert D. Blumofe; Christopher F. Joerg; Bradley C. Kuszmaul; Charles E. Leiserson; Keith H. Randall; Yuli Zhou (J. Parallel Distributed Comput., 1996)

The Network Architecture of the Connection Machine CM-5. - 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; et al. (J. Parallel Distributed Comput., 1996)

Programming Irregular Parallel Applications in Cilk. - Charles E. Leiserson (IRREGULAR, 1997)

Algorithmic Analysis of Multithreaded Algorithms (Abstract). - Charles E. Leiserson (ISAAC, 1997)

Optimizing two-phase, level-clocked circuitry. - Alexander T. Ishii; Charles E. Leiserson; Marios C. Papaefthymiou (J. ACM, 1997)

Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers. - Charles E. Leiserson; Satish Rao; Sivan Toledo (J. Comput. Syst. Sci., 1997)

Parallel Algorithms for the Circuit Value Update Problem. - Charles E. Leiserson; Keith H. Randall (Theory Comput. Syst., 1997)

The Implementation of the Cilk-5 Multithreaded Language. - Matteo Frigo; Charles E. Leiserson; Keith H. Randall (PLDI, 1998)

Detecting Data Rase in Cilk Programs That use Locks. - Guang-Ien Cheng; Mingdong Feng; Charles E. Leiserson; Keith H. Randall; Andrew F. Stark (SPAA, 1998)

An Experimental Analysis of Parallel Sorting Algorithms. - Guy E. Blelloch; Charles E. Leiserson (Theory Comput. Syst., 1998)

Space-Efficient Scheduling of Multithreaded Computations. - Robert D. Blumofe; Charles E. Leiserson (SIAM J. Comput., 1998)

Design and Analysis of Algorithms for Shared-Memory Multiprocessors (Abstract). - Charles E. Leiserson (WADS, 1999)

Scheduling Multithreaded Computations by Work Stealing. - Robert D. Blumofe; Charles E. Leiserson (J. ACM, 1999)

Efficient Detection of Determinacy Races in Cilk Programs. - Mingdong Feng; Charles E. Leiserson (Theory Comput. Syst., 1999)

A New Competitive Analysis of Randomized Caching. - Ching Law; Charles E. Leiserson (ISAAC, 2000)

Introduction to Algorithms, Second Edition - Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein 001 (The MIT Press and McGraw-Hill Book Company, 2001)

Cache-Oblivious Algorithms. - Charles E. Leiserson (CIAC, 2003)

04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. - Lars Arge; Michael A. Bender; Erik D. Demaine; Charles E. Leiserson; Kurt Mehlhorn (Cache-Oblivious and Cache-Aware Algorithms, 2004)

Adversarial Analyses of Window Backoff Strategies. - Michael A. Bender; Martin Farach-Colton; Simai He; Bradley C. Kuszmaul; Charles E. Leiserson (IPDPS Next Generation Software Program - NSFNGS - PI Workshop, 2004)

On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. - Michael A. Bender; Jeremy T. Fineman; Seth Gilbert; Charles E. Leiserson (SPAA, 2004)

Design and Analysis of Dynamic Multithreaded Algorithms. - Charles E. Leiserson (SWAT, 2004)

Adversarial contention resolution for simple channels. - Michael A. Bender; Martin Farach-Colton; Simai He; Bradley C. Kuszmaul; Charles E. Leiserson (SPAA, 2005)

Memory models for open-nested transactions. - Kunal Agrawal 001; Charles E. Leiserson; Jim Sukha (Memory System Performance and Correctness, 2006)

An Empirical Evaluation ofWork Stealing with Parallelism Feedback. - Kunal Agrawal 001; Yuxiong He; Charles E. Leiserson (ICDCS, 2006)

Provably Efficient Two-Level Adaptive Scheduling. - Yuxiong He; Wen-Jing Hsu; Charles E. Leiserson (JSSPP, 2006)

Unbounded Transactional Memory. - C. Scott Ananian; Krste Asanovic; Bradley C. Kuszmaul; Charles E. Leiserson; Sean Lie (IEEE Micro, 2006)

Programming with exceptions in JCilk. - John S. Danaher; I-Ting Angelina Lee; Charles E. Leiserson (Sci. Comput. Program., 2006)

Planet-in-a-Bottle: A Numerical Fluid-Laboratory System. - Chris Hill; Bradley C. Kuszmaul; Charles E. Leiserson; John Marshall (International Conference on Computational Science (1), 2007)

Adaptive Scheduling with Parallelism Feedback. - Kunal Agrawal 001; Yuxiong He; Wen-Jing Hsu; Charles E. Leiserson (IPDPS, 2007)

Provably Efficient Online Non-clairvoyant Adaptive Scheduling. - Yuxiong He; Wen-Jing Hsu; Charles E. Leiserson (IPDPS, 2007)

Adaptive work stealing with parallelism feedback. - Kunal Agrawal 001; Yuxiong He; Charles E. Leiserson (PPoPP, 2007)

A consistency architecture for hierarchical shared caches. - Edya Ladan-Mozes; Charles E. Leiserson (SPAA, 2008)

Adaptive work-stealing with parallelism feedback. - Kunal Agrawal 001; Charles E. Leiserson; Yuxiong He; Wen-Jing Hsu (ACM Trans. Comput. Syst., 2008)

Provably Efficient Online Nonclairvoyant Adaptive Scheduling. - Yuxiong He; Wen-Jing Hsu; Charles E. Leiserson (IEEE Trans. Parallel Distributed Syst., 2008)

Introduction to Algorithms, 3rd Edition. - Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein 001 (MIT Press, 2009)

Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. - Aydin Buluç; Jeremy T. Fineman; Matteo Frigo; John R. Gilbert; Charles E. Leiserson (SPAA, 2009)

Reducers and other Cilk++ hyperobjects. - Matteo Frigo; Pablo Halpern; Charles E. Leiserson; Stephen Lewin-Berlin (SPAA, 2009)

Using memory mapping to support cactus stacks in work-stealing runtime systems. - I-Ting Angelina Lee; Silas Boyd-Wickizer; Zhiyi Huang 001; Charles E. Leiserson (PACT, 2010)

Parallel computation of the minimal elements of a poset. - Charles E. Leiserson; Marc Moreno Maza; Liyun Li; Yuzhen Xie (PASCO, 2010)

Efficient Evaluation of Large Polynomials. - Charles E. Leiserson; Liyun Li; Marc Moreno Maza; Yuzhen Xie (ICMS, 2010)

Executing task graphs using work-stealing. - Kunal Agrawal 001; Charles E. Leiserson; Jim Sukha (IPDPS, 2010)

Helper locks for fork-join parallel programming. - Kunal Agrawal 001; Charles E. Leiserson; Jim Sukha (PPoPP, 2010)

The Cilkview scalability analyzer. - Yuxiong He; Charles E. Leiserson; William M. Leiserson (SPAA, 2010)

A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). - Charles E. Leiserson; Tao B. Schardl (SPAA, 2010)

The Cilk++ concurrency platform. - Charles E. Leiserson (J. Supercomput., 2010)

The pochoir stencil compiler. - Yuan Tang; Rezaul Alam Chowdhury; Bradley C. Kuszmaul; Chi-Keung Luk; Charles E. Leiserson (SPAA, 2011)

Race Detectors for Cilk and Cilk++ Programs. - Jeremy T. Fineman; Charles E. Leiserson (Encyclopedia of Parallel Computing, 2011)

Cilk. - Charles E. Leiserson (Encyclopedia of Parallel Computing, 2011)

Deterministic parallel random-number generation for dynamic-multithreading platforms. - Charles E. Leiserson; Tao B. Schardl; Jim Sukha (PPoPP, 2012)

Cache-conscious scheduling of streaming applications. - Kunal Agrawal 001; Jeremy T. Fineman; Jordan Krage; Charles E. Leiserson; Sivan Toledo (SPAA, 2012)

Memory-mapping support for reducer hyperobjects. - I-Ting Angelina Lee; Aamir Shafi; Charles E. Leiserson (SPAA, 2012)

Cache-Oblivious Algorithms. - Matteo Frigo; Charles E. Leiserson; Harald Prokop; Sridhar Ramachandran (ACM Trans. Algorithms, 2012)

Standards for graph algorithm primitives. - Tim Mattson; David A. Bader; Jonathan W. Berry; Aydin Buluç; Jack J. Dongarra; Christos Faloutsos; John Feo; John R. Gilbert; Joseph Gonzalez 001; Bruce Hendrickson; Jeremy Kepner; Charles E. Leiserson; et al. (HPEC, 2013)

Ordering heuristics for parallel graph coloring. - William Hasenplaugh; Tim Kaler; Tao B. Schardl; Charles E. Leiserson (SPAA, 2014)

The Cilkprof Scalability Profiler. - Tao B. Schardl; Bradley C. Kuszmaul; I-Ting Angelina Lee; William M. Leiserson; Charles E. Leiserson (SPAA, 2015)

On-the-Fly Pipeline Parallelism. - I-Ting Angelina Lee; Charles E. Leiserson; Tao B. Schardl; Zhunping Zhang; Jim Sukha (ACM Trans. Parallel Comput., 2015)

Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations. - Shachar Itzhaky; Rohit Singh 002; Armando Solar-Lezama; Kuat Yessenov; Yongquan Lu; Charles E. Leiserson; Rezaul Alam Chowdhury (OOPSLA, 2016)

AUTOGEN: automatic discovery of cache-oblivious parallel recursive algorithms for solving dynamic programs. - Rezaul Alam Chowdhury; Pramod Ganapathi; Jesmin Jahan Tithi; Charles Bachmeier; Bradley C. Kuszmaul; Charles E. Leiserson; Armando Solar-Lezama; Yuan Tang (PPoPP, 2016)

On the efficiency of localized work stealing. - Warut Suksompong; Charles E. Leiserson; Tao B. Schardl (Inf. Process. Lett., 2016)

A simple deterministic algorithm for guaranteeing the forward progress of transactions. - Charles E. Leiserson (Inf. Syst., 2016)

Upper Bounds on Number of Steals in Rooted Trees. - Charles E. Leiserson; Tao B. Schardl; Warut Suksompong (Theory Comput. Syst., 2016)

Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling. - Tim Kaler; William Hasenplaugh; Tao B. Schardl; Charles E. Leiserson (ACM Trans. Parallel Comput., 2016)

Tapir: Embedding Fork-Join Parallelism into LLVM's Intermediate Representation. - Tao B. Schardl; William S. Moses; Charles E. Leiserson (PPoPP, 2017)

Autotuning divide-and-conquer stencil computations. - Ekanathan Palamadai Natarajan; Maryam Mehri Dehnavi; Charles E. Leiserson (Concurr. Comput. Pract. Exp., 2017)

The CSI Framework for Compiler-Inserted Program Instrumentation. - Tao B. Schardl; Tyler Denniston; Damon Doucet; Bradley C. Kuszmaul; I-Ting Angelina Lee; Charles E. Leiserson (Proc. ACM Meas. Anal. Comput. Syst., 2017)

Autogen: Automatic Discovery of Efficient Recursive Divide-8-Conquer Algorithms for Solving Dynamic Programming Problems. - Rezaul Chowdhury; Pramod Ganapathi; Stephen L. Tschudi; Jesmin Jahan Tithi; Charles Bachmeier; Charles E. Leiserson; Armando Solar-Lezama; Bradley C. Kuszmaul; Yuan Tang (ACM Trans. Parallel Comput., 2017)

The Resurgence of Software Performance Engineering. - Charles E. Leiserson (SPAA, 2018)

Brief Announcement: Open Cilk. - Tao B. Schardl; I-Ting Angelina Lee; Charles E. Leiserson (SPAA, 2018)

Scalable Graph Learning for Anti-Money Laundering: A First Look. - Mark Weber; Jie Chen 007; Toyotaro Suzumura; Aldo Pareja; Tengfei Ma 001; Hiroki Kanezashi; Tim Kaler; Charles E. Leiserson; Tao B. Schardl (CoRR, 2018)

EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs. - Aldo Pareja; Giacomo Domeniconi; Jie Chen 007; Tengfei Ma 001; Toyotaro Suzumura; Hiroki Kanezashi; Tim Kaler; Charles E. Leiserson (CoRR, 2019)

Anti-Money Laundering in Bitcoin: Experimenting with Graph Convolutional Networks for Financial Forensics. - Mark Weber; Giacomo Domeniconi; Jie Chen 007; Daniel Karl I. Weidele; Claudio Bellei; Tom Robinson; Charles E. Leiserson (CoRR, 2019)

Tapir: Embedding Recursive Fork-join Parallelism into LLVM's Intermediate Representation. - Tao B. Schardl; William S. Moses; Charles E. Leiserson (ACM Trans. Parallel Comput., 2019)

EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs. - Aldo Pareja; Giacomo Domeniconi; Jie Chen 007; Tengfei Ma 001; Toyotaro Suzumura; Hiroki Kanezashi; Tim Kaler; Tao B. Schardl; Charles E. Leiserson (AAAI, 2020)

Work-Efficient Parallel Algorithms for Accurate Floating-Point Prefix Sums. - Sean Fraser; Helen Xu 001; Charles E. Leiserson (HPEC, 2020)

Multidimensional Included and Excluded Sums. - Helen Xu 001; Sean Fraser; Charles E. Leiserson (ACDA, 2021)

PARAD: A Work-Efficient Parallel Algorithm for Reverse-Mode Automatic Differentiation. - Tim Kaler; Tao B. Schardl; Brian Xie; Charles E. Leiserson; Jie Chen 007; Aldo Pareja; Georgios Kollias (APOCS, 2021)

Floors and Ceilings in Divide-and-Conquer Recurrences. - William Kuszmaul; Charles E. Leiserson (SOSA, 2021)

Ordering Heuristics for Parallel Graph Coloring. - William Hasenplaugh; Tim Kaler; Tao B. Schardl; Charles E. Leiserson (Massive Graph Analytics, 2022)

Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling. - Tim Kaler; William Hasenplaugh; Tao B. Schardl; Charles E. Leiserson (Massive Graph Analytics, 2022)

A Work-Efficient Parallel Breadth-First Search Algorithm (or How To Cope With the Nondeterminism of Reducers). - Charles E. Leiserson; Tao B. Schardl (Massive Graph Analytics, 2022)

Peachy Parallel Assignments (EduHPC 2022). - 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 (EduHPC@SC, 2022)

Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and Pipelining. - Tim Kaler; Nickolas Stathas; Anne Ouyang; Alexandros-Stavros Iliopoulos; Tao B. Schardl; Charles E. Leiserson; Jie Chen 007 (MLSys, 2022)

Communication-Efficient Graph Neural Networks with Probabilistic Neighborhood Expansion Analysis and Caching. - Tim Kaler; Alexandros-Stavros Iliopoulos; Philip Murzynowski; Tao B. Schardl; Charles E. Leiserson; Jie Chen 007 (MLSys, 2023)

The Connection Machine CM-5, Moore's Law, and the Future of Computational Performance. - Bradley C. Kuszmaul; Charles E. Leiserson (SPAA, 2023)

Speedcode: Software Performance Engineering Education via the Coding of Didactic Exercises. - Tim Kaler; Xuhao Chen 001; Brian Wheatman; Dorothy Curtis; Bruce Hoppe; Tao B. Schardl; Charles E. Leiserson (IPDPS (Workshops), 2024)

EduPar 2024 Keynote Speaker. - Charles E. Leiserson (IPDPS (Workshops), 2024)

The Shape of Money Laundering: Subgraph Representation Learning on the Blockchain with the Elliptic2 Dataset. - Claudio Bellei; Muhua Xu; Ross Phillips; Tom Robinson; Mark Weber; Tim Kaler; Charles E. Leiserson; Arvind 001; Jie Chen 007 (CoRR, 2024)

Setting a Course for Post-Moore Software Performance. - Charles E. Leiserson (PPoPP, 2025)

Lessons Learned: A Multi-Agent Framework for Code LLMs to Learn and Improve. - Yuanzhe Liu 001; Ryan Deng; Tim Kaler; Xuhao Chen 001; Charles E. Leiserson; Yao Ma; Jie Chen 007 (CoRR, 2025)