Chris Umans

Citata da

	Tutte	Dal 2019
Citazioni	4232	1499
Indice H	29	21
i10-index	44	29

300

150

225

1999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202412 26 52 90 42 51 112 163 116 164 150 171 199 158 189 180 169 203 202 222 253 222 225 232 276 287

Accesso pubblico

Visualizza tutto

5 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Henry CohnSenior Principal Researcher, Microsoft Research New EnglandEmail verificata su microsoft.com
Ronen ShaltielProfessor of Computer Science, University of HaifaEmail verificata su cs.haifa.ac.il
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityEmail verificata su g.harvard.edu
Venkatesan GuruswamiUniversity of California, BerkeleyEmail verificata su berkeley.edu
Robert KleinbergDepartment of Computer Science, Cornell UniversityEmail verificata su cs.cornell.edu
Bill FeffermanUniversity of ChicagoEmail verificata su uchicago.edu
Joshua A. GrochowUniversity of Colorado BoulderEmail verificata su colorado.edu
Marcus SchaeferDePaul UniversityEmail verificata su cdm.depaul.edu
David ZuckermanProfessor of Computer Science, University of Texas at AustinEmail verificata su cs.utexas.edu
Thomas ChurchAssistant Professor, Stanford UniversityEmail verificata su math.stanford.edu
Emanuele ViolaProfessor of Computer Science, Northeastern UniversityEmail verificata su ccs.neu.edu
Tiziano VillaProfessore d'informatica, Universita' di VeronaEmail verificata su univr.it
Alberto Sangiovanni VincentelliProfessor of EECS, University of California, BerkeleyEmail verificata su eecs.berkeley.edu
Lance FortnowIllinois Institute of TechnologyEmail verificata su iit.edu
Elchanan MosselProfessor of Mathematics, MITEmail verificata su mit.edu
William LenhartProfessor of Computer Science, Williams CollegeEmail verificata su williams.edu
Will SawinPrinceton UniversityEmail verificata su math.columbia.edu
Noga AlonPrinceton University and Tel Aviv UniversityEmail verificata su tau.ac.il
Michael SchapiraProfessor of Computer Science, The Hebrew University of JerusalemEmail verificata su huji.ac.il
Shaddin DughmiAssociate Professor of Computer Science, University of Southern CaliforniaEmail verificata su usc.edu

Segui

Chris Umans

Professor of Computer Science, Caltech

Email verificata su cs.caltech.edu - Home page

Computational complexity randomness in computation algebraic complexity and algorithms


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	502	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	319	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	278*	2001
Fast polynomial factorization and modular composition KS Kedlaya, C Umans SIAM Journal on Computing 40 (6), 1767-1802, 2011	271	2011
Lossless condensers, unbalanced expanders, and extractors A Ta-Shma*, C Umans, D Zuckerman Combinatorica 27, 213-240, 2007	230*	2007
Completeness in the polynomial-time hierarchy: A compendium M Schaefer, C Umans SIGACT news 33 (3), 32-49, 2002	211	2002
The minimum equivalent DNF problem and shortest implicants C Umans Journal of Computer and System Sciences 63 (4), 597-611, 2001	195	2001
A group-theoretic approach to fast matrix multiplication H Cohn, C Umans 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003	181	2003
Pseudo-random generators for all hardnesses C Umans Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	168	2002
Hamiltonian cycles in solid grid graphs C Umans, W Lenhart Proceedings 38th Annual Symposium on Foundations of Computer Science, 496-505, 1997	167	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	136	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	128	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	102	1999
On sunflowers and matrix multiplication N Alon, A Shpilka, C Umans 2012 IEEE 27th Conference on Computational Complexity, 214-223, 2012	94	2012
Fast modular composition in any characteristic KS Kedlaya, C Umans 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 146-155, 2008	93	2008
Virtual otoscopy R Frankenthaler, V Moharir, R Kikinis, P van Kipshagen, F Jolesz, ... Otolaryngologic Clinics of North America 31 (2), 383-392, 1998	92	1998
The complexity of boolean formula minimization D Buchfuhrer, C Umans Journal of Computer and System Sciences 77 (1), 142-153, 2011	83	2011
Pseudorandomness for approximate counting and sampling R Shaltiel, C Umans computational complexity 15 (4), 298-341, 2006	80	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	79	2010
Fast matrix multiplication using coherent configurations H Cohn, C Umans Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013	60	2013

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori