|
Volume 5, Article 12 (pages 239-255)
Tensor Products of Weakly Smooth Codes are Robust by Eli Ben-Sasson and Michael Viderman |
|
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 |
|
Volume 4, Article 3 (pages 53-76)
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications by Avi Wigderson and David Xiao |
|
Volume 3, Article 3 (pages 45-60)
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy by Ishay Haviv, Oded Regev, and Amnon Ta-Shma |
|
Volume 3, Article 1 (pages 1-23)
Censorship Resistant Peer-to-Peer Networks by Amos Fiat and Jared Saia |
|
Volume 2, Article 5 (pages 91-120)
Iterative Construction of Cayley Expander Graphs by Eyal Rozenman, Aner Shalev, and Avi Wigderson |