Chris Umans

Navedeno

	Vse	Od leta 2019
Navedbe	4266	1530
indeks h	29	21
indeks i10	45	31

320

160

240

1999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202412 26 52 90 42 51 112 163 116 164 150 171 199 157 190 180 169 203 202 222 254 224 225 231 272 320

Javni dostop

Prikaži vse

5 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Henry CohnSenior Principal Researcher, Microsoft Research New EnglandPreverjeni e-poštni naslov na microsoft.com
Ronen ShaltielProfessor of Computer Science, University of HaifaPreverjeni e-poštni naslov na cs.haifa.ac.il
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityPreverjeni e-poštni naslov na g.harvard.edu
Venkatesan GuruswamiUniversity of California, BerkeleyPreverjeni e-poštni naslov na berkeley.edu
Joshua A. GrochowUniversity of Colorado BoulderPreverjeni e-poštni naslov na colorado.edu
Robert KleinbergDepartment of Computer Science, Cornell UniversityPreverjeni e-poštni naslov na cs.cornell.edu
Bill FeffermanUniversity of ChicagoPreverjeni e-poštni naslov na uchicago.edu
Marcus SchaeferDePaul UniversityPreverjeni e-poštni naslov na cdm.depaul.edu
David ZuckermanProfessor of Computer Science, University of Texas at AustinPreverjeni e-poštni naslov na cs.utexas.edu
Thomas ChurchAssistant Professor, Stanford UniversityPreverjeni e-poštni naslov na math.stanford.edu
Emanuele ViolaProfessor of Computer Science, Northeastern UniversityPreverjeni e-poštni naslov na ccs.neu.edu
Tiziano VillaProfessore d'informatica, Universita' di VeronaPreverjeni e-poštni naslov na univr.it
Alberto Sangiovanni VincentelliProfessor of EECS, University of California, BerkeleyPreverjeni e-poštni naslov na eecs.berkeley.edu
Lance FortnowIllinois Institute of TechnologyPreverjeni e-poštni naslov na iit.edu
Elchanan MosselProfessor of Mathematics, MITPreverjeni e-poštni naslov na mit.edu
William LenhartProfessor of Computer Science, Williams CollegePreverjeni e-poštni naslov na williams.edu
Will SawinPrinceton UniversityPreverjeni e-poštni naslov na math.columbia.edu
Noga AlonPrinceton University and Tel Aviv UniversityPreverjeni e-poštni naslov na tau.ac.il
Michael SchapiraProfessor of Computer Science, The Hebrew University of JerusalemPreverjeni e-poštni naslov na huji.ac.il
Shaddin DughmiAssociate Professor of Computer Science, University of Southern CaliforniaPreverjeni e-poštni naslov na usc.edu

Spremljaj

Chris Umans

Professor of Computer Science, Caltech

Preverjeni e-poštni naslov na cs.caltech.edu - Domača stran

Computational complexity randomness in computation algebraic complexity and algorithms


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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	506	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	320	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	281*	2001
Fast polynomial factorization and modular composition KS Kedlaya, C Umans SIAM Journal on Computing 40 (6), 1767-1802, 2011	278	2011
Lossless condensers, unbalanced expanders, and extractors A Ta-Shma*, C Umans, D Zuckerman Combinatorica 27, 213-240, 2007	231*	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	196	2001
A group-theoretic approach to fast matrix multiplication H Cohn, C Umans 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003	183	2003
Pseudo-random generators for all hardnesses C Umans Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	170	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	129	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	91	1998
The complexity of boolean formula minimization D Buchfuhrer, C Umans Journal of Computer and System Sciences 77 (1), 142-153, 2011	84	2011
Pseudorandomness for approximate counting and sampling R Shaltiel, C Umans computational complexity 15 (4), 298-341, 2006	82	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

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji