The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Leonard J. Schulman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  61. Volume in General Metric Spaces. [Citation Graph (, )][DBLP]


  62. Quantum Algorithms for Hidden Nonlinear Structures. [Citation Graph (, )][DBLP]


  63. Solvency Games. [Citation Graph (, )][DBLP]


  64. On a capacitated multivehicle routing problem. [Citation Graph (, )][DBLP]


  65. Approximation algorithms for labeling hierarchical taxonomies. [Citation Graph (, )][DBLP]


  66. Universal epsilon-approximators for Integrals. [Citation Graph (, )][DBLP]


  67. On partitioning graphs via single commodity flows. [Citation Graph (, )][DBLP]


  68. Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem. [Citation Graph (, )][DBLP]


  69. Contraction and Expansion of Convex Sets. [Citation Graph (, )][DBLP]


  70. Solvency Games. [Citation Graph (, )][DBLP]


Search in 0.042secs, Finished in 0.046secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002