☰

Charles Rackoff - Publications

Affiliations: 
Computer Science University of Toronto, Toronto, ON, Canada 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

10 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
2009 Juma A, Kabanets V, Rackoff C, Shpilka A. The black-box query complexity of polynomial summation Computational Complexity. 18: 59-79. DOI: 10.1007/S00037-009-0263-7  0.452
2006 Rackoff C. Martin Dietzfelbinger. Primality testing in polynomial time—from randomized algorithms to “PRIMES is in P” . Lecture Notes in Computer Science, vol. 3000. Springer-Verlag, 2004, x + 147 pp. The Bulletin of Symbolic Logic. 12: 494-496. DOI: 10.1017/S1079898600002596  0.305
2005 Kilian J, Rackoff C, Petrank E. Lower Bounds For Concurrent Zero Knowledge Combinatorica. 25: 217-249. DOI: 10.1007/S00493-005-0014-6  0.323
2000 Petrank E, Rackoff C. CBC MAC for Real-Time Data Sources Journal of Cryptology. 13: 315-338. DOI: 10.1007/S001450010009  0.339
1989 Goldwasser S, Micali S, Rackoff C. The knowledge complexity of interactive proof systems Siam Journal On Computing. 18: 186-208. DOI: 10.1137/0218012  0.343
1988 Micali S, Rackoff C, Sloan B. The notion of security for probabilistic cryptosystems Siam Journal On Computing. 17: 412-426. DOI: 10.1137/0217025  0.31
1988 Luby M, Rackoff C. How to construct pseudorandom permutations from pseudorandom functions Siam Journal On Computing. 17: 373-386. DOI: 10.1137/0217022  0.304
1978 Rackoff C. The covering and boundedness problems for vector addition systems Theoretical Computer Science. 6: 223-231. DOI: 10.1016/0304-3975(78)90036-1  0.302
1976 Rackoff C. On the Complexity of the Theories of Weak Direct Powers Journal of Symbolic Logic. 41: 561-573. DOI: 10.1017/S0022481200051136  0.303
1975 Ferrante J, Rackoff C. A Decision Procedure for the First Order Theory of Real Addition with Order Siam Journal On Computing. 4: 69-76. DOI: 10.1137/0204006  0.317
Show low-probability matches.