Umans, Christopher

Article from CaltechAUTHORS

• Umans, Christopher M. (2024) Fast Generalized DFTs for All Finite Groups; SIAM Journal on Computing; FOCS19-398-FOCS19-419; 10.1137/20m1316342
• Hsu, Chloe Ching-Yun and Umans, Chris (2019) A New Algorithm for Fast Generalized DFTs; ACM Transactions on Algorithms; Vol. 16; No. 1; Art. No. 4; 10.1145/3301313
• Bläser, Markus and Kabanets, Valentine, et el. (2018) Algebraic Methods in Computational Complexity; Dagstuhl Reports; Vol. 8; No. 9; 133-153; 10.4230/DagRep.8.9.133
• Blasiak, Jonah and Church, Thomas, et el. (2017) On cap sets and the group-theoretic approach to matrix multiplication; Discrete Analysis; Vol. 2017; No. 3; 1-27; 10.19086/da.1245
• Kabanets, Valentine and Thierauf, Thomas, et el. (2016) Algebraic and Combinatorial Methods in Computational Complexity; Dagstuhl Reports; Vol. 6; No. 10; 13-32; 10.4230/DagRep.6.10.13
• Agrawal, Manindra and Kabanets, Valentine, et el. (2014) Algebra in Computational Complexity; Dagstuhl Reports; Vol. 4; No. 9; 85-105; 10.4230/DagRep.4.9.85
• Umans, Christopher (2014) Special Issue "Conference on Computational Complexity 2013" Guest editor's foreword; Computational Complexity; Vol. 23; No. 2; 147-149; 10.1007/s00037-014-0088-x
• Fefferman, Bill and Shaltiel, Ronen, et el. (2013) On Beating the Hybrid Argument; Theory of Computing; Vol. 9; No. 1; 809-843; 10.4086/toc.2013.v009a026
• Alon, Noga and Shpilka, Amir, et el. (2013) On sunflowers and matrix multiplication; Computational Complexity; Vol. 22; No. 2; 219-243; 10.1007/s00037-013-0060-1
• Immorlica, Nicole and Katz, Jonathan N., et el. (2012) Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009); SIAM Journal on Computing; Vol. 41; No. 6; 1591-1592; 10.1137/120973305
• Agrawal, Manindra and Thierauf, Thomas, et el. (2012) Algebraic and Combinatorial Methods in Computational Complexity; Dagstuhl Reports; Vol. 2; No. 10; 60-78; 10.4230/DagRep.2.10.60
• Kedlaya, Kiran S. and Umans, Christopher (2011) Fast Polynomial Factorization and Modular Composition; SIAM Journal on Computing; Vol. 40; No. 6; 1767-1802; 10.1137/08073408X
• Alon, Noga and Shpilka, Amir, et el. (2011) On Sunflowers and Matrix Multiplication; Electronic Colloquium on Computational Complexity; Vol. 2011; Art. No. 67
• Buchfuhrer, David and Umans, Christopher (2011) The complexity of Boolean formula minimization; Journal of Computer and System Sciences; Vol. 77; No. 1; 142-153; 10.1016/j.jcss.2010.06.011
• Fefferman, Bill and Umans, Christopher, et el. (2010) On beating the hybrid argument; Electronic Colloquium on Computational Complexity; Vol. 2010; Art. No. 186
• Lee, James R. and Umans, Chris (2010) Special Section On Foundations of Computer Science; SIAM Journal on Computing; Vol. 39; No. 6; 2397-2397; 10.1137/smjcat000039000006002397000001
• Kalyanaraman, Shankar and Umans, Christopher (2009) The Complexity of Rationalizing Network Formation; Electronic Colloquium on Computational Complexity; Vol. 2009; Art. No. 145
• Dick, Kevin and Umans, Christopher (2009) Improved inapproximability factors for some Σ^p₂ minimization problems; Electronic Colloquium on Computational Complexity; Vol. 2009; Art. No. 107
• Shaltiel, Ronen and Umans, Christopher (2009) Low-End Uniform Hardness versus Randomness Tradeoffs for AM; SIAM Journal on Computing; Vol. 39; No. 3; 1006-1037; 10.1137/070698348
• Umans, Christopher (2009) Reconstructive Dispersers and Hitting Set Generators; Algorithmica; Vol. 55; No. 1; 134-156; 10.1007/s00453-008-9266-z
• Buchfuhrer, David and Umans, Christopher (2009) Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms; Electronic Colloquium on Computational Complexity; Vol. 2009; Art. No. 68
• Guruswami, Venkatesan and Umans, Christopher, et el. (2009) Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes; Journal of the ACM; Vol. 56; No. 4; 20; 10.1145/1538902.1538904
• Asodi, Vera and Umans, Christopher (2009) The complexity of the matroid-greedoid partition problem; Theoretical Computer Science; Vol. 410; No. 8-10; 859-866; 10.1016/j.tcs.2008.11.019
• Fortnow, Lance and Impagliazzo, Russell, et el. (2008) On the Complexity of Succinct Zero-Sum Games; Computational Complexity; Vol. 17; No. 3; 353-376; 10.1007/s00037-008-0252-2
• Kalyanaraman, Shankar and Umans, Christopher (2008) The Complexity of Rationalizing Matchings; Electronic Colloquium on Computational Complexity; Art. No. 21
• Shaltiel, Ronen and Umans, Christopher (2006) Pseudorandomness for Approximate Counting and Sampling; Computational Complexity; Vol. 15; No. 4; 298-341; 10.1007/s00037-007-0218-9
• Kalyanaraman, Shankar and Umans, Christopher (2006) On obtaining pseudorandomness from error-correcting codes; Electronic Colloquium on Computational Complexity; Vol. 2006; TR06-128
• Umans, Christopher and Villa, Tiziano, et el. (2006) Complexity of two-level logic minimization; IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems; Vol. 25; No. 7; 1230-1246; 10.1109/TCAD.2005.855944
• Shaltiel, Ronen and Umans, Christopher (2005) Simple extractors for all min-entropies and a new pseudorandom generator; Journal of the ACM; Vol. 52; No. 2; 172-216; 10.1145/1059513.1059516