| 2026 | ICALP | Partial Derivative Complexity of a Product of Linearly Independent Quadratics. | Nir Shalmon, Amir Shpilka |
| 2025 | ICALP | On the Complexity of Hazard-Free Formulas. | Leah London Arazi, Amir Shpilka |
| 2024 | ISSAC | New Bounds on Quotient Polynomials with Applications to Exact Division and Divisibility Testing of Sparse Polynomials. | Ido Nahshon, Amir Shpilka |
| 2023 | STACS | On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts. | Suryajith Chillara, Coral Grichener, Amir Shpilka |
| 2022 | ISIT | Reed Solomon Codes Against Adversarial Insertions and Deletions. | Roni Con, Amir Shpilka, Itzhak Tamo |
| 2021 | STOC | Learnability can be independent of set theory (invited paper). | Shai Ben-David, Pavel Hrubes, Shay Moran, Amir Shpilka, Amir Yehudayoff |
| 2021 | STOC | Polynomial time deterministic identity testing algorithm for Σ | Shir Peleg, Amir Shpilka |
| 2020 | ISIT | Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel. | Roni Con, Amir Shpilka |
| 2020 | SODA | On the Performance of Reed-Muller Codes with respect to Random Errors and Erasures. | Ori Sberlo, Amir Shpilka |
| 2019 | STOC | Sylvester-Gallai type theorems for quadratic polynomials. | Amir Shpilka |
| 2018 | STOC | A PSPACE construction of a hitting set for the closure of small algebraic circuits. | Michael A. Forbes, Amir Shpilka |
| 2017 | STOC | Succinct hitting sets and barriers to proving algebraic circuits lower bounds. | Michael A. Forbes, Amir Shpilka, Ben Lee Volk |
| 2016 | STOC | Efficiently decoding Reed-Muller codes from random errors. | Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk |
| 2015 | FOCS | Compressing and Teaching for Low VC-Dimension. | Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff |
| 2015 | STOC | Reed-Muller Codes for Random Erasures and Errors. | Emmanuel Abbe, Amir Shpilka, Avi Wigderson |
| 2014 | ICALP | Testing Equivalence of Polynomials under Shifts. | Zeev Dvir, Rafael Oliveira, Amir Shpilka |
| 2014 | ICALP | Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound. | Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff |
| 2014 | STOC | Hitting sets for multilinear read-once algebraic branching programs, in any order. | Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka |
| 2013 | FOCS | Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs. | Michael A. Forbes, Amir Shpilka |
| 2012 | ISIT | High sum-rate three-write and non-binary WOM codes. | Eitan Yaakobi, Amir Shpilka |
| 2012 | LATIN | Capacity Achieving Two-Write WOM Codes. | Amir Shpilka |
| 2012 | STOC | On identity testing of tensors, low-rank recovery and compressed sensing. | Michael A. Forbes, Amir Shpilka |
| 2011 | CSR | Recent Results on Polynomial Identity Testing. | Amir Shpilka |
| 2011 | FOCS | Tight Lower Bounds for 2-query LCCs over Finite Fields. | Arnab Bhattacharyya, Zeev Dvir, Amir Shpilka, Shubhangi Saraf |
| 2011 | FOCS | Optimal Testing of Multivariate Polynomials over Small Prime Fields. | Elad Haramaty, Amir Shpilka, Madhu Sudan |
| 2010 | FOCS | Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields. | Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka |
| 2010 | ICALP | On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors. | Amir Shpilka, Ilya Volkovich |
| 2010 | STOC | On the structure of cubic and quartic polynomials. | Elad Haramaty, Amir Shpilka |
| 2010 | STOC | Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in. | Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich |
| 2009 | ICALP | Testing Fourier Dimensionality and Sparsity. | Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer |
| 2009 | STOC | Explicit construction of a small epsilon-net for linear threshold functions. | Yuval Rabani, Amir Shpilka |
| 2008 | STOC | Hardness-randomness tradeoffs for bounded depth arithmetic circuits. | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
| 2008 | STOC | Read-once polynomial identity testing. | Amir Shpilka, Ilya Volkovich |
| 2007 | FOCS | Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. | Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam D. Smith |
| 2007 | FOCS | A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. | Ran Raz, Amir Shpilka, Amir Yehudayoff |
| 2007 | STOC | Interpolation of depth-3 arithmetic circuits with two multiplication gates. | Amir Shpilka |
| 2005 | STOC | Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. | Zeev Dvir, Amir Shpilka |
| 2004 | STOC | Derandomizing homomorphism testing in general groups. | Amir Shpilka, Avi Wigderson |
| 2003 | COLT | Learning Arithmetic Circuits via Partial Derivatives. | Adam R. Klivans, Amir Shpilka |
| 2003 | FOCS | Locally Testable Cyclic Codes. | Lszl Babai, Amir Shpilka, Daniel Stefankovic |
| 2003 | FOCS | On e-Biased Generators in NC0. | Elchanan Mossel, Amir Shpilka, Luca Trevisan |
| 2001 | FOCS | Lower Bounds for Matrix Product. | Amir Shpilka |
| 2001 | STOC | Lower bounds for matrix product, in bounded depth circuits with arbitrary gates. | Ran Raz, Amir Shpilka |