Steven Rudich

Citado por

	Total	Desde 2019
Citas	6607	1686
Índice h	24	14
Índice i10	27	14

380

190

285

1990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202425 42 33 47 75 83 63 76 87 75 91 111 114 139 175 206 196 237 190 226 236 197 204 238 302 296 372 344 338 298 307 337 319 335 90

Coautores

Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceDirección de correo verificada de weizmann.ac.il
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityDirección de correo verificada de g.harvard.edu
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLADirección de correo verificada de cs.ucla.edu
Boaz BarakHarvard UniversityDirección de correo verificada de boazbarak.org
Richard BeigelTemple UniversityDirección de correo verificada de temple.edu
Moni NaorProfessor of Computer Science, Weizmann Institute of ScienceDirección de correo verificada de weizmann.ac.il
Avrim BlumProfessor and Chief Academic Officer, Toyota Technological Institute at ChicagoDirección de correo verificada de ttic.edu
merrick furstDistinguished Professor, Georgia TechDirección de correo verificada de cc.gatech.edu
Eric AllenderRutgers UniversityDirección de correo verificada de cs.rutgers.edu
Yishay MansourTel Aviv UniversityDirección de correo verificada de tauex.tau.ac.il
Michael KearnsProfessor of Computer Science, University of PennsylvaniaDirección de correo verificada de cis.upenn.edu
Sampath KannanProfessor, Computer and Information Science, University of PennsylvaniaDirección de correo verificada de seas.upenn.edu
Alexander RazborovUniversity of ChicagoDirección de correo verificada de math.uchicago.edu
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemDirección de correo verificada de cs.huji.ac.il
Manindra AgrawalProfessor of Computer Science, IIT KanpurDirección de correo verificada de iitk.ac.in
Johan HåstadProfessor i teoretisk datalogi, KTHDirección de correo verificada de kth.se
Benny ChorProfessor of Computer Science, Tel-Aviv UniversityDirección de correo verificada de cs.tau.ac.il
Jeffrey C. JacksonProfessor of Computer Science, Duquesne UniversityDirección de correo verificada de duq.edu
James AspnesYale UniversityDirección de correo verificada de yale.edu
Michael FischerProfessor of Computer Science, Yale UniversityDirección de correo verificada de yale.edu

Seguir

Steven Rudich

Professor of Computer Science, Carnegie Mellon University

Dirección de correo verificada de cmu.edu

Computational Complexity Theory Cryptography


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
On the (im) possibility of obfuscating programs B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, ... Annual international cryptology conference, 1-18, 2001	1910	2001
Limits on the provable consequences of one-way permutations R Impagliazzo, S Rudich Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989	815	1989
Natural proofs AA Razborov, S Rudich Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994	747	1994
The bit extraction problem or t-resilient functions B Chor, O Goldreich, J Hasted, J Freidmann, S Rudich, R Smolensky 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 396-407, 1985	539	1985
On the (im) possibility of obfuscating programs B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, ... Journal of the ACM (JACM) 59 (2), 1-48, 2012	538	2012
Weakly learning DNF and characterizing statistical query learning using Fourier analysis A Blum, M Furst, J Jackson, M Kearns, Y Mansour, S Rudich Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994	337	1994
Implicit representation of graphs S Kannan, M Naor, S Rudich Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988	335	1988
The expressive power of voting polynomials J Aspnes, R Beigel, M Furst, S Rudich Proceedings of the twenty-third annual ACM symposium on Theory of Computing …, 1991	271	1991
Representing Boolean functions as polynomials modulo composite numbers DAM Barrington, R Beigel, S Rudich Computational Complexity 4 (4), 367-382, 1994	121	1994
Learning a hidden matching N Alon, R Beigel, S Kasif, S Rudich, B Sudakov SIAM Journal on Computing 33 (2), 487-501, 2004	111	2004
Fast learning of k-term DNF formulas with queries A Blum, S Rudich Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992	101	1992
Limits on the provable consequences of one-way functions S Rudich University of California at Berkeley, 1988	101	1988
Communication complexity towards lower bounds on circuit depth J Edmonds, R Impagliazzo, S Rudich, J Sgall Computational Complexity 10 (3), 210-246, 2001	84	2001
Computational complexity theory S Rudich, A Wigderson American Mathematical Soc., 2004	64	2004
On the complexity of ranking LA Hemachandra, S Rudich Journal of Computer and System Sciences 41 (2), 251-271, 1990	63	1990
Reductions in circuit complexity: An isomorphism theorem and a gap theorem M Agrawal, E Allender, S Rudich Journal of Computer and System Sciences 57 (2), 127-143, 1998	60	1998
The Use of Interaction in Public Cryptosystems. extended abstract S Rudich Annual International Cryptology Conference, 242-251, 1991	59	1991
Reducing the complexity of reductions M Agrawal, E Allender, R Impagliazzo, T Pitassi, S Rudich Computational Complexity 10 (2), 117-138, 2001	54	2001
Super-bits, demi-bits, and NP/qpoly-natural proofs S Rudich International Workshop on Randomization and Approximation Techniques in …, 1997	52	1997
Inferring the structure of a Markov chain from its output S Rudich 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 321-326, 1985	36	1985

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores