<h1>Schulman, Leonard</h1>
<h2>Article from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Dvijotham, Krishnamurthy and Rabani, Yuval, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201217-133744650">Convergence of incentive-driven dynamics in Fisher markets</a>; Games and Economic Behavior; Vol. 134; 361-375; <a href="https://doi.org/10.1016/j.geb.2020.11.005">10.1016/j.geb.2020.11.005</a></li>
<li>Gordon, Spencer L. and Schulman, Leonard J. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220210-721777000">Hadamard Extensions and the Identification of Mixtures of Product Distributions</a>; IEEE Transactions on Information Theory; Vol. 68; No. 6; 4085-4089; <a href="https://doi.org/10.1109/tit.2022.3146630">10.1109/tit.2022.3146630</a></li>
<li>Grandoni, Fabrizio and Ostrovsky, Rafail, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220204-680165000">A refined approximation for Euclidean k-means</a>; Information Processing Letters; Vol. 176; Art. No. 106251; <a href="https://doi.org/10.1016/j.ipl.2022.106251">10.1016/j.ipl.2022.106251</a></li>
<li>Rabani, Yuval and Schulman, Leonard J. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210128-142707495">The invisible hand of Laplace: The role of market structure in price convergence and oscillation</a>; Journal of Mathematical Economics; Vol. 95; Art. No. 102475; <a href="https://doi.org/10.1016/j.jmateco.2021.102475">10.1016/j.jmateco.2021.102475</a></li>
<li>Bhaskar, Umang and Ligett, Katrina, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180622-082816994">Achieving target equilibria in network routing games without knowing the latency functions</a>; Games and Economic Behavior; Vol. 118; 533-569; <a href="https://doi.org/10.1016/j.geb.2018.02.009">10.1016/j.geb.2018.02.009</a></li>
<li>Schulman, Leonard J. and Srivastava, Piyush (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191010-093119072">Online Codes for Analog Signals</a>; IEEE Transactions on Information Theory; Vol. 65; No. 10; 6633-6649; <a href="https://doi.org/10.1109/TIT.2019.2919632">10.1109/TIT.2019.2919632</a></li>
<li>Schulman, Leonard J. and Vazirani, Umesh V. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190328-112416478">The duality gap for two-team zero-sum games</a>; Games and Economic Behavior; Vol. 115; 336-345; <a href="https://doi.org/10.1016/j.geb.2019.03.011">10.1016/j.geb.2019.03.011</a></li>
<li>Kalai, Gil and Schulman, Leonard J. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190103-132542769">Quasi-random multilinear polynomials</a>; Israel Journal of Mathematics; Vol. 230; No. 1; 195-211; <a href="https://doi.org/10.1007/s11856-018-1821-y">10.1007/s11856-018-1821-y</a></li>
<li>Schulman, Leonard J. and Sinclair, Alistair (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170614-151934720">Analysis of a Classical Matrix Preconditioning Algorithm</a>; Journal of the ACM; Vol. 64; No. 2; Art. No. 9; <a href="https://doi.org/10.1145/2988227">10.1145/2988227</a></li>
<li>Abraham, Ittai and Bartal, Yair, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20141015-160530977">Volume in General Metric Spaces</a>; Discrete and Computational Geometry; Vol. 52; No. 2; 366-389; <a href="https://doi.org/10.1007/s00454-014-9615-4">10.1007/s00454-014-9615-4</a></li>
<li>Harrow, Aram W. and Kolla, Alexandra, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130122-104220997">Dimension-free L_2 maximal inequality for spherical means in the hypercube</a>; Theory of Computing; Vol. 10; No. 3; 55-75; <a href="https://doi.org/10.4086/toc.2014.v010a003">10.4086/toc.2014.v010a003</a></li>
<li>Franklin, Matthew and Gelles, Ran, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150202-090030427">Optimal Coding for Streaming Authentication and Interactive Communication</a>; IEEE Transactions on Information Theory; Vol. 61; No. 1; 133-145; <a href="https://doi.org/10.1109/TIT.2014.2367094">10.1109/TIT.2014.2367094</a></li>
<li>Franklin, Matthew and Gelles, Ran, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170427-170911967">Optimal Coding for Streaming Authentication and Interactive Communication</a>; Electronic Colloquium on Computational Complexity; report 104</li>
<li>Ostrovsky, Rafail and Rabani, Yuval, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130125-143155195">The Effectiveness of Lloyd-Type Methods for the k-Means Problem</a>; 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; <a href="https://doi.org/10.1145/2395116.2395117">10.1145/2395116.2395117</a></li>
<li>Schulman, Leonard J. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110620-085724958">The quantifier semigroup for bipartite graphs</a>; Electronic Journal of Combinatorics; Vol. 18; No. 1; Art. No. P123; <a href="https://doi.org/10.37236/610">10.37236/610</a></li>
<li>Gao, Jie and Langberg, Michael, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110421-134437164">Clustering Lines in High-Dimensional Space: Classification
of Incomplete Data</a>; ACM Transactions on Algorithms; Vol. 7; No. 1; Art. No. 8; <a href="https://doi.org/10.1145/1868237.1868246">10.1145/1868237.1868246</a></li>
<li>Schulman, Leonard J. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100628-100808011">Variation on a theorem by Carathéodory</a>; Mathematika; Vol. 56; No. 1; 169-172; <a href="https://doi.org/10.1112/S0025579309000515">10.1112/S0025579309000515</a></li>
<li>Langberg, Michael and Schulman, Leonard J. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20091130-102029397">Contraction and Expansion of Convex Sets</a>; Discrete and Computational Geometry; Vol. 42; No. 4; 594-614; <a href="https://doi.org/10.1007/s00454-009-9214-y">10.1007/s00454-009-9214-y</a></li>
<li>Schulman, Leonard J. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20090824-094016673">Muirhead-Rado inequality for compact groups</a>; Positivity; Vol. 13; No. 3; 559-574; <a href="https://doi.org/10.1007/s11117-008-2172-4">10.1007/s11117-008-2172-4</a></li>
<li>Ostrovsky, Rafail and Rabani, Yuval, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20090831-141451771">Error-Correcting Codes for Automatic Control</a>; IEEE Transactions on Information Theory; Vol. 55; No. 7; 2931-2941; <a href="https://doi.org/10.1109/TIT.2009.2021303">10.1109/TIT.2009.2021303</a></li>
<li>Bartal, Yair and Schulman, Leonard J. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20090730-142657667">Universal immersion spaces for edge-colored graphs and nearest-neighbor metrics</a>; SIAM Journal on Discrete Mathematics; Vol. 23; No. 2; 1110-1115; <a href="https://doi.org/10.1137/08071555X">10.1137/08071555X</a></li>
<li>Gao, Jie and Langberg, Michael, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GAOdcg08">Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem</a>; Discrete and Computational Geometry; Vol. 40; No. 4; 537-560; <a href="https://doi.org/10.1007/s00454-008-9107-5">10.1007/s00454-008-9107-5</a></li>
<li>Moore, Christopher and Russell, Alexander, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:MOOsiamjc08">The Symmetric Group Defies Strong Fourier Sampling</a>; SIAM Journal on Computing; Vol. 37; No. 6; 1842-1864; <a href="https://doi.org/10.1137/050644896">10.1137/050644896</a></li>
<li>Moore, Cristopher and Rockmore, Daniel, el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:MOOsiamjc07">The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts</a>; SIAM Journal on Computing; Vol. 37; No. 3; 938-958; <a href="https://doi.org/10.1137/S0097539705447177">10.1137/S0097539705447177</a></li>
<li>Schulman, Leonard J. and Mor, Tal, el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:SCHUsiamjc07">Physical Limits of Heat-Bath Algorithmic Cooling</a>; SIAM Journal on Computing; Vol. 36; No. 6; 1729-1747; <a href="https://doi.org/10.1137/050666023">10.1137/050666023</a></li>
<li>Dasgupta, Sanjoy and Schulman, Leonard J. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:DASjmlr07">A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians</a>; Journal of Machine Learning Research; Vol. 8; 203-226</li>
<li>Goldreich, Oded and Karloff, Howard, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200225-113212660">Lower bounds for linear locally decodable codes and private information retrieval</a>; Computational Complexity; Vol. 15; No. 3; 263-296; <a href="https://doi.org/10.1007/s00037-006-0216-3">10.1007/s00037-006-0216-3</a></li>
<li>Gaveau, Bernard and Schulman, Lawrence S., el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20090917-133724756">Imaging geometry through dynamics: the observable representation</a>; Journal of Physics A: Mathematical and General; Vol. 39; No. 33; 10307-10321; <a href="https://doi.org/10.1088/0305-4470/39/33/004">10.1088/0305-4470/39/33/004</a></li>
<li>Ambainis, Andris and Schulman, Leonard J., el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160419-113716190">Computing with Highly Mixed States</a>; Journal of the ACM; Vol. 53; No. 3; 507-531; <a href="https://doi.org/10.1145/1147954.1147962">10.1145/1147954.1147962</a></li>
<li>Schulman, Lawrence S. and Schulman, Leonard J. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:SCHUjpa06">Convergence of matrices under random conjugation: wave packet scattering without kinematic entanglement</a>; Journal of Physics A: Mathematical and General; Vol. 39; No. 7; 1717-1728; <a href="https://doi.org/10.1088/0305-4470/39/7/015">10.1088/0305-4470/39/7/015</a></li>
<li>Schulman, Leonard J. and Vazirani, Vijay V. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190820-150854373">A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution</a>; Combinatorica; Vol. 25; No. 4; 465-486; <a href="https://doi.org/10.1007/s00493-005-0028-4">10.1007/s00493-005-0028-4</a></li>
<li>Schulman, Leonard J. and Mor, Tal, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:SCHUprl05">Physical Limits of Heat-Bath Algorithmic Cooling</a>; Physical Review Letters; Vol. 94; No. 12; Art. No. 120501; <a href="https://doi.org/10.1103/PhysRevLett.94.120501">10.1103/PhysRevLett.94.120501</a></li>
<li>Schulman, Lawrence S. and Schulman, Leonard J. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:SCHUieeetnano05">Wave-packet scattering without kinematic entanglement: convergence of expectation values</a>; IEEE Transactions on Nanotechnology; Vol. 4; No. 1; 8-13; <a href="https://doi.org/10.1109/TNANO.2004.840141">10.1109/TNANO.2004.840141</a></li>
<li>Franceschetti, Massimo and Bruck, Jehoshua, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FRAieeetap04">A random walk model of wave propagation</a>; IEEE Transactions on Antennas and Propagation; Vol. 52; No. 5; 1304-1317; <a href="https://doi.org/10.1109/TAP.2004.827540">10.1109/TAP.2004.827540</a></li>
<li>Grigni, Michelangelo and Schulman, Leonard J., el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190829-131534342">Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem</a>; Combinatorica; Vol. 24; No. 1; 137-154; <a href="https://doi.org/10.1007/s00493-004-0009-8">10.1007/s00493-004-0009-8</a></li>
<li>Loh, Po-Shen and Schulman, Leonard J. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200518-134456297">Improved Expansion of Random Cayley Graphs</a>; Discrete Mathematics and Theoretical Computer Science; Vol. 6; No. 2; 523-528</li>
<li>Evans, William S. and Schulman, Leonard J. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EVAieeetit03">On the maximum tolerable noise of k-input gates for reliable computation by formulas</a>; IEEE Transactions on Information Theory; Vol. 49; No. 11; 3094-3098; <a href="https://doi.org/10.1109/TIT.2003.818405">10.1109/TIT.2003.818405</a></li>
<li>Ambainis, Andris and Schulman, Leonard J., el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:AMBsiamjc03">The quantum communication complexity of sampling</a>; SIAM Journal on Computing; Vol. 32; No. 6; 1570-1585; <a href="https://doi.org/10.1137/S009753979935476">10.1137/S009753979935476</a></li>
<li>Schulman, Leonard J. (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170409-075810379">A random stacking process</a>; Discrete Mathematics; Vol. 257; No. 2-3; 541-547; <a href="https://doi.org/10.1016/S0012-365X(02)00512-5">10.1016/S0012-365X(02)00512-5</a></li>
<li>Schulman, Leonard J. and Zuckerman, David (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:SCHUieeetit99">Asymptotically good codes correcting insertions, deletions, and transpositions</a>; IEEE Transactions on Information Theory; Vol. 45; No. 7; 2552-2557; <a href="https://doi.org/10.1109/18.796406">10.1109/18.796406</a></li>
<li>Evans, William S. and Schulman, Leonard J. (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EVAieeetit99">Signal propagation and noisy circuits</a>; IEEE Transactions on Information Theory; Vol. 45; No. 7; 2367-2373; <a href="https://doi.org/10.1109/18.796377">10.1109/18.796377</a></li>
<li>Schulman, Leonard J. (1996) <a href="https://resolver.caltech.edu/CaltechAUTHORS:SCHUieeetit96">Coding for interactive communication</a>; IEEE Transactions on Information Theory; Vol. 42; No. 6; 1745-1756; <a href="https://doi.org/10.1109/18.556671">10.1109/18.556671</a></li>
</ul>