<h1>Schulman, Leonard</h1> <h2>Book Chapter from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2> <ul> <li>Mehta, Jenish C. and Schulman, Leonard J. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200828-114509192">Edge Expansion and Spectral Gap of Nonnegative Matrices</a>; ISBN 978-1-61197-599-4; Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms; 1200-1213; <a href="https://doi.org/10.1137/1.9781611975994.73">10.1137/1.9781611975994.73</a></li> <li>Cohen, Gil and Haeupler, Bernhard, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180823-141633075">Explicit binary tree codes with polylogarithmic size alphabet</a>; ISBN 978-1-4503-5559-9; Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing; 535-544; <a href="https://doi.org/10.1145/3188745.3188928">10.1145/3188745.3188928</a></li> <li>Kempe, David and Schulman, Leonard J., el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180410-145958889">Quasi-regular sequences and optimal schedules for security games</a>; ISBN 978-1-6119-7503-1; Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms; 1625-1644; <a href="https://doi.org/10.1137/1.9781611975031.106">10.1137/1.9781611975031.106</a></li> <li>Dvijotham, Krishnamurthy and Rabani, Yuval, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170214-145943460">Convergence of Incentive-Driven Dynamics in Fisher Markets</a>; ISBN 978-1-61197-478-2; Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms; 554-567; <a href="https://doi.org/10.1137/1.9781611974782.35">10.1137/1.9781611974782.35</a></li> <li>Schulman, Leonard J. and Vazirani, Umesh V. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190402-143205523">The duality gap for two-team zero-sum games</a>; ISBN 978-3-95977-029-3; 8th Innovations in Theoretical Computer Science Conference; Art. No. 56; <a href="https://doi.org/10.4230/LIPIcs.ITCS.2017.56">10.4230/LIPIcs.ITCS.2017.56</a></li> <li>Cohen, Gil and Schulman, Leonard J. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170127-140321585">Extractors for Near Logarithmic Min-Entropy</a>; ISBN 978-1-5090-3933-3; IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS); 178-187; <a href="https://doi.org/10.1109/FOCS.2016.27">10.1109/FOCS.2016.27</a></li> <li>Schulman, Leonard J. and Srivastava, Piyush (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160628-152001110">Stability of Causal Inference</a></li> <li>Hoza, William M. and Schulman, Leonard J. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160316-071949447">The adversarial noise threshold for distributed protocols</a>; ISBN 978-1-611974-33-1; Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms; 240-258; <a href="https://doi.org/10.48550/arXiv.1412.8097">10.48550/arXiv.1412.8097</a></li> <li>Schulman, Leonard J. and Sinclair, Alistair, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160804-113612809">Symbolic Integration and the Complexity of Computing Averages</a>; ISBN 978-1-4673-8191-8; IEEE 56th Annual Symposium on Foundations of Computer Science; 1231-1245; <a href="https://doi.org/10.1109/FOCS.2015.79">10.1109/FOCS.2015.79</a></li> <li>Li, Jian and Rabani, Yuval, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150715-085732981">Learning Arbitrary Statistical Mixtures of Discrete Distributions</a>; ISBN 978-1-4503-3536-2; Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing; 743-752; <a href="https://doi.org/10.1145/2746539.2746584">10.1145/2746539.2746584</a></li> <li>Schulman, Leonard J. and Sinclair, Alistair (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150715-085040447">Analysis of a Classical Matrix Preconditioning Algorithm</a>; ISBN 978-1-4503-3536-2; Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing; 831-840; <a href="https://doi.org/10.1145/2746539.2746556">10.1145/2746539.2746556</a></li> <li>Bhaskar, Umang and Ligett, Katrina, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160105-073143688">Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions</a>; ISBN 978-1-4799-6517-5; IEEE 55th Annual Symposium on Foundations of Computer Science; 31-40; <a href="https://doi.org/10.1109/FOCS.2014.12">10.1109/FOCS.2014.12</a></li> <li>Rabani, Yuval and Schulman, Leonard J., el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161212-165501273">Learning mixtures of arbitrary distributions over large discrete domains</a>; ISBN 978-1-4503-2698-8; ITCS '14 Proceedings of the 5th conference on Innovations in theoretical computer science; 207-224; <a href="https://doi.org/10.1145/2554797.2554818">10.1145/2554797.2554818</a></li> <li>Moore, Cristopher and Schulman, Leonard J. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140331-152623727">Tree Codes and a Conjecture on Exponential Sums</a>; ISBN 978-1-4503-2698-8; Proceedings of the 5th conference on Innovations in theoretical computer science; 145-154; <a href="https://doi.org/10.1145/2554797.2554813">10.1145/2554797.2554813</a></li> <li>Bhaskar, Umang and Ligett, Katrina, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150223-101614687">Network Improvement for Equilibrium Routing</a>; ISBN 978-3-319-07556-3; Integer Programming and Combinatorial Optimization; 138-149</li> <li>Franklin, Matthew and Gelles, Ran, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170427-165048383">Optimal Coding for Streaming Authentication and Interactive Communication</a>; ISBN 978-3-642-40083-4; Advances in Cryptology – CRYPTO 2013; 258-276; <a href="https://doi.org/10.1007/978-3-642-40084-1_15">10.1007/978-3-642-40084-1_15</a></li> <li>Lee, Euiwoong and Schulman, Leonard J. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161121-172931655">Clustering affine subspaces: hardness and algorithms</a>; ISBN 978-1-61197-251-1; Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms; 810-827; <a href="https://doi.org/10.1137/1.9781611973105.58">10.1137/1.9781611973105.58</a></li> <li>Feldman, Dan and Schulman, Leonard J. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120524-112316051">Data reduction for weighted and outlier-resistant clustering</a>; ISBN 9781611972108; Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms; 1343-1354</li> <li>Bartal, Yair and Recht, Ben, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120509-070406524">Dimensionality reduction: beyond the Johnson-Lindenstrauss bound</a>; ISBN 978-0-898719-93-2; Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms; 868-887</li> <li>Langberg, Michael and Schulman, Leonard J. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161121-163001649">Universal ε-approximators for integrals</a>; ISBN 978-0-89871-701-3; Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms; <a href="https://doi.org/10.1137/1.9781611973075.50">10.1137/1.9781611973075.50</a></li> <li>Gao, Xiaojie and Schulman, Leonard J. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161025-173435709">On a capacitated multivehicle routing problem</a>; ISBN 978-1-59593-989-0; PODC '08 Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing; 175-184; <a href="https://doi.org/10.1145/1400751.1400776">10.1145/1400751.1400776</a></li> <li>Orecchia, Lorenzo and Schulman, Leonard J., el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161206-174428027">On partitioning graphs via single commodity flows</a>; ISBN 978-1-60558-047-0; STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing; 461-470; <a href="https://doi.org/10.1145/1374376.1374442">10.1145/1374376.1374442</a></li> <li>Rabani, Yuval and Schulman, Leonard J., el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161212-164128630">Approximation algorithms for labeling hierarchical taxonomies</a></li> <li>Ostrovsky, Rafail and Rabani, Yuval, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170511-131811663">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 (FOCS'06); 165-176; <a href="https://doi.org/10.1109/FOCS.2006.75">10.1109/FOCS.2006.75</a></li> <li>Gao, Jie and Langberg, Michael, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161025-171347433">Analysis of incomplete data and an intrinsic-dimension Helly theorem</a>; ISBN 0-89871-605-5; SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm; 464-473</li> <li>Ko, Chih-Kai and Gao, Xiaojie, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110818-154937885">On Scalar LQG Control with Communication Cost</a>; ISBN 0-7803-9567-0; 2005 44th IEEE Conference on Decision and Control & European Control Conference; 2805-2810; <a href="https://doi.org/10.1109/CDC.2005.1582588">10.1109/CDC.2005.1582588</a></li> <li>Moore, Cristopher and Russell, Alexander, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110822-081948476">The symmetric group defies strong Fourier sampling</a>; ISBN 0-7695-2468-0; 46th Annual IEEE Symposium on Foundations of Computer Science; 479-488; <a href="https://doi.org/10.1109/SFCS.2005.73">10.1109/SFCS.2005.73</a></li> <li>Ostrovsky, Rafail and Rabani, Yuval, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110824-152034750">Error-correcting codes for automatic control</a>; ISBN 0-7695-2468-0; 46th Annual IEEE Symposium on Foundations of Computer Science; 309-316; <a href="https://doi.org/10.1109/SFCS.2005.33">10.1109/SFCS.2005.33</a></li> <li>Gao, Xiaojie and Schulman, Leonard J. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110817-093537514">Real-Time Coding for Multiple Access Channels</a>; ISBN 0-7803-9150-0; 2005 IEEE International Symposium on Information Theory; 67-71; <a href="https://doi.org/10.1109/ISIT.2005.1523294">10.1109/ISIT.2005.1523294</a></li> <li>Gao, Xiaojie and Schulman, Leonard J. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161025-172835471">Feedback control for router congestion resolution</a>; ISBN 1-58113-994-2; PODC '05 Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing; 218-226; <a href="https://doi.org/10.1145/1073814.1073855">10.1145/1073814.1073855</a></li> <li>Effros, Michelle and Schulman, Leonard J. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFisit04">Rapid near-optimal VQ design with a deterministic data net</a>; ISBN 0-7803-8280-3; IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June - 2 July 2004; 299; <a href="https://doi.org/10.1109/ISIT.2004.1365336">10.1109/ISIT.2004.1365336</a></li> <li>Moore, Cristopher and Rockmore, Daniel, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161130-165912905">The power of basis selection in fourier sampling: hidden subgroup problems in affine groups</a>; ISBN 0-89871-558-X; SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms; 1113-1122</li> <li>Gao, Xiaojie and Jain, Kamal, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161025-172050851">Fair and efficient router congestion control</a>; ISBN 0-89871-558-X; SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms; 1050-1059</li> <li>Goldreich, Oded and Karloff, Howard, el al. (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111102-143056331">Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval</a>; ISBN 0-7695-1468-5; 17th IEEE Annual Conference on Computational Complexity; 143-151; <a href="https://doi.org/10.1109/CCC.2002.1004353">10.1109/CCC.2002.1004353</a></li> <li>Grigni, Michaelangelo and Schulman, Leonard J., el al. (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161031-162455553">Quantum mechanical algorithms for the nonabelian hidden subgroup problem</a>; ISBN 1-58113-349-9; STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing; 68-74; <a href="https://doi.org/10.1145/380752.380769">10.1145/380752.380769</a></li> <li>Ambainis, Andris and Schulman, Leonard J., el al. (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111213-142315946">The quantum communication complexity of sampling</a>; ISBN 0-8186-9172-7; 39th Annual Symposium on Foundations of Computer Science; 342-351; <a href="https://doi.org/10.1109/SFCS.1998.743480">10.1109/SFCS.1998.743480</a></li> <li>Cardoze, David E. and Schulman, Leonard J. (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120117-151248754">Pattern Matching for Spatial Point Sets</a>; ISBN 0-8186-9172-7; 39th Annual Symposium on Foundations of Computer Science: Proceedings; 156-165; <a href="https://doi.org/10.1109/SFCS.1998.743439">10.1109/SFCS.1998.743439</a></li> <li>Rajagopalan, Sridhar and Schulman, Leonard J. (1996) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120208-152850561">Verifying Identities</a>; ISBN 0-8186-7594-2; Proceedings: 37th Annual Symposium on Foundations of Computer Science; 612-616; <a href="https://doi.org/10.1109/SFCS.1996.548520">10.1109/SFCS.1996.548520</a></li> <li>Naor, Moni and Schulman, Leonard J., el al. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120223-112750729">Splitters and near-optimal derandomization</a>; ISBN 0-8186-7183-1; 36th Annual Symposium on Foundations of Computer Science; 182-191; <a href="https://doi.org/10.1109/SFCS.1995.492475">10.1109/SFCS.1995.492475</a></li> <li>Schulman, Leonard J. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120224-084221884">Coding for interactive communication</a>; ISBN 0-7803-2453-6; 1995 IEEE International Symposium on Information Theory; 452-452; <a href="https://doi.org/10.1109/ISIT.1995.550439">10.1109/ISIT.1995.550439</a></li> <li>Evans, William S. and Schulman, Leonard J. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120216-114451513">Information Theory and Noisy Computation</a>; ISBN 0-7803-2453-6; Proceedings: 1995 IEEE International Symposium on Information Theory; 456; <a href="https://doi.org/10.1109/ISIT.1995.550443">10.1109/ISIT.1995.550443</a></li> <li>Rajagopalan, Sridhar and Schulman, Leonard J. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120224-093023413">Coding for Distributed Computation</a>; ISBN 0-7803-2453-6; 1995 IEEE International Symposium on Information Theory, Proceedings; 453-453; <a href="https://doi.org/10.1109/ISIT.1995.550440">10.1109/ISIT.1995.550440</a></li> <li>Schulman, Leonard J. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120223-084134446">Coding for distributed computation</a>; ISBN 0-7803-2761-6; Proceedings 1994 IEEE-IMS Workshop on Information Theory and Statistics; 28-28; <a href="https://doi.org/10.1109/WITS.1994.513866">10.1109/WITS.1994.513866</a></li> <li>Evans, Williams and Schulman, Leonard J. (1993) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120309-133211732">Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas</a>; ISBN 0-8186-4370-6; 34th Annual Symposium on Foundations of Computer Science Proceedings; 594-603; <a href="https://doi.org/10.1109/SFCS.1993.366827">10.1109/SFCS.1993.366827</a></li> <li>Schulman, Leonard J. (1992) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120328-141319570">Communication on noisy channels: a coding theorem for computation</a>; ISBN 0-8186-2900-2; 33rd Annual Symposium on Foundations of Computer Science; 724-733; <a href="https://doi.org/10.1109/SFCS.1992.267778">10.1109/SFCS.1992.267778</a></li> <li>Awerbuch, Baruch and Schulman, Leonard J. (1991) <a href="https://resolver.caltech.edu/CaltechAUTHORS:AWEfocs91">The maintenance of common data in a distributed system</a>; ISBN 0-8186-2445-0; Foundations of Computer Science, 32nd Annual Symposium. 1-4 Oct. 1991; 505-514; <a href="https://doi.org/10.1109/SFCS.1991.185413">10.1109/SFCS.1991.185413</a></li> </ul>