A Survey of Binary Covering Arrays. - Jim Lawrence; Raghu Kacker; Yu Lei 001; D. Richard Kuhn; Michael A. Forbes 001 (Electron. J. Comb., 2011)

Tensor Rank: Some Lower and Upper Bounds. - Boris Alexeev; Michael A. Forbes 001; Jacob Tsimerman (Electron. Colloquium Comput. Complex., 2011)

On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing. - Michael A. Forbes 001; Amir Shpilka (Electron. Colloquium Comput. Complex., 2011)

Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs. - Michael A. Forbes 001; Amir Shpilka (Electron. Colloquium Comput. Complex., 2012)

Improved Soundness for QMA with Multiple Provers - Alessandro Chiesa; Michael A. Forbes 001 (Chic. J. Theor. Comput. Sci., 2013)

Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing. - Michael A. Forbes 001; Amir Shpilka (Electron. Colloquium Comput. Complex., 2013)

Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order. - Michael A. Forbes 001; Ramprasad Saptharishi; Amir Shpilka (Electron. Colloquium Comput. Complex., 2013)

Hitting sets for multilinear read-once algebraic branching programs, in any order. - Michael A. Forbes 001; Ramprasad Saptharishi; Amir Shpilka (STOC, 2014)

On the locality of codeword symbols in non-linear codes. - Michael A. Forbes 001; Sergey Yekhanin (Discret. Math., 2014)

Dimension Expanders via Rank Condensers. - Michael A. Forbes 001; Venkatesan Guruswami (Electron. Colloquium Comput. Complex., 2014)

Polynomial identity testing of read-once oblivious algebraic branching programs. - Michael A. Forbes 001 (2014)

Deterministic Divisibility Testing via Shifted Partial Derivatives. - Michael A. Forbes 001 (FOCS, 2015)

Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. - Matthew Anderson; Michael A. Forbes 001; Ramprasad Saptharishi; Amir Shpilka; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2015)

Complexity Theory Column 88: Challenges in Polynomial Factorization1. - Michael A. Forbes 001; Amir Shpilka (SIGACT News, 2015)

Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. - Matthew Anderson; Michael A. Forbes 001; Ramprasad Saptharishi; Amir Shpilka; Ben Lee Volk (CCC, 2016)

On Probabilistic Checking in Perfect Zero Knowledge. - Eli Ben-Sasson; Alessandro Chiesa; Michael A. Forbes 001; Ariel Gabizon; Michael Riabzev; Nicholas Spooner (Electron. Colloquium Comput. Complex., 2016)

Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity. - Michael A. Forbes 001; Mrinal Kumar 001; Ramprasad Saptharishi (Electron. Colloquium Comput. Complex., 2016)

Proof Complexity Lower Bounds from Algebraic Circuit Complexity. - Michael A. Forbes 001; Amir Shpilka; Iddo Tzameret; Avi Wigderson (Electron. Colloquium Comput. Complex., 2016)

Zero Knowledge Protocols from Succinct Constraint Detection. - Eli Ben-Sasson; Alessandro Chiesa; Michael A. Forbes 001; Ariel Gabizon; Michael Riabzev; Nicholas Spooner (TCC (2), 2017)

Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good. - Manindra Agrawal; Michael A. Forbes 001; Sumanta Ghosh; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2017)

A Zero Knowledge Sumcheck and its Applications. - Alessandro Chiesa; Michael A. Forbes 001; Nicholas Spooner (Electron. Colloquium Comput. Complex., 2017)

A PSPACE Construction of a Hitting Set for the Closure of Small Algebraic Circuits. - Michael A. Forbes 001; Amir Shpilka (Electron. Colloquium Comput. Complex., 2017)

Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds. - Michael A. Forbes 001; Amir Shpilka; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2017)

Spatial Isolation Implies Zero Knowledge Even in a Quantum World. - Alessandro Chiesa; Michael A. Forbes 001; Tom Gur; Nicholas Spooner (Electron. Colloquium Comput. Complex., 2018)

Towards blackbox identity testing of log-variate circuits. - Michael A. Forbes 001; Sumanta Ghosh; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2018)

Pseudorandom Generators for Read-Once Branching Programs, in any Order. - Michael A. Forbes 001; Zander Kelley (Electron. Colloquium Comput. Complex., 2018)

Succinct Hitting Sets and Barriers to Proving Lower Bounds for Algebraic Circuits. - Michael A. Forbes 001; Amir Shpilka; Ben Lee Volk (Theory Comput., 2018)

Ideals, Determinants, and Straightening: Proving and Using Lower Bounds for Polynomial Ideals. - Robert Andrews 003; Michael A. Forbes 001 (Electron. Colloquium Comput. Complex., 2021)

Low-Depth Algebraic Circuit Lower Bounds over Any Field. - Michael A. Forbes 001 (CCC, 2024)