High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity.
Invited Articles Foreword.
Verifying Increasingly Expressive Temporal Logics for Infinite-State Systems.
On the Switch Markov Chain for Perfect Matchings.
Monadic Decomposition.
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques.
Arithmetic Cryptography.
Analysis of a Classical Matrix Preconditioning Algorithm.