Chris Umans

Citirano

	Sve	Od 2019.
Citati	4186	1459
H-indeks	29	21
i10-indeks	44	28

280

140

210

1999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202412 26 52 87 42 51 112 163 116 164 150 171 199 157 189 180 169 202 202 222 253 222 225 232 274 248

Javni pristup

Prikaži sve

5 članaka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Henry CohnSenior Principal Researcher, Microsoft Research New EnglandPotvrđena adresa e-pošte na microsoft.com
Ronen ShaltielProfessor of Computer Science, University of HaifaPotvrđena adresa e-pošte na cs.haifa.ac.il
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityPotvrđena adresa e-pošte na g.harvard.edu
Venkatesan GuruswamiUniversity of California, BerkeleyPotvrđena adresa e-pošte na berkeley.edu
Robert KleinbergDepartment of Computer Science, Cornell UniversityPotvrđena adresa e-pošte na cs.cornell.edu
Bill FeffermanUniversity of ChicagoPotvrđena adresa e-pošte na uchicago.edu
Joshua A. GrochowUniversity of Colorado BoulderPotvrđena adresa e-pošte na colorado.edu
Marcus SchaeferDePaul UniversityPotvrđena adresa e-pošte na cdm.depaul.edu
David ZuckermanProfessor of Computer Science, University of Texas at AustinPotvrđena adresa e-pošte na cs.utexas.edu
Thomas ChurchAssistant Professor, Stanford UniversityPotvrđena adresa e-pošte na math.stanford.edu
Emanuele ViolaProfessor of Computer Science, Northeastern UniversityPotvrđena adresa e-pošte na ccs.neu.edu
Tiziano VillaProfessore d'informatica, Universita' di VeronaPotvrđena adresa e-pošte na univr.it
Alberto Sangiovanni VincentelliProfessor of EECS, University of California, BerkeleyPotvrđena adresa e-pošte na eecs.berkeley.edu
Lance FortnowIllinois Institute of TechnologyPotvrđena adresa e-pošte na iit.edu
Elchanan MosselProfessor of Mathematics, MITPotvrđena adresa e-pošte na mit.edu
William LenhartProfessor of Computer Science, Williams CollegePotvrđena adresa e-pošte na williams.edu
Will SawinPrinceton UniversityPotvrđena adresa e-pošte na math.columbia.edu
Noga AlonPrinceton University and Tel Aviv UniversityPotvrđena adresa e-pošte na tau.ac.il
Michael SchapiraProfessor of Computer Science, The Hebrew University of JerusalemPotvrđena adresa e-pošte na huji.ac.il
Shaddin DughmiAssociate Professor of Computer Science, University of Southern CaliforniaPotvrđena adresa e-pošte na usc.edu

Prati

Chris Umans

Professor of Computer Science, Caltech

Potvrđena adresa e-pošte na cs.caltech.edu - Početna stranica

Computational complexity randomness in computation algebraic complexity and algorithms


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
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	495	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	316	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	277*	2001
Fast polynomial factorization and modular composition KS Kedlaya, C Umans SIAM Journal on Computing 40 (6), 1767-1802, 2011	267	2011
Lossless condensers, unbalanced expanders, and extractors A Ta-Shma*, C Umans, D Zuckerman Combinatorica 27, 213-240, 2007	228*	2007
Completeness in the polynomial-time hierarchy: A compendium M Schaefer, C Umans SIGACT news 33 (3), 32-49, 2002	208	2002
The minimum equivalent DNF problem and shortest implicants C Umans Journal of Computer and System Sciences 63 (4), 597-611, 2001	192	2001
A group-theoretic approach to fast matrix multiplication H Cohn, C Umans 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003	179	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	164	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	135	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	127	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	101	1999
On sunflowers and matrix multiplication N Alon, A Shpilka, C Umans 2012 IEEE 27th Conference on Computational Complexity, 214-223, 2012	93	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	81	2011
Pseudorandomness for approximate counting and sampling R Shaltiel, C Umans computational complexity 15 (4), 298-341, 2006	79	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	77	2010
Fast matrix multiplication using coherent configurations H Cohn, C Umans Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013	59	2013

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori