Steven Rudich

Citada per

	Totes	Des de 2020
Citacions	6925	1675
Índex h	25	14
Índex i10	27	14

380

190

285

19901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202526 42 33 45 80 84 63 74 87 75 89 113 116 142 177 202 196 241 193 227 231 202 205 240 301 297 376 339 354 295 309 343 321 327 336 39

Coautors

Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceCorreu electrònic verificat a weizmann.ac.il
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityCorreu electrònic verificat a g.harvard.edu
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLACorreu electrònic verificat a cs.ucla.edu
Boaz BarakHarvard UniversityCorreu electrònic verificat a boazbarak.org
Richard BeigelTemple UniversityCorreu electrònic verificat a temple.edu
Moni NaorProfessor of Computer Science, Weizmann Institute of ScienceCorreu electrònic verificat a weizmann.ac.il
Avrim BlumProfessor and Chief Academic Officer, Toyota Technological Institute at ChicagoCorreu electrònic verificat a ttic.edu
Alexander RazborovUniversity of ChicagoCorreu electrònic verificat a math.uchicago.edu
merrick furstDistinguished Professor, Georgia TechCorreu electrònic verificat a cc.gatech.edu
Eric AllenderRutgers UniversityCorreu electrònic verificat a cs.rutgers.edu
Yishay MansourTel Aviv UniversityCorreu electrònic verificat a tauex.tau.ac.il
Michael KearnsProfessor of Computer Science, University of PennsylvaniaCorreu electrònic verificat a cis.upenn.edu
Sampath KannanProfessor, Computer and Information Science, University of PennsylvaniaCorreu electrònic verificat a seas.upenn.edu
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemCorreu electrònic verificat a cs.huji.ac.il
Johan HåstadProfessor i teoretisk datalogi, KTHCorreu electrònic verificat a kth.se
Benny ChorProfessor of Computer Science, Tel-Aviv UniversityCorreu electrònic verificat a cs.tau.ac.il
Manindra AgrawalProfessor of Computer Science, IIT KanpurCorreu electrònic verificat a iitk.ac.in
Jeffrey C. JacksonProfessor of Computer Science, Duquesne UniversityCorreu electrònic verificat a duq.edu
James AspnesYale UniversityCorreu electrònic verificat a yale.edu
Michael FischerProfessor of Computer Science, Yale UniversityCorreu electrònic verificat a yale.edu

Segueix

Steven Rudich

Professor of Computer Science, Carnegie Mellon University

Correu electrònic verificat a cmu.edu

Computational Complexity Theory Cryptography


Títol Ordena per cites Ordena per any Ordena per títol	Citada per Citada per	Any
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	1996	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	879	1989
Natural proofs AA Razborov, S Rudich Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994	782	1994
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	568	2012
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	556	1985
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	356	1994
Implicit representation of graphs S Kannan, M Naor, S Rudich Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988	352	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	274	1991
Representing Boolean functions as polynomials modulo composite numbers DAM Barrington, R Beigel, S Rudich Computational Complexity 4 (4), 367-382, 1994	129	1994
Learning a hidden matching N Alon, R Beigel, S Kasif, S Rudich, B Sudakov SIAM Journal on Computing 33 (2), 487-501, 2004	119	2004
Limits on the provable consequences of one-way functions S Rudich University of California at Berkeley, 1988	106	1988
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	103	1992
Communication complexity towards lower bounds on circuit depth J Edmonds, R Impagliazzo, S Rudich, J Sgall Computational Complexity 10 (3), 210-246, 2001	88	2001
Computational complexity theory S Rudich, A Wigderson American Mathematical Soc., 2004	66	2004
On the complexity of ranking LA Hemachandra, S Rudich Journal of Computer and System Sciences 41 (2), 251-271, 1990	62	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
Super-bits, demi-bits, and NP/qpoly-natural proofs S Rudich International Workshop on Randomization and Approximation Techniques in …, 1997	56	1997
Reducing the complexity of reductions M Agrawal, E Allender, R Impagliazzo, T Pitassi, S Rudich Computational Complexity 10 (2), 117-138, 2001	55	2001
Inferring the structure of a Markov chain from its output S Rudich Proceedings of the 26th Annual Symposium on Foundations of Computer Science …, 1985	37	1985

En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.

Articles 1–20

Cites per any

Cites duplicades

Cites combinades

Addició de coautorsCoautors

Segueix

Citada per

Coautors