Articles under category:
Expanders
Expanders
Vol 17, Article 4 (pp 1-35)
[APRX-RND19 Spec Issue]
Deterministic Approximation of Random Walks in Small Space by Jack Murtagh, Omer Reingold, Aaron Sidford, and Salil Vadhan |
Vol 16, Article 1 (pp 1-23)
Distributed Corruption Detection in Networks by Noga Alon, Elchanan Mossel, and Robin Pemantle |
Vol 11, Article 9 (pp 241-256)
[APRX-RND13 Spec Issue]
A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs by Shayan Oveis Gharan and Luca Trevisan |
Vol 9, Article 13 (pp 441-470)
[APRX-RND12 Spec Issue]
Optimal Hitting Sets for Combinatorial Shapes by Aditya Bhaskara, Devendra Desai, and Srikanth Srinivasan |
Vol 6, Article 12 (pp 291-308)
[RESEARCH SURVEY]
Monotone Expanders: Constructions and Applications by Zeev Dvir and Avi Wigderson |
Vol 6, Article 3 (pp 47-79)
Quantum Expanders: Motivation and Construction by Avraham Ben-Aroya, Oded Schwartz, and Amnon Ta-Shma |
Vol 5, Article 12 (pp 239-255)
Tensor Products of Weakly Smooth Codes are Robust by Eli Ben-Sasson and Michael Viderman |
Vol 5, Article 2 (pp 43-67)
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories by Tal Moran, Moni Naor, and Gil Segev |
Vol 4, Article 3 (pp 53-76)
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications by Avi Wigderson and David Xiao |
Vol 3, Article 3 (pp 45-60)
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy by Ishay Haviv, Oded Regev, and Amnon Ta-Shma |
Vol 3, Article 1 (pp 1-23)
Censorship Resistant Peer-to-Peer Networks by Amos Fiat and Jared Saia |
Vol 2, Article 5 (pp 91-120)
Iterative Construction of Cayley Expander Graphs by Eyal Rozenman, Aner Shalev, and Avi Wigderson |