Christopher Umans

Publication Activity (10 Years)

Years Active: 1997-2018
Publications (10 Years): 3

Top Topics

Computational Complexity

Benchmark Datasets

Top Venues

Dagstuhl Reports

Comput. Complex.

Computational Complexity Conference

Publications

Markus Bläser, Valentine Kabanets, Jacobo Torán, Christopher Umans
Algebraic Methods in Computational Complexity (Dagstuhl Seminar 18391). Dagstuhl Reports 8 (9) (2018)
Valentine Kabanets, Thomas Thierauf, Jacobo Torán, Christopher Umans
Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411). Dagstuhl Reports 6 (10) (2016)
Bill Fefferman, Christopher Umans
On the Power of Quantum Fourier Sampling. TQC (2016)
Christopher Umans
Special Issue "Conference on Computational Complexity 2013" Guest editor's foreword. Comput. Complex. 23 (2) (2014)
Manindra Agrawal, Valentine Kabanets, Thomas Thierauf, Christopher Umans
Algebra in Computational Complexity (Dagstuhl Seminar 14391). Dagstuhl Reports 4 (9) (2014)
Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola
On Beating the Hybrid Argument. Theory Comput. 9 (2013)
Henry Cohn, Christopher Umans
Fast matrix multiplication using coherent configurations. SODA (2013)
Noga Alon, Amir Shpilka, Christopher Umans
On sunflowers and matrix multiplication. Comput. Complex. 22 (2) (2013)
Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola
On beating the hybrid argument. ITCS (2012)
Noga Alon, Amir Shpilka, Christopher Umans
On Sunflowers and Matrix Multiplication. Computational Complexity Conference (2012)
Amnon Ta-Shma, Christopher Umans
Better Condensers and New Extractors from Parvaresh-Vardy Codes. Computational Complexity Conference (2012)
Henry Cohn, Christopher Umans
Fast matrix multiplication using coherent configurations CoRR (2012)
Manindra Agrawal, Thomas Thierauf, Christopher Umans
Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421). Dagstuhl Reports 2 (10) (2012)
Kiran S. Kedlaya, Christopher Umans
Fast Polynomial Factorization and Modular Composition. SIAM J. Comput. 40 (6) (2011)
Noga Alon, Amir Shpilka, Christopher Umans
On Sunflowers and Matrix Multiplication. Electron. Colloquium Comput. Complex. 18 (2011)
David Buchfuhrer, Christopher Umans
The complexity of Boolean formula minimization. J. Comput. Syst. Sci. 77 (1) (2011)
Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola
On beating the hybrid argument. Electron. Colloquium Comput. Complex. 17 (2010)
James R. Lee, Christopher Umans
Special Section On Foundations of Computer Science. SIAM J. Comput. 39 (6) (2010)
David Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer, Christopher Umans
Inapproximability for VCG-Based Combinatorial Auctions. SODA (2010)
Bill Fefferman, Christopher Umans
Pseudorandom generators and the BQP vs. PH problem CoRR (2010)
Christopher Umans
Reconstructive Dispersers and Hitting Set Generators. Algorithmica 55 (1) (2009)
Ronen Shaltiel, Christopher Umans
Low-End Uniform Hardness versus Randomness Tradeoffs for AM. SIAM J. Comput. 39 (3) (2009)
Shankar Kalyanaraman, Christopher Umans
The Complexity of Rationalizing Network Formation. Electron. Colloquium Comput. Complex. 16 (2009)
David Buchfuhrer, Christopher Umans
Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms. Electron. Colloquium Comput. Complex. 16 (2009)
Manindra Agrawal, Lance Fortnow, Thomas Thierauf, Christopher Umans
09421 Abstracts Collection - Algebraic Methods in Computational Complexity. Algebraic Methods in Computational Complexity (2009)
Manindra Agrawal, Lance Fortnow, Thomas Thierauf, Christopher Umans
09421 Executive Summary - Algebraic Methods in Computational Complexity. Algebraic Methods in Computational Complexity (2009)
Shankar Kalyanaraman, Christopher Umans
The Complexity of Rationalizing Network Formation. FOCS (2009)
Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. J. ACM 56 (4) (2009)
Kevin Dick, Christopher Umans
minimization problems. Electron. Colloquium Comput. Complex. 16 (2009)
Vera Asodi, Christopher Umans
The complexity of the matroid-greedoid partition problem. Theor. Comput. Sci. 410 (8-10) (2009)
Shankar Kalyanaraman, Christopher Umans
The Complexity of Rationalizing Matchings. Electron. Colloquium Comput. Complex. 15 (021) (2008)
Kiran S. Kedlaya, Christopher Umans
Fast Modular Composition in any Characteristic. FOCS (2008)
Shankar Kalyanaraman, Christopher Umans
The Complexity of Rationalizing Matchings. ISAAC (2008)
Christopher Umans
Fast polynomial factorization and modular composition in small characteristic. STOC (2008)
David Buchfuhrer, Christopher Umans
The Complexity of Boolean Formula Minimization. ICALP (1) (2008)
Kiran S. Kedlaya, Christopher Umans
Fast polynomial factorization and modular composition. Computational Complexity of Discrete Problems (2008)
Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans
On the Complexity of Succinct Zero-Sum Games. Comput. Complex. 17 (3) (2008)
Shankar Kalyanaraman, Christopher Umans
Algorithms for Playing Games with Limited Randomness. Electron. Colloquium Comput. Complex. 14 (059) (2007)
Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. Computational Complexity Conference (2007)
Ronen Shaltiel, Christopher Umans
Low-end uniform hardness vs. randomness tradeoffs for AM. STOC (2007)
Ronen Shaltiel, Christopher Umans
Low-end uniform hardness vs. randomness tradeoffs for AM. Electron. Colloquium Comput. Complex. 14 (069) (2007)
Shankar Kalyanaraman, Christopher Umans
Algorithms for Playing Games with Limited Randomness. ESA (2007)
Amnon Ta-Shma, Christopher Umans, David Zuckerman
Lossless Condensers, Unbalanced Expanders, And Extractors. Comb. 27 (2) (2007)
Amnon Ta-Shma, Christopher Umans
Better lossless condensers through derandomized curve samplers. FOCS (2006)
Christopher Umans
Optimization Problems in the Polynomial-Time Hierarchy. TAMC (2006)
Christopher Umans, Tiziano Villa, Alberto L. Sangiovanni-Vincentelli
Complexity of two-level logic minimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25 (7) (2006)
Shankar Kalyanaraman, Christopher Umans
On obtaining pseudorandomness from error-correcting codes.. Electron. Colloquium Comput. Complex. 13 (128) (2006)
Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan
Extractors and condensers from univariate polynomials. Electron. Colloquium Comput. Complex. 13 (134) (2006)
Shankar Kalyanaraman, Christopher Umans
On Obtaining Pseudorandomness from Error-Correcting Codes. FSTTCS (2006)
Christopher Umans
Group-theoretic algorithms for matrix multiplication. ISSAC (2006)
Ronen Shaltiel, Christopher Umans
Pseudorandomness for Approximate Counting and Sampling. Comput. Complex. 15 (4) (2006)
Ronen Shaltiel, Christopher Umans
Simple extractors for all min-entropies and a new pseudorandom generator. J. ACM 52 (2) (2005)
Henry Cohn, Robert D. Kleinberg, Balázs Szegedy, Christopher Umans
Group-theoretic Algorithms for Matrix Multiplication. FOCS (2005)
Christopher Umans
Reconstructive Dispersers and Hitting Set Generators. APPROX-RANDOM (2005)
Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans
On the Complexity of Succinct Zero-Sum Games. Computational Complexity Conference (2005)
Ronen Shaltiel, Christopher Umans
Pseudorandomness for Approximate Counting and Sampling. Computational Complexity Conference (2005)
Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans
On the complexity of succinct zero-sum games Electron. Colloquium Comput. Complex. (001) (2004)
Ronen Shaltiel, Christopher Umans
Pseudorandomness for Approximate Counting and Sampling Electron. Colloquium Comput. Complex. (086) (2004)
Henry Cohn, Christopher Umans
A Group-Theoretic Approach to Fast Matrix Multiplication. FOCS (2003)
Christopher Umans
Pseudo-random generators for all hardnesses. J. Comput. Syst. Sci. 67 (2) (2003)
Elchanan Mossel, Christopher Umans
On the complexity of approximating the VC dimension. J. Comput. Syst. Sci. 65 (4) (2002)
Christopher Umans
Pseudo-random generators for all hardnesses. STOC (2002)
Christopher Umans
Pseudo-Random Generators for All Hardnesses. Computational Complexity Conference (2002)
Elchanan Mossel, Christopher Umans
On the Complexity of Approximating the VC Dimension. Computational Complexity Conference (2001)
Ronen Shaltiel, Christopher Umans
Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator. FOCS (2001)
Amnon Ta-Shma, Christopher Umans, David Zuckerman
Loss-less condensers, unbalanced expanders, and extractors. STOC (2001)
Christopher Umans
The Minimum Equivalent DNF Problem and Shortest Implicants. J. Comput. Syst. Sci. 63 (4) (2001)
Christopher Umans
On the Complexity and Inapproximability of Shortest Implicant Problems. ICALP (1999)
Christopher Umans
Minimization Problems. FOCS (1999)
Polina Golland, Ron Kikinis, Christopher Umans, Michael Halle, Martha Elizabeth Shenton, Jens A. Richolt
AnatomyBrowser: A Framework for Integration of Medical Information. MICCAI (1998)
Christopher Umans
The Minimum Equivalent DNF Problem and Shortest Implicants. FOCS (1998)
Christopher Umans, William Lenhart
Hamiltonian Cycles in Solid Grid Graphs. FOCS (1997)