| Succinct hitting sets and barriers to proving lower bounds for algebraic circuits MA Forbes, A Shpilka, BL Volk Theory of Computing 14 (1), 1-45, 2018 | 42* | 2018 |
| On the structure of boolean functions with small spectral norm A Shpilka, A Tal, BL Volk Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 41 | 2014 |
| Efficiently decoding Reed-Muller codes from random errors R Saptharishi, A Shpilka, BL Volk Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 37* | 2016 |
| Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs M Anderson, MA Forbes, R Saptharishi, A Shpilka, BL Volk ACM Transactions on Computation Theory (TOCT) 10 (1), 1-30, 2018 | 33 | 2018 |
| Subexponential size hitting sets for bounded depth multilinear formulas R Oliveira, A Shpilka, BL Volk computational complexity 25, 455-505, 2016 | 31 | 2016 |
| Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits N Alon, M Kumar, BL Volk Combinatorica 40 (2), 149-178, 2020 | 29 | 2020 |
| Lower bounds for matrix factorization M Kumar, BL Volk arXiv preprint arXiv:1904.01182, 2019 | 13 | 2019 |
| Lower bounds on stabilizer rank S Peleg, A Shpilka, BL Volk Quantum 6, 652, 2022 | 12 | 2022 |
| Quadratic lower bounds for algebraic branching programs and formulas P Chatterjee, M Kumar, A She, B Lee Volk computational complexity 31 (2), 8, 2022 | 11 | 2022 |
| A quadratic lower bound for algebraic branching programs P Chatterjee, M Kumar, A She, BL Volk 35th Computational Complexity Conference (CCC 2020), 2020 | 10 | 2020 |
| Pseudorandom bits for oblivious branching programs R Gurjar, BL Volk ACM Transactions on Computation Theory (TOCT) 12 (2), 1-12, 2020 | 7 | 2020 |
| A Polynomial Degree Bound on Equations of Non-rigid Matrices and Small Linear Circuits M Kumar, BL Volk arXiv preprint arXiv:2003.12938, 2020 | 6* | 2020 |
| Extractors for images of varieties Z Guo, BL Volk, A Jalan, D Zuckerman Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 46-59, 2023 | 5 | 2023 |
| A lower bound on determinantal complexity M Kumar, BL Volk computational complexity 31 (2), 12, 2022 | 3 | 2022 |
| Tensor Reconstruction Beyond Constant Rank S Peleg, A Shpilka, BL Volk arXiv preprint arXiv:2209.04177, 2022 | 2 | 2022 |
| Determinants vs. algebraic branching programs A Chatterjee, M Kumar, BL Volk arXiv preprint arXiv:2308.04599, 2023 | 1 | 2023 |
| Guest Column: Algebraic Natural Proofs Ben Lee Volk BL Volk ACM SIGACT News 52 (4), 56-73, 2022 | 1 | 2022 |
| Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits M Kumar, V Ramanathan, R Saptharishi, BL Volk arXiv preprint arXiv:2403.01965, 2024 | | 2024 |
| Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields A Dwivedi, Z Guo, BL Volk arXiv preprint arXiv:2402.11915, 2024 | | 2024 |
| Identity Testing and Lower Bounds in Arithmetic Complexity BL Volk Tel Aviv University, 2017 | | 2017 |
