Ben Lee Volk
Scholar

Ben Lee Volk

Google Scholar ID: vQ-0v2oAAAAJ
Efi Arazi School of Computer Science, Reichman University
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
229
 
H-index
10
 
i10-index
10
 
Publications
20
 
Co-authors
0
 
Contact
Emailbenleevolk@gmail.comCVOpen ↗
Publications
1 items
On Deterministically Finding an Element of High Order Modulo a Composite
2025
Cited
0
Resume (English only)
Academic Achievements
  • Publications:
  • - On Deterministically Finding an Element of High Order Modulo a Composite (SODA 2026)
  • - Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits (ACM TOCT)
  • - Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields (RANDOM 2024)
  • - Determinants vs. Algebraic Branching Programs (ITCS 2024)
  • - Tensor Reconstruction Beyond Constant Rank (ITCS 2024)
  • - Extractors for Images of Varieties (STOC 2023)
  • - Algebraic Natural Proofs (SIGACT News Complexity Column, 2021)
  • - Lower Bounds on Stabilizer Rank (Quantum 2022)
  • - A Lower Bound on Determinantal Complexity (Computational Complexity, 2022)
  • - A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits (ACM TOCT, 2022)
  • - Quadratic Lower Bounds for Algebraic Branching Programs and Formulas (Computational Complexity, 2022)
  • - Lower Bounds for Matrix Factorization (Computational Complexity, 2021)
  • - Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits (Combinatorica, 2020)
  • - Pseudorandom Bits for Oblivious Branching Programs (ACM TOCT, 2020)
  • - Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds (Theory of Computing, 2018)
  • - Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs (ACM TOCT, 2018)
  • - Efficiently decoding Reed-Muller codes from random errors (IEEE TIT, 2017)
  • - Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas (Computational Complexity, 2016)
  • - On The Structure of Boolean Functions with Small Spectral Norm (Computational Complexity, 2017)
Research Experience
  • Teaching Experience:
  • - Advanced Algorithms (Spring 2023, Spring 2024, Spring 2025)
  • - Complexity Theory (Winter 2022-2023, Winter 2023-2024, Winter 2024-2025, Winter 2025-2026)
  • - Data Structures (Spring 2022)
  • - Algebraic Computation and Algorithms (Winter 2021-2022, Spring 2024)
Background
  • Research Interests: Computational complexity theory, particularly algebraic complexity, algorithms for algebraic problems, error correcting codes, and pseudorandomness.
Miscellany
  • Graduate Students: Ziv Oznovich (M.Sc.)
Co-authors
0 total
Co-authors: 0 (list not available)