Steven Rudich
Affiliations: | Carnegie Mellon University, Pittsburgh, PA |
Area:
Computer ScienceGoogle:
"Steven Rudich"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Alon N, Beigel R, Kasif S, et al. (2004) Learning a hidden matching Siam Journal On Computing. 33: 487-501 |
| Barak B, Goldreich O, Impagliazzo R, et al. (2001) 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 |
| Edmonds J, Impagliazzo R, Rudich S, et al. (2001) Communication complexity towards lower bounds on circuit depth Computational Complexity. 10: 210-246 |
| Agrawal M, Allender E, Impagliazzo R, et al. (2001) Reducing the complexity of reductions Computational Complexity. 10: 117-138 |
| Nisan N, Rudich S, Saks M. (1999) Products and Help Bits in Decision Trees Siam Journal On Computing. 28: 1035-1050 |
| Agrawal M, Allender E, Rudich S. (1998) Reductions in Circuit Complexity Journal of Computer and System Sciences. 57: 127-143 |
| Allender E, Feigenbaum J, Goldsmith J, et al. (1996) The future of computational complexity theory: part II Acm Sigact News. 27: 3-7 |
| Barrington DAM, Beigel R, Rudich S. (1994) Representing Boolean functions as polynomials modulo composite numbers Computational Complexity. 4: 367-382 |
| Aspnes J, Beigel R, Furst M, et al. (1994) The expressive power of voting polynomials Combinatorica. 14: 135-148 |
| Feldman D, Impagliazzo R, Naor M, et al. (1993) On Dice and Coins: Models of Computation for Random Generation Information and Computation. 104: 159-174 |