Michael A. Forbes

ORCID

Publication Activity (10 Years)

Years Active: 2011-2022
Publications (10 Years): 45

Top Venues

CoRR

Electron. Colloquium Comput. Complex.

STOC

FOCS

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Robert Andrews, Michael A. Forbes
Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals. STOC (2022)
Yannik Rist, Michael A. Forbes
A column generation and Combinatorial Benders Decomposition algorithm for the Selective Dial-A-Ride-Problem. Comput. Oper. Res. 140 (2022)
Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. J. ACM 69 (2) (2022)
Yannik Rist, Michael A. Forbes
A New Formulation for the Dial-a-Ride Problem. Transp. Sci. 55 (5) (2021)
Robert Andrews, Michael A. Forbes
Ideals, Determinants, and Straightening: Proving and Using Lower Bounds for Polynomial Ideals. CoRR (2021)
Robert Andrews, Michael A. Forbes
Ideals, Determinants, and Straightening: Proving and Using Lower Bounds for Polynomial Ideals. Electron. Colloquium Comput. Complex. 28 (2021)
Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Theory Comput. 17 (2021)
Rick Jeuken, Michael A. Forbes, Michael Kearney
Optimal blending strategies for coking coal using chance constraints. J. Oper. Res. Soc. 72 (12) (2021)
Robin H. Pearce, Michael A. Forbes
Disaggregated benders decomposition for solving a network maintenance scheduling problem. J. Oper. Res. Soc. 70 (6) (2019)
Ali Mehsin Alyasiry, Michael A. Forbes, Michael Bulmer
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows and Last-in-First-out Loading. Transp. Sci. 53 (6) (2019)
Michael A. Forbes, Sumanta Ghosh, Nitin Saxena
Towards blackbox identity testing of log-variate circuits. Electron. Colloquium Comput. Complex. 25 (2018)
Haoquan Liu, Kevin Austin, Michael A. Forbes, Michael Kearney
Monte-Carlo Tree Search in Dragline Operation Planning. IEEE Robotics Autom. Lett. 3 (1) (2018)
Michael A. Forbes, Zander Kelley
Pseudorandom Generators for Read-Once Branching Programs, in Any Order. FOCS (2018)
Robin H. Pearce, Michael A. Forbes
Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem. Eur. J. Oper. Res. 270 (1) (2018)
Michael A. Forbes, Zander Kelley
Pseudorandom Generators for Read-Once Branching Programs, in any Order. Electron. Colloquium Comput. Complex. 25 (2018)
Michael A. Forbes, Sumanta Ghosh, Nitin Saxena
Towards Blackbox Identity Testing of Log-Variate Circuits. ICALP (2018)
Michael A. Forbes, Zander Kelley
Pseudorandom Generators for Read-Once Branching Programs, in any Order. CoRR (2018)
Michael A. Forbes, Amir Shpilka, Ben Lee Volk
Succinct Hitting Sets and Barriers to Proving Lower Bounds for Algebraic Circuits. Theory Comput. 14 (1) (2018)
Michael A. Forbes, Amir Shpilka
A PSPACE construction of a hitting set for the closure of small algebraic circuits. STOC (2018)
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Oblivious Algebraic Branching Programs. ACM Trans. Comput. Theory 10 (1) (2018)
Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. CoRR (2018)
Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. FOCS (2018)
Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. Electron. Colloquium Comput. Complex. 25 (2018)
Michael A. Forbes, Amir Shpilka, Ben Lee Volk
Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds. Electron. Colloquium Comput. Complex. 24 (2017)
Alessandro Chiesa, Michael A. Forbes, Nicholas Spooner
A Zero Knowledge Sumcheck and its Applications. CoRR (2017)
Alessandro Chiesa, Michael A. Forbes, Nicholas Spooner
A Zero Knowledge Sumcheck and its Applications. IACR Cryptol. ePrint Arch. 2017 (2017)
Manindra Agrawal, Michael A. Forbes, Sumanta Ghosh, Nitin Saxena
Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good. Electron. Colloquium Comput. Complex. 24 (2017)
Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
Zero Knowledge Protocols from Succinct Constraint Detection. TCC (2) (2017)
Michael A. Forbes, Amir Shpilka
A PSPACE Construction of a Hitting Set for the Closure of Small Algebraic Circuits. CoRR (2017)
Michael A. Forbes, Amir Shpilka, Ben Lee Volk
Succinct hitting sets and barriers to proving algebraic circuits lower bounds. STOC (2017)
Michael A. Forbes, Amir Shpilka
A PSPACE Construction of a Hitting Set for the Closure of Small Algebraic Circuits. Electron. Colloquium Comput. Complex. 24 (2017)
Robin H. Pearce, Michael A. Forbes
Puzzle - The Fillomino Puzzle. INFORMS Trans. Educ. 17 (2) (2017)
Manindra Agrawal, Michael A. Forbes, Sumanta Ghosh, Nitin Saxena
Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good. CoRR (2017)
Michael A. Forbes, Amir Shpilka, Ben Lee Volk
Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds. CoRR (2017)
Alessandro Chiesa, Michael A. Forbes, Nicholas Spooner
A Zero Knowledge Sumcheck and its Applications. Electron. Colloquium Comput. Complex. 24 (2017)
Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Computational Complexity Conference (2016)
Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
On Probabilistic Checking in Perfect Zero Knowledge. IACR Cryptol. ePrint Arch. 2016 (2016)
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. Computational Complexity Conference (2016)
Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. CoRR (2016)
Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity. CoRR (2016)
Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity. Electron. Colloquium Comput. Complex. 23 (2016)
Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi
Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity. Computational Complexity Conference (2016)
Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Electron. Colloquium Comput. Complex. 23 (2016)
Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
On Probabilistic Checking in Perfect Zero Knowledge. Electron. Colloquium Comput. Complex. 23 (2016)
Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
On Probabilistic Checking in Perfect Zero Knowledge. CoRR (2016)
Peter Ferris, Chris Forbes, Joe Forbes, Michael A. Forbes, Paul Kennedy
Optimizing Network Designs for the World's Largest Broadband Project. Interfaces 45 (1) (2015)
Michael A. Forbes, Amir Shpilka
Complexity Theory Column 88: Challenges in Polynomial Factorization1. SIGACT News 46 (4) (2015)
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs. CoRR (2015)
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Oblivious Algebraic Branching Programs. Electron. Colloquium Comput. Complex. 22 (2015)
Michael A. Forbes
Deterministic Divisibility Testing via Shifted Partial Derivatives. FOCS (2015)
Michael A. Forbes, Venkatesan Guruswami
Dimension Expanders via Rank Condensers. APPROX-RANDOM (2015)
Michael A. Forbes, Sergey Yekhanin
On the locality of codeword symbols in non-linear codes. Discret. Math. 324 (2014)
Michael A. Forbes, Venkatesan Guruswami
Dimension Expanders via Rank Condensers. Electron. Colloquium Comput. Complex. 21 (2014)
Michael A. Forbes, Venkatesan Guruswami
Dimension Expanders via Rank Condensers. CoRR (2014)
Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka
Hitting sets for multilinear read-once algebraic branching programs, in any order. STOC (2014)
Michael A. Forbes, Amir Shpilka
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing CoRR (2013)
Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order. Electron. Colloquium Comput. Complex. 20 (2013)
Michael A. Forbes, Amir Shpilka
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing. Electron. Colloquium Comput. Complex. 20 (2013)
Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order. CoRR (2013)
Michael A. Forbes, Amir Shpilka
Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs. FOCS (2013)
Alessandro Chiesa, Michael A. Forbes
Improved Soundness for QMA with Multiple Provers Chic. J. Theor. Comput. Sci. 2013 (2013)
Michael A. Forbes, Sergey Yekhanin
On the Locality of Codeword Symbols in Non-Linear Codes CoRR (2013)
Michael A. Forbes, Amir Shpilka
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing. APPROX-RANDOM (2013)
Michael A. Forbes, Amir Shpilka
On identity testing of tensors, low-rank recovery and compressed sensing. STOC (2012)
Michael A. Forbes, Amir Shpilka
Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs CoRR (2012)
Michael A. Forbes, Amir Shpilka
Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs. Electron. Colloquium Comput. Complex. 19 (2012)
Michael A. Forbes, Amir Shpilka
On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing. Electron. Colloquium Comput. Complex. 18 (2011)
Alessandro Chiesa, Michael A. Forbes
Improved Soundness for QMA with Multiple Provers CoRR (2011)
Boris Alexeev, Michael A. Forbes, Jacob Tsimerman
Tensor Rank: Some Lower and Upper Bounds CoRR (2011)
Boris Alexeev, Michael A. Forbes, Jacob Tsimerman
Tensor Rank: Some Lower and Upper Bounds. Computational Complexity Conference (2011)
Michael A. Forbes, Amir Shpilka
On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing CoRR (2011)
Michael A. Forbes, Neeraj Kayal, Rajat Mittal, Chandan Saha
Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant CoRR (2011)
Boris Alexeev, Michael A. Forbes, Jacob Tsimerman
Tensor Rank: Some Lower and Upper Bounds. Electron. Colloquium Comput. Complex. 18 (2011)
Alessandro Chiesa, Michael A. Forbes
Improved Soundness for QMA with Multiple Provers. Electron. Colloquium Comput. Complex. 18 (2011)
Jim Lawrence, Raghu Kacker, Yu Lei, D. Richard Kuhn, Michael A. Forbes
A Survey of Binary Covering Arrays. Electron. J. Comb. 18 (1) (2011)

Michael A. Forbes.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael A. Forbes