Schulman, Leonard
Dvijotham, Krishnamurthy and Rabani, Yuval, et el. (2022) Convergence of incentive-driven dynamics in Fisher markets ; Games and Economic Behavior; Vol. 134; 361-375; 10.1016/j.geb.2020.11.005
Gordon, Spencer L. and Schulman, Leonard J. (2022) Hadamard Extensions and the Identification of Mixtures of Product Distributions ; IEEE Transactions on Information Theory; Vol. 68; No. 6; 4085-4089; 10.1109/tit.2022.3146630
Grandoni, Fabrizio and Ostrovsky, Rafail, et el. (2022) A refined approximation for Euclidean k-means ; Information Processing Letters; Vol. 176; Art. No. 106251; 10.1016/j.ipl.2022.106251
Rabani, Yuval and Schulman, Leonard J. (2021) The invisible hand of Laplace: The role of market structure in price convergence and oscillation ; Journal of Mathematical Economics; Vol. 95; Art. No. 102475; 10.1016/j.jmateco.2021.102475
Mehta, Jenish C. and Schulman, Leonard J. (2020) Edge Expansion and Spectral Gap of Nonnegative Matrices ; ISBN 978-1-61197-599-4; Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms; 1200-1213; 10.1137/1.9781611975994.73
Bhaskar, Umang and Ligett, Katrina, et el. (2019) Achieving target equilibria in network routing games without knowing the latency functions ; Games and Economic Behavior; Vol. 118; 533-569; 10.1016/j.geb.2018.02.009
Schulman, Leonard J. and Srivastava, Piyush (2019) Online Codes for Analog Signals ; IEEE Transactions on Information Theory; Vol. 65; No. 10; 6633-6649; 10.1109/TIT.2019.2919632
Schulman, Leonard J. and Vazirani, Umesh V. (2019) The duality gap for two-team zero-sum games ; Games and Economic Behavior; Vol. 115; 336-345; 10.1016/j.geb.2019.03.011
Kalai, Gil and Schulman, Leonard J. (2019) Quasi-random multilinear polynomials ; Israel Journal of Mathematics; Vol. 230; No. 1; 195-211; 10.1007/s11856-018-1821-y
Cohen, Gil and Haeupler, Bernhard, et el. (2018) Explicit binary tree codes with polylogarithmic size alphabet ; ISBN 978-1-4503-5559-9; Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing; 535-544; 10.1145/3188745.3188928
Kempe, David and Schulman, Leonard J., et el. (2018) Quasi-regular sequences and optimal schedules for security games ; ISBN 978-1-6119-7503-1; Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms; 1625-1644; 10.1137/1.9781611975031.106
Schulman, Leonard J. and Sinclair, Alistair (2017) Analysis of a Classical Matrix Preconditioning Algorithm ; Journal of the ACM; Vol. 64; No. 2; Art. No. 9; 10.1145/2988227
Dvijotham, Krishnamurthy and Rabani, Yuval, et el. (2017) Convergence of Incentive-Driven Dynamics in Fisher Markets ; ISBN 978-1-61197-478-2; Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms; 554-567; 10.1137/1.9781611974782.35
Schulman, Leonard J. and Vazirani, Umesh V. (2017) The duality gap for two-team zero-sum games ; ISBN 978-3-95977-029-3; 8th Innovations in Theoretical Computer Science Conference; Art. No. 56; 10.4230/LIPIcs.ITCS.2017.56
Cohen, Gil and Schulman, Leonard J. (2016) Extractors for Near Logarithmic Min-Entropy ; ISBN 978-1-5090-3933-3; IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS); 178-187; 10.1109/FOCS.2016.27
Schulman, Leonard J. and Srivastava, Piyush (2016) Stability of Causal Inference
Hoza, William M. and Schulman, Leonard J. (2016) The adversarial noise threshold for distributed protocols ; ISBN 978-1-611974-33-1; Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms; 240-258; 10.48550/arXiv.1412.8097
Schulman, Leonard J. and Sinclair, Alistair, et el. (2015) Symbolic Integration and the Complexity of Computing Averages ; ISBN 978-1-4673-8191-8; IEEE 56th Annual Symposium on Foundations of Computer Science; 1231-1245; 10.1109/FOCS.2015.79
Schulman, Leonard J. and Sinclair, Alistair (2015) Analysis of a Classical Matrix Preconditioning Algorithm ; ISBN 978-1-4503-3536-2; Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing; 831-840; 10.1145/2746539.2746556
Li, Jian and Rabani, Yuval, et el. (2015) Learning Arbitrary Statistical Mixtures of Discrete Distributions ; ISBN 978-1-4503-3536-2; Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing; 743-752; 10.1145/2746539.2746584
Bhaskar, Umang and Ligett, Katrina, et el. (2014) Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions ; ISBN 978-1-4799-6517-5; IEEE 55th Annual Symposium on Foundations of Computer Science; 31-40; 10.1109/FOCS.2014.12
Abraham, Ittai and Bartal, Yair, et el. (2014) Volume in General Metric Spaces ; Discrete and Computational Geometry; Vol. 52; No. 2; 366-389; 10.1007/s00454-014-9615-4
Harrow, Aram W. and Kolla, Alexandra, et el. (2014) Dimension-free L_2 maximal inequality for spherical means in the hypercube ; Theory of Computing; Vol. 10; No. 3; 55-75; 10.4086/toc.2014.v010a003
Rabani, Yuval and Schulman, Leonard J., et el. (2014) Learning mixtures of arbitrary distributions over large discrete domains ; ISBN 978-1-4503-2698-8; ITCS '14 Proceedings of the 5th conference on Innovations in theoretical computer science; 207-224; 10.1145/2554797.2554818
Moore, Cristopher and Schulman, Leonard J. (2014) Tree Codes and a Conjecture on Exponential Sums ; ISBN 978-1-4503-2698-8; Proceedings of the 5th conference on Innovations in theoretical computer science; 145-154; 10.1145/2554797.2554813
Franklin, Matthew and Gelles, Ran, et el. (2014) Optimal Coding for Streaming Authentication and Interactive Communication ; IEEE Transactions on Information Theory; Vol. 61; No. 1; 133-145; 10.1109/TIT.2014.2367094
Bhaskar, Umang and Ligett, Katrina, et el. (2014) Network Improvement for Equilibrium Routing ; ISBN 978-3-319-07556-3; Integer Programming and Combinatorial Optimization; 138-149
Franklin, Matthew and Gelles, Ran, et el. (2013) Optimal Coding for Streaming Authentication and Interactive Communication ; ISBN 978-3-642-40083-4; Advances in Cryptology – CRYPTO 2013; 258-276; 10.1007/978-3-642-40084-1_15
Franklin, Matthew and Gelles, Ran, et el. (2013) Optimal Coding for Streaming Authentication and Interactive Communication ; Electronic Colloquium on Computational Complexity; report 104
Schulman, Leonard J. (2013) An MQ/Code Cyptosystem Proposal
Lee, Euiwoong and Schulman, Leonard J. (2013) Clustering affine subspaces: hardness and algorithms ; ISBN 978-1-61197-251-1; Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms; 810-827; 10.1137/1.9781611973105.58
Ostrovsky, Rafail and Rabani, Yuval, et el. (2012) The Effectiveness of Lloyd-Type Methods for the k-Means Problem ; ISBN 0-7695-2720-5; 47th Annual IEEE Symposium on Foundations of Computer Science, Proceedings; Journal of the ACM; Vol. 59; No. 6; Art. No. 28; 10.1145/2395116.2395117
Schulman, Leonard J. (2012) Cryptography from tensor problems
Feldman, Dan and Schulman, Leonard J. (2012) Data reduction for weighted and outlier-resistant clustering ; ISBN 9781611972108; Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms; 1343-1354
Schulman, Leonard J. (2011) The quantifier semigroup for bipartite graphs ; Electronic Journal of Combinatorics; Vol. 18; No. 1; Art. No. P123; 10.37236/610
Bartal, Yair and Recht, Ben, et el. (2011) Dimensionality reduction: beyond the Johnson-Lindenstrauss bound ; ISBN 978-0-898719-93-2; Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms; 868-887
Gao, Jie and Langberg, Michael, et el. (2010) Clustering Lines in High-Dimensional Space: Classification
of Incomplete Data ; ACM Transactions on Algorithms; Vol. 7; No. 1; Art. No. 8; 10.1145/1868237.1868246
Schulman, Leonard J. (2010) Variation on a theorem by Carathéodory ; Mathematika; Vol. 56; No. 1; 169-172; 10.1112/S0025579309000515
Langberg, Michael and Schulman, Leonard J. (2010) Universal ε-approximators for integrals ; ISBN 978-0-89871-701-3; Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms; 10.1137/1.9781611973075.50
Langberg, Michael and Schulman, Leonard J. (2009) Contraction and Expansion of Convex Sets ; Discrete and Computational Geometry; Vol. 42; No. 4; 594-614; 10.1007/s00454-009-9214-y
Schulman, Leonard J. (2009) Muirhead-Rado inequality for compact groups ; Positivity; Vol. 13; No. 3; 559-574; 10.1007/s11117-008-2172-4
Ostrovsky, Rafail and Rabani, Yuval, et el. (2009) Error-Correcting Codes for Automatic Control ; IEEE Transactions on Information Theory; Vol. 55; No. 7; 2931-2941; 10.1109/TIT.2009.2021303
Bartal, Yair and Schulman, Leonard J. (2009) Universal immersion spaces for edge-colored graphs and nearest-neighbor metrics ; SIAM Journal on Discrete Mathematics; Vol. 23; No. 2; 1110-1115; 10.1137/08071555X
Gao, Jie and Langberg, Michael, et el. (2008) Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem ; Discrete and Computational Geometry; Vol. 40; No. 4; 537-560; 10.1007/s00454-008-9107-5
Gao, Xiaojie and Schulman, Leonard J. (2008) On a capacitated multivehicle routing problem ; ISBN 978-1-59593-989-0; PODC '08 Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing; 175-184; 10.1145/1400751.1400776
Orecchia, Lorenzo and Schulman, Leonard J., et el. (2008) On partitioning graphs via single commodity flows ; ISBN 978-1-60558-047-0; STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing; 461-470; 10.1145/1374376.1374442
Moore, Christopher and Russell, Alexander, et el. (2008) The Symmetric Group Defies Strong Fourier Sampling ; SIAM Journal on Computing; Vol. 37; No. 6; 1842-1864; 10.1137/050644896
Rabani, Yuval and Schulman, Leonard J., et el. (2008) Approximation algorithms for labeling hierarchical taxonomies
Moore, Cristopher and Rockmore, Daniel, et el. (2007) The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts ; SIAM Journal on Computing; Vol. 37; No. 3; 938-958; 10.1137/S0097539705447177
Schulman, Leonard J. and Mor, Tal, et el. (2007) Physical Limits of Heat-Bath Algorithmic Cooling ; SIAM Journal on Computing; Vol. 36; No. 6; 1729-1747; 10.1137/050666023
Dasgupta, Sanjoy and Schulman, Leonard J. (2007) A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians ; Journal of Machine Learning Research; Vol. 8; 203-226
Goldreich, Oded and Karloff, Howard, et el. (2006) Lower bounds for linear locally decodable codes and private information retrieval ; Computational Complexity; Vol. 15; No. 3; 263-296; 10.1007/s00037-006-0216-3
Ostrovsky, Rafail and Rabani, Yuval, et el. (2006) The Effectiveness of Lloyd-Type Methods for the k-Means Problem ; ISBN 0-7695-2720-5; 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06); 165-176; 10.1109/FOCS.2006.75
Gaveau, Bernard and Schulman, Lawrence S., et el. (2006) Imaging geometry through dynamics: the observable representation ; Journal of Physics A: Mathematical and General; Vol. 39; No. 33; 10307-10321; 10.1088/0305-4470/39/33/004
Ambainis, Andris and Schulman, Leonard J., et el. (2006) Computing with Highly Mixed States ; Journal of the ACM; Vol. 53; No. 3; 507-531; 10.1145/1147954.1147962
Schulman, Lawrence S. and Schulman, Leonard J. (2006) Convergence of matrices under random conjugation: wave packet scattering without kinematic entanglement ; Journal of Physics A: Mathematical and General; Vol. 39; No. 7; 1717-1728; 10.1088/0305-4470/39/7/015
Gao, Jie and Langberg, Michael, et el. (2006) Analysis of incomplete data and an intrinsic-dimension Helly theorem ; ISBN 0-89871-605-5; SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm; 464-473
Ko, Chih-Kai and Gao, Xiaojie, et el. (2005) On Scalar LQG Control with Communication Cost ; ISBN 0-7803-9567-0; 2005 44th IEEE Conference on Decision and Control & European Control Conference; 2805-2810; 10.1109/CDC.2005.1582588
Moore, Cristopher and Russell, Alexander, et el. (2005) The symmetric group defies strong Fourier sampling ; ISBN 0-7695-2468-0; 46th Annual IEEE Symposium on Foundations of Computer Science; 479-488; 10.1109/SFCS.2005.73
Ostrovsky, Rafail and Rabani, Yuval, et el. (2005) Error-correcting codes for automatic control ; ISBN 0-7695-2468-0; 46th Annual IEEE Symposium on Foundations of Computer Science; 309-316; 10.1109/SFCS.2005.33
Gao, Xiaojie and Schulman, Leonard J. (2005) Real-Time Coding for Multiple Access Channels ; ISBN 0-7803-9150-0; 2005 IEEE International Symposium on Information Theory; 67-71; 10.1109/ISIT.2005.1523294
Schulman, Leonard J. and Vazirani, Vijay V. (2005) A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution ; Combinatorica; Vol. 25; No. 4; 465-486; 10.1007/s00493-005-0028-4
Gao, Xiaojie and Schulman, Leonard J. (2005) Feedback control for router congestion resolution ; ISBN 1-58113-994-2; PODC '05 Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing; 218-226; 10.1145/1073814.1073855
Schulman, Leonard J. and Mor, Tal, et el. (2005) Physical Limits of Heat-Bath Algorithmic Cooling ; Physical Review Letters; Vol. 94; No. 12; Art. No. 120501; 10.1103/PhysRevLett.94.120501
Effros, Michelle and Schulman, Leonard J. (2005) Rapid near-optimal VQ design with a deterministic data net ; ISBN 0-7803-8280-3; IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June - 2 July 2004; 299; 10.1109/ISIT.2004.1365336
Schulman, Lawrence S. and Schulman, Leonard J. (2005) Wave-packet scattering without kinematic entanglement: convergence of expectation values ; IEEE Transactions on Nanotechnology; Vol. 4; No. 1; 8-13; 10.1109/TNANO.2004.840141
Franceschetti, Massimo and Bruck, Jehoshua, et el. (2004) A random walk model of wave propagation ; IEEE Transactions on Antennas and Propagation; Vol. 52; No. 5; 1304-1317; 10.1109/TAP.2004.827540
Moore, Cristopher and Rockmore, Daniel, et el. (2004) The power of basis selection in fourier sampling: hidden subgroup problems in affine groups ; ISBN 0-89871-558-X; SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms; 1113-1122
Grigni, Michelangelo and Schulman, Leonard J., et el. (2004) Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem ; Combinatorica; Vol. 24; No. 1; 137-154; 10.1007/s00493-004-0009-8
Gao, Xiaojie and Jain, Kamal, et el. (2004) Fair and efficient router congestion control ; ISBN 0-89871-558-X; SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms; 1050-1059
Loh, Po-Shen and Schulman, Leonard J. (2004) Improved Expansion of Random Cayley Graphs ; Discrete Mathematics and Theoretical Computer Science; Vol. 6; No. 2; 523-528
Evans, William S. and Schulman, Leonard J. (2003) On the maximum tolerable noise of k-input gates for reliable computation by formulas ; IEEE Transactions on Information Theory; Vol. 49; No. 11; 3094-3098; 10.1109/TIT.2003.818405
Ambainis, Andris and Schulman, Leonard J., et el. (2003) The quantum communication complexity of sampling ; SIAM Journal on Computing; Vol. 32; No. 6; 1570-1585; 10.1137/S009753979935476
Schulman, Leonard J. (2002) A random stacking process ; Discrete Mathematics; Vol. 257; No. 2-3; 541-547; 10.1016/S0012-365X(02)00512-5
Goldreich, Oded and Karloff, Howard, et el. (2002) Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval ; ISBN 0-7695-1468-5; 17th IEEE Annual Conference on Computational Complexity; 143-151; 10.1109/CCC.2002.1004353
Franceschetti, Massimo and Bruck, Jehoshua, et el. (2002) Microcellular Systems, Random Walks, and Wave Propagation
Grigni, Michaelangelo and Schulman, Leonard J., et el. (2001) Quantum mechanical algorithms for the nonabelian hidden subgroup problem ; ISBN 1-58113-349-9; STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing; 68-74; 10.1145/380752.380769
Schulman, Leonard J. and Zuckerman, David (1999) Asymptotically good codes correcting insertions, deletions, and transpositions ; IEEE Transactions on Information Theory; Vol. 45; No. 7; 2552-2557; 10.1109/18.796406
Evans, William S. and Schulman, Leonard J. (1999) Signal propagation and noisy circuits ; IEEE Transactions on Information Theory; Vol. 45; No. 7; 2367-2373; 10.1109/18.796377
Ambainis, Andris and Schulman, Leonard J., et el. (1998) The quantum communication complexity of sampling ; ISBN 0-8186-9172-7; 39th Annual Symposium on Foundations of Computer Science; 342-351; 10.1109/SFCS.1998.743480
Cardoze, David E. and Schulman, Leonard J. (1998) Pattern Matching for Spatial Point Sets ; ISBN 0-8186-9172-7; 39th Annual Symposium on Foundations of Computer Science: Proceedings; 156-165; 10.1109/SFCS.1998.743439
Schulman, Leonard J. (1996) Coding for interactive communication ; IEEE Transactions on Information Theory; Vol. 42; No. 6; 1745-1756; 10.1109/18.556671
Rajagopalan, Sridhar and Schulman, Leonard J. (1996) Verifying Identities ; ISBN 0-8186-7594-2; Proceedings: 37th Annual Symposium on Foundations of Computer Science; 612-616; 10.1109/SFCS.1996.548520
Naor, Moni and Schulman, Leonard J., et el. (1995) Splitters and near-optimal derandomization ; ISBN 0-8186-7183-1; 36th Annual Symposium on Foundations of Computer Science; 182-191; 10.1109/SFCS.1995.492475
Rajagopalan, Sridhar and Schulman, Leonard J. (1995) Coding for Distributed Computation ; ISBN 0-7803-2453-6; 1995 IEEE International Symposium on Information Theory, Proceedings; 453-453; 10.1109/ISIT.1995.550440
Evans, William S. and Schulman, Leonard J. (1995) Information Theory and Noisy Computation ; ISBN 0-7803-2453-6; Proceedings: 1995 IEEE International Symposium on Information Theory; 456; 10.1109/ISIT.1995.550443
Schulman, Leonard J. (1995) Coding for interactive communication ; ISBN 0-7803-2453-6; 1995 IEEE International Symposium on Information Theory; 452-452; 10.1109/ISIT.1995.550439
Schulman, Leonard J. (1994) Coding for distributed computation ; ISBN 0-7803-2761-6; Proceedings 1994 IEEE-IMS Workshop on Information Theory and Statistics; 28-28; 10.1109/WITS.1994.513866
Evans, Williams and Schulman, Leonard J. (1993) Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas ; ISBN 0-8186-4370-6; 34th Annual Symposium on Foundations of Computer Science Proceedings; 594-603; 10.1109/SFCS.1993.366827
Schulman, Leonard J. (1992) Communication on noisy channels: a coding theorem for computation ; ISBN 0-8186-2900-2; 33rd Annual Symposium on Foundations of Computer Science; 724-733; 10.1109/SFCS.1992.267778
Awerbuch, Baruch and Schulman, Leonard J. (1991) The maintenance of common data in a distributed system ; ISBN 0-8186-2445-0; Foundations of Computer Science, 32nd Annual Symposium. 1-4 Oct. 1991; 505-514; 10.1109/SFCS.1991.185413
