Steven Rudich

引用次数

	总计	2020 年至今
引用	6927	1678
h 指数	25	14
i10 指数	27	14

380

190

285

19901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202526 42 33 45 80 84 63 74 87 75 89 113 117 141 177 202 196 241 193 227 231 202 205 240 301 297 376 340 352 295 310 343 319 329 338 39

合著作者

Oded GoldreichProfessor of Computer Science, Weizmann Institute of Science在 weizmann.ac.il 的电子邮件经过验证
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard University在 g.harvard.edu 的电子邮件经过验证
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLA在 cs.ucla.edu 的电子邮件经过验证
Boaz BarakHarvard University在 boazbarak.org 的电子邮件经过验证
Richard BeigelTemple University在 temple.edu 的电子邮件经过验证
Moni NaorProfessor of Computer Science, Weizmann Institute of Science在 weizmann.ac.il 的电子邮件经过验证
Avrim BlumProfessor and Chief Academic Officer, Toyota Technological Institute at Chicago在 ttic.edu 的电子邮件经过验证
Alexander RazborovUniversity of Chicago在 math.uchicago.edu 的电子邮件经过验证
merrick furstDistinguished Professor, Georgia Tech在 cc.gatech.edu 的电子邮件经过验证
Eric AllenderRutgers University在 cs.rutgers.edu 的电子邮件经过验证
Yishay MansourTel Aviv University在 tauex.tau.ac.il 的电子邮件经过验证
Michael KearnsProfessor of Computer Science, University of Pennsylvania在 cis.upenn.edu 的电子邮件经过验证
Sampath KannanProfessor, Computer and Information Science, University of Pennsylvania在 seas.upenn.edu 的电子邮件经过验证
Noam NisanProfessor of Computer Science, Hebrew University of Jerusalem在 cs.huji.ac.il 的电子邮件经过验证
Johan HåstadProfessor i teoretisk datalogi, KTH在 kth.se 的电子邮件经过验证
Benny ChorProfessor of Computer Science, Tel-Aviv University在 cs.tau.ac.il 的电子邮件经过验证
Manindra AgrawalProfessor of Computer Science, IIT Kanpur在 iitk.ac.in 的电子邮件经过验证
Jeffrey C. JacksonProfessor of Computer Science, Duquesne University在 duq.edu 的电子邮件经过验证
James AspnesYale University在 yale.edu 的电子邮件经过验证
Michael FischerProfessor of Computer Science, Yale University在 yale.edu 的电子邮件经过验证

关注

Steven Rudich

Professor of Computer Science, Carnegie Mellon University

在 cmu.edu 的电子邮件经过验证

Computational Complexity Theory Cryptography


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	1998	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

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

关注

引用次数

合著作者