Leonard J. Schulman

According to our database, Leonard J. Schulman authored at least 107 papers between 1990 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of one.

2024

Diversity in Evolutionary Dynamics.

Yuval Rabani, Leonard J. Schulman, Alistair Sinclair

CoRR, 2024

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

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Identifiability of Product of Experts Models.

Manav Kant, Eric Y. Ma, Andrei Staicu, Leonard J. Schulman, Spencer Gordon

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

Causal Discovery under Latent Class Confounding.

Bijan Mazaheri, Spencer Gordon, Yuval Rabani, Leonard J. Schulman

CoRR, 2023

Computational and Information-Theoretic Questions from Causal Inference (Invited Talk).

Leonard J. Schulman

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Causal Inference Despite Limited Global Confounding via Mixture Models.

Spencer L. Gordon, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman

Proceedings of the Conference on Causal Learning and Reasoning, 2023

2022

Hadamard Extensions and the Identification of Mixtures of Product Distributions.

Spencer L. Gordon, Leonard J. Schulman

IEEE Trans. Inf. Theory, 2022

A refined approximation for Euclidean k-means.

Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat

Inf. Process. Lett., 2022

Convergence of incentive-driven dynamics in Fisher markets.

Krishnamurthy Dvijotham, Yuval Rabani, Leonard J. Schulman

Games Econ. Behav., 2022

2021

Identifying Mixtures of Bayesian Network Distributions.

Spencer L. Gordon, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman

CoRR, 2021

Hadamard Powers and the Identification of Mixtures of Products.

Spencer L. Gordon, Leonard J. Schulman

CoRR, 2021

Condition number bounds for causal inference.

Spencer L. Gordon, Vinayak M. Kumar, Leonard J. Schulman, Piyush Srivastava

Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Source Identification for Mixtures of Product Distributions.

Spencer Gordon, Bijan H. Mazaheri, Yuval Rabani, Leonard J. Schulman

Proceedings of the Conference on Learning Theory, 2021

2020

The Sparse Hausdorff Moment Problem, with Application to Topic Models.

Spencer Gordon, Bijan Mazaheri, Leonard J. Schulman, Yuval Rabani

CoRR, 2020

Edge Expansion and Spectral Gap of Nonnegative Matrices.

Jenish C. Mehta, Leonard J. Schulman

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Online Codes for Analog Signals.

Leonard J. Schulman, Piyush Srivastava

IEEE Trans. Inf. Theory, 2019

The duality gap for two-team zero-sum games.

Leonard J. Schulman, Umesh V. Vazirani

Games Econ. Behav., 2019

Achieving target equilibria in network routing games without knowing the latency functions.

Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy

Games Econ. Behav., 2019

2018

Explicit Binary Tree Codes with Polylogarithmic Size Alphabet.

Gil Cohen, Bernhard Haeupler, Leonard J. Schulman

Electron. Colloquium Comput. Complex., 2018

Quasi-regular sequences and optimal schedules for security games.

David Kempe, Leonard J. Schulman, Omer Tamuz

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Learning Dynamics and the Co-Evolution of Competing Sexual Species.

Georgios Piliouras, Leonard J. Schulman

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017

Analysis of a Classical Matrix Preconditioning Algorithm.

Leonard J. Schulman, Alistair Sinclair

J. ACM, 2017

2016

Extractors for Near Logarithmic Min-Entropy.

Gil Cohen, Leonard J. Schulman

Electron. Colloquium Comput. Complex., 2016

Market Dynamics of Best-Response with Lookahead.

Krishnamurthy Dvijotham, Yuval Rabani, Leonard J. Schulman

CoRR, 2016

Stability of Causal Inference.

Leonard J. Schulman, Piyush Srivastava

Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, 2016

The Adversarial Noise Threshold for Distributed Protocols.

William M. Hoza, Leonard J. Schulman

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Learning Arbitrary Statistical Mixtures of Discrete Distributions.

Jian Li, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Allocation of Divisible Goods Under Lexicographic Preferences.

Leonard J. Schulman, Vijay V. Vazirani

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Symbolic Integration and the Complexity of Computing Averages.

Leonard J. Schulman, Alistair Sinclair, Piyush Srivastava

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Dimension-Free L₂ Maximal Inequality for Spherical Means in the Hypercube.

Aram W. Harrow, Alexandra Kolla, Leonard J. Schulman

Theory Comput., 2014

Volume in General Metric Spaces.

Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman

Discret. Comput. Geom., 2014

Network Improvement for Equilibrium Routing.

