Schulman, Leonard
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
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
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
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
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
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
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
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
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
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
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
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
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
Rabani, Yuval and Schulman, Leonard J., et el. (2008) Approximation algorithms for labeling hierarchical taxonomies
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
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
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
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
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
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
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
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
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
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
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
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
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
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
