Chris Umans
Chris Umans
Professor of Computer Science, Caltech
Verified email at - Homepage
Cited by
Cited by
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
V Guruswami, C Umans, S Vadhan
Journal of the ACM (JACM) 56 (4), 1-34, 2009
Group-theoretic algorithms for matrix multiplication
H Cohn, R Kleinberg, B Szegedy, C Umans
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 379-388, 2005
Simple extractors for all min-entropies and a new pseudo-random generator
R Shaltiel, C Umans
42nd IEEE Symposium on Foundations of Computer Science, 648-658, 2001
Fast polynomial factorization and modular composition
KS Kedlaya, C Umans
SIAM Journal on Computing 40 (6), 1767-1802, 2011
Lossless condensers, unbalanced expanders, and extractors
A Ta-Shma*, C Umans, D Zuckerman
Combinatorica 27, 213-240, 2007
Completeness in the polynomial-time hierarchy: A compendium
M Schaefer, C Umans
SIGACT news 33 (3), 32-49, 2002
The minimum equivalent DNF problem and shortest implicants
C Umans
Journal of Computer and System Sciences 63 (4), 597-611, 2001
A group-theoretic approach to fast matrix multiplication
H Cohn, C Umans
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
Pseudo-random generators for all hardnesses
C Umans
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
Hamiltonian cycles in solid grid graphs
C Umans, W Lenhart
Proceedings 38th Annual Symposium on Foundations of Computer Science, 496-505, 1997
Complexity of two-level logic minimization
C Umans, T Villa, AL Sangiovanni-Vincentelli
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2006
On cap sets and the group-theoretic approach to matrix multiplication
J Blasiak, T Church, H Cohn, JA Grochow, E Naslund, WF Sawin, ...
Discrete Analysis 2017 (3), 27 pp., 2017
Hardness of approximating/spl Sigma//sub 2//sup p/minimization problems
C Umans
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
Fast modular composition in any characteristic
KS Kedlaya, C Umans
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 146-155, 2008
Virtual otoscopy
R Frankenthaler, V Moharir, R Kikinis, P van Kipshagen, F Jolesz, ...
Otolaryngologic Clinics of North America 31 (2), 383-392, 1998
On sunflowers and matrix multiplication
N Alon, A Shpilka, C Umans
2012 IEEE 27th Conference on Computational Complexity, 214-223, 2012
The complexity of boolean formula minimization
D Buchfuhrer, C Umans
Journal of Computer and System Sciences 77 (1), 142-153, 2011
Pseudorandomness for approximate counting and sampling
R Shaltiel, C Umans
computational complexity 15 (4), 298-341, 2006
Inapproximability for VCG-based combinatorial auctions
D Buchfuhrer, S Dughmi, H Fu, R Kleinberg, E Mossel, C Papadimitriou, ...
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010
Fast matrix multiplication using coherent configurations
H Cohn, C Umans
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
The system can't perform the operation now. Try again later.
Articles 1–20