| Lower Bounds on Stabilizer Rank | 0 | 0.34 | 2022 |
| Robust Sylvester-Gallai Type Theorem for Quadratic Polynomials | 0 | 0.34 | 2022 |
| Improved Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel | 1 | 0.36 | 2022 |
| Reed Solomon Codes Against Adversarial Insertions and Deletions | 0 | 0.34 | 2022 |
| Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions | 0 | 0.34 | 2022 |
| Learnability can be independent of set theory (invited paper) | 0 | 0.34 | 2021 |
| Hitting Sets and Reconstruction for Dense Orbits in VP_{e} and ΣΠΣ Circuits. | 0 | 0.34 | 2021 |
| Polynomial time deterministic identity testing algorithm for Σ[3]ΠΣΠ[2] circuits via Edelstein–Kelly type theorem for quadratic polynomials | 0 | 0.34 | 2021 |
| Reed–Muller Codes: Theory and Algorithms | 5 | 0.46 | 2021 |
| On the Performance of Reed-Muller Codes with respect to Random Errors and Erasures. | 0 | 0.34 | 2020 |
| Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel | 1 | 0.35 | 2020 |
| A generalized Sylvester-Gallai type theorem for quadratic polynomials | 0 | 0.34 | 2020 |
| On Some Recent Advances in Algebraic Complexity (Invited Talk). | 0 | 0.34 | 2020 |
| Learnability Can Be Undecidable (Vol 1, Pg 44, 2019) | 0 | 0.34 | 2019 |
| Sylvester-Gallai type theorems for quadratic polynomials. | 0 | 0.34 | 2019 |
| Learnability Can Be Undecidable | 1 | 0.35 | 2019 |
| Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. | 6 | 0.42 | 2018 |
| Succinct Hitting Sets and Barriers to Proving Lower Bounds for Algebraic Circuits. | 0 | 0.34 | 2018 |
| A learning problem that is independent of the set theory ZFC axioms. | 0 | 0.34 | 2017 |
| Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds. | 3 | 0.38 | 2017 |
| A PSPACE Construction of a Hitting Set for the Closure of Small Algebraic Circuits. | 1 | 0.64 | 2017 |
| Proof Complexity Lower Bounds from Algebraic Circuit Complexity. | 6 | 0.43 | 2016 |
| Tight lower bounds for linear 2-query LCCs over finite fields. | 1 | 0.35 | 2016 |
| Efficiently Decoding Reed–Muller Codes From Random Errors | 2 | 0.42 | 2016 |
| Complexity Theory Column 88: Challenges in Polynomial Factorization1. | 4 | 0.39 | 2015 |
| Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. | 1 | 0.35 | 2015 |
| Compressing and Teaching for Low VC-Dimension | 8 | 0.51 | 2015 |
| Decoding high rate Reed-Muller codes from random errors in near linear time. | 0 | 0.34 | 2015 |
| Read-once polynomial identity testing | 27 | 0.90 | 2015 |
| Equivalence of Polynomial Identity Testing and Polynomial Factorization | 5 | 0.45 | 2015 |
| Teaching and compressing for low VC-dimension. | 5 | 0.47 | 2015 |
| Hitting sets for multilinear read-once algebraic branching programs, in any order | 20 | 0.71 | 2014 |
| Testing Equivalence of Polynomials under Shifts. | 5 | 0.44 | 2014 |
| Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound. | 4 | 0.44 | 2014 |
| Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization | 9 | 0.57 | 2014 |
| Capacity-Achieving Multiwrite WOM Codes | 3 | 0.49 | 2014 |
| On Reconstruction and Testing of Read-Once Formulas. | 5 | 0.45 | 2014 |
| Reed-Muller codes for random erasures and errors. | 5 | 0.44 | 2014 |
| Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing | 15 | 0.61 | 2013 |
| Optimal Testing of Multivariate Polynomials over Small Prime Fields. | 1 | 0.37 | 2013 |
| Direct sum fails for zero error average communication | 0 | 0.34 | 2013 |
| Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order. | 4 | 0.40 | 2013 |
| Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in | 17 | 0.63 | 2013 |
| Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields | 3 | 0.41 | 2013 |
| Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs | 26 | 0.82 | 2012 |
| Capacity achieving two-write WOM codes | 5 | 0.55 | 2012 |
| High Sum-Rate Three-Write and Nonbinary WOM Codes | 10 | 0.68 | 2012 |
| Symmetric LDPC Codes are not Necessarily Locally Testable | 12 | 0.53 | 2011 |
| New Constructions of WOM Codes Using the Wozencraft Ensemble | 15 | 0.84 | 2011 |
| On the minimal fourier degree of symmetric Boolean functions | 6 | 0.56 | 2011 |
