@article{https://authors.library.caltech.edu/records/mfnwn-hjx19,
    authors = "Hsu, Chloe Ching-Yun and Umans, Chris",
    title = "A New Algorithm for Fast Generalized DFTs",
    journal = "ACM Transactions on Algorithms",
    publisher = "Association for Computing Machinery (ACM)",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191115-080137932",
    id = "https://authors.library.caltech.edu/records/mfnwn-hjx19",
    issn = "1549-6325",
    doi = "10.1145/3301313",
    volume = "16",
    number = "1",
    pages = "Art. No. 4"
}


@article{https://authors.library.caltech.edu/records/wmv9a-40h47,
    authors = "Bläser, Markus and Kabanets, Valentine and Torán, Jacobo and Umans, Christopher",
    title = "Algebraic Methods in Computational Complexity",
    journal = "Dagstuhl Reports",
    publisher = "Dagstuhl Publishing",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191115-154547839",
    id = "https://authors.library.caltech.edu/records/wmv9a-40h47",
    issn = "2192-5283",
    doi = "10.4230/DagRep.8.9.133",
    volume = "8",
    number = "9",
    pages = "133-153"
}


@article{https://authors.library.caltech.edu/records/gqsk3-8rd15,
    authors = "Blasiak, Jonah and Church, Thomas and Cohn, Henry and Grochow, Joshua A. and Naslund, Eric and Sawin, William F. and Umans, Chris",
    title = "On cap sets and the group-theoretic approach to matrix multiplication",
    journal = "Discrete Analysis",
    publisher = "Discrete Analysis",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170531-152830870",
    id = "https://authors.library.caltech.edu/records/gqsk3-8rd15",
    issn = "2397-3129",
    doi = "10.19086/da.1245",
    volume = "2017",
    number = "3",
    pages = "1-27"
}


@article{https://authors.library.caltech.edu/records/s7nkn-rq096,
    authors = "Kabanets, Valentine and Thierauf, Thomas and Torán, Jacobo and Umans, Christopher",
    title = "Algebraic and Combinatorial Methods in Computational Complexity",
    journal = "Dagstuhl Reports",
    publisher = "Dagstuhl Publishing",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191118-153821359",
    id = "https://authors.library.caltech.edu/records/s7nkn-rq096",
    issn = "2192-5283",
    doi = "10.4230/DagRep.6.10.13",
    volume = "6",
    number = "10",
    pages = "13-32"
}


@article{https://authors.library.caltech.edu/records/zra1e-qjk46,
    authors = "Agrawal, Manindra and Kabanets, Valentine and Thierauf, Thomas and Umans, Christopher",
    title = "Algebra in Computational Complexity",
    journal = "Dagstuhl Reports",
    publisher = "Dagstuhl Publishing",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-133603851",
    id = "https://authors.library.caltech.edu/records/zra1e-qjk46",
    issn = "2192-5283",
    doi = "10.4230/DagRep.4.9.85",
    volume = "4",
    number = "9",
    pages = "85-105"
}


@article{https://authors.library.caltech.edu/records/v0nha-rpf57,
    authors = "Umans, Christopher",
    title = {Special Issue "Conference on Computational Complexity 2013" Guest editor's foreword},
    journal = "Computational Complexity",
    publisher = "Springer",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140701-090549753",
    id = "https://authors.library.caltech.edu/records/v0nha-rpf57",
    issn = "1016-3328",
    doi = "10.1007/s00037-014-0088-x",
    volume = "23",
    number = "2",
    pages = "147-149"
}


@article{https://authors.library.caltech.edu/records/8kb7d-trj22,
    authors = "Fefferman, Bill and Shaltiel, Ronen and Umans, Christopher and Viola, Emanuele",
    title = "On Beating the Hybrid Argument",
    journal = "Theory of Computing",
    publisher = "University of Chicago",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191118-154821951",
    id = "https://authors.library.caltech.edu/records/8kb7d-trj22",
    issn = "1557-2862",
    doi = "10.4086/toc.2013.v009a026",
    volume = "9",
    number = "1",
    pages = "809-843"
}


@article{https://authors.library.caltech.edu/records/pm0dy-mrb85,
    authors = "Alon, Noga and Shpilka, Amir and Umans, Christopher",
    title = "On sunflowers and matrix multiplication",
    journal = "Computational Complexity",
    publisher = "Springer",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130703-102109533",
    id = "https://authors.library.caltech.edu/records/pm0dy-mrb85",
    issn = "1016-3328",
    doi = "10.1007/s00037-013-0060-1",
    volume = "22",
    number = "2",
    pages = "219-243"
}


@article{https://authors.library.caltech.edu/records/2719d-ve992,
    authors = "Immorlica, Nicole and Katz, Jonathan N. and Mitzenmacher, Michael and Servedio, Rocco and Umans, Chris",
    title = "Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009)",
    journal = "SIAM Journal on Computing",
    publisher = "Society for Industrial and Applied Mathematics",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-134942908",
    id = "https://authors.library.caltech.edu/records/2719d-ve992",
    issn = "0097-5397",
    doi = "10.1137/120973305",
    volume = "41",
    number = "6",
    pages = "1591-1592"
}


@article{https://authors.library.caltech.edu/records/e8rpy-ybr95,
    authors = "Agrawal, Manindra and Thierauf, Thomas and Umans, Christopher",
    title = "Algebraic and Combinatorial Methods in Computational
 Complexity",
    journal = "Dagstuhl Reports",
    publisher = "Dagstuhl Publishing",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-143839781",
    id = "https://authors.library.caltech.edu/records/e8rpy-ybr95",
    issn = "2192-5283",
    doi = "10.4230/DagRep.2.10.60",
    volume = "2",
    number = "10",
    pages = "60-78"
}


@article{https://authors.library.caltech.edu/records/m9qjm-tht77,
    authors = "Kedlaya, Kiran S. and Umans, Christopher",
    title = "Fast Polynomial Factorization and Modular Composition",
    journal = "SIAM Journal on Computing",
    publisher = "Society for Industrial and Applied Mathematics",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120125-151548395",
    id = "https://authors.library.caltech.edu/records/m9qjm-tht77",
    issn = "0097-5397",
    doi = "10.1137/08073408X",
    volume = "40",
    number = "6",
    pages = "1767-1802"
}


@article{https://authors.library.caltech.edu/records/epgka-nze16,
    authors = "Alon, Noga and Shpilka, Amir and Umans, Christopher",
    title = "On Sunflowers and Matrix Multiplication",
    journal = "Electronic Colloquium on Computational Complexity",
    publisher = "Computational Complexity Foundation (CCF)",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-142038137",
    id = "https://authors.library.caltech.edu/records/epgka-nze16",
    issn = "1433-8092",
    volume = "2011",
    pages = "Art. No. 67"
}


@article{https://authors.library.caltech.edu/records/t2v4w-6ps74,
    authors = "Buchfuhrer, David and Umans, Christopher",
    title = "The complexity of Boolean formula minimization",
    journal = "Journal of Computer and System Sciences",
    publisher = "Elsevier",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110422-100438828",
    id = "https://authors.library.caltech.edu/records/t2v4w-6ps74",
    issn = "0022-0000",
    doi = "10.1016/j.jcss.2010.06.011",
    volume = "77",
    number = "1",
    pages = "142-153"
}


@article{https://authors.library.caltech.edu/records/af5ze-8d022,
    authors = "Fefferman, Bill and Umans, Christopher and Shaltiel, Ronen and Viola, Emanuele",
    title = "On beating the hybrid argument",
    journal = "Electronic Colloquium on Computational Complexity",
    publisher = "Computational Complexity Foundation (CCF)",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-153323226",
    id = "https://authors.library.caltech.edu/records/af5ze-8d022",
    issn = "1433-8092",
    volume = "2010",
    pages = "Art. No. 186"
}


@article{https://authors.library.caltech.edu/records/vg9e2-dnz47,
    authors = "Lee, James R. and Umans, Chris",
    title = "Special Section On Foundations of Computer Science",
    journal = "SIAM Journal on Computing",
    publisher = "Society for Industrial and Applied Mathematics",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191126-150500984",
    id = "https://authors.library.caltech.edu/records/vg9e2-dnz47",
    issn = "0097-5397",
    doi = "10.1137/smjcat000039000006002397000001",
    volume = "39",
    number = "6",
    pages = "2397-2397"
}


@article{https://authors.library.caltech.edu/records/28ynw-3cm55,
    authors = "Kalyanaraman, Shankar and Umans, Christopher",
    title = "The Complexity of Rationalizing Network Formation",
    journal = "Electronic Colloquium on Computational Complexity",
    publisher = "Computational Complexity Foundation (CCF)",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191127-082201341",
    id = "https://authors.library.caltech.edu/records/28ynw-3cm55",
    issn = "1433-8092",
    volume = "2009",
    pages = "Art. No. 145"
}


@article{https://authors.library.caltech.edu/records/fhv5w-h3x81,
    authors = "Dick, Kevin and Umans, Christopher",
    title = "Improved inapproximability factors for some Σ^p₂ minimization problems",
    journal = "Electronic Colloquium on Computational Complexity",
    publisher = "Computational Complexity Foundation (CCF)",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191127-080702908",
    id = "https://authors.library.caltech.edu/records/fhv5w-h3x81",
    issn = "1433-8092",
    volume = "2009",
    pages = "Art. No. 107"
}


@article{https://authors.library.caltech.edu/records/fzepj-9xh02,
    authors = "Shaltiel, Ronen and Umans, Christopher",
    title = "Low-End Uniform Hardness versus Randomness Tradeoffs for AM",
    journal = "SIAM Journal on Computing",
    publisher = "Society for Industrial and Applied Mathematics",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20091023-111539349",
    id = "https://authors.library.caltech.edu/records/fzepj-9xh02",
    issn = "0097-5397",
    doi = "10.1137/070698348",
    volume = "39",
    number = "3",
    pages = "1006-1037"
}


@article{https://authors.library.caltech.edu/records/mw6pc-7dd24,
    authors = "Umans, Christopher",
    title = "Reconstructive Dispersers and Hitting Set Generators",
    journal = "Algorithmica",
    publisher = "Springer",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090901-145722580",
    id = "https://authors.library.caltech.edu/records/mw6pc-7dd24",
    issn = "0178-4617",
    doi = "10.1007/s00453-008-9266-z",
    volume = "55",
    number = "1",
    pages = "134-156"
}


@article{https://authors.library.caltech.edu/records/ydt3m-73k86,
    authors = "Buchfuhrer, David and Umans, Christopher",
    title = "Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms",
    journal = "Electronic Colloquium on Computational Complexity",
    publisher = "Computational Complexity Foundation (CCF)",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191127-082848396",
    id = "https://authors.library.caltech.edu/records/ydt3m-73k86",
    issn = "1433-8092",
    volume = "2009",
    pages = "Art. No. 68"
}


@article{https://authors.library.caltech.edu/records/jy06s-8qb83,
    authors = "Guruswami, Venkatesan and Umans, Christopher and Vadhan, Salil",
    title = "Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes",
    journal = "Journal of the ACM",
    publisher = "Association for Computing Machinery",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090817-144815953",
    id = "https://authors.library.caltech.edu/records/jy06s-8qb83",
    issn = "0004-5411",
    doi = "10.1145/1538902.1538904",
    volume = "56",
    number = "4",
    pages = "20"
}


@article{https://authors.library.caltech.edu/records/n1c9f-krc68,
    authors = "Asodi, Vera and Umans, Christopher",
    title = "The complexity of the matroid-greedoid partition problem",
    journal = "Theoretical Computer Science",
    publisher = "Elsevier",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090422-111344642",
    id = "https://authors.library.caltech.edu/records/n1c9f-krc68",
    issn = "0304-3975",
    doi = "10.1016/j.tcs.2008.11.019",
    volume = "410",
    number = "8-10",
    pages = "859-866"
}


@article{https://authors.library.caltech.edu/records/j8nbh-rcd32,
    authors = "Fortnow, Lance and Impagliazzo, Russell and Kabanets, Valentine and Umans, Christopher",
    title = "On the Complexity of Succinct Zero-Sum Games",
    journal = "Computational Complexity",
    publisher = "Springer",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:FORcc08",
    id = "https://authors.library.caltech.edu/records/j8nbh-rcd32",
    issn = "1016-3328",
    doi = "10.1007/s00037-008-0252-2",
    volume = "17",
    number = "3",
    pages = "353-376"
}


@article{https://authors.library.caltech.edu/records/hj5nx-af624,
    authors = "Kalyanaraman, Shankar and Umans, Christopher",
    title = "The Complexity of Rationalizing Matchings",
    journal = "Electronic Colloquium on Computational Complexity",
    publisher = "Computational Complexity Foundation (CCF)",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191127-084809601",
    id = "https://authors.library.caltech.edu/records/hj5nx-af624",
    issn = "1433-8092",
    pages = "Art. No. 21"
}


@article{https://authors.library.caltech.edu/records/z9v21-my692,
    authors = "Shaltiel, Ronen and Umans, Christopher",
    title = "Pseudorandomness for Approximate Counting and Sampling",
    journal = "Computational Complexity",
    publisher = "Springer",
    year = "2006",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110811-085055181",
    id = "https://authors.library.caltech.edu/records/z9v21-my692",
    issn = "1016-3328",
    doi = "10.1007/s00037-007-0218-9",
    volume = "15",
    number = "4",
    pages = "298-341"
}


@article{https://authors.library.caltech.edu/records/0rzht-sf015,
    authors = "Kalyanaraman, Shankar and Umans, Christopher",
    title = "On obtaining pseudorandomness from error-correcting codes",
    journal = "Electronic Colloquium on Computational Complexity",
    publisher = "Computational Complexity Foundation (CCF)",
    year = "2006",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190829-152850467",
    id = "https://authors.library.caltech.edu/records/0rzht-sf015",
    issn = "1433-8092",
    volume = "2006",
    pages = "TR06-128"
}


@article{https://authors.library.caltech.edu/records/pwqs2-7z819,
    authors = "Umans, Christopher and Villa, Tiziano and Sangiovanni-Vincentelli, Alberto L.",
    title = "Complexity of two-level logic minimization",
    journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
    publisher = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
    year = "2006",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:UMAieeetcadics06",
    id = "https://authors.library.caltech.edu/records/pwqs2-7z819",
    issn = "0278-0070",
    doi = "10.1109/TCAD.2005.855944",
    volume = "25",
    number = "7",
    pages = "1230-1246"
}


@article{https://authors.library.caltech.edu/records/9xmaq-tkq70,
    authors = "Shaltiel, Ronen and Umans, Christopher",
    title = "Simple extractors for all min-entropies and a new pseudorandom generator",
    journal = "Journal of the ACM",
    publisher = "Association for Computing Machinery",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161219-150257214",
    id = "https://authors.library.caltech.edu/records/9xmaq-tkq70",
    issn = "0004-5411",
    doi = "10.1145/1059513.1059516",
    volume = "52",
    number = "2",
    pages = "172-216"
}