default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeonard J. Schulman
Person information
- affiliation: California Institute of Technology, Pasadena, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c66]Manav Kant, Eric Y. Ma, Andrei Staicu, Leonard J. Schulman, Spencer Gordon:
Identifiability of Product of Experts Models. AISTATS 2024: 4492-4500- [c65]Spencer L. Gordon, Erik Jahn, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman:
Identification of mixtures of discrete product distributions in near-optimal sample and time complexity. COLT 2024: 2071-2091 - [i33]Yuval Rabani, Leonard J. Schulman, Alistair Sinclair:
Diversity in Evolutionary Dynamics. CoRR abs/2406.03938 (2024) - 2023
- [c64]Spencer L. Gordon, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman:
Causal Inference Despite Limited Global Confounding via Mixture Models. CLeaR 2023: 574-601 - [c63]Leonard J. Schulman:
Computational and Information-Theoretic Questions from Causal Inference (Invited Talk). FSTTCS 2023: 3:1-3:1 - [i32]Spencer L. Gordon, Erik Jahn, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman:
Identification of Mixtures of Discrete Product Distributions in Near-Optimal Sample and Time Complexity. CoRR abs/2309.13993 (2023) - [i31]Spencer L. Gordon, Manav Kant, Eric Y. Ma, Leonard J. Schulman, Andrei Staicu:
Identifiability of Product of Experts Models. CoRR abs/2310.09397 (2023) - [i30]Bijan Mazaheri, Spencer Gordon, Yuval Rabani, Leonard J. Schulman:
Causal Discovery under Latent Class Confounding. CoRR abs/2311.07454 (2023) - 2022
- [j46]Krishnamurthy Dvijotham, Yuval Rabani, Leonard J. Schulman
:
Convergence of incentive-driven dynamics in Fisher markets. Games Econ. Behav. 134: 361-375 (2022) - [j45]Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat:
A refined approximation for Euclidean k-means. Inf. Process. Lett. 176: 106251 (2022) - [j44]Spencer L. Gordon, Leonard J. Schulman:
Hadamard Extensions and the Identification of Mixtures of Product Distributions. IEEE Trans. Inf. Theory 68(6): 4085-4089 (2022) - 2021
- [c62]Spencer Gordon, Bijan H. Mazaheri, Yuval Rabani, Leonard J. Schulman:
Source Identification for Mixtures of Product Distributions. COLT 2021: 2193-2216 - [c61]Spencer L. Gordon, Vinayak M. Kumar, Leonard J. Schulman, Piyush Srivastava:
Condition number bounds for causal inference. UAI 2021: 1948-1957 - [i29]Spencer L. Gordon, Leonard J. Schulman:
Hadamard Powers and the Identification of Mixtures of Products. CoRR abs/2101.11688 (2021) - [i28]Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat:
A Refined Approximation for Euclidean k-Means. CoRR abs/2107.07358 (2021) - [i27]Spencer L. Gordon, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman:
Identifying Mixtures of Bayesian Network Distributions. CoRR abs/2112.11602 (2021) - 2020
- [c60]Jenish C. Mehta, Leonard J. Schulman:
Edge Expansion and Spectral Gap of Nonnegative Matrices. SODA 2020: 1200-1213 - [i26]Spencer Gordon, Bijan Mazaheri, Leonard J. Schulman, Yuval Rabani:
The Sparse Hausdorff Moment Problem, with Application to Topic Models. CoRR abs/2007.08101 (2020) - [i25]Spencer L. Gordon, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman:
Source Identification for Mixtures of Product Distributions. CoRR abs/2012.14540 (2020)
2010 – 2019
- 2019
- [j43]Leonard J. Schulman, Umesh V. Vazirani:
The duality gap for two-team zero-sum games. Games Econ. Behav. 115: 336-345 (2019) - [j42]Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy:
Achieving target equilibria in network routing games without knowing the latency functions. Games Econ. Behav. 118: 533-569 (2019) - [j41]Leonard J. Schulman, Piyush Srivastava:
Online Codes for Analog Signals. IEEE Trans. Inf. Theory 65(10): 6633-6649 (2019) - [i24]Jenish C. Mehta, Leonard J. Schulman:
Edge Expansion and Spectral Gap of Nonnegative Matrices. CoRR abs/1909.12497 (2019) - 2018
- [c59]Georgios Piliouras, Leonard J. Schulman:
Learning Dynamics and the Co-Evolution of Competing Sexual Species. ITCS 2018: 59:1-59:3 - [c58]David Kempe, Leonard J. Schulman, Omer Tamuz:
Quasi-regular sequences and optimal schedules for security games. SODA 2018: 1625-1644 - [c57]Gil Cohen, Bernhard Haeupler, Leonard J. Schulman:
Explicit binary tree codes with polylogarithmic size alphabet. STOC 2018: 535-544 - [i23]Gil Cohen, Bernhard Haeupler, Leonard J. Schulman:
Explicit Binary Tree Codes with Polylogarithmic Size Alphabet. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j40]Leonard J. Schulman, Alistair Sinclair:
Analysis of a Classical Matrix Preconditioning Algorithm. J. ACM 64(2): 9:1-9:23 (2017) - [c56]Leonard J. Schulman, Umesh V. Vazirani:
The Duality Gap for Two-Team Zero-Sum Games. ITCS 2017: 56:1-56:8 - [c55]Krishnamurthy Dvijotham, Yuval Rabani, Leonard J. Schulman:
Convergence of Incentive-Driven Dynamics in Fisher Markets. SODA 2017: 554-567 - [i22]Leonard J. Schulman, Piyush Srivastava:
Online codes for analog signals. CoRR abs/1707.05199 (2017) - [i21]Georgios Piliouras, Leonard J. Schulman:
Learning Dynamics and the Co-Evolution of Competing Sexual Species. CoRR abs/1711.06879 (2017) - 2016
- [c54]Gil Cohen, Leonard J. Schulman:
Extractors for Near Logarithmic Min-Entropy. FOCS 2016: 178-187 - [c53]William M. Hoza, Leonard J. Schulman:
The Adversarial Noise Threshold for Distributed Protocols. SODA 2016: 240-258 - [c52]Leonard J. Schulman, Piyush Srivastava:
Stability of Causal Inference. UAI 2016 - [i20]Krishnamurthy Dvijotham, Yuval Rabani, Leonard J. Schulman:
Market Dynamics of Best-Response with Lookahead. CoRR abs/1605.09012 (2016) - [i19]David Kempe, Leonard J. Schulman, Omer Tamuz:
Quasi-regular sequences and optimal schedules for security games. CoRR abs/1611.07169 (2016) - [i18]Gil Cohen, Leonard J. Schulman:
Extractors for Near Logarithmic Min-Entropy. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j39]Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman:
Optimal Coding for Streaming Authentication and Interactive Communication. IEEE Trans. Inf. Theory 61(1): 133-145 (2015) - [c51]Leonard J. Schulman, Alistair Sinclair, Piyush Srivastava:
Symbolic Integration and the Complexity of Computing Averages. FOCS 2015: 1231-1245 - [c50]Leonard J. Schulman, Vijay V. Vazirani:
Allocation of Divisible Goods Under Lexicographic Preferences. FSTTCS 2015: 543-559 - [c49]Jian Li, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
Learning Arbitrary Statistical Mixtures of Discrete Distributions. STOC 2015: 743-752 - [c48]Leonard J. Schulman, Alistair Sinclair:
Analysis of a Classical Matrix Preconditioning Algorithm. STOC 2015: 831-840 - [i17]Jian Li, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
Learning Arbitrary Statistical Mixtures of Discrete Distributions. CoRR abs/1504.02526 (2015) - [i16]Leonard J. Schulman, Alistair Sinclair:
Analysis of a Classical Matrix Preconditioning Algorithm. CoRR abs/1504.03026 (2015) - 2014
- [j38]Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman:
Volume in General Metric Spaces. Discret. Comput. Geom. 52(2): 366-389 (2014) - [j37]Aram W. Harrow, Alexandra Kolla, Leonard J. Schulman:
Dimension-Free L2 Maximal Inequality for Spherical Means in the Hypercube. Theory Comput. 10: 55-75 (2014) - [c47]Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy:
Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. FOCS 2014: 31-40 - [c46]Cristopher Moore, Leonard J. Schulman:
Tree codes and a conjecture on exponential sums. ITCS 2014: 145-154 - [c45]Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
Learning mixtures of arbitrary distributions over large discrete domains. ITCS 2014: 207-224 - [c44]Umang Bhaskar, Katrina Ligett, Leonard J. Schulman:
Network Improvement for Equilibrium Routing. IPCO 2014: 138-149 - [i15]Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy:
Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. CoRR abs/1408.1429 (2014) - [i14]William M. Hoza, Leonard J. Schulman:
The Adversarial Noise Threshold for Distributed Protocols. CoRR abs/1412.8097 (2014) - 2013
- [j36]Chris Peikert, Robert Kleinberg, Aravind Srinivasan, Alan M. Frieze, Alexander Russell, Leonard J. Schulman:
Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010). SIAM J. Comput. 42(3): 1216-1217 (2013) - [c43]Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman:
Optimal Coding for Streaming Authentication and Interactive Communication. CRYPTO (2) 2013: 258-276 - [c42]Euiwoong Lee, Leonard J. Schulman:
Clustering Affine Subspaces: Hardness and Algorithms. SODA 2013: 810-827 - [i13]Sanjoy Dasgupta, Leonard J. Schulman:
A Two-round Variant of EM for Gaussian Mixtures. CoRR abs/1301.3850 (2013) - [i12]Umang Bhaskar, Katrina Ligett, Leonard J. Schulman:
The Network Improvement Problem for Equilibrium Routing. CoRR abs/1307.3794 (2013) - [i11]Cristopher Moore, Leonard J. Schulman:
Tree Codes and a Conjecture on Exponential Sums. CoRR abs/1308.6007 (2013) - [i10]Leonard J. Schulman:
An MQ/Code Cryptosystem Proposal. IACR Cryptol. ePrint Arch. 2013: 135 (2013) - 2012
- [j35]Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
The effectiveness of lloyd-type methods for the k-means problem. J. ACM 59(6): 28:1-28:22 (2012) - [c41]Dan Feldman, Leonard J. Schulman:
Data reduction for weighted and outlier-resistant clustering. SODA 2012: 1343-1354 - [i9]Leonard J. Schulman, Vijay V. Vazirani:
Allocation of Divisible Goods under Lexicographic Preferences. CoRR abs/1206.4366 (2012) - [i8]Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
Learning Mixtures of Arbitrary Distributions over Large Discrete Domains. CoRR abs/1212.1527 (2012) - [i7]Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman:
Optimal Coding for Streaming Authentication and Interactive Communication. Electron. Colloquium Comput. Complex. TR12 (2012) - [i6]Leonard J. Schulman:
Cryptography from tensor problems. IACR Cryptol. ePrint Arch. 2012: 244 (2012) - 2011
- [j34]Leonard J. Schulman:
The Quantifier Semigroup for Bipartite Graphs. Electron. J. Comb. 18(1) (2011) - [c40]Yair Bartal, Ben Recht, Leonard J. Schulman:
Dimensionality reduction: Beyond the Johnson-Lindenstrauss bound. SODA 2011: 868-887 - 2010
- [j33]Jie Gao, Michael Langberg, Leonard J. Schulman:
Clustering lines in high-dimensional space: Classification of incomplete data. ACM Trans. Algorithms 7(1): 8:1-8:26 (2010) - [c39]Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman:
Volume in General Metric Spaces. ESA (2) 2010: 87-99 - [c38]Michael Langberg, Leonard J. Schulman:
Universal epsilon-approximators for Integrals. SODA 2010: 598-607 - [e1]Leonard J. Schulman:
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. ACM 2010, ISBN 978-1-4503-0050-6 [contents]
2000 – 2009
- 2009
- [j32]Michael Langberg, Leonard J. Schulman:
Contraction and Expansion of Convex Sets. Discret. Comput. Geom. 42(4): 594-614 (2009) - [j31]Yair Bartal, Leonard J. Schulman:
Universal Immersion Spaces for Edge-Colored Graphs and Nearest-Neighbor Metrics. SIAM J. Discret. Math. 23(2): 1110-1115 (2009) - [j30]Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman:
Error-correcting codes for automatic control. IEEE Trans. Inf. Theory 55(7): 2931-2941 (2009) - 2008
- [j29]Jie Gao, Michael Langberg, Leonard J. Schulman:
Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem. Discret. Comput. Geom. 40(4): 537-560 (2008) - [j28]Cristopher Moore, Alexander Russell, Leonard J. Schulman:
The Symmetric Group Defies Strong Fourier Sampling. SIAM J. Comput. 37(6): 1842-1864 (2008) - [c37]Noam Berger, Nevin Kapur, Leonard J. Schulman, Vijay V. Vazirani:
Solvency Games. FSTTCS 2008: 61-72 - [c36]Xiaojie Gao, Leonard J. Schulman:
On a capacitated multivehicle routing problem. PODC 2008: 175-184 - [c35]Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
Approximation algorithms for labeling hierarchical taxonomies. SODA 2008: 671-680 - [c34]Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi:
On partitioning graphs via single commodity flows. STOC 2008: 461-470 - [i5]Noam Berger, Nevin Kapur, Leonard J. Schulman, Vijay V. Vazirani:
Solvency Games. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j27]Sanjoy Dasgupta, Leonard J. Schulman:
A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians. J. Mach. Learn. Res. 8: 203-226 (2007) - [j26]Leonard J. Schulman, Tal Mor, Yossi Weinstein:
Physical Limits of Heat-Bath Algorithmic Cooling. SIAM J. Comput. 36(6): 1729-1747 (2007) - [j25]Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman:
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts. SIAM J. Comput. 37(3): 938-958 (2007) - [c33]Michael Langberg, Leonard J. Schulman:
Contraction and Expansion of Convex Sets. CCCG 2007: 25-28 - [c32]Andrew M. Childs, Leonard J. Schulman, Umesh V. Vazirani:
Quantum Algorithms for Hidden Nonlinear Structures. FOCS 2007: 395-404 - 2006
- [j24]Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan:
Lower bounds for linear locally decodable codes and private information retrieval. Comput. Complex. 15(3): 263-296 (2006) - [j23]Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani:
Computing with highly mixed states. J. ACM 53(3): 507-531 (2006) - [c31]Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
The Effectiveness of Lloyd-Type Methods for the k-Means Problem. FOCS 2006: 165-176 - [c30]Jie Gao, Michael Langberg, Leonard J. Schulman:
Analysis of incomplete data and an intrinsic-dimension Helly theorem. SODA 2006: 464-473 - 2005
- [j22]Leonard J. Schulman, Vijay V. Vazirani:
A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution. Comb. 25(4): 465-486 (2005) - [c29]Chih-Kai Ko, Xiaojie Gao, Stephen Prajna, Leonard J. Schulman:
On Scalar LQG Control with Communication Cost. CDC/ECC 2005: 2805-2810 - [c28]Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman:
Error-Correcting Codes for Automatic Control. FOCS 2005: 309-316 - [c27]Cristopher Moore, Alexander Russell, Leonard J. Schulman:
The Symmetric Group Defies Strong Fourier Sampling. FOCS 2005: 479-490 - [c26]Xiaojie Gao, Leonard J. Schulman:
Real-time coding for multiple access channels. ISIT 2005: 67-71 - [c25]Xiaojie Gao, Leonard J. Schulman:
Feedback control for router congestion resolution. PODC 2005: 218-226 - [i4]Cristopher Moore, Alexander Russell, Leonard J. Schulman:
The Symmetric Group Defies Strong Fourier Sampling: Part I. CoRR abs/quant-ph/0501056 (2005) - 2004
- [j21]Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, Umesh V. Vazirani:
Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem. Comb. 24(1): 137-154 (2004) - [j20]Po-Shen Loh, Leonard J. Schulman:
Improved Expansion of Random Cayley Graphs. Discret. Math. Theor. Comput. Sci. 6(2): 523-528 (2004) - [c24]Michelle Effros, Leonard J. Schulman:
Rapid near-optimal VQ design with a deterministic data net. ISIT 2004: 298 - [c23]Xiaojie Gao, Kamal Jain, Leonard J. Schulman:
Fair and efficient router congestion control. SODA 2004: 1050-1059 - [c22]Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman:
The power of basis selection in fourier sampling: hidden subgroup problems in affine groups. SODA 2004: 1113-1122 - [i3]Michelle Effros, Leonard J. Schulman:
Deterministic clustering with data nets. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j19]Miroslav Dudík, Leonard J. Schulman:
Reconstruction from subsequences. J. Comb. Theory A 103(2): 337-348 (2003) - [j18]Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson:
The Quantum Communication Complexity of Sampling. SIAM J. Comput. 32(6): 1570-1585 (2003) - [j17]William S. Evans, Leonard J. Schulman:
On the maximum tolerable noise of k-input gates for reliable computation by formulas. IEEE Trans. Inf. Theory 49(11): 3094-3098 (2003) - 2002
- [j16]Leonard J. Schulman:
A random stacking process. Discret. Math. 257(2-3): 541-547 (2002) - [c21]Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan:
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. CCC 2002: 175-183 - 2001
- [j15]Shmuel Onn, Leonard J. Schulman:
The Vector Partition Problem for Convex Objective Functions. Math. Oper. Res. 26(3): 583-590 (2001) - [c20]Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, Umesh V. Vazirani:
Quantum mechanical algorithms for the nonabelian hidden subgroup problem. STOC 2001: 68-74 - [i2]Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan:
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j14]Sridhar Rajagopalan, Leonard J. Schulman:
Verification of Identities. SIAM J. Comput. 29(4): 1155-1163 (2000) - [c19]Leonard J. Schulman:
Clustering for edge-cost minimization (extended abstract). STOC 2000: 547-555 - [c18]Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani:
Computing with highly mixed states (extended abstract). STOC 2000: 697-704 - [c17]Sanjoy Dasgupta, Leonard J. Schulman:
A Two-Round Variant of EM for Gaussian Mixtures. UAI 2000: 152-159
1990 – 1999
- 1999
- [j13]William S. Evans, Leonard J. Schulman:
Signal propagation and noisy circuits. IEEE Trans. Inf. Theory 45(7): 2367-2373 (1999) - [j12]Leonard J. Schulman, David Zuckerman:
Asymptotically good codes correcting insertions, deletions, and transpositions. IEEE Trans. Inf. Theory 45(7): 2552-2557 (1999) - [c16]Leonard J. Schulman, Vijay V. Vazirani:
Majorizing Estimators and the Approximation of #P-Complete Problems. STOC 1999: 288-294 - [c15]Leonard J. Schulman, Umesh V. Vazirani:
Molecular Scale Heat Engines and Scalable Quantum Computation. STOC 1999: 322-329 - [i1]Leonard J. Schulman:
Clustering for Edge-Cost Minimization. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [j11]Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts:
Fairness in Scheduling. J. Algorithms 29(2): 306-357 (1998) - [j10]Leonard J. Schulman:
A Three-Party Communication Problem. J. Comput. Syst. Sci. 57(3): 399-401 (1998) - [c14]David E. Cardoze, Leonard J. Schulman:
Pattern Matching for Spatial Point Sets. FOCS 1998: 156-165 - [c13]Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson:
The Quantum Communication Complexity of Sampling. FOCS 1998: 342-351 - 1997
- [j9]Baruch Awerbuch, Leonard J. Schulman:
The maintenance of common data in a distributed system. J. ACM 44(1): 86-103 (1997) - [c12]Leonard J. Schulman, David Zuckerman:
Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version). SODA 1997: 669-674 - 1996
- [j8]Nabil Kahalé, Leonard J. Schulman:
Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph. Comb. 16(3): 383-397 (1996) - [j7]Leonard J. Schulman:
Coding for interactive communication. IEEE Trans. Inf. Theory 42(6): 1745-1756 (1996) - [c11]Sridhar Rajagopalan, Leonard J. Schulman:
Verifying Identities (extended abstract). FOCS 1996: 612-616 - 1995
- [c10]Moni Naor, Leonard J. Schulman, Aravind Srinivasan:
Splitters and Near-Optimal Derandomization. FOCS 1995: 182-191 - [c9]Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts:
Fairness in Scheduling. SODA 1995: 477-485 - 1994
- [j6]Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman:
Crossing Families. Comb. 14(2): 127-134 (1994) - [j5]Leonard J. Schulman:
A Product Theorem for Intersection Families. Eur. J. Comb. 15(6): 579-586 (1994) - [c8]Sridhar Rajagopalan, Leonard J. Schulman:
A coding theorem for distributed computation. STOC 1994: 790-799 - 1993
- [j4]Leonard J. Schulman:
An Equipartition of Planar Sets. Discret. Comput. Geom. 9: 257-266 (1993) - [j3]Daniel J. Kleitman, Leonard J. Schulman:
Minimally Distant Sets of Lattice Points. Eur. J. Comb. 14(3): 231-240 (1993) - [j2]Wayne Goddard, Claire Kenyon, Valerie King, Leonard J. Schulman:
Optimal Randomized Algorithms for Local Sorting and Set-Maxima. SIAM J. Comput. 22(2): 272-283 (1993) - [c7]William S. Evans, Leonard J. Schulman:
Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas. FOCS 1993: 594-603 - [c6]Leonard J. Schulman:
Deterministic coding for interactive communication. STOC 1993: 747-756 - 1992
- [c5]Leonard J. Schulman:
Communication on Noisy Channels: A Coding Theorem for Computation. FOCS 1992: 724-733 - [c4]Leonard J. Schulman:
Sample Spaces Uniform on Neighborhoods. STOC 1992: 17-25 - 1991
- [c3]Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman:
Crossing Families. SCG 1991: 351-356 - [c2]Baruch Awerbuch, Leonard J. Schulman:
The Maintenance of Common Data in a Distributed System. FOCS 1991: 505-514 - 1990
- [j1]Yishay Mansour, Leonard J. Schulman:
Sorting on a Ring of Processors. J. Algorithms 11(4): 622-630 (1990) - [c1]Wayne Goddard, Valerie King, Leonard J. Schulman:
Optimal Randomized Algorithms for Local Sorting and Set-Maxima. STOC 1990: 45-53
Coauthor Index
Spencer Gordon
aka: Spencer L. Gordon
aka: Spencer L. Gordon
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
