Charles E. Leiserson

Affiliations:
  • MIT, Cambridge, US


According to our database1, Charles E. Leiserson authored at least 108 papers between 1980 and 2021.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2006, "For contributions to parallel and distributed computing.".

IEEE Fellow

IEEE Fellow 2016, "For leadership in parallel and distributed computing".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and Pipelining.
CoRR, 2021

Floors and Ceilings in Divide-and-Conquer Recurrences.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

PARAD: A Work-Efficient Parallel Algorithm for Reverse-Mode Automatic Differentiation.
Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

Multidimensional Included and Excluded Sums.
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020
Work-Efficient Parallel Algorithms for Accurate Floating-Point Prefix Sums.
Proceedings of the 2020 IEEE High Performance Extreme Computing Conference, 2020

EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Tapir: Embedding Recursive Fork-join Parallelism into LLVM's Intermediate Representation.
ACM Trans. Parallel Comput., 2019

Anti-Money Laundering in Bitcoin: Experimenting with Graph Convolutional Networks for Financial Forensics.
CoRR, 2019

EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs.
CoRR, 2019

2018
Scalable Graph Learning for Anti-Money Laundering: A First Look.
CoRR, 2018

Brief Announcement: Open Cilk.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

The Resurgence of Software Performance Engineering.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

2017
Autogen: Automatic Discovery of Efficient Recursive Divide-8-Conquer Algorithms for Solving Dynamic Programming Problems.
ACM Trans. Parallel Comput., 2017

The CSI Framework for Compiler-Inserted Program Instrumentation.
Proc. ACM Meas. Anal. Comput. Syst., 2017

Autotuning divide-and-conquer stencil computations.
Concurr. Comput. Pract. Exp., 2017

Tapir: Embedding Fork-Join Parallelism into LLVM's Intermediate Representation.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

2016
Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling.
ACM Trans. Parallel Comput., 2016

Upper Bounds on Number of Steals in Rooted Trees.
Theory Comput. Syst., 2016

A simple deterministic algorithm for guaranteeing the forward progress of transactions.
Inf. Syst., 2016

On the efficiency of localized work stealing.
Inf. Process. Lett., 2016

AUTOGEN: automatic discovery of cache-oblivious parallel recursive algorithms for solving dynamic programs.
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016

Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations.
Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, 2016

2015
On-the-Fly Pipeline Parallelism.
ACM Trans. Parallel Comput., 2015

The Cilkprof Scalability Profiler.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014
Ordering heuristics for parallel graph coloring.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2013

2012
Cache-Oblivious Algorithms.
ACM Trans. Algorithms, 2012

Memory-mapping support for reducer hyperobjects.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Cache-conscious scheduling of streaming applications.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Deterministic parallel random-number generation for dynamic-multithreading platforms.
Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012

2011
Proceedings of the Encyclopedia of Parallel Computing, 2011

Race Detectors for Cilk and Cilk++ Programs.
Proceedings of the Encyclopedia of Parallel Computing, 2011

The pochoir stencil compiler.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

2010
The Cilk++ concurrency platform.
J. Supercomput., 2010

A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers).
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

The Cilkview scalability analyzer.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Helper locks for fork-join parallel programming.
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2010

Executing task graphs using work-stealing.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Efficient Evaluation of Large Polynomials.
Proceedings of the Mathematical Software, 2010

Parallel computation of the minimal elements of a poset.
Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

Using memory mapping to support cactus stacks in work-stealing runtime systems.
Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques, 2010

2009
Reducers and other Cilk++ hyperobjects.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Introduction to Algorithms, 3rd Edition.
MIT Press, ISBN: 9780262533058, 2009

2008
Provably Efficient Online Nonclairvoyant Adaptive Scheduling.
IEEE Trans. Parallel Distributed Syst., 2008

Adaptive work-stealing with parallelism feedback.
ACM Trans. Comput. Syst., 2008

A consistency architecture for hierarchical shared caches.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

2007
Adaptive work stealing with parallelism feedback.
Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2007

Provably Efficient Online Non-clairvoyant Adaptive Scheduling.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

Adaptive Scheduling with Parallelism Feedback.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

Planet-in-a-Bottle: A Numerical Fluid-Laboratory System.
Proceedings of the Computational Science, 2007

2006
Programming with exceptions in JCilk.
Sci. Comput. Program., 2006

Unbounded Transactional Memory.
IEEE Micro, 2006

