@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200828-114509192,
    title = "Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms",
    chapter = "Edge Expansion and Spectral Gap of Nonnegative Matrices",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200828-114509192",
    id = "record",
    isbn = "978-1-61197-599-4",
    doi = "10.1137/1.9781611975994.73"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180823-141633075,
    title = "Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing",
    chapter = "Explicit binary tree codes with polylogarithmic size alphabet",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180823-141633075",
    id = "record",
    isbn = "978-1-4503-5559-9",
    doi = "10.1145/3188745.3188928"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180410-145958889,
    title = "Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms",
    chapter = "Quasi-regular sequences and optimal schedules for security games",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180410-145958889",
    id = "record",
    isbn = "978-1-6119-7503-1",
    doi = "10.1137/1.9781611975031.106"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170214-145943460,
    title = "Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms",
    chapter = "Convergence of Incentive-Driven Dynamics in Fisher Markets",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170214-145943460",
    id = "record",
    isbn = "978-1-61197-478-2",
    doi = "10.1137/1.9781611974782.35"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190402-143205523,
    title = "8th Innovations in Theoretical Computer Science Conference",
    chapter = "The duality gap for two-team zero-sum games",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190402-143205523",
    id = "record",
    isbn = "978-3-95977-029-3",
    doi = "10.4230/LIPIcs.ITCS.2017.56"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170127-140321585,
    title = "IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)",
    chapter = "Extractors for Near Logarithmic Min-Entropy",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170127-140321585",
    id = "record",
    isbn = "978-1-5090-3933-3",
    doi = "10.1109/FOCS.2016.27"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160628-152001110,
    chapter = "Stability of Causal Inference",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160628-152001110",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160316-071949447,
    title = "Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms",
    chapter = "The adversarial noise threshold for distributed protocols",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160316-071949447",
    id = "record",
    isbn = "978-1-611974-33-1",
    doi = "10.48550/arXiv.1412.8097"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160804-113612809,
    title = "IEEE 56th Annual Symposium on Foundations of Computer Science",
    chapter = "Symbolic Integration and the Complexity of Computing Averages",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160804-113612809",
    id = "record",
    isbn = "978-1-4673-8191-8",
    doi = "10.1109/FOCS.2015.79"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150715-085732981,
    title = "Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing",
    chapter = "Learning Arbitrary Statistical Mixtures of Discrete Distributions",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150715-085732981",
    id = "record",
    isbn = "978-1-4503-3536-2",
    doi = "10.1145/2746539.2746584"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150715-085040447,
    title = "Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing",
    chapter = "Analysis of a Classical Matrix Preconditioning Algorithm",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150715-085040447",
    id = "record",
    isbn = "978-1-4503-3536-2",
    doi = "10.1145/2746539.2746556"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160105-073143688,
    title = "IEEE 55th Annual Symposium on Foundations of Computer Science",
    chapter = "Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160105-073143688",
    id = "record",
    isbn = "978-1-4799-6517-5",
    doi = "10.1109/FOCS.2014.12"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161212-165501273,
    title = "ITCS '14 Proceedings of the 5th conference on Innovations in theoretical computer science",
    chapter = "Learning mixtures of arbitrary distributions over large discrete domains",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161212-165501273",
    id = "record",
    isbn = "978-1-4503-2698-8",
    doi = "10.1145/2554797.2554818"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140331-152623727,
    title = "Proceedings of the 5th conference on Innovations in theoretical computer science",
    chapter = "Tree Codes and a Conjecture on Exponential Sums",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140331-152623727",
    id = "record",
    isbn = "978-1-4503-2698-8",
    doi = "10.1145/2554797.2554813"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150223-101614687,
    title = "Integer Programming and Combinatorial Optimization",
    chapter = "Network Improvement for Equilibrium Routing",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150223-101614687",
    id = "record",
    isbn = "978-3-319-07556-3"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170427-165048383,
    title = "Advances in Cryptology – CRYPTO 2013",
    chapter = "Optimal Coding for Streaming Authentication and Interactive Communication",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170427-165048383",
    id = "record",
    isbn = "978-3-642-40083-4",
    doi = "10.1007/978-3-642-40084-1\_15"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161121-172931655,
    title = "Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms",
    chapter = "Clustering affine subspaces: hardness and algorithms",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161121-172931655",
    id = "record",
    isbn = "978-1-61197-251-1",
    doi = "10.1137/1.9781611973105.58"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120524-112316051,
    title = "Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms",
    chapter = "Data reduction for weighted and outlier-resistant clustering",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120524-112316051",
    id = "record",
    isbn = "9781611972108"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120509-070406524,
    title = "Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms",
    chapter = "Dimensionality reduction: beyond the Johnson-Lindenstrauss bound",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120509-070406524",
    id = "record",
    isbn = "978-0-898719-93-2"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161121-163001649,
    title = "Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms",
    chapter = "Universal ε-approximators for integrals",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161121-163001649",
    id = "record",
    isbn = "978-0-89871-701-3",
    doi = "10.1137/1.9781611973075.50"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161025-173435709,
    title = "PODC '08 Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing",
    chapter = "On a capacitated multivehicle routing problem",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161025-173435709",
    id = "record",
    isbn = "978-1-59593-989-0",
    doi = "10.1145/1400751.1400776"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161206-174428027,
    title = "STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing",
    chapter = "On partitioning graphs via single commodity flows",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161206-174428027",
    id = "record",
    isbn = "978-1-60558-047-0",
    doi = "10.1145/1374376.1374442"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161212-164128630,
    chapter = "Approximation algorithms for labeling hierarchical taxonomies",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161212-164128630",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170511-131811663,
    title = "47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)",
    chapter = "The Effectiveness of Lloyd-Type Methods for the k-Means Problem",
    year = "2006",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170511-131811663",
    id = "record",
    isbn = "0-7695-2720-5",
    doi = "10.1109/FOCS.2006.75"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161025-171347433,
    title = "SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm",
    chapter = "Analysis of incomplete data and an intrinsic-dimension Helly theorem",
    year = "2006",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161025-171347433",
    id = "record",
    isbn = "0-89871-605-5"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110818-154937885,
    title = "2005 44th IEEE Conference on Decision and Control \& European Control Conference",
    chapter = "On Scalar LQG Control with Communication Cost",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110818-154937885",
    id = "record",
    isbn = "0-7803-9567-0",
    doi = "10.1109/CDC.2005.1582588"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110824-152034750,
    title = "46th Annual IEEE Symposium on Foundations of Computer Science",
    chapter = "Error-correcting codes for automatic control",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110824-152034750",
    id = "record",
    isbn = "0-7695-2468-0",
    doi = "10.1109/SFCS.2005.33"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110822-081948476,
    title = "46th Annual IEEE Symposium on Foundations of Computer Science",
    chapter = "The symmetric group defies strong Fourier sampling",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110822-081948476",
    id = "record",
    isbn = "0-7695-2468-0",
    doi = "10.1109/SFCS.2005.73"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110817-093537514,
    title = "2005 IEEE International Symposium on Information Theory",
    chapter = "Real-Time Coding for Multiple Access Channels",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110817-093537514",
    id = "record",
    isbn = "0-7803-9150-0",
    doi = "10.1109/ISIT.2005.1523294"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161025-172835471,
    title = "PODC '05 Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing",
    chapter = "Feedback control for router congestion resolution",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161025-172835471",
    id = "record",
    isbn = "1-58113-994-2",
    doi = "10.1145/1073814.1073855"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFisit04,
    title = "IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June - 2 July 2004",
    chapter = "Rapid near-optimal VQ design with a deterministic data net",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFisit04",
    id = "record",
    isbn = "0-7803-8280-3",
    doi = "10.1109/ISIT.2004.1365336"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161130-165912905,
    title = "SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms",
    chapter = "The power of basis selection in fourier sampling: hidden subgroup problems in affine groups",
    year = "2004",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161130-165912905",
    id = "record",
    isbn = "0-89871-558-X"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161025-172050851,
    title = "SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms",
    chapter = "Fair and efficient router congestion control",
    year = "2004",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161025-172050851",
    id = "record",
    isbn = "0-89871-558-X"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111102-143056331,
    title = "17th IEEE Annual Conference on Computational Complexity",
    chapter = "Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval",
    year = "2002",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111102-143056331",
    id = "record",
    isbn = "0-7695-1468-5",
    doi = "10.1109/CCC.2002.1004353"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161031-162455553,
    title = "STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing",
    chapter = "Quantum mechanical algorithms for the nonabelian hidden subgroup problem",
    year = "2001",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161031-162455553",
    id = "record",
    isbn = "1-58113-349-9",
    doi = "10.1145/380752.380769"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120117-151248754,
    title = "39th Annual Symposium on Foundations of Computer Science: Proceedings",
    chapter = "Pattern Matching for Spatial Point Sets",
    year = "1998",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120117-151248754",
    id = "record",
    isbn = "0-8186-9172-7",
    doi = "10.1109/SFCS.1998.743439"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111213-142315946,
    title = "39th Annual Symposium on Foundations of Computer Science",
    chapter = "The quantum communication complexity of sampling",
    year = "1998",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111213-142315946",
    id = "record",
    isbn = "0-8186-9172-7",
    doi = "10.1109/SFCS.1998.743480"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120208-152850561,
    title = "Proceedings: 37th Annual Symposium on Foundations of Computer Science",
    chapter = "Verifying Identities",
    year = "1996",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120208-152850561",
    id = "record",
    isbn = "0-8186-7594-2",
    doi = "10.1109/SFCS.1996.548520"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120223-112750729,
    title = "36th Annual Symposium on Foundations of Computer Science",
    chapter = "Splitters and near-optimal derandomization",
    year = "1995",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120223-112750729",
    id = "record",
    isbn = "0-8186-7183-1",
    doi = "10.1109/SFCS.1995.492475"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120224-093023413,
    title = "1995 IEEE International Symposium on Information Theory, Proceedings",
    chapter = "Coding for Distributed Computation",
    year = "1995",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120224-093023413",
    id = "record",
    isbn = "0-7803-2453-6",
    doi = "10.1109/ISIT.1995.550440"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120216-114451513,
    title = "Proceedings: 1995 IEEE International Symposium on Information Theory",
    chapter = "Information Theory and Noisy Computation",
    year = "1995",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120216-114451513",
    id = "record",
    isbn = "0-7803-2453-6",
    doi = "10.1109/ISIT.1995.550443"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120224-084221884,
    title = "1995 IEEE International Symposium on Information Theory",
    chapter = "Coding for interactive communication",
    year = "1995",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120224-084221884",
    id = "record",
    isbn = "0-7803-2453-6",
    doi = "10.1109/ISIT.1995.550439"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120223-084134446,
    title = "Proceedings 1994 IEEE-IMS Workshop on Information Theory and Statistics",
    chapter = "Coding for distributed computation",
    year = "1994",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120223-084134446",
    id = "record",
    isbn = "0-7803-2761-6",
    doi = "10.1109/WITS.1994.513866"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120309-133211732,
    title = "34th Annual Symposium on Foundations of Computer Science Proceedings",
    chapter = "Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas",
    year = "1993",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120309-133211732",
    id = "record",
    isbn = "0-8186-4370-6",
    doi = "10.1109/SFCS.1993.366827"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120328-141319570,
    title = "33rd Annual Symposium on Foundations of Computer Science",
    chapter = "Communication on noisy channels: a coding theorem for computation",
    year = "1992",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120328-141319570",
    id = "record",
    isbn = "0-8186-2900-2",
    doi = "10.1109/SFCS.1992.267778"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:AWEfocs91,
    title = "Foundations of Computer Science, 32nd Annual Symposium. 1-4 Oct. 1991",
    chapter = "The maintenance of common data in a distributed system",
    year = "1991",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:AWEfocs91",
    id = "record",
    isbn = "0-8186-2445-0",
    doi = "10.1109/SFCS.1991.185413"
}