| 2026 | ICALP | An Algorithmic Proof of Kruskal's Tensor Decomposition Theorem. | Vishwas Bhargava, Leonard J. Schulman, Shiri Sivan |
| 2025 | UAI | Lower Bounds on the Size of Markov Equivalence Classes. | Erik Jahn, Frederick Eberhardt, Leonard J. Schulman |
| 2024 | AISTATS | Identifiability of Product of Experts Models. | Manav Kant, Eric Y. Ma, Andrei Staicu, Leonard J. Schulman, Spencer Gordon |
| 2024 | COLT | Identification of mixtures of discrete product distributions in near-optimal sample and time complexity. | Spencer L. Gordon, Erik Jahn, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman |
| 2021 | COLT | Source Identification for Mixtures of Product Distributions. | Spencer Gordon, Bijan H. Mazaheri, Yuval Rabani, Leonard J. Schulman |
| 2021 | UAI | Condition number bounds for causal inference. | Spencer L. Gordon, Vinayak M. Kumar, Leonard J. Schulman, Piyush Srivastava |
| 2020 | SODA | Edge Expansion and Spectral Gap of Nonnegative Matrices. | Jenish C. Mehta, Leonard J. Schulman |
| 2018 | SODA | Quasi-regular sequences and optimal schedules for security games. | David Kempe, Leonard J. Schulman, Omer Tamuz |
| 2018 | STOC | Explicit binary tree codes with polylogarithmic size alphabet. | Gil Cohen, Bernhard Haeupler, Leonard J. Schulman |
| 2017 | SODA | Convergence of Incentive-Driven Dynamics in Fisher Markets. | Krishnamurthy Dvijotham, Yuval Rabani, Leonard J. Schulman |
| 2016 | FOCS | Extractors for Near Logarithmic Min-Entropy. | Gil Cohen, Leonard J. Schulman |
| 2016 | SODA | The Adversarial Noise Threshold for Distributed Protocols. | William M. Hoza, Leonard J. Schulman |
| 2016 | UAI | Stability of Causal Inference. | Leonard J. Schulman, Piyush Srivastava |
| 2015 | FOCS | Symbolic Integration and the Complexity of Computing Averages. | Leonard J. Schulman, Alistair Sinclair, Piyush Srivastava |
| 2015 | STOC | Learning Arbitrary Statistical Mixtures of Discrete Distributions. | Jian Li, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy |
| 2015 | STOC | Analysis of a Classical Matrix Preconditioning Algorithm. | Leonard J. Schulman, Alistair Sinclair |
| 2014 | FOCS | Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. | Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy |
| 2014 | IPCO | Network Improvement for Equilibrium Routing. | Umang Bhaskar, Katrina Ligett, Leonard J. Schulman |
| 2013 | CRYPTO | Optimal Coding for Streaming Authentication and Interactive Communication. | Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman |
| 2013 | SODA | Clustering Affine Subspaces: Hardness and Algorithms. | Euiwoong Lee, Leonard J. Schulman |
| 2012 | SODA | Data reduction for weighted and outlier-resistant clustering. | Dan Feldman, Leonard J. Schulman |
| 2011 | SODA | Dimensionality reduction: Beyond the Johnson-Lindenstrauss bound. | Yair Bartal, Ben Recht, Leonard J. Schulman |
| 2010 | ESA | Volume in General Metric Spaces. | Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman |
| 2010 | SODA | Universal epsilon-approximators for Integrals. | Michael Langberg, Leonard J. Schulman |
| 2008 | PODC | On a capacitated multivehicle routing problem. | Xiaojie Gao, Leonard J. Schulman |
| 2008 | SODA | Approximation algorithms for labeling hierarchical taxonomies. | Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy |
| 2008 | STOC | On partitioning graphs via single commodity flows. | Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi |
| 2007 | FOCS | Quantum Algorithms for Hidden Nonlinear Structures. | Andrew M. Childs, Leonard J. Schulman, Umesh V. Vazirani |
| 2006 | FOCS | The Effectiveness of Lloyd-Type Methods for the k-Means Problem. | Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy |
| 2006 | SODA | Analysis of incomplete data and an intrinsic-dimension Helly theorem. | Jie Gao, Michael Langberg, Leonard J. Schulman |
| 2005 | FOCS | The Symmetric Group Defies Strong Fourier Sampling. | Cristopher Moore, Alexander Russell, Leonard J. Schulman |
| 2005 | FOCS | Error-Correcting Codes for Automatic Control. | Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman |
| 2005 | ISIT | Real-time coding for multiple access channels. | Xiaojie Gao, Leonard J. Schulman |
| 2005 | PODC | Feedback control for router congestion resolution. | Xiaojie Gao, Leonard J. Schulman |
| 2004 | ISIT | Rapid near-optimal VQ design with a deterministic data net. | Michelle Effros, Leonard J. Schulman |
| 2004 | SODA | Fair and efficient router congestion control. | Xiaojie Gao, Kamal Jain, Leonard J. Schulman |
| 2004 | SODA | The power of basis selection in fourier sampling: hidden subgroup problems in affine groups. | Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman |
| 2001 | STOC | Quantum mechanical algorithms for the nonabelian hidden subgroup problem. | Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, Umesh V. Vazirani |
| 2000 | STOC | Computing with highly mixed states (extended abstract). | Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani |
| 2000 | STOC | Clustering for edge-cost minimization (extended abstract). | Leonard J. Schulman |
| 2000 | UAI | A Two-Round Variant of EM for Gaussian Mixtures. | Sanjoy Dasgupta, Leonard J. Schulman |
| 1999 | STOC | Majorizing Estimators and the Approximation of #P-Complete Problems. | Leonard J. Schulman, Vijay V. Vazirani |
| 1999 | STOC | Molecular Scale Heat Engines and Scalable Quantum Computation. | Leonard J. Schulman, Umesh V. Vazirani |
| 1998 | FOCS | The Quantum Communication Complexity of Sampling. | Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson |
| 1998 | FOCS | Pattern Matching for Spatial Point Sets. | David E. Cardoze, Leonard J. Schulman |
| 1997 | SODA | Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version). | Leonard J. Schulman, David Zuckerman |
| 1996 | FOCS | Verifying Identities (extended abstract). | Sridhar Rajagopalan, Leonard J. Schulman |
| 1995 | FOCS | Splitters and Near-Optimal Derandomization. | Moni Naor, Leonard J. Schulman, Aravind Srinivasan |
| 1995 | SODA | Fairness in Scheduling. | Mikls Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts |
| 1994 | STOC | A coding theorem for distributed computation. | Sridhar Rajagopalan, Leonard J. Schulman |
| 1993 | FOCS | Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas | William S. Evans, Leonard J. Schulman |
| 1993 | STOC | Deterministic coding for interactive communication. | Leonard J. Schulman |
| 1992 | FOCS | Communication on Noisy Channels: A Coding Theorem for Computation | Leonard J. Schulman |
| 1992 | STOC | Sample Spaces Uniform on Neighborhoods | Leonard J. Schulman |
| 1991 | FOCS | The Maintenance of Common Data in a Distributed System | Baruch Awerbuch, Leonard J. Schulman |
| 1990 | STOC | Optimal Randomized Algorithms for Local Sorting and Set-Maxima | Wayne Goddard, Valerie King, Leonard J. Schulman |