Chris Umans

Citace

	Všechny	Od 2020
Citace	4338	1334
h-index	30	21
i10-index	45	29

340

170

255

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202513 27 52 86 42 54 118 164 111 166 149 177 197 162 185 181 168 206 200 225 258 226 229 222 273 336 48

Veřejný přístup

Zobrazit všechny

5 článků

0 článků

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Henry CohnSenior Principal Researcher, Microsoft Research New EnglandE-mailová adresa ověřena na: microsoft.com
Ronen ShaltielProfessor of Computer Science, University of HaifaE-mailová adresa ověřena na: cs.haifa.ac.il
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityE-mailová adresa ověřena na: g.harvard.edu
Venkatesan GuruswamiUniversity of California, BerkeleyE-mailová adresa ověřena na: berkeley.edu
Bill FeffermanUniversity of ChicagoE-mailová adresa ověřena na: uchicago.edu
Joshua A. GrochowUniversity of Colorado BoulderE-mailová adresa ověřena na: colorado.edu
Robert KleinbergDepartment of Computer Science, Cornell UniversityE-mailová adresa ověřena na: cs.cornell.edu
Marcus SchaeferDePaul UniversityE-mailová adresa ověřena na: cdm.depaul.edu
David ZuckermanProfessor of Computer Science, University of Texas at AustinE-mailová adresa ověřena na: cs.utexas.edu
Emanuele ViolaProfessor of Computer Science, Northeastern UniversityE-mailová adresa ověřena na: ccs.neu.edu
Thomas ChurchAssistant Professor, Stanford UniversityE-mailová adresa ověřena na: math.stanford.edu
Lance FortnowIllinois Institute of TechnologyE-mailová adresa ověřena na: iit.edu
Tiziano VillaProfessore d'informatica, Universita' di VeronaE-mailová adresa ověřena na: univr.it
Alberto Sangiovanni VincentelliProfessor of EECS, University of California, BerkeleyE-mailová adresa ověřena na: eecs.berkeley.edu
Elchanan MosselProfessor of Mathematics, MITE-mailová adresa ověřena na: mit.edu
Yaron SingerHarvard UniversityE-mailová adresa ověřena na: seas.harvard.edu
William LenhartProfessor of Computer Science, Williams CollegeE-mailová adresa ověřena na: williams.edu
Will SawinPrinceton UniversityE-mailová adresa ověřena na: math.columbia.edu
Noga AlonPrinceton University and Tel Aviv UniversityE-mailová adresa ověřena na: tau.ac.il
Michael SchapiraProfessor of Computer Science, The Hebrew University of JerusalemE-mailová adresa ověřena na: huji.ac.il

Sledovat

Chris Umans

Professor of Computer Science, Caltech

E-mailová adresa ověřena na: cs.caltech.edu - Domovská stránka

Computational complexity randomness in computation algebraic complexity and algorithms


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
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
Fast polynomial factorization and modular composition KS Kedlaya, C Umans SIAM Journal on Computing 40 (6), 1767-1802, 2011	288	2011
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	284*	2001
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	211	2002
The minimum equivalent DNF problem and shortest implicants C Umans Journal of Computer and System Sciences 63 (4), 597-611, 2001	198	2001
A group-theoretic approach to fast matrix multiplication H Cohn, C Umans 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003	188	2003
Pseudo-random generators for all hardnesses C Umans Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	172	2002
Hamiltonian cycles in solid grid graphs C Umans, W Lenhart Proceedings 38th Annual Symposium on Foundations of Computer Science, 496-505, 1997	170	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	138	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	133	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	105	1999
On sunflowers and matrix multiplication N Alon, A Shpilka, C Umans 2012 IEEE 27th Conference on Computational Complexity, 214-223, 2012	96	2012
Fast modular composition in any characteristic KS Kedlaya, C Umans 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 146-155, 2008	94	2008
Virtual otoscopy R Frankenthaler, V Moharir, R Kikinis, P van Kipshagen, F Jolesz, ... Otolaryngologic Clinics of North America 31 (2), 383-392, 1998	94	1998
The complexity of boolean formula minimization D Buchfuhrer, C Umans Journal of Computer and System Sciences 77 (1), 142-153, 2011	86	2011
Pseudorandomness for approximate counting and sampling R Shaltiel, C Umans computational complexity 15 (4), 298-341, 2006	86	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

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři