Chris Umans

Cited by

	All	Since 2016
Citations	3219	1170
h-index	28	19
i10-index	38	26

260

130

195

19981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202110 11 24 46 84 37 57 104 155 106 160 152 178 206 148 196 171 159 199 200 230 249 232 58

Co-authors

Ronen ShaltielProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il
Henry CohnSenior Principal Researcher, Microsoft Research New EnglandVerified email at microsoft.com
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityVerified email at g.harvard.edu
Venkatesan GuruswamiCarnegie Mellon UniversityVerified email at cmu.edu
Robert KleinbergDepartment of Computer Science, Cornell UniversityVerified email at cs.cornell.edu
Marcus SchaeferDePaul UniversityVerified email at cdm.depaul.edu
David ZuckermanProfessor of Computer Science, University of Texas at AustinVerified email at cs.utexas.edu
Lance FortnowIllinois Institute of TechnologyVerified email at iit.edu
Bill FeffermanUniversity of ChicagoVerified email at uchicago.edu
Elchanan MosselProfessor of Mathematics, MITVerified email at mit.edu
Tiziano VillaProfessore d'informatica, Universita' di VeronaVerified email at univr.it
Alberto Sangiovanni VincentelliProfessor of EECS, University of California, BerkeleyVerified email at eecs.berkeley.edu
Emanuele ViolaProfessor of Computer Science, Northeastern UniversityVerified email at ccs.neu.edu
Noga AlonPrinceton University and Tel Aviv UniversityVerified email at tau.ac.il
Joshua A. GrochowUniversity of Colorado BoulderVerified email at colorado.edu
Thomas ChurchAssistant Professor, Stanford UniversityVerified email at math.stanford.edu
Russell ImpagliazzoUC, San DiegoVerified email at eng.ucsd.edu
William LenhartProfessor of Computer Science, Williams CollegeVerified email at williams.edu
Will SawinClay Mathematics Institute / Columbia UniversityVerified email at math.columbia.edu
Michael SchapiraProfessor of Computer Science, The Hebrew University of JerusalemVerified email at huji.ac.il

Chris Umans

Professor of Computer Science, Caltech

Verified email at cs.caltech.edu - Homepage

Computational complexity randomness in computation algebraic complexity and algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	394	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	269	2005
Simple extractors for all min-entropies and a new pseudorandom generator R Shaltiel, C Umans Journal of the ACM (JACM) 52 (2), 172-216, 2005	231*	2005
Lossless condensers, unbalanced expanders, and extractors A Ta-Shma, C Umans, D Zuckerman Combinatorica 27 (2), 213-240, 2007	186*	2007
Completeness in the polynomial-time hierarchy: A compendium M Schaefer, C Umans SIGACT news 33 (3), 32-49, 2002	168	2002
The minimum equivalent DNF problem and shortest implicants C Umans Journal of Computer and System Sciences 63 (4), 597-611, 2001	164	2001
Fast polynomial factorization and modular composition KS Kedlaya, C Umans SIAM Journal on Computing 40 (6), 1767-1802, 2011	152	2011
A group-theoretic approach to fast matrix multiplication H Cohn, C Umans 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003	152	2003
Pseudo-random generators for all hardnesses C Umans Journal of Computer and System Sciences 67 (2), 419-440, 2003	134	2003
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	128	2001
Hamiltonian cycles in solid grid graphs C Umans, W Lenhart Proceedings 38th Annual Symposium on Foundations of Computer Science, 496-505, 1997	113	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	94	2006
Virtual otoscopy R Frankenthaler, V Moharir, R Kikinis, P van Kipshagen, F Jolesz, ... Otolaryngologic Clinics of North America 31 (2), 383-392, 1998	86	1998
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	80	1999
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	75	2017
On sunflowers and matrix multiplication N Alon, A Shpilka, C Umans 2012 IEEE 27th Conference on Computational Complexity, 214-223, 2012	74	2012
Fast modular composition in any characteristic KS Kedlaya, C Umans 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 146-155, 2008	69	2008
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	67	2010
Pseudorandomness for approximate counting and sampling R Shaltiel, C Umans computational complexity 15 (4), 298-341, 2006	64	2006
The complexity of boolean formula minimization D Buchfuhrer, C Umans Journal of Computer and System Sciences 77 (1), 142-153, 2011	57	2011

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors