@article{https://authors.library.caltech.edu/records/byk5c-s6m73,
    title = "Fast Generalized DFTs for All Finite Groups",
    journal = "SIAM Journal on Computing",
    year = "2024",
    url = "https://authors.library.caltech.edu/records/byk5c-s6m73",
    id = "record",
    issn = "0097-5397",
    doi = "10.1137/20m1316342"
}


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


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


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170531-152830870,
    title = "On cap sets and the group-theoretic approach to matrix multiplication",
    journal = "Discrete Analysis",
    year = "2017",
    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",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191118-153821359",
    id = "record",
    issn = "2192-5283",
    doi = "10.4230/DagRep.6.10.13",
    volume = "6"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191126-133603851,
    title = "Algebra in Computational Complexity",
    journal = "Dagstuhl Reports",
    year = "2014",
    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",
    year = "2014",
    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",
    year = "2013",
    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",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130703-102109533",
    id = "record",
    issn = "1016-3328",
    doi = "10.1007/s00037-013-0060-1",
    volume = "22"
}


@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",
    year = "2012",
    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",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-143839781",
    id = "record",
    issn = "2192-5283",
    doi = "10.4230/DagRep.2.10.60",
    volume = "2"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120125-151548395,
    title = "Fast Polynomial Factorization and Modular Composition",
    journal = "SIAM Journal on Computing",
    year = "2011",
    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",
    year = "2011",
    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",
    year = "2011",
    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",
    year = "2010",
    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",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-150500984",
    id = "record",
    issn = "0097-5397",
    doi = "10.1137/smjcat000039000006002397000001",
    volume = "39"
}


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


@article{https://resolver.caltech.edu/CaltechAUTHORS:20091023-111539349,
    title = "Low-End Uniform Hardness versus Randomness Tradeoffs for AM",
    journal = "SIAM Journal on Computing",
    year = "2009",
    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",
    year = "2009",
    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",
    year = "2009",
    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",
    year = "2009",
    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",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090422-111344642",
    id = "record",
    issn = "0304-3975",
    doi = "10.1016/j.tcs.2008.11.019",
    volume = "410"
}


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


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


@article{https://resolver.caltech.edu/CaltechAUTHORS:20110811-085055181,
    title = "Pseudorandomness for Approximate Counting and Sampling",
    journal = "Computational Complexity",
    year = "2006",
    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",
    year = "2006",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190829-152850467",
    id = "record",
    issn = "1433-8092",
    volume = "2006"
}


@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",
    year = "2006",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:UMAieeetcadics06",
    id = "record",
    issn = "0278-0070",
    doi = "10.1109/TCAD.2005.855944",
    volume = "25"
}


@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",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161219-150257214",
    id = "record",
    issn = "0004-5411",
    doi = "10.1145/1059513.1059516",
    volume = "52"
}