☰

Steven Rudich - Publications

Affiliations: 
Carnegie Mellon University, Pittsburgh, PA 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

12 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2004 Alon N, Beigel R, Kasif S, Rudich S, Sudakovh B. Learning a hidden matching Siam Journal On Computing. 33: 487-501. DOI: 10.1137/S0097539702420139  0.404
2001 Barak B, Goldreich O, Impagliazzo R, Rudich S, Sahai A, Vadhan S, Yang K. On the (Im)possibility of obfuscating programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2139: 1-18. DOI: 10.1145/2160158.2160159  0.566
2001 Edmonds J, Impagliazzo R, Rudich S, Sgall J. Communication complexity towards lower bounds on circuit depth Computational Complexity. 10: 210-246. DOI: 10.1007/S00037-001-8195-X  0.572
2001 Agrawal M, Allender E, Impagliazzo R, Pitassi T, Rudich S. Reducing the complexity of reductions Computational Complexity. 10: 117-138. DOI: 10.1007/S00037-001-8191-1  0.569
1999 Nisan N, Rudich S, Saks M. Products and Help Bits in Decision Trees Siam Journal On Computing. 28: 1035-1050. DOI: 10.1137/S0097539795282444  0.343
1998 Agrawal M, Allender E, Rudich S. Reductions in Circuit Complexity Journal of Computer and System Sciences. 57: 127-143. DOI: 10.1006/Jcss.1998.1583  0.366
1996 Allender E, Feigenbaum J, Goldsmith J, Pitassi T, Rudich S. The future of computational complexity theory: part II Acm Sigact News. 27: 3-7. DOI: 10.1145/242581.242582  0.316
1994 Barrington DAM, Beigel R, Rudich S. Representing Boolean functions as polynomials modulo composite numbers Computational Complexity. 4: 367-382. DOI: 10.1007/Bf01263424  0.338
1994 Aspnes J, Beigel R, Furst M, Rudich S. The expressive power of voting polynomials Combinatorica. 14: 135-148. DOI: 10.1007/Bf01215346  0.347
1993 Feldman D, Impagliazzo R, Naor M, Nisan N, Rudich S, Shamir A. On Dice and Coins: Models of Computation for Random Generation Information and Computation. 104: 159-174. DOI: 10.1006/Inco.1993.1028  0.588
1990 Hemachandra LA, Rudich S. On the complexity of ranking Journal of Computer and System Sciences. 41: 251-271. DOI: 10.1016/0022-0000(90)90038-M  0.338
1988 Kannan S, Naor M, Rudich S. Implicit representation of graphs Proceedings of the Annual Acm Symposium On Theory of Computing. 334-343. DOI: 10.1137/0405049  0.476
Show low-probability matches.