Provably Efficient Two-Level Adaptive Scheduling.
Proceedings of the Job Scheduling Strategies for Parallel Processing, 2006

An Empirical Evaluation ofWork Stealing with Parallelism Feedback.
Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

Memory models for open-nested transactions.
Proceedings of the 2006 workshop on Memory System Performance and Correctness, 2006

2005
Adversarial contention resolution for simple channels.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

2004
Design and Analysis of Dynamic Multithreaded Algorithms.
Proceedings of the Algorithm Theory, 2004

On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Adversarial Analyses of Window Backoff Strategies.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms.
Proceedings of the Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004, 2004

2003
Cache-Oblivious Algorithms.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2001
Introduction to Algorithms, Second Edition
The MIT Press and McGraw-Hill Book Company, ISBN: 0-07-013151-1, 2001

2000
A New Competitive Analysis of Randomized Caching.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999
Efficient Detection of Determinacy Races in Cilk Programs.
Theory Comput. Syst., 1999

Scheduling Multithreaded Computations by Work Stealing.
J. ACM, 1999

Design and Analysis of Algorithms for Shared-Memory Multiprocessors (Abstract).
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
Space-Efficient Scheduling of Multithreaded Computations.
SIAM J. Comput., 1998

An Experimental Analysis of Parallel Sorting Algorithms.
Theory Comput. Syst., 1998

Detecting Data Rase in Cilk Programs That use Locks.
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

The Implementation of the Cilk-5 Multithreaded Language.
Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI), 1998

1997
Parallel Algorithms for the Circuit Value Update Problem.
Theory Comput. Syst., 1997

Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers.
J. Comput. Syst. Sci., 1997

Optimizing two-phase, level-clocked circuitry.
J. ACM, 1997

Algorithmic Analysis of Multithreaded Algorithms (Abstract).
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Programming Irregular Parallel Applications in Cilk.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

1996
The Network Architecture of the Connection Machine CM-5.
J. Parallel Distributed Comput., 1996

Cilk: An Efficient Multithreaded Runtime System.
J. Parallel Distributed Comput., 1996

A Comparison of Sorting Algorithms for the Connection Machine CM-2.
Commun. ACM, 1996

An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Can Multithreaded Programming Save Massively Parallel Computing?
Proceedings of IPPS '96, 1996

Dag-Consistent Distributed Shared Memory.
Proceedings of IPPS '96, 1996

1993
Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract)
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
The Network Architecture of the Connection Machine CM-5 (Extended Abstract).
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

The Networks of the Connection Machine CM-5.
Proceedings of the Parallel Architectures and Their Efficient Use, 1992

1991
Retiming Synchronous Circuitry.
Algorithmica, 1991

1990
The Organization of Permutation Architectures with Bused Interconnections.
IEEE Trans. Computers, 1990

A Hyperconcentrator Swith for Routing Bit-Serial Messages.
J. Parallel Distributed Comput., 1990

1989
Randomized Routing on Fat-Trees.
Adv. Comput. Res., 1989

Introduction to Algorithms
The MIT Press and McGraw-Hill Book Company, ISBN: 0-07-013143-0, 1989

1988
A Mixed-Integer Linear Programming Problem which is Efficiently Solvable.
J. Algorithms, 1988

Communication-Efficient Parallel Algorithms for Distributed Random-Access Machines.
Algorithmica, 1988

1987
Orderings for Parallel Sparse Symmetric Factorization.
Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing, 1987

The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
An application of number theory to the organization of raster-graphics memory.
J. ACM, 1986

Communication-Efficient Parallel Graph Algorithms.
Proceedings of the International Conference on Parallel Processing, 1986

A Hyperconcentrator Switch for Routing Bit-Serial Messages.
Proceedings of the International Conference on Parallel Processing, 1986

Recent Results in VLSI CAD at MIT.
Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA, 1986

1985
Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing.
IEEE Trans. Computers, 1985

Wafer-Scale Integration of Systolic Arrays.
IEEE Trans. Computers, 1985

Algorithms for Routing and Testing Routability of Planar VLSI Layouts
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Randomized Routing on Fat-Trees (Preliminary Version)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1983
Optimal Placement for River Routing.
SIAM J. Comput., 1983

1982
How to Assemble Tree Machines (Extended Abstract)
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

Wafer-Scale Integration of Systolic Arrays (Extended Abstract)
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract)
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981
Optimizing Synchronous Systems
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
Area-Efficient Graph Layouts (for VLSI)
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980


  Loading...