logo
http://theoryofcomputing.org     ISSN 1557-2862
Endorsed by ACM SIGACT
  • Home
  • Introduction
  • Articles
  • Special Issues
  • Library
  • Editors
  • Submit
  • Issues
  • Contact Us
  • Search
Articles under category:
Cryptography
Volume 5, Article 13 (pages 257-282)
Optimal Cryptographic Hardness of Learning Monotone Functions
by Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, and Hoeteck Wee
Volume 5, Article 8 (pages 141-172)
Parallel Repetition: Simplification and the No-Signaling Case
by Thomas Holenstein
Volume 5, Article 2 (pages 43-67)
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
by Tal Moran, Moni Naor, and Gil Segev