Leonard J. Schulman

153 papers A* 46A 11B 3Journal 83Unranked 10

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Causal Identification in Time Series Models. CLeaR Erik Jahn, Karthik Karnik, Leonard J. Schulman
2025	J	`jnl`	Causal Identification in Time Series Models. CoRR Erik Jahn, Karthik Karnik, Leonard J. Schulman
2025	A	`conf`	Diversity in Evolutionary Dynamics (Extended Abstract). ITCS Yuval Rabani, Leonard J. Schulman, Alistair Sinclair
2025	A	`conf`	Lower Bounds on the Size of Markov Equivalence Classes. UAI Erik Jahn, Frederick Eberhardt, Leonard J. Schulman
2025	J	`jnl`	Lower Bounds on the Size of Markov Equivalence Classes. CoRR Erik Jahn, Frederick Eberhardt, Leonard J. Schulman
2025	J	`jnl`	The Rate-Immediacy Barrier in Explicit Tree Code Constructions. CoRR Gil Cohen, Leonard J. Schulman, Piyush Srivastava
2025	J	`jnl`	The Rate-Immediacy Barrier in Explicit Tree Code Constructions. Electron. Colloquium Comput. Complex. Gil Cohen, Leonard J. Schulman, Piyush Srivastava
2024	J	`jnl`	Diversity in Evolutionary Dynamics. CoRR Yuval Rabani, Leonard J. Schulman, Alistair Sinclair
2024	A	`conf`	Identifiability of Product of Experts Models. AISTATS Manav Kant, Eric Y. Ma, Andrei Staicu, Leonard J. Schulman, Spencer Gordon
2024	A*	`conf`	Identification of mixtures of discrete product distributions in near-optimal sample and time complexity. COLT Spencer L. Gordon, Erik Jahn, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman
2023	J	`jnl`	Causal Discovery under Latent Class Confounding. CoRR Bijan Mazaheri, Spencer Gordon, Yuval Rabani, Leonard J. Schulman
2023	—	`conf`	Causal Inference Despite Limited Global Confounding via Mixture Models. CLeaR Spencer L. Gordon, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman
2023	—	`conf`	Computational and Information-Theoretic Questions from Causal Inference (Invited Talk). FSTTCS Leonard J. Schulman
2023	J	`jnl`	Identifiability of Product of Experts Models. CoRR Spencer L. Gordon, Manav Kant, Eric Y. Ma, Leonard J. Schulman, Andrei Staicu
2023	J	`jnl`	Identification of Mixtures of Discrete Product Distributions in Near-Optimal Sample and Time Complexity. CoRR Spencer L. Gordon, Erik Jahn, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman
2022	J	`jnl`	A refined approximation for Euclidean k-means. Inf. Process. Lett. Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat
2022	J	`jnl`	Convergence of incentive-driven dynamics in Fisher markets. Games Econ. Behav. Krishnamurthy Dvijotham, Yuval Rabani, Leonard J. Schulman
2022	J	`jnl`	Hadamard Extensions and the Identification of Mixtures of Product Distributions. IEEE Trans. Inf. Theory Spencer L. Gordon, Leonard J. Schulman
2021	J	`jnl`	A Refined Approximation for Euclidean k-Means. CoRR Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat
2021	A	`conf`	Condition number bounds for causal inference. UAI Spencer L. Gordon, Vinayak M. Kumar, Leonard J. Schulman, Piyush Srivastava
2021	J	`jnl`	Hadamard Powers and the Identification of Mixtures of Products. CoRR Spencer L. Gordon, Leonard J. Schulman
2021	J	`jnl`	Identifying Mixtures of Bayesian Network Distributions. CoRR Spencer L. Gordon, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman
2021	A*	`conf`	Source Identification for Mixtures of Product Distributions. COLT Spencer Gordon, Bijan H. Mazaheri, Yuval Rabani, Leonard J. Schulman
2020	A*	`conf`	Edge Expansion and Spectral Gap of Nonnegative Matrices. SODA Jenish C. Mehta, Leonard J. Schulman
2020	J	`jnl`	Source Identification for Mixtures of Product Distributions. CoRR Spencer L. Gordon, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman
2020	J	`jnl`	The Sparse Hausdorff Moment Problem, with Application to Topic Models. CoRR Spencer Gordon, Bijan Mazaheri, Leonard J. Schulman, Yuval Rabani
2019	J	`jnl`	Achieving target equilibria in network routing games without knowing the latency functions. Games Econ. Behav. Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy
2019	J	`jnl`	Edge Expansion and Spectral Gap of Nonnegative Matrices. CoRR Jenish C. Mehta, Leonard J. Schulman
2019	J	`jnl`	Online Codes for Analog Signals. IEEE Trans. Inf. Theory Leonard J. Schulman, Piyush Srivastava
2019	J	`jnl`	The duality gap for two-team zero-sum games. Games Econ. Behav. Leonard J. Schulman, Umesh V. Vazirani
2018	J	`jnl`	Explicit Binary Tree Codes with Polylogarithmic Size Alphabet. Electron. Colloquium Comput. Complex. Gil Cohen, Bernhard Haeupler, Leonard J. Schulman
2018	A*	`conf`	Explicit binary tree codes with polylogarithmic size alphabet. STOC Gil Cohen, Bernhard Haeupler, Leonard J. Schulman
2018	A	`conf`	Learning Dynamics and the Co-Evolution of Competing Sexual Species. ITCS Georgios Piliouras, Leonard J. Schulman
2018	A*	`conf`	Quasi-regular sequences and optimal schedules for security games. SODA David Kempe, Leonard J. Schulman, Omer Tamuz
2017	J	`jnl`	Analysis of a Classical Matrix Preconditioning Algorithm. J. ACM Leonard J. Schulman, Alistair Sinclair
2017	A*	`conf`	Convergence of Incentive-Driven Dynamics in Fisher Markets. SODA Krishnamurthy Dvijotham, Yuval Rabani, Leonard J. Schulman
2017	J	`jnl`	Learning Dynamics and the Co-Evolution of Competing Sexual Species. CoRR Georgios Piliouras, Leonard J. Schulman
2017	J	`jnl`	Online codes for analog signals. CoRR Leonard J. Schulman, Piyush Srivastava
2017	A	`conf`	The Duality Gap for Two-Team Zero-Sum Games. ITCS Leonard J. Schulman, Umesh V. Vazirani
2016	A*	`conf`	Extractors for Near Logarithmic Min-Entropy. FOCS Gil Cohen, Leonard J. Schulman
2016	J	`jnl`	Extractors for Near Logarithmic Min-Entropy. Electron. Colloquium Comput. Complex. Gil Cohen, Leonard J. Schulman
2016	J	`jnl`	Market Dynamics of Best-Response with Lookahead. CoRR Krishnamurthy Dvijotham, Yuval Rabani, Leonard J. Schulman
2016	J	`jnl`	Quasi-regular sequences and optimal schedules for security games. CoRR David Kempe, Leonard J. Schulman, Omer Tamuz
2016	A	`conf`	Stability of Causal Inference. UAI Leonard J. Schulman, Piyush Srivastava
2016	A*	`conf`	The Adversarial Noise Threshold for Distributed Protocols. SODA William M. Hoza, Leonard J. Schulman
2015	—	`conf`	Allocation of Divisible Goods Under Lexicographic Preferences. FSTTCS Leonard J. Schulman, Vijay V. Vazirani
2015	A*	`conf`	Analysis of a Classical Matrix Preconditioning Algorithm. STOC Leonard J. Schulman, Alistair Sinclair
2015	J	`jnl`	Analysis of a Classical Matrix Preconditioning Algorithm. CoRR Leonard J. Schulman, Alistair Sinclair
2015	A*	`conf`	Learning Arbitrary Statistical Mixtures of Discrete Distributions. STOC Jian Li, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
2015	J	`jnl`	Learning Arbitrary Statistical Mixtures of Discrete Distributions. CoRR Jian Li, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
2015	J	`jnl`	Optimal Coding for Streaming Authentication and Interactive Communication. IEEE Trans. Inf. Theory Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman
2015	A*	`conf`	Symbolic Integration and the Complexity of Computing Averages. FOCS Leonard J. Schulman, Alistair Sinclair, Piyush Srivastava
2014	A*	`conf`	Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. FOCS Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy
2014	J	`jnl`	Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. CoRR Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy
2014	J	`jnl`	Dimension-Free L Theory Comput. Aram W. Harrow, Alexandra Kolla, Leonard J. Schulman
2014	A	`conf`	Learning mixtures of arbitrary distributions over large discrete domains. ITCS Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
2014	B	`conf`	Network Improvement for Equilibrium Routing. IPCO Umang Bhaskar, Katrina Ligett, Leonard J. Schulman
2014	J	`jnl`	The Adversarial Noise Threshold for Distributed Protocols. CoRR William M. Hoza, Leonard J. Schulman
2014	A	`conf`	Tree codes and a conjecture on exponential sums. ITCS Cristopher Moore, Leonard J. Schulman
2014	J	`jnl`	Volume in General Metric Spaces. Discret. Comput. Geom. Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman
2013	J	`jnl`	A Two-round Variant of EM for Gaussian Mixtures CoRR Sanjoy Dasgupta, Leonard J. Schulman
2013	J	`jnl`	An MQ/Code Cryptosystem Proposal. IACR Cryptol. ePrint Arch. Leonard J. Schulman
2013	A*	`conf`	Clustering Affine Subspaces: Hardness and Algorithms. SODA Euiwoong Lee, Leonard J. Schulman
2013	—	`conf`	Optimal Coding for Streaming Authentication and Interactive Communication. CRYPTO (2) Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman
2013	J	`jnl`	Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010). SIAM J. Comput. Chris Peikert, Robert Kleinberg, Aravind Srinivasan, Alan M. Frieze, Alexander Russell, Leonard J. Schulman
2013	J	`jnl`	The Network Improvement Problem for Equilibrium Routing. CoRR Umang Bhaskar, Katrina Ligett, Leonard J. Schulman
2013	J	`jnl`	Tree Codes and a Conjecture on Exponential Sums. CoRR Cristopher Moore, Leonard J. Schulman
2012	J	`jnl`	Allocation of Divisible Goods under Lexicographic Preferences CoRR Leonard J. Schulman, Vijay V. Vazirani
2012	J	`jnl`	Cryptography from tensor problems. IACR Cryptol. ePrint Arch. Leonard J. Schulman
2012	A*	`conf`	Data reduction for weighted and outlier-resistant clustering. SODA Dan Feldman, Leonard J. Schulman
2012	J	`jnl`	Learning Mixtures of Arbitrary Distributions over Large Discrete Domains CoRR Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
2012	J	`jnl`	Optimal Coding for Streaming Authentication and Interactive Communication. Electron. Colloquium Comput. Complex. Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman
2012	J	`jnl`	The effectiveness of lloyd-type methods for the k-means problem. J. ACM Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
2011	A*	`conf`	Dimensionality reduction: Beyond the Johnson-Lindenstrauss bound. SODA Yair Bartal, Ben Recht, Leonard J. Schulman
2011	J	`jnl`	The Quantifier Semigroup for Bipartite Graphs. Electron. J. Comb. Leonard J. Schulman
2010	J	`jnl`	Clustering lines in high-dimensional space: Classification of incomplete data. ACM Trans. Algorithms Jie Gao, Michael Langberg, Leonard J. Schulman
2010	A*	`ed.`	Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010 STOC Leonard J. Schulman
2010	A*	`conf`	Universal epsilon-approximators for Integrals. SODA Michael Langberg, Leonard J. Schulman
2010	—	`conf`	Volume in General Metric Spaces. ESA (2) Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman
2009	J	`jnl`	Contraction and Expansion of Convex Sets. Discret. Comput. Geom. Michael Langberg, Leonard J. Schulman
2009	J	`jnl`	Error-correcting codes for automatic control. IEEE Trans. Inf. Theory Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman
2009	J	`jnl`	Universal Immersion Spaces for Edge-Colored Graphs and Nearest-Neighbor Metrics. SIAM J. Discret. Math. Yair Bartal, Leonard J. Schulman
2008	J	`jnl`	Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem. Discret. Comput. Geom. Jie Gao, Michael Langberg, Leonard J. Schulman
2008	A*	`conf`	Approximation algorithms for labeling hierarchical taxonomies. SODA Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
2008	A*	`conf`	On a capacitated multivehicle routing problem. PODC Xiaojie Gao, Leonard J. Schulman
2008	A*	`conf`	On partitioning graphs via single commodity flows. STOC Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi
2008	—	`conf`	Solvency Games. FSTTCS Noam Berger, Nevin Kapur, Leonard J. Schulman, Vijay V. Vazirani
2008	J	`jnl`	Solvency Games. Electron. Colloquium Comput. Complex. Noam Berger, Nevin Kapur, Leonard J. Schulman, Vijay V. Vazirani
2008	J	`jnl`	The Symmetric Group Defies Strong Fourier Sampling. SIAM J. Comput. Cristopher Moore, Alexander Russell, Leonard J. Schulman
2007	J	`jnl`	A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians. J. Mach. Learn. Res. Sanjoy Dasgupta, Leonard J. Schulman
2007	—	`conf`	Contraction and Expansion of Convex Sets. CCCG Michael Langberg, Leonard J. Schulman
2007	J	`jnl`	Physical Limits of Heat-Bath Algorithmic Cooling. SIAM J. Comput. Leonard J. Schulman, Tal Mor, Yossi Weinstein
2007	A*	`conf`	Quantum Algorithms for Hidden Nonlinear Structures. FOCS Andrew M. Childs, Leonard J. Schulman, Umesh V. Vazirani
2007	J	`jnl`	The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts. SIAM J. Comput. Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman
2006	A*	`conf`	Analysis of incomplete data and an intrinsic-dimension Helly theorem. SODA Jie Gao, Michael Langberg, Leonard J. Schulman
2006	J	`jnl`	Computing with highly mixed states. J. ACM Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani
2006	J	`jnl`	Lower bounds for linear locally decodable codes and private information retrieval. Comput. Complex. Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan
2006	A*	`conf`	The Effectiveness of Lloyd-Type Methods for the k-Means Problem. FOCS Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
2005	J	`jnl`	A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution. Comb. Leonard J. Schulman, Vijay V. Vazirani
2005	A*	`conf`	Error-Correcting Codes for Automatic Control. FOCS Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman
2005	A*	`conf`	Feedback control for router congestion resolution. PODC Xiaojie Gao, Leonard J. Schulman
2005	—	`conf`	On Scalar LQG Control with Communication Cost. CDC/ECC Chih-Kai Ko, Xiaojie Gao, Stephen Prajna, Leonard J. Schulman
2005	B	`conf`	Real-time coding for multiple access channels. ISIT Xiaojie Gao, Leonard J. Schulman
2005	A*	`conf`	The Symmetric Group Defies Strong Fourier Sampling. FOCS Cristopher Moore, Alexander Russell, Leonard J. Schulman
2005	J	`jnl`	The Symmetric Group Defies Strong Fourier Sampling: Part I CoRR Cristopher Moore, Alexander Russell, Leonard J. Schulman
2004	J	`jnl`	Deterministic clustering with data nets Electron. Colloquium Comput. Complex. Michelle Effros, Leonard J. Schulman
2004	A*	`conf`	Fair and efficient router congestion control. SODA Xiaojie Gao, Kamal Jain, Leonard J. Schulman
2004	J	`jnl`	Improved Expansion of Random Cayley Graphs. Discret. Math. Theor. Comput. Sci. Po-Shen Loh, Leonard J. Schulman
2004	J	`jnl`	Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem. Comb. Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, Umesh V. Vazirani
2004	B	`conf`	Rapid near-optimal VQ design with a deterministic data net. ISIT Michelle Effros, Leonard J. Schulman
2004	A*	`conf`	The power of basis selection in fourier sampling: hidden subgroup problems in affine groups. SODA Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman
2003	J	`jnl`	On the maximum tolerable noise of k-input gates for reliable computation by formulas. IEEE Trans. Inf. Theory William S. Evans, Leonard J. Schulman
2003	J	`jnl`	Reconstruction from subsequences. J. Comb. Theory A Miroslav Dudík, Leonard J. Schulman
2003	J	`jnl`	The Quantum Communication Complexity of Sampling. SIAM J. Comput. Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson
2002	J	`jnl`	A random stacking process. Discret. Math. Leonard J. Schulman
2002	A	`conf`	Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. CCC Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan
2001	J	`jnl`	Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval Electron. Colloquium Comput. Complex. Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan
2001	A*	`conf`	Quantum mechanical algorithms for the nonabelian hidden subgroup problem. STOC Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, Umesh V. Vazirani
2001	J	`jnl`	The Vector Partition Problem for Convex Objective Functions. Math. Oper. Res. Shmuel Onn, Leonard J. Schulman
2000	A	`conf`	A Two-Round Variant of EM for Gaussian Mixtures. UAI Sanjoy Dasgupta, Leonard J. Schulman
2000	A*	`conf`	Clustering for edge-cost minimization (extended abstract). STOC Leonard J. Schulman
2000	A*	`conf`	Computing with highly mixed states (extended abstract). STOC Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani
2000	J	`jnl`	Verification of Identities. SIAM J. Comput. Sridhar Rajagopalan, Leonard J. Schulman
1999	J	`jnl`	Asymptotically good codes correcting insertions, deletions, and transpositions. IEEE Trans. Inf. Theory Leonard J. Schulman, David Zuckerman
1999	J	`jnl`	Clustering for Edge-Cost Minimization Electron. Colloquium Comput. Complex. Leonard J. Schulman
1999	A*	`conf`	Majorizing Estimators and the Approximation of #P-Complete Problems. STOC Leonard J. Schulman, Vijay V. Vazirani
1999	A*	`conf`	Molecular Scale Heat Engines and Scalable Quantum Computation. STOC Leonard J. Schulman, Umesh V. Vazirani
1999	J	`jnl`	Signal propagation and noisy circuits. IEEE Trans. Inf. Theory William S. Evans, Leonard J. Schulman
1998	J	`jnl`	A Three-Party Communication Problem. J. Comput. Syst. Sci. Leonard J. Schulman
1998	J	`jnl`	Fairness in Scheduling J. Algorithms Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
1998	A*	`conf`	Pattern Matching for Spatial Point Sets. FOCS David E. Cardoze, Leonard J. Schulman
1998	A*	`conf`	The Quantum Communication Complexity of Sampling. FOCS Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson
1997	A*	`conf`	Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version). SODA Leonard J. Schulman, David Zuckerman
1997	J	`jnl`	The maintenance of common data in a distributed system. J. ACM Baruch Awerbuch, Leonard J. Schulman
1996	J	`jnl`	Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph. Comb. Nabil Kahalé, Leonard J. Schulman
1996	J	`jnl`	Coding for interactive communication. IEEE Trans. Inf. Theory Leonard J. Schulman
1996	A*	`conf`	Verifying Identities (extended abstract). FOCS Sridhar Rajagopalan, Leonard J. Schulman
1995	A*	`conf`	Fairness in Scheduling. SODA Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
1995	A*	`conf`	Splitters and Near-Optimal Derandomization. FOCS Moni Naor, Leonard J. Schulman, Aravind Srinivasan
1994	J	`jnl`	A Product Theorem for Intersection Families. Eur. J. Comb. Leonard J. Schulman
1994	A*	`conf`	A coding theorem for distributed computation. STOC Sridhar Rajagopalan, Leonard J. Schulman
1994	J	`jnl`	Crossing Families. Comb. Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
1993	J	`jnl`	An Equipartition of Planar Sets. Discret. Comput. Geom. Leonard J. Schulman
1993	A*	`conf`	Deterministic coding for interactive communication. STOC Leonard J. Schulman
1993	J	`jnl`	Minimally Distant Sets of Lattice Points. Eur. J. Comb. Daniel J. Kleitman, Leonard J. Schulman
1993	J	`jnl`	Optimal Randomized Algorithms for Local Sorting and Set-Maxima. SIAM J. Comput. Wayne Goddard, Claire Kenyon, Valerie King, Leonard J. Schulman
1993	A*	`conf`	Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas FOCS William S. Evans, Leonard J. Schulman
1992	A*	`conf`	Communication on Noisy Channels: A Coding Theorem for Computation FOCS Leonard J. Schulman
1992	A*	`conf`	Sample Spaces Uniform on Neighborhoods STOC Leonard J. Schulman
1991	—	`conf`	Crossing Families. SCG Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
1991	A*	`conf`	The Maintenance of Common Data in a Distributed System FOCS Baruch Awerbuch, Leonard J. Schulman
1990	A*	`conf`	Optimal Randomized Algorithms for Local Sorting and Set-Maxima STOC Wayne Goddard, Valerie King, Leonard J. Schulman
1990	J	`jnl`	Sorting on a Ring of Processors. J. Algorithms Yishay Mansour, Leonard J. Schulman