Christopher Umans

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