On the Structure of Boolean Functions with Small Spectral Norm. - Amir Shpilka; Ben lee Volk (Electron. Colloquium Comput. Complex., 2013)

Decoding high rate Reed-Muller codes from random errors in near linear time. - Ramprasad Saptharishi; Amir Shpilka; Ben Lee Volk (CoRR, 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)

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)

Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. - Rafael Oliveira 002; Amir Shpilka; Ben lee Volk (Comput. Complex., 2016)

On the Structure of Boolean Functions with Small Spectral Norm. - Amir Shpilka; Avishay Tal; Ben lee Volk (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)

Pseudorandom Bits for Oblivious Branching Programs. - Rohit Gurjar; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2017)

An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. - Mrinal Kumar 001; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2017)

Efficiently Decoding Reed-Muller Codes From Random Errors. - Ramprasad Saptharishi; Amir Shpilka; Ben Lee Volk (IEEE Trans. Inf. Theory, 2017)

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

Identity Testing and Lower Bounds in Arithmetic Complexity - Ben Lee Volk (2018)

A Quadratic Lower Bound for Algebraic Branching Programs. - Prerona Chatterjee; Mrinal Kumar 001; Adrian She; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2019)

Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. - Noga Alon; Mrinal Kumar 001; Ben Lee Volk (Comb., 2020)

A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits. - Mrinal Kumar 001; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2020)

Lower Bounds for Matrix Factorization. - Ben Lee Volk; Mrinal Kumar 001 (Comput. Complex., 2021)

Guest Column: Algebraic Natural Proofs Ben Lee Volk. - Ben Lee Volk (SIGACT News, 2021)

Quadratic Lower Bounds for Algebraic Branching Programs and Formulas. - Prerona Chatterjee; Mrinal Kumar 001; Adrian She; Ben Lee Volk (Comput. Complex., 2022)

A Lower Bound on Determinantal Complexity. - Mrinal Kumar 001; Ben Lee Volk (Comput. Complex., 2022)

Extractors for Images of Varieties. - Zeyu Guo 001; Ben Lee Volk; Akhil Jalan; David Zuckerman (Electron. Colloquium Comput. Complex., 2022)

Tensor Reconstruction Beyond Constant Rank. - Shir Peleg; Amir Shpilka; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2022)

Lower Bounds on Stabilizer Rank. - Shir Peleg; Amir Shpilka; Ben Lee Volk (Quantum, 2022)

A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits. - Ben Lee Volk; Mrinal Kumar 001 (ACM Trans. Comput. Theory, 2022)

SIGACT News Complexity Theory Column 118. - Ben Lee Volk (SIGACT News, 2023)

SIGACT News Complexity Theory Column 119. - Ben Lee Volk (SIGACT News, 2023)

Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. - Mrinal Kumar 001; Varun Ramanathan 002; Ramprasad Saptharishi; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2024)

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields. - Ashish Dwivedi; Zeyu Guo 001; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2024)

SIGACT News Complexity Theory Column 120. - Ben Lee Volk (SIGACT News, 2024)

SIGACT News Complexity Theory Column 121. - Ben Lee Volk (SIGACT News, 2024)

SIGACT News Complexity Theory Column. - Ben Lee Volk (SIGACT News, 2024)

Determinants vs. Algebraic Branching Programs. - Abhranil Chatterjee 001; Mrinal Kumar 001; Ben Lee Volk (Comput. Complex., 2024)

SIGACT News Complexity Theory Column 123. - Ben Lee Volk (SIGACT News, 2024)

On Deterministically Finding an Element of High Order Modulo a Composite. - Ziv Oznovich; Ben Lee Volk (CoRR, 2025)