Schulman, Leonard J.

Article from CaltechAUTHORS

• 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
• 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
• 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
• 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
• 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
• Franklin, Matthew and Gelles, Ran, et el. (2013) Optimal Coding for Streaming Authentication and Interactive Communication; Electronic Colloquium on Computational Complexity; report 104
• 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. (2011) The quantifier semigroup for bipartite graphs; Electronic Journal of Combinatorics; Vol. 18; No. 1; Art. No. P123; 10.37236/610
• 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. (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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Schulman, Leonard J. (1996) Coding for interactive communication; IEEE Transactions on Information Theory; Vol. 42; No. 6; 1745-1756; 10.1109/18.556671