| 2026 | ICALP | Proving Algebraic Independence in Zero-Knowledge. | Michael A. Forbes, Andrei Staicu |
| 2022 | STOC | Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals. | Robert Andrews, Michael A. Forbes |
| 2018 | FOCS | Spatial Isolation Implies Zero Knowledge Even in a Quantum World. | Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner |
| 2018 | FOCS | Pseudorandom Generators for Read-Once Branching Programs, in Any Order. | Michael A. Forbes, Zander Kelley |
| 2018 | ICALP | Towards Blackbox Identity Testing of Log-Variate Circuits. | Michael A. Forbes, Sumanta Ghosh, Nitin Saxena |
| 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 |
| 2017 | TCC | Zero Knowledge Protocols from Succinct Constraint Detection. | Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner |
| 2015 | FOCS | Deterministic Divisibility Testing via Shifted Partial Derivatives. | Michael A. Forbes |
| 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 | STOC | On identity testing of tensors, low-rank recovery and compressed sensing. | Michael A. Forbes, Amir Shpilka |