Umang Bhaskar, Katrina Ligett, Leonard J. Schulman

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

Learning mixtures of arbitrary distributions over large discrete domains.

Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy

Proceedings of the Innovations in Theoretical Computer Science, 2014

Tree codes and a conjecture on exponential sums.

Cristopher Moore, Leonard J. Schulman

Proceedings of the Innovations in Theoretical Computer Science, 2014

2013

Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010).

Chris Peikert, Robert Kleinberg, Aravind Srinivasan, Alan M. Frieze, Alexander Russell, Leonard J. Schulman

SIAM J. Comput., 2013

An MQ/Code Cryptosystem Proposal.

Leonard J. Schulman

IACR Cryptol. ePrint Arch., 2013

The Network Improvement Problem for Equilibrium Routing.

Umang Bhaskar, Katrina Ligett, Leonard J. Schulman

CoRR, 2013

Clustering Affine Subspaces: Hardness and Algorithms.

Euiwoong Lee, Leonard J. Schulman

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

The effectiveness of lloyd-type methods for the k-means problem.

Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy

J. ACM, 2012

Cryptography from tensor problems.

Leonard J. Schulman

IACR Cryptol. ePrint Arch., 2012

Optimal Coding for Streaming Authentication and Interactive Communication.

Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman

Electron. Colloquium Comput. Complex., 2012

Data reduction for weighted and outlier-resistant clustering.

Dan Feldman, Leonard J. Schulman

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

The Quantifier Semigroup for Bipartite Graphs.

Leonard J. Schulman

Electron. J. Comb., 2011

Dimensionality reduction: Beyond the Johnson-Lindenstrauss bound.

Yair Bartal, Ben Recht, Leonard J. Schulman

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Clustering lines in high-dimensional space: Classification of incomplete data.

Jie Gao, Michael Langberg, Leonard J. Schulman

ACM Trans. Algorithms, 2010

Universal epsilon-approximators for Integrals.

Michael Langberg, Leonard J. Schulman

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Error-correcting codes for automatic control.

Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman

IEEE Trans. Inf. Theory, 2009

Universal Immersion Spaces for Edge-Colored Graphs and Nearest-Neighbor Metrics.

Yair Bartal, Leonard J. Schulman

SIAM J. Discret. Math., 2009

Contraction and Expansion of Convex Sets.

Michael Langberg, Leonard J. Schulman

Discret. Comput. Geom., 2009

2008

The Symmetric Group Defies Strong Fourier Sampling.

Cristopher Moore, Alexander Russell, Leonard J. Schulman

SIAM J. Comput., 2008

Solvency Games.

Noam Berger, Nevin Kapur, Leonard J. Schulman, Vijay V. Vazirani

Electron. Colloquium Comput. Complex., 2008

Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem.

Jie Gao, Michael Langberg, Leonard J. Schulman

Discret. Comput. Geom., 2008

On partitioning graphs via single commodity flows.

Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Approximation algorithms for labeling hierarchical taxonomies.

Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

On a capacitated multivehicle routing problem.

Xiaojie Gao, Leonard J. Schulman

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007

Physical Limits of Heat-Bath Algorithmic Cooling.

Leonard J. Schulman, Tal Mor, Yossi Weinstein

SIAM J. Comput., 2007

The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts.

Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman

SIAM J. Comput., 2007

A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians.

Sanjoy Dasgupta, Leonard J. Schulman

J. Mach. Learn. Res., 2007

Quantum Algorithms for Hidden Nonlinear Structures.

Andrew M. Childs, Leonard J. Schulman, Umesh V. Vazirani

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006

Computing with highly mixed states.

Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani

J. ACM, 2006

Lower bounds for linear locally decodable codes and private information retrieval.

Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan

Comput. Complex., 2006

2005

The Symmetric Group Defies Strong Fourier Sampling: Part I

Cristopher Moore, Alexander Russell, Leonard J. Schulman

CoRR, 2005

A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution.

Leonard J. Schulman, Vijay V. Vazirani

Comb., 2005

Feedback control for router congestion resolution.

Xiaojie Gao, Leonard J. Schulman

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Real-time coding for multiple access channels.

Xiaojie Gao, Leonard J. Schulman

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

On Scalar LQG Control with Communication Cost.

Chih-Kai Ko, Xiaojie Gao, Stephen Prajna, Leonard J. Schulman

Proceedings of the 44th IEEE IEEE Conference on Decision and Control and 8th European Control Conference Control, 2005

2004

Deterministic clustering with data nets

Michelle Effros, Leonard J. Schulman

Electron. Colloquium Comput. Complex., 2004

Improved Expansion of Random Cayley Graphs.

Po-Shen Loh, Leonard J. Schulman

Discret. Math. Theor. Comput. Sci., 2004

Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem.

Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, Umesh V. Vazirani

Comb., 2004

The power of basis selection in fourier sampling: hidden subgroup problems in affine groups.

Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Fair and efficient router congestion control.

Xiaojie Gao, Kamal Jain, Leonard J. Schulman

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Rapid near-optimal VQ design with a deterministic data net.

Michelle Effros, Leonard J. Schulman

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

On the maximum tolerable noise of k-input gates for reliable computation by formulas.

William S. Evans, Leonard J. Schulman

IEEE Trans. Inf. Theory, 2003

The Quantum Communication Complexity of Sampling.

Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson

SIAM J. Comput., 2003

Reconstruction from subsequences.

Miroslav Dudík, Leonard J. Schulman

J. Comb. Theory A, 2003

2002

A random stacking process.

Leonard J. Schulman

Discret. Math., 2002

2001

The Vector Partition Problem for Convex Objective Functions.

Shmuel Onn, Leonard J. Schulman

Math. Oper. Res., 2001

2000

Verification of Identities.

Sridhar Rajagopalan, Leonard J. Schulman

SIAM J. Comput., 2000

A Two-Round Variant of EM for Gaussian Mixtures.

Sanjoy Dasgupta, Leonard J. Schulman

Proceedings of the UAI '00: Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence, Stanford University, Stanford, California, USA, June 30, 2000

Clustering for edge-cost minimization (extended abstract).

Leonard J. Schulman

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Computing with highly mixed states (extended abstract).

Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999

Asymptotically good codes correcting insertions, deletions, and transpositions.

Leonard J. Schulman, David Zuckerman

IEEE Trans. Inf. Theory, 1999

Signal propagation and noisy circuits.

William S. Evans, Leonard J. Schulman

IEEE Trans. Inf. Theory, 1999

Clustering for Edge-Cost Minimization

Leonard J. Schulman

Electron. Colloquium Comput. Complex., 1999

Molecular Scale Heat Engines and Scalable Quantum Computation.

Leonard J. Schulman, Umesh V. Vazirani

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Majorizing Estimators and the Approximation of #P-Complete Problems.

Leonard J. Schulman, Vijay V. Vazirani

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1998

A Three-Party Communication Problem.

Leonard J. Schulman

J. Comput. Syst. Sci., 1998

Fairness in Scheduling

Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts

J. Algorithms, 1998

Pattern Matching for Spatial Point Sets.

David E. Cardoze, Leonard J. Schulman

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

The maintenance of common data in a distributed system.

Baruch Awerbuch, Leonard J. Schulman

J. ACM, 1997

Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version).

Leonard J. Schulman, David Zuckerman

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

Coding for interactive communication.

Leonard J. Schulman

IEEE Trans. Inf. Theory, 1996

Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph.

Nabil Kahalé, Leonard J. Schulman

Comb., 1996

Verifying Identities (extended abstract).

Sridhar Rajagopalan, Leonard J. Schulman

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

Splitters and Near-Optimal Derandomization.

Moni Naor, Leonard J. Schulman, Aravind Srinivasan

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

A Product Theorem for Intersection Families.

Leonard J. Schulman

Eur. J. Comb., 1994

Crossing Families.

Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman

Comb., 1994

A coding theorem for distributed computation.

Sridhar Rajagopalan, Leonard J. Schulman

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1993

Optimal Randomized Algorithms for Local Sorting and Set-Maxima.

Wayne Goddard, Claire Kenyon, Valerie King, Leonard J. Schulman

SIAM J. Comput., 1993

Minimally Distant Sets of Lattice Points.

Daniel J. Kleitman, Leonard J. Schulman

Eur. J. Comb., 1993

An Equipartition of Planar Sets.

Leonard J. Schulman

Discret. Comput. Geom., 1993

Deterministic coding for interactive communication.

Leonard J. Schulman

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas

William S. Evans, Leonard J. Schulman

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

Sample Spaces Uniform on Neighborhoods

Leonard J. Schulman

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Communication on Noisy Channels: A Coding Theorem for Computation

Leonard J. Schulman

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1990

Sorting on a Ring of Processors.

Yishay Mansour, Leonard J. Schulman

J. Algorithms, 1990

Optimal Randomized Algorithms for Local Sorting and Set-Maxima

Wayne Goddard, Valerie King, Leonard J. Schulman

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990