| 2008 |
|---|
| 68 | EE | Noam Berger,
Nevin Kapur,
Leonard J. Schulman,
Vijay V. Vazirani:
Solvency Games.
FSTTCS 2008 |
| 67 | EE | Xiaojie Gao,
Leonard J. Schulman:
On a capacitated multivehicle routing problem.
PODC 2008: 175-184 |
| 66 | EE | Yuval Rabani,
Leonard J. Schulman,
Chaitanya Swamy:
Approximation algorithms for labeling hierarchical taxonomies.
SODA 2008: 671-680 |
| 65 | EE | Lorenzo Orecchia,
Leonard J. Schulman,
Umesh V. Vazirani,
Nisheeth K. Vishnoi:
On partitioning graphs via single commodity flows.
STOC 2008: 461-470 |
| 64 | EE | Jie Gao,
Michael Langberg,
Leonard J. Schulman:
Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem.
Discrete & Computational Geometry 40(4): 537-560 (2008) |
| 63 | EE | Noam Berger,
Nevin Kapur,
Leonard J. Schulman,
Vijay V. Vazirani:
Solvency Games.
Electronic Colloquium on Computational Complexity (ECCC) 15(089): (2008) |
| 62 | EE | Cristopher Moore,
Alexander Russell,
Leonard J. Schulman:
The Symmetric Group Defies Strong Fourier Sampling.
SIAM J. Comput. 37(6): 1842-1864 (2008) |
| 2007 |
|---|
| 61 | | Michael Langberg,
Leonard J. Schulman:
Contraction and Expansion of Convex Sets.
CCCG 2007: 25-28 |
| 60 | EE | Andrew M. Childs,
Leonard J. Schulman,
Umesh V. Vazirani:
Quantum Algorithms for Hidden Nonlinear Structures.
FOCS 2007: 395-404 |
| 59 | EE | Sanjoy Dasgupta,
Leonard J. Schulman:
A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians.
Journal of Machine Learning Research 8: 203-226 (2007) |
| 58 | EE | Leonard J. Schulman,
Tal Mor,
Yossi Weinstein:
Physical Limits of Heat-Bath Algorithmic Cooling.
SIAM J. Comput. 36(6): 1729-1747 (2007) |
| 57 | EE | 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) |
| 2006 |
|---|
| 56 | EE | Rafail Ostrovsky,
Yuval Rabani,
Leonard J. Schulman,
Chaitanya Swamy:
The Effectiveness of Lloyd-Type Methods for the k-Means Problem.
FOCS 2006: 165-176 |
| 55 | EE | Jie Gao,
Michael Langberg,
Leonard J. Schulman:
Analysis of incomplete data and an intrinsic-dimension Helly theorem.
SODA 2006: 464-473 |
| 54 | EE | Oded Goldreich,
Howard J. Karloff,
Leonard J. Schulman,
Luca Trevisan:
Lower bounds for linear locally decodable codes and private information retrieval.
Computational Complexity 15(3): 263-296 (2006) |
| 53 | EE | Andris Ambainis,
Leonard J. Schulman,
Umesh V. Vazirani:
Computing with highly mixed states.
J. ACM 53(3): 507-531 (2006) |
| 2005 |
|---|
| 52 | EE | Rafail Ostrovsky,
Yuval Rabani,
Leonard J. Schulman:
Error-Correcting Codes for Automatic Control.
FOCS 2005: 309-316 |
| 51 | EE | Cristopher Moore,
Alexander Russell,
Leonard J. Schulman:
The Symmetric Group Defies Strong Fourier Sampling.
FOCS 2005: 479-490 |
| 50 | EE | Xiaojie Gao,
Leonard J. Schulman:
Feedback control for router congestion resolution.
PODC 2005: 218-226 |
| 49 | EE | Cristopher Moore,
Alexander Russell,
Leonard J. Schulman:
The Symmetric Group Defies Strong Fourier Sampling: Part I
CoRR abs/quant-ph/0501056: (2005) |
| 48 | EE | Leonard J. Schulman,
Vijay V. Vazirani:
A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution.
Combinatorica 25(4): 465-486 (2005) |
| 2004 |
|---|
| 47 | EE | Xiaojie Gao,
Kamal Jain,
Leonard J. Schulman:
Fair and efficient router congestion control.
SODA 2004: 1050-1059 |
| 46 | EE | 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 |
| 45 | EE | Michelangelo Grigni,
Leonard J. Schulman,
Monica Vazirani,
Umesh V. Vazirani:
Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem.
Combinatorica 24(1): 137-154 (2004) |
| 44 | EE | Po-Shen Loh,
Leonard J. Schulman:
Improved Expansion of Random Cayley Graphs.
Discrete Mathematics & Theoretical Computer Science 6(2): 523-528 (2004) |
| 43 | EE | Michelle Effros,
Leonard J. Schulman:
Deterministic clustering with data nets
Electronic Colloquium on Computational Complexity (ECCC)(050): (2004) |
| 2003 |
|---|
| 42 | | William S. Evans,
Leonard J. Schulman:
On the maximum tolerable noise of k-input gates for reliable computation by formulas.
IEEE Transactions on Information Theory 49(11): 3094-3098 (2003) |
| 41 | EE | Miroslav Dudík,
Leonard J. Schulman:
Reconstruction from subsequences.
J. Comb. Theory, Ser. A 103(2): 337-348 (2003) |
| 40 | EE | 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) |
| 2002 |
|---|
| 39 | EE | Oded Goldreich,
Howard J. Karloff,
Leonard J. Schulman,
Luca Trevisan:
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval.
IEEE Conference on Computational Complexity 2002: 175-183 |
| 38 | EE | Leonard J. Schulman:
A random stacking process.
Discrete Mathematics 257(2-3): 541-547 (2002) |
| 2001 |
|---|
| 37 | EE | Michelangelo Grigni,
Leonard J. Schulman,
Monica Vazirani,
Umesh V. Vazirani:
Quantum mechanical algorithms for the nonabelian hidden subgroup problem.
STOC 2001: 68-74 |
| 36 | EE | Oded Goldreich,
Howard J. Karloff,
Leonard J. Schulman,
Luca Trevisan:
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
Electronic Colloquium on Computational Complexity (ECCC)(080): (2001) |
| 35 | EE | Shmuel Onn,
Leonard J. Schulman:
The Vector Partition Problem for Convex Objective Functions.
Math. Oper. Res. 26(3): 583-590 (2001) |
| 2000 |
|---|
| 34 | EE | Leonard J. Schulman:
Clustering for edge-cost minimization (extended abstract).
STOC 2000: 547-555 |
| 33 | EE | Andris Ambainis,
Leonard J. Schulman,
Umesh V. Vazirani:
Computing with highly mixed states (extended abstract).
STOC 2000: 697-704 |
| 32 | EE | Sanjoy Dasgupta,
Leonard J. Schulman:
A Two-Round Variant of EM for Gaussian Mixtures.
UAI 2000: 152-159 |
| 31 | | Sridhar Rajagopalan,
Leonard J. Schulman:
Verification of Identities.
SIAM J. Comput. 29(4): 1155-1163 (2000) |
| 1999 |
|---|
| 30 | EE | Leonard J. Schulman,
Vijay V. Vazirani:
Majorizing Estimators and the Approximation of #P-Complete Problems.
STOC 1999: 288-294 |
| 29 | EE | Leonard J. Schulman,
Umesh V. Vazirani:
Molecular Scale Heat Engines and Scalable Quantum Computation.
STOC 1999: 322-329 |
| 28 | EE | Leonard J. Schulman:
Clustering for Edge-Cost Minimization
Electronic Colloquium on Computational Complexity (ECCC) 6(35): (1999) |
| 27 | | William S. Evans,
Leonard J. Schulman:
Signal propagation and noisy circuits.
IEEE Transactions on Information Theory 45(7): 2367-2373 (1999) |
| 26 | | Leonard J. Schulman,
David Zuckerman:
Asymptotically good codes correcting insertions, deletions, and transpositions.
IEEE Transactions on Information Theory 45(7): 2552-2557 (1999) |
| 1998 |
|---|
| 25 | EE | David E. Cardoze,
Leonard J. Schulman:
Pattern Matching for Spatial Point Sets.
FOCS 1998: 156-165 |
| 24 | EE | Andris Ambainis,
Leonard J. Schulman,
Amnon Ta-Shma,
Umesh V. Vazirani,
Avi Wigderson:
The Quantum Communication Complexity of Sampling.
FOCS 1998: 342-351 |
| 23 | | Miklós Ajtai,
James Aspnes,
Moni Naor,
Yuval Rabani,
Leonard J. Schulman,
Orli Waarts:
Fairness in Scheduling
J. Algorithms 29(2): 306-357 (1998) |
| 22 | | Leonard J. Schulman:
A Three-Party Communication Problem.
J. Comput. Syst. Sci. 57(3): 399-401 (1998) |
| 1997 |
|---|
| 21 | | Leonard J. Schulman,
David Zuckerman:
Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version).
SODA 1997: 669-674 |
| 20 | EE | Baruch Awerbuch,
Leonard J. Schulman:
The maintenance of common data in a distributed system.
J. ACM 44(1): 86-103 (1997) |
| 1996 |
|---|
| 19 | | Sridhar Rajagopalan,
Leonard J. Schulman:
Verifying Identities (extended abstract).
FOCS 1996: 612-616 |
| 18 | | Nabil Kahale,
Leonard J. Schulman:
Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph.
Combinatorica 16(3): 383-397 (1996) |
| 17 | | Leonard J. Schulman:
Coding for interactive communication.
IEEE Transactions on Information Theory 42(6): 1745-1756 (1996) |
| 1995 |
|---|
| 16 | | Moni Naor,
Leonard J. Schulman,
Aravind Srinivasan:
Splitters and Near-Optimal Derandomization.
FOCS 1995: 182-191 |
| 15 | | Miklós Ajtai,
James Aspnes,
Moni Naor,
Yuval Rabani,
Leonard J. Schulman,
Orli Waarts:
Fairness in Scheduling.
SODA 1995: 477-485 |
| 1994 |
|---|
| 14 | EE | Sridhar Rajagopalan,
Leonard J. Schulman:
A coding theorem for distributed computation.
STOC 1994: 790-799 |
| 13 | | Boris Aronov,
Paul Erdös,
Wayne Goddard,
Daniel J. Kleitman,
Michael Klugerman,
János Pach,
Leonard J. Schulman:
Crossing Families.
Combinatorica 14(2): 127-134 (1994) |
| 12 | EE | Leonard J. Schulman:
A Product Theorem for Intersection Families.
Eur. J. Comb. 15(6): 579-586 (1994) |
| 1993 |
|---|
| 11 | | William S. Evans,
Leonard J. Schulman:
Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas
FOCS 1993: 594-603 |
| 10 | EE | Leonard J. Schulman:
Deterministic coding for interactive communication.
STOC 1993: 747-756 |
| 9 | | Leonard J. Schulman:
An Equipartition of Planar Sets.
Discrete & Computational Geometry 9: 257-266 (1993) |
| 8 | EE | Daniel J. Kleitman,
Leonard J. Schulman:
Minimally Distant Sets of Lattice Points.
Eur. J. Comb. 14(3): 231-240 (1993) |
| 7 | | 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) |
| 1992 |
|---|
| 6 | | Leonard J. Schulman:
Communication on Noisy Channels: A Coding Theorem for Computation
FOCS 1992: 724-733 |
| 5 | | Leonard J. Schulman:
Sample Spaces Uniform on Neighborhoods
STOC 1992: 17-25 |
| 1991 |
|---|
| 4 | | Baruch Awerbuch,
Leonard J. Schulman:
The Maintenance of Common Data in a Distributed System
FOCS 1991: 505-514 |
| 3 | EE | Boris Aronov,
Paul Erdös,
Wayne Goddard,
Daniel J. Kleitman,
Michael Klugerman,
János Pach,
Leonard J. Schulman:
Crossing Families.
Symposium on Computational Geometry 1991: 351-356 |
| 1990 |
|---|
| 2 | | Wayne Goddard,
Valerie King,
Leonard J. Schulman:
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
STOC 1990: 45-53 |
| 1 | | Yishay Mansour,
Leonard J. Schulman:
Sorting on a Ring of Processors.
J. Algorithms 11(4): 622-630 (1990) |
