 | 2009 |
|---|
| 44 |       | Christopher Umans:
Reconstructive Dispersers and Hitting Set Generators.
Algorithmica 55(1): 134-156 (2009) |
| 43 | | Venkatesan Guruswami,
Christopher Umans,
Salil P. Vadhan:
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes.
J. ACM 56(4): (2009) |
| 42 | | Vera Asodi,
Christopher Umans:
The complexity of the matroid-greedoid partition problem.
Theor. Comput. Sci. 410(8-10): 859-866 (2009) |
| 2008 |
|---|
| 41 | | Kiran S. Kedlaya,
Christopher Umans:
Fast Modular Composition in any Characteristic.
FOCS 2008: 146-155 |
| 40 | | David Buchfuhrer,
Christopher Umans:
The Complexity of Boolean Formula Minimization.
ICALP (1) 2008: 24-35 |
| 39 | | Shankar Kalyanaraman,
Christopher Umans:
The Complexity of Rationalizing Matchings.
ISAAC 2008: 171-182 |
| 38 | | Christopher Umans:
Fast polynomial factorization and modular composition in small characteristic.
STOC 2008: 481-490 |
| 37 | | Lance Fortnow,
Russell Impagliazzo,
Valentine Kabanets,
Christopher Umans:
On the Complexity of Succinct Zero-Sum Games.
Computational Complexity 17(3): 353-376 (2008) |
| 36 | | Shankar Kalyanaraman,
Christopher Umans:
The Complexity of Rationalizing Matchings.
Electronic Colloquium on Computational Complexity (ECCC) 15(021): (2008) |
| 2007 |
|---|
| 35 | | Shankar Kalyanaraman,
Christopher Umans:
Algorithms for Playing Games with Limited Randomness.
ESA 2007: 323-334 |
| 34 | | Venkatesan Guruswami,
Christopher Umans,
Salil P. Vadhan:
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes.
IEEE Conference on Computational Complexity 2007: 96-108 |
| 33 | | Ronen Shaltiel,
Christopher Umans:
Low-end uniform hardness vs. randomness tradeoffs for AM.
STOC 2007: 430-439 |
| 32 | | Amnon Ta-Shma,
Christopher Umans,
David Zuckerman:
Lossless Condensers, Unbalanced Expanders, And Extractors.
Combinatorica 27(2): 213-240 (2007) |
| 31 | | Shankar Kalyanaraman,
Christopher Umans:
Algorithms for Playing Games with Limited Randomness.
Electronic Colloquium on Computational Complexity (ECCC) 14(059): (2007) |
| 30 | | Ronen Shaltiel,
Christopher Umans:
Low-end uniform hardness vs. randomness tradeoffs for AM.
Electronic Colloquium on Computational Complexity (ECCC) 14(069): (2007) |
| 2006 |
|---|
| 29 | | Amnon Ta-Shma,
Christopher Umans:
Better lossless condensers through derandomized curve samplers.
FOCS 2006: 177-186 |
| 28 | | Shankar Kalyanaraman,
Christopher Umans:
On Obtaining Pseudorandomness from Error-Correcting Codes.
FSTTCS 2006: 105-116 |
| 27 | | Christopher Umans:
Group-theoretic algorithms for matrix multiplication.
ISSAC 2006: 5 |
| 26 | | Christopher Umans:
Optimization Problems in the Polynomial-Time Hierarchy.
TAMC 2006: 345-355 |
| 25 | | Ronen Shaltiel,
Christopher Umans:
Pseudorandomness for Approximate Counting and Sampling.
Computational Complexity 15(4): 298-341 (2006) |
| 24 | | Shankar Kalyanaraman,
Christopher Umans:
On obtaining pseudorandomness from error-correcting codes..
Electronic Colloquium on Computational Complexity (ECCC) 13(128): (2006) |
| 23 | | Venkatesan Guruswami,
Christopher Umans,
Salil P. Vadhan:
Extractors and condensers from univariate polynomials.
Electronic Colloquium on Computational Complexity (ECCC) 13(134): (2006) |
| 22 | | Christopher Umans,
Tiziano Villa,
Alberto L. Sangiovanni-Vincentelli:
Complexity of two-level logic minimization.
IEEE Trans. on CAD of Integrated Circuits and Systems 25(7): 1230-1246 (2006) |
| 2005 |
|---|
| 21 | | Christopher Umans:
Reconstructive Dispersers and Hitting Set Generators.
APPROX-RANDOM 2005: 460-471 |
| 20 | | Henry Cohn,
Robert D. Kleinberg,
Balázs Szegedy,
Christopher Umans:
Group-theoretic Algorithms for Matrix Multiplication.
FOCS 2005: 379-388 |
| 19 | | Ronen Shaltiel,
Christopher Umans:
Pseudorandomness for Approximate Counting and Sampling.
IEEE Conference on Computational Complexity 2005: 212-226 |
| 18 | | Lance Fortnow,
Russell Impagliazzo,
Valentine Kabanets,
Christopher Umans:
On the Complexity of Succinct Zero-Sum Games.
IEEE Conference on Computational Complexity 2005: 323-332 |
| 17 | | Ronen Shaltiel,
Christopher Umans:
Simple extractors for all min-entropies and a new pseudorandom generator.
J. ACM 52(2): 172-216 (2005) |
| 2004 |
|---|
| 16 | | Lance Fortnow,
Russell Impagliazzo,
Valentine Kabanets,
Christopher Umans:
On the complexity of succinct zero-sum games
Electronic Colloquium on Computational Complexity (ECCC)(001): (2004) |
| 15 | | Ronen Shaltiel,
Christopher Umans:
Pseudorandomness for Approximate Counting and Sampling
Electronic Colloquium on Computational Complexity (ECCC)(086): (2004) |
| 2003 |
|---|
| 14 | | Henry Cohn,
Christopher Umans:
A Group-Theoretic Approach to Fast Matrix Multiplication.
FOCS 2003: 438-449 |
| 13 | | Christopher Umans:
Pseudo-random generators for all hardnesses.
J. Comput. Syst. Sci. 67(2): 419-440 (2003) |
| 2002 |
|---|
| 12 | | Christopher Umans:
Pseudo-Random Generators for All Hardnesses.
IEEE Conference on Computational Complexity 2002: 11 |
| 11 | | Christopher Umans:
Pseudo-random generators for all hardnesses.
STOC 2002: 627-634 |
| 10 | | Elchanan Mossel,
Christopher Umans:
On the complexity of approximating the VC dimension.
J. Comput. Syst. Sci. 65(4): 660-671 (2002) |
| 2001 |
|---|
| 9 |  | Ronen Shaltiel,
Christopher Umans:
Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator.
FOCS 2001: 648-657 |
| 8 | | Elchanan Mossel,
Christopher Umans:
On the Complexity of Approximating the VC Dimension.
IEEE Conference on Computational Complexity 2001: 220-225 |
| 7 | | Amnon Ta-Shma,
Christopher Umans,
David Zuckerman:
Loss-less condensers, unbalanced expanders, and extractors.
STOC 2001: 143-152 |
| 6 | | Christopher Umans:
The Minimum Equivalent DNF Problem and Shortest Implicants.
J. Comput. Syst. Sci. 63(4): 597-611 (2001) |
| 1999 |
|---|
| 5 | | Christopher Umans:
Hardness of Approximating Sigma2p Minimization Problems.
FOCS 1999: 465-474 |
| 4 | | Christopher Umans:
On the Complexity and Inapproximability of Shortest Implicant Problems.
ICALP 1999: 687-696 |
| 1998 |
|---|
| 3 | | Christopher Umans:
The Minimum Equivalent DNF Problem and Shortest Implicants.
FOCS 1998: 556-563 |
| 2 | | Polina Golland,
Ron Kikinis,
Christopher Umans,
Michael Halle,
Martha Elizabeth Shenton,
Jens A. Richolt:
AnatomyBrowser: A Framework for Integration of Medical Information.
MICCAI 1998: 720-731 |
| 1997 |
|---|
| 1 | | Christopher Umans,
William Lenhart:
Hamiltonian Cycles in Solid Grid Graphs.
FOCS 1997: 496-505 |
