@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191115-133902016,
    title = "2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)",
    chapter = "Fast generalized DFTs for all finite groups",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191115-133902016",
    id = "record",
    isbn = "978-1-7281-4952-3",
    doi = "10.1109/FOCS.2019.00052"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180410-153010180,
    title = "Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms",
    chapter = "A fast generalized DFT for finite groups of Lie type",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180410-153010180",
    id = "record",
    isbn = "978-1-6119-7503-1",
    doi = "10.48550/arXiv.1707.00349"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191118-123714214,
    title = "2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)",
    chapter = "FOCS 2017 Preface",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191118-123714214",
    id = "record",
    isbn = "978-1-5386-3464-6",
    doi = "10.1109/FOCS.2017.5"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191115-144427087,
    title = "42nd International Symposium on Mathematical Foundations of Computer Science",
    chapter = "On Multidimensional and Monotone k-SUM",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191115-144427087",
    id = "record",
    isbn = "9783959770460",
    doi = "10.4230/LIPIcs.MFCS.2017.50"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170705-173204335,
    title = "Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017",
    chapter = "Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170705-173204335",
    id = "record",
    isbn = "978-1-4503-4528-6",
    doi = "10.1145/3055399.3055414"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191118-141357870,
    title = "11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)",
    chapter = "On the Power of Quantum Fourier Sampling",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191118-141357870",
    id = "record",
    isbn = "9783959770194",
    doi = "10.4230/LIPIcs.TQC.2016.1"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191118-103356388,
    title = "41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)",
    chapter = "Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191118-103356388",
    id = "record",
    isbn = "9783959770163",
    doi = "10.4230/LIPIcs.MFCS.2016.47"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160913-165513831,
    title = "Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms",
    chapter = "Fast matrix multiplication using coherent configurations",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160913-165513831",
    id = "record",
    isbn = "978-1-61197-251-1",
    doi = "10.1137/1.9781611973105.77"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191126-140535982,
    title = "2012 IEEE 27th Conference on Computational Complexity",
    chapter = "Better Condensers and New Extractors from Parvaresh-Vardy Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-140535982",
    id = "record",
    isbn = "9780769547084",
    doi = "10.1109/ccc.2012.25"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20130703-110037886,
    title = "27th Annual IEEE Conference on Computational Complexity (CCC)",
    chapter = "On Sunflowers and Matrix Multiplication",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130703-110037886",
    id = "record",
    isbn = "978-1-4673-1663-7",
    doi = "10.1109/CCC.2012.26"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120522-093532704,
    title = "Proceedings of the 3rd Innovations in Theoretical Computer Science Conference",
    chapter = "On beating the hybrid argument",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120522-093532704",
    id = "record",
    isbn = "978-1-4503-1115-1",
    doi = "10.1145/2090236.2090273"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100824-073813316,
    title = "Proceedings of the Twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms",
    chapter = "Inapproximability for VCG-Based Combinatorial Auctions",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100824-073813316",
    id = "record",
    isbn = "978-0-898717-01-3"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191127-075729203,
    chapter = "Algebraic Methods in Computational Complexity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191127-075729203",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191127-093701543,
    chapter = "Algebraic Methods in Computational Complexity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191127-093701543",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100707-095613286,
    title = "50th Annual IEEE Symposium on Foundations of Computer Science, 2009",
    chapter = "The Complexity of Rationalizing Network Formation",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100707-095613286",
    id = "record",
    isbn = "978-1-4244-5116-6",
    doi = "10.1109/FOCS.2009.48"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191126-155702845,
    title = "Algorithms and Computation",
    chapter = "The Complexity of Rationalizing Matchings",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-155702845",
    id = "record",
    isbn = "978-3-540-92181-3",
    doi = "10.1007/978-3-540-92182-0\_18"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191126-160438923,
    title = "2008 49th Annual IEEE Symposium on Foundations of Computer Science",
    chapter = "Fast Modular Composition in any Characteristic",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-160438923",
    id = "record",
    isbn = "978-0-7695-3436-7",
    doi = "10.1109/focs.2008.13"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191127-094213132,
    chapter = "Fast polynomial factorization and modular composition",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191127-094213132",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191112-131623581,
    title = "Automata, Languages and Programming",
    chapter = "The Complexity of Boolean Formula Minimization",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191112-131623581",
    id = "record",
    isbn = "978-3-540-70574-1",
    doi = "10.1007/978-3-540-70575-8\_3"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170103-171822942,
    title = "STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing",
    chapter = "Fast polynomial factorization and modular composition in small characteristic",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170103-171822942",
    id = "record",
    isbn = "978-1-60558-047-0",
    doi = "10.1145/1374376.1374445"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190828-102317126,
    title = "Algorithms – ESA 2007",
    chapter = "Algorithms for Playing Games with Limited Randomness",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190828-102317126",
    id = "record",
    isbn = "9783540755197",
    doi = "10.1007/978-3-540-75520-3\_30"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161219-151217993,
    title = "STOC '07 Proceedings of the thirty-ninth annual ACM symposium on Theory of computing",
    chapter = "Low-end uniform hardness vs. randomness tradeoffs for AM",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161219-151217993",
    id = "record",
    isbn = "978-1-59593-631-8",
    doi = "10.1145/1250790.1250854"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170426-160240908,
    title = "Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)",
    chapter = "Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170426-160240908",
    id = "record",
    isbn = "0-7695-2780-9",
    doi = "10.1109/CCC.2007.38"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190828-102318013,
    title = "FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science",
    chapter = "On Obtaining Pseudorandomness from Error-Correcting Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190828-102318013",
    id = "record",
    isbn = "9783540499947",
    doi = "10.1007/11944836\_12"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170427-151755097,
    title = "47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)",
    chapter = "Better lossless condensers through derandomized curve samplers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170427-151755097",
    id = "record",
    isbn = "0-7695-2720-5",
    doi = "10.1109/FOCS.2006.18"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170103-170341500,
    title = "ISSAC '06 Proceedings of the 2006 international symposium on Symbolic and algebraic computation",
    chapter = "Group-theoretic algorithms for matrix multiplication",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170103-170341500",
    id = "record",
    isbn = "1-59593-276-3",
    doi = "10.1145/1145768.1145772"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200127-140148446,
    title = "Theory and Applications of Models of Computation",
    chapter = "Optimization Problems in the Polynomial-Time Hierarchy",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200127-140148446",
    id = "record",
    isbn = "978-3-540-34021-8",
    doi = "10.1007/11750321\_33"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110609-141427936,
    title = "46th Annual IEEE Symposium on Foundations of Computer Science",
    chapter = "Group-theoretic Algorithms for Matrix Multiplication",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110609-141427936",
    id = "record",
    isbn = "0-7695-2468-0",
    doi = "10.1109/SFCS.2005.39"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200609-101642741,
    title = "Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques",
    chapter = "Reconstructive Dispersers and Hitting Set Generators",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200609-101642741",
    id = "record",
    isbn = "978-3-540-28239-6",
    doi = "10.1007/11538462\_39"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111026-095124253,
    title = "44th Annual IEEE Symposium on Foundations of Computer Science",
    chapter = "A Group-theoretic Approach to Fast Matrix Multiplication",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111026-095124253",
    id = "record",
    isbn = "0-7695-2040-5",
    doi = "10.1109/SFCS.2003.1238217"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111110-081820059,
    title = "17th Annual Conference on Computational Complexity",
    chapter = "Pseudo-Random Generators for All Hardnesses",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111110-081820059",
    id = "record",
    isbn = "0-7695-1468-5",
    doi = "10.1109/CCC.2002.1004326"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111121-092803461,
    title = "42nd Annual Symposium on Foundations of Computer Science",
    chapter = "Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111121-092803461",
    id = "record",
    isbn = "0-7695-1390-5",
    doi = "10.1109/SFCS.2001.959941"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111118-115638180,
    title = "16th Annual IEEE Conference on Computational Complexity Proceedings",
    chapter = "On the Complexity of Approximating the VC dimension",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111118-115638180",
    id = "record",
    isbn = "0-7695-1054-X",
    doi = "10.1109/CCC.2001.933889"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120109-142652598,
    title = "40th Annual Symposium on Foundations of Computer Science",
    chapter = "Hardness of Approximating Σ^(p)\_(2) Minimization Problems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120109-142652598",
    id = "record",
    isbn = "0-7695-0409-4",
    doi = "10.1109/SFFCS.1999.814619"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120119-070934161,
    title = "39th Annual Symposium on Foundations of Computer Science",
    chapter = "The Minimum Equivalent DNF Problem and Shortest Implicants",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120119-070934161",
    id = "record",
    isbn = "0-8186-9172-7",
    doi = "10.1109/SFCS.1998.743506"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120126-092849476,
    title = "38th Annual Symposium on Foundations of Computer Science: Proceedings",
    chapter = "Hamiltonian cycles in solid grid graphs",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120126-092849476",
    id = "record",
    isbn = "0-8186-8197-7",
    doi = "10.1109/SFCS.1997.646138"
}