| Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead | 0 | 0.34 | 2022 |
| Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. | 0 | 0.34 | 2021 |
| Efficient List-Decoding With Constant Alphabet and List Sizes | 0 | 0.34 | 2021 |
| Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists). | 0 | 0.34 | 2021 |
| Local Proofs Approaching the Witness Length [Extended Abstract] | 1 | 0.35 | 2020 |
| Linear-Time Erasure List-Decoding of Expander Codes | 0 | 0.34 | 2020 |
| Local List Recovery of High-rate Tensor Codes and Applications | 1 | 0.35 | 2020 |
| LDPC Codes Achieve List Decoding Capacity | 1 | 0.38 | 2020 |
| From Local to Robust Testing via Agreement Testing. | 0 | 0.34 | 2019 |
| Erasures vs. Errors in Local Decoding and Property Testing. | 0 | 0.34 | 2019 |
| LDPC Codes Achieve List-Decoding Capacity. | 0 | 0.34 | 2019 |
| On List Recovery of High-Rate Tensor Codes | 1 | 0.35 | 2019 |
| Improved Decoding of Folded Reed-Solomon and Multiplicity Codes | 0 | 0.34 | 2018 |
| Explicit Capacity Approaching Coding for Interactive Communication. | 0 | 0.34 | 2018 |
| Erasures Versus Errors In Local Decoding And Property Testing | 0 | 0.34 | 2018 |
| High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. | 2 | 0.37 | 2017 |
| Local List Recovery of High-Rate Tensor Codes & Applications | 5 | 0.41 | 2017 |
| Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound. | 1 | 0.35 | 2017 |
| Towards Optimal Deterministic Coding for Interactive Communication. | 4 | 0.41 | 2016 |
| High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity. | 1 | 0.35 | 2015 |
| High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. | 0 | 0.34 | 2015 |
| Absolutely Sound Testing of Lifted Codes. | 3 | 0.39 | 2013 |
| Sparse Affine-Invariant Linear Codes Are Locally Testable | 3 | 0.37 | 2012 |
| Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications. | 1 | 0.35 | 2012 |
| A new upper bound on the query complexity for testing generalized Reed-Muller codes | 3 | 0.43 | 2012 |
| An Additive Combinatorics Approach Relating Rank to Communication Complexity | 4 | 0.52 | 2012 |
| Space Complexity in Polynomial Calculus | 9 | 0.46 | 2012 |
