Chris Umans

Citée par

	Toutes	Depuis 2020
Citations	4304	1313
indice h	29	21
indice i10	46	29

340

170

255

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202512 26 52 90 42 51 112 163 116 164 150 171 199 158 189 181 168 203 202 222 254 226 226 225 281 328 27

Accès public

Tout afficher

5 articles

0 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Henry CohnSenior Principal Researcher, Microsoft Research New EnglandAdresse e-mail validée de microsoft.com
Ronen ShaltielProfessor of Computer Science, University of HaifaAdresse e-mail validée de cs.haifa.ac.il
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityAdresse e-mail validée de g.harvard.edu
Venkatesan GuruswamiUniversity of California, BerkeleyAdresse e-mail validée de berkeley.edu
Joshua A. GrochowUniversity of Colorado BoulderAdresse e-mail validée de colorado.edu
Robert KleinbergDepartment of Computer Science, Cornell UniversityAdresse e-mail validée de cs.cornell.edu
Bill FeffermanUniversity of ChicagoAdresse e-mail validée de uchicago.edu
Marcus SchaeferDePaul UniversityAdresse e-mail validée de cdm.depaul.edu
David ZuckermanProfessor of Computer Science, University of Texas at AustinAdresse e-mail validée de cs.utexas.edu
Thomas ChurchAssistant Professor, Stanford UniversityAdresse e-mail validée de math.stanford.edu
Emanuele ViolaProfessor of Computer Science, Northeastern UniversityAdresse e-mail validée de ccs.neu.edu
Tiziano VillaProfessore d'informatica, Universita' di VeronaAdresse e-mail validée de univr.it
Alberto Sangiovanni VincentelliProfessor of EECS, University of California, BerkeleyAdresse e-mail validée de eecs.berkeley.edu
Lance FortnowIllinois Institute of TechnologyAdresse e-mail validée de iit.edu
Elchanan MosselProfessor of Mathematics, MITAdresse e-mail validée de mit.edu
William LenhartProfessor of Computer Science, Williams CollegeAdresse e-mail validée de williams.edu
Will SawinPrinceton UniversityAdresse e-mail validée de math.columbia.edu
Noga AlonPrinceton University and Tel Aviv UniversityAdresse e-mail validée de tau.ac.il
Michael SchapiraProfessor of Computer Science, The Hebrew University of JerusalemAdresse e-mail validée de huji.ac.il
Shaddin DughmiAssociate Professor of Computer Science, University of Southern CaliforniaAdresse e-mail validée de usc.edu

Suivre

Chris Umans

Professor of Computer Science, Caltech

Adresse e-mail validée de cs.caltech.edu - Page d'accueil

Computational complexity randomness in computation algebraic complexity and algorithms


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	509	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	322	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	283*	2001
Fast polynomial factorization and modular composition KS Kedlaya, C Umans SIAM Journal on Computing 40 (6), 1767-1802, 2011	281	2011
Lossless condensers, unbalanced expanders, and extractors A Ta-Shma*, C Umans, D Zuckerman Combinatorica 27, 213-240, 2007	232*	2007
Completeness in the polynomial-time hierarchy: A compendium M Schaefer, C Umans SIGACT news 33 (3), 32-49, 2002	212	2002
The minimum equivalent DNF problem and shortest implicants C Umans Journal of Computer and System Sciences 63 (4), 597-611, 2001	197	2001
A group-theoretic approach to fast matrix multiplication H Cohn, C Umans 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003	185	2003
Pseudo-random generators for all hardnesses C Umans Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	171	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	137	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	132	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	103	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	91	1998
The complexity of boolean formula minimization D Buchfuhrer, C Umans Journal of Computer and System Sciences 77 (1), 142-153, 2011	85	2011
Pseudorandomness for approximate counting and sampling R Shaltiel, C Umans computational complexity 15 (4), 298-341, 2006	84	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	61	2013

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs