Leonard J. Schulman

According to our database1, Leonard J. Schulman authored at least 93 papers between 1990 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Edge Expansion and Spectral Gap of Nonnegative Matrices.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Online Codes for Analog Signals.
IEEE Trans. Inf. Theory, 2019

The duality gap for two-team zero-sum games.
Games Econ. Behav., 2019

Achieving target equilibria in network routing games without knowing the latency functions.
Games Econ. Behav., 2019

2018
Explicit Binary Tree Codes with Polylogarithmic Size Alphabet.
Electronic Colloquium on Computational Complexity (ECCC), 2018

Quasi-regular sequences and optimal schedules for security games.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Learning Dynamics and the Co-Evolution of Competing Sexual Species.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017
Analysis of a Classical Matrix Preconditioning Algorithm.
J. ACM, 2017

Convergence of Incentive-Driven Dynamics in Fisher Markets.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Extractors for Near Logarithmic Min-Entropy.
Electronic Colloquium on Computational Complexity (ECCC), 2016

Market Dynamics of Best-Response with Lookahead.
CoRR, 2016

Stability of Causal Inference.
Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, 2016

The Adversarial Noise Threshold for Distributed Protocols.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Learning Arbitrary Statistical Mixtures of Discrete Distributions.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Allocation of Divisible Goods Under Lexicographic Preferences.
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.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Dimension-Free L2 Maximal Inequality for Spherical Means in the Hypercube.
Theory Comput., 2014

Volume in General Metric Spaces.
Discret. Comput. Geom., 2014

Network Improvement for Equilibrium Routing.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014

Learning mixtures of arbitrary distributions over large discrete domains.
Proceedings of the Innovations in Theoretical Computer Science, 2014

Tree codes and a conjecture on exponential sums.
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).
SIAM J. Comput., 2013

An MQ/Code Cryptosystem Proposal.
IACR Cryptol. ePrint Arch., 2013

The Network Improvement Problem for Equilibrium Routing.
CoRR, 2013

Clustering Affine Subspaces: Hardness and Algorithms.
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.
J. ACM, 2012

Cryptography from tensor problems.
IACR Cryptol. ePrint Arch., 2012

Optimal Coding for Streaming Authentication and Interactive Communication.
Electronic Colloquium on Computational Complexity (ECCC), 2012

Data reduction for weighted and outlier-resistant clustering.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
The Quantifier Semigroup for Bipartite Graphs.
Electron. J. Comb., 2011

Dimensionality reduction: Beyond the Johnson-Lindenstrauss bound.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
Clustering lines in high-dimensional space: Classification of incomplete data.
ACM Trans. Algorithms, 2010

Universal epsilon-approximators for Integrals.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Error-correcting codes for automatic control.
IEEE Trans. Inf. Theory, 2009

Universal Immersion Spaces for Edge-Colored Graphs and Nearest-Neighbor Metrics.
SIAM J. Discret. Math., 2009

Contraction and Expansion of Convex Sets.
Discret. Comput. Geom., 2009

2008
The Symmetric Group Defies Strong Fourier Sampling.
SIAM J. Comput., 2008

Solvency Games.
Electronic Colloquium on Computational Complexity (ECCC), 2008

Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem.
Discret. Comput. Geom., 2008

On partitioning graphs via single commodity flows.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Approximation algorithms for labeling hierarchical taxonomies.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

On a capacitated multivehicle routing problem.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007
Physical Limits of Heat-Bath Algorithmic Cooling.
SIAM J. Comput., 2007

The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts.
SIAM J. Comput., 2007

A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians.
J. Mach. Learn. Res., 2007

Quantum Algorithms for Hidden Nonlinear Structures.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006
Computing with highly mixed states.
J. ACM, 2006

Lower bounds for linear locally decodable codes and private information retrieval.
Comput. Complex., 2006

2005
The Symmetric Group Defies Strong Fourier Sampling: Part I
CoRR, 2005

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

Feedback control for router congestion resolution.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Real-time coding for multiple access channels.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Deterministic clustering with data nets
Electronic Colloquium on Computational Complexity (ECCC), 2004

Improved Expansion of Random Cayley Graphs.
Discret. Math. Theor. Comput. Sci., 2004

Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem.
Combinatorica, 2004

The power of basis selection in fourier sampling: hidden subgroup problems in affine groups.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Fair and efficient router congestion control.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Rapid near-optimal VQ design with a deterministic data net.
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.
IEEE Trans. Inf. Theory, 2003

The Quantum Communication Complexity of Sampling.
SIAM J. Comput., 2003

Reconstruction from subsequences.
J. Comb. Theory, Ser. A, 2003

2002
A random stacking process.
Discret. Math., 2002

2001
The Vector Partition Problem for Convex Objective Functions.
Math. Oper. Res., 2001

2000
Verification of Identities.
SIAM J. Comput., 2000

A Two-Round Variant of EM for Gaussian Mixtures.
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).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Computing with highly mixed states (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Asymptotically good codes correcting insertions, deletions, and transpositions.
IEEE Trans. Inf. Theory, 1999

Signal propagation and noisy circuits.
IEEE Trans. Inf. Theory, 1999

Clustering for Edge-Cost Minimization
Electronic Colloquium on Computational Complexity (ECCC), 1999

Molecular Scale Heat Engines and Scalable Quantum Computation.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Majorizing Estimators and the Approximation of #P-Complete Problems.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1998
A Three-Party Communication Problem.
J. Comput. Syst. Sci., 1998

Fairness in Scheduling
J. Algorithms, 1998

Pattern Matching for Spatial Point Sets.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
The maintenance of common data in a distributed system.
J. ACM, 1997

Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
Coding for interactive communication.
IEEE Trans. Inf. Theory, 1996

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

Verifying Identities (extended abstract).
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995
Splitters and Near-Optimal Derandomization.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
A Product Theorem for Intersection Families.
Eur. J. Comb., 1994

Crossing Families.
Combinatorica, 1994

A coding theorem for distributed computation.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1993
Optimal Randomized Algorithms for Local Sorting and Set-Maxima.
SIAM J. Comput., 1993

Minimally Distant Sets of Lattice Points.
Eur. J. Comb., 1993

An Equipartition of Planar Sets.
Discret. Comput. Geom., 1993

Deterministic coding for interactive communication.
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
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Sample Spaces Uniform on Neighborhoods
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Communication on Noisy Channels: A Coding Theorem for Computation
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1990
Sorting on a Ring of Processors.
J. Algorithms, 1990

Optimal Randomized Algorithms for Local Sorting and Set-Maxima
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990


  Loading...