@other{https://resolver.caltech.edu/CaltechAUTHORS:20191118-072853843,
    title = "Which groups are amenable to proving exponent two for matrix multiplication?",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191118-072853843",
    id = "record",
    doi = "10.48550/arXiv.1712.02302"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20191118-130935010,
    title = "Pseudorandom generators and the BQP vs. PH problem",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191118-130935010",
    id = "record",
    doi = "10.48550/arXiv.1007.0305"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191115-080137932,
    title = "A New Algorithm for Fast Generalized DFTs",
    journal = "ACM Transactions on Algorithms",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191115-080137932",
    id = "record",
    issn = "1549-6325",
    doi = "10.1145/3301313",
    volume = "16"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191115-154547839,
    title = "Algebraic Methods in Computational Complexity",
    journal = "Dagstuhl Reports",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191115-154547839",
    id = "record",
    issn = "2192-5283",
    doi = "10.4230/DagRep.8.9.133",
    volume = "8"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170531-152830870,
    title = "On cap sets and the group-theoretic approach to matrix multiplication",
    journal = "Discrete Analysis",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170531-152830870",
    id = "record",
    issn = "2397-3129",
    doi = "10.19086/da.1245",
    volume = "2017"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191118-153821359,
    title = "Algebraic and Combinatorial Methods in Computational Complexity",
    journal = "Dagstuhl Reports",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191118-153821359",
    id = "record",
    issn = "2192-5283",
    doi = "10.4230/DagRep.6.10.13",
    volume = "6"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191126-133603851,
    title = "Algebra in Computational Complexity",
    journal = "Dagstuhl Reports",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-133603851",
    id = "record",
    issn = "2192-5283",
    doi = "10.4230/DagRep.4.9.85",
    volume = "4"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140701-090549753,
    title = {Special Issue "Conference on Computational Complexity 2013" Guest editor's foreword},
    journal = "Computational Complexity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140701-090549753",
    id = "record",
    issn = "1016-3328",
    doi = "10.1007/s00037-014-0088-x",
    volume = "23"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191118-154821951,
    title = "On Beating the Hybrid Argument",
    journal = "Theory of Computing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191118-154821951",
    id = "record",
    issn = "1557-2862",
    doi = "10.4086/toc.2013.v009a026",
    volume = "9"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20130703-102109533,
    title = "On sunflowers and matrix multiplication",
    journal = "Computational Complexity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130703-102109533",
    id = "record",
    issn = "1016-3328",
    doi = "10.1007/s00037-013-0060-1",
    volume = "22"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191126-134942908,
    title = "Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009)",
    journal = "SIAM Journal on Computing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-134942908",
    id = "record",
    issn = "0097-5397",
    doi = "10.1137/120973305",
    volume = "41"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191126-143839781,
    title = "Algebraic and Combinatorial Methods in Computational
 Complexity",
    journal = "Dagstuhl Reports",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-143839781",
    id = "record",
    issn = "2192-5283",
    doi = "10.4230/DagRep.2.10.60",
    volume = "2"
}


@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: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: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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120125-151548395,
    title = "Fast Polynomial Factorization and Modular Composition",
    journal = "SIAM Journal on Computing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120125-151548395",
    id = "record",
    issn = "0097-5397",
    doi = "10.1137/08073408X",
    volume = "40"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191126-142038137,
    title = "On Sunflowers and Matrix Multiplication",
    journal = "Electronic Colloquium on Computational Complexity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-142038137",
    id = "record",
    issn = "1433-8092",
    volume = "2011"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20110422-100438828,
    title = "The complexity of Boolean formula minimization",
    journal = "Journal of Computer and System Sciences",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110422-100438828",
    id = "record",
    issn = "0022-0000",
    doi = "10.1016/j.jcss.2010.06.011",
    volume = "77"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191126-153323226,
    title = "On beating the hybrid argument",
    journal = "Electronic Colloquium on Computational Complexity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-153323226",
    id = "record",
    issn = "1433-8092",
    volume = "2010"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191126-150500984,
    title = "Special Section On Foundations of Computer Science",
    journal = "SIAM Journal on Computing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-150500984",
    id = "record",
    issn = "0097-5397",
    doi = "10.1137/smjcat000039000006002397000001",
    volume = "39"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191127-082201341,
    title = "The Complexity of Rationalizing Network Formation",
    journal = "Electronic Colloquium on Computational Complexity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191127-082201341",
    id = "record",
    issn = "1433-8092",
    volume = "2009"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191127-080702908,
    title = "Improved inapproximability factors for some Σ^p₂ minimization problems",
    journal = "Electronic Colloquium on Computational Complexity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191127-080702908",
    id = "record",
    issn = "1433-8092",
    volume = "2009"
}


@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:20191127-075729203,
    chapter = "Algebraic Methods in Computational Complexity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191127-075729203",
    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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20091023-111539349,
    title = "Low-End Uniform Hardness versus Randomness Tradeoffs for AM",
    journal = "SIAM Journal on Computing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20091023-111539349",
    id = "record",
    issn = "0097-5397",
    doi = "10.1137/070698348",
    volume = "39"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20090901-145722580,
    title = "Reconstructive Dispersers and Hitting Set Generators",
    journal = "Algorithmica",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090901-145722580",
    id = "record",
    issn = "0178-4617",
    doi = "10.1007/s00453-008-9266-z",
    volume = "55"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191127-082848396,
    title = "Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms",
    journal = "Electronic Colloquium on Computational Complexity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191127-082848396",
    id = "record",
    issn = "1433-8092",
    volume = "2009"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20090817-144815953,
    title = "Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes",
    journal = "Journal of the ACM",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090817-144815953",
    id = "record",
    issn = "0004-5411",
    doi = "10.1145/1538902.1538904",
    volume = "56"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20090422-111344642,
    title = "The complexity of the matroid-greedoid partition problem",
    journal = "Theoretical Computer Science",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090422-111344642",
    id = "record",
    issn = "0304-3975",
    doi = "10.1016/j.tcs.2008.11.019",
    volume = "410"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:FORcc08,
    title = "On the Complexity of Succinct Zero-Sum Games",
    journal = "Computational Complexity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:FORcc08",
    id = "record",
    issn = "1016-3328",
    doi = "10.1007/s00037-008-0252-2",
    volume = "17"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191127-084809601,
    title = "The Complexity of Rationalizing Matchings",
    journal = "Electronic Colloquium on Computational Complexity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191127-084809601",
    id = "record",
    issn = "1433-8092"
}


@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: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: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: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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20110811-085055181,
    title = "Pseudorandomness for Approximate Counting and Sampling",
    journal = "Computational Complexity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110811-085055181",
    id = "record",
    issn = "1016-3328",
    doi = "10.1007/s00037-007-0218-9",
    volume = "15"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190829-152850467,
    title = "On obtaining pseudorandomness from error-correcting codes",
    journal = "Electronic Colloquium on Computational Complexity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190829-152850467",
    id = "record",
    issn = "1433-8092",
    volume = "2006"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:UMAieeetcadics06,
    title = "Complexity of two-level logic minimization",
    journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:UMAieeetcadics06",
    id = "record",
    issn = "0278-0070",
    doi = "10.1109/TCAD.2005.855944",
    volume = "25"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20161219-150257214,
    title = "Simple extractors for all min-entropies and a new pseudorandom generator",
    journal = "Journal of the ACM",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161219-150257214",
    id = "record",
    issn = "0004-5411",
    doi = "10.1145/1059513.1059516",
    volume = "52"
}


@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: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: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"
}