STOC 2005 |
|
|---|---|
[Sort by page number] [Sort by citations count] | |
|   | |
| Harold N. Gabow, Ronald Fagin, editors, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005. Association for Computing Machinery, 2005. ISBN 1-58113-960-8. [Papers] Find this book on amazon.com | |
| Andrej Bogdanov, Pseudorandom generators for low degree polynomials, pp. 21 - 30, STOC 2005. [ Electronic
Edition][ Cited
21 times
] | |
| Oded Regev, On lattices, learning with errors, random linear codes, and cryptography, pp. 84 - 93, STOC 2005. [ Electronic
Edition][ Cited
170 times
![]() ] | |
| Luis von Ahn, Nicholas J. Hopper, John Langford, Covert two-party computation, pp. 513 - 522, STOC 2005. [ Electronic
Edition][ Cited
7 times
] | |
| Hoeteck Wee, On obfuscating point functions, pp. 523 - 532, STOC 2005. [ Electronic
Edition][ Cited
80 times
] | |
| Rafael Pass, Alon Rosen, New and improved constructions of non-malleable cryptographic protocols, pp. 533 - 542, STOC 2005. [ Electronic
Edition][ Cited
47 times
] | |
| Matt Lepinski, Silvio Micali, Abhi Shelat, Collusion-free protocols, pp. 543 - 552, STOC 2005. [ Electronic
Edition][ Cited
29 times
] | |
| Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran, Concurrent general composition of secure protocols in the timing model, pp. 644 - 653, STOC 2005. [ Electronic
Edition][ Cited
22 times
] | |
| Thomas Holenstein, Key agreement from weak bit agreement, pp. 664 - 673, STOC 2005. [ Electronic
Edition][ Cited
31 times
] | |
|
3755 authors, 5428 conference papers from 177 conference proceedings, 559 journal papers from 8 journals | |
Electronic
Edition
Cited
21 times
]