Research Interests
Computational complexity theory, and in particular algebraic complexity, algorithms for algebraic problems, error correcting codes and pseudorandomness.
Previously, I was a CMI postdoc at Caltech, and before that, a Ph.D. student at the Theory of Computation group at Tel Aviv University, advised by Amir Shpilka.
Publications

Manuscript

ITCS 2021 (to appear)

(An earlier version, titled "A Quadratic Lower bound for Algebraic Branching Programs", to appear in CCC 2020)

CCC 2020

Combinatorica, 2020 (Preliminary version in CCC 2018)

ACM TOCT, 2020

Theory of Computing, 2018 (Preliminary version in STOC 2017)

ACM TOCT, 2018 (Preliminary version in CCC 2016)(video and slides from WACT 2016 at Tel Aviv University)

IEEE TIT, 2017 (Preliminary version in STOC 2016)

Computational Complexity, 2016 (Preliminary version in CCC 2015)(slides)

Computational Complexity, 2017 (Preliminary version in ITCS 2014)(video and slides of a lecture given at the Simons Institute, and another set of video and slides of a related lecture)
Name guide: My first name is Ben Lee and my last name is Volk. But it's OK, nobody gets it right the first time. If you call me Ben, I will answer without correcting you and not make a big deal out of it. If you spell it as Ben Lee Volk in your *.bib file (with this exact order and capitalization), BibTeX will correctly infer the first and last names. To read a whole lot more about how BibTeX processes names, see this paper, which is also likely to fulfill your lifelong dream of reading a document that contains the phrase "First von Last".