Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBen lee Volk
Person information
- affiliation: Reichman University, Herzliya, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk:
Determinants vs. Algebraic Branching Programs. ITCS 2024: 27:1-27:13- [c13]Shir Peleg, Amir Shpilka, Ben Lee Volk:
Tensor Reconstruction Beyond Constant Rank. ITCS 2024: 87:1-87:20 - [i33]Ashish Dwivedi, Zeyu Guo, Ben Lee Volk:
Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields. CoRR abs/2402.11915 (2024) - [i32]Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk:
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. CoRR abs/2403.01965 (2024) - [i31]Ashish Dwivedi, Zeyu Guo, Ben Lee Volk:
Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields. Electron. Colloquium Comput. Complex. TR24: TR24-028 (2024) - [i30]Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk:
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. Electron. Colloquium Comput. Complex. TR24: TR24-043 (2024) - 2023
- [j15]Ben Lee Volk:
SIGACT News Complexity Theory Column 118. SIGACT News 54(2): 43 (2023) - [j14]Ben Lee Volk:
SIGACT News Complexity Theory Column 119. SIGACT News 54(4): 53 (2023) - [c12]Zeyu Guo
, Ben Lee Volk, Akhil Jalan, David Zuckerman:
Extractors for Images of Varieties. STOC 2023: 46-59 - [i29]Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk:
Determinants vs. Algebraic Branching Programs. CoRR abs/2308.04599 (2023) - [i28]Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk:
Determinants vs. Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j13]Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
Quadratic Lower Bounds for Algebraic Branching Programs and Formulas. Comput. Complex. 31(2): 8 (2022) - [j12]Mrinal Kumar, Ben Lee Volk:
A Lower Bound on Determinantal Complexity. Comput. Complex. 31(2): 12 (2022) - [j11]Shir Peleg, Amir Shpilka, Ben Lee Volk:
Lower Bounds on Stabilizer Rank. Quantum 6: 652 (2022) - [j10]Ben Lee Volk, Mrinal Kumar:
A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits. ACM Trans. Comput. Theory 14(2): 6:1-6:14 (2022) - [c11]Shir Peleg, Ben Lee Volk, Amir Shpilka:
Lower Bounds on Stabilizer Rank. ITCS 2022: 110:1-110:4 - [i27]Shir Peleg, Amir Shpilka, Ben Lee Volk:
Tensor Reconstruction Beyond Constant Rank. CoRR abs/2209.04177 (2022) - [i26]Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman:
Extractors for Images of Varieties. CoRR abs/2211.14497 (2022) - [i25]Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman:
Extractors for Images of Varieties. Electron. Colloquium Comput. Complex. TR22 (2022) - [i24]Shir Peleg, Amir Shpilka, Ben Lee Volk:
Tensor Reconstruction Beyond Constant Rank. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j9]Ben Lee Volk, Mrinal Kumar:
Lower Bounds for Matrix Factorization. Comput. Complex. 30(1): 6 (2021) - [j8]Ben Lee Volk:
Guest Column: Algebraic Natural Proofs Ben Lee Volk. SIGACT News 52(4): 56-73 (2021) - [c10]Mrinal Kumar, Ben Lee Volk:
A Lower Bound on Determinantal Complexity. CCC 2021: 4:1-4:12 - [c9]Mrinal Kumar, Ben Lee Volk:
A Polynomial Degree Bound on Equations for Non-Rigid Matrices and Small Linear Circuits. ITCS 2021: 9:1-9:9 - [i23]Shir Peleg, Amir Shpilka, Ben Lee Volk:
Lower Bounds on Stabilizer Rank. CoRR abs/2106.03214 (2021) - [i22]Shir Peleg, Amir Shpilka, Ben Lee Volk:
Lower Bounds on Stabilizer Rank. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j7]Noga Alon, Mrinal Kumar, Ben Lee Volk:
Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Comb. 40(2): 149-178 (2020) - [j6]Rohit Gurjar, Ben Lee Volk:
Pseudorandom Bits for Oblivious Branching Programs. ACM Trans. Comput. Theory 12(2): 8:1-8:12 (2020) - [c8]Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
A Quadratic Lower Bound for Algebraic Branching Programs. CCC 2020: 2:1-2:21 - [c7]Mrinal Kumar, Ben Lee Volk:
Lower Bounds for Matrix Factorization. CCC 2020: 5:1-5:20 - [i21]Mrinal Kumar, Ben Lee Volk:
A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits. CoRR abs/2003.12938 (2020) - [i20]Mrinal Kumar, Ben Lee Volk:
A Lower Bound on Determinantal Complexity. CoRR abs/2009.02452 (2020) - [i19]Mrinal Kumar, Ben Lee Volk:
A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits. Electron. Colloquium Comput. Complex. TR20 (2020) - [i18]Mrinal Kumar, Ben Lee Volk:
A Lower Bound on Determinantal Complexity. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [i17]Mrinal Kumar, Ben Lee Volk:
Lower Bounds for Matrix Factorization. CoRR abs/1904.01182 (2019) - [i16]Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
A Quadratic Lower Bound for Algebraic Branching Programs. CoRR abs/1911.11793 (2019) - [i15]Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
A Quadratic Lower Bound for Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR19 (2019) - [i14]Mrinal Kumar, Ben Lee Volk:
Lower Bounds for Matrix Factorization. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [b1]Ben Lee Volk:
Identity Testing and Lower Bounds in Arithmetic Complexity. Tel Aviv University, Israel, 2018 - [j5]Michael A. Forbes, Amir Shpilka, Ben Lee Volk:
Succinct Hitting Sets and Barriers to Proving Lower Bounds for Algebraic Circuits. Theory Comput. 14(1): 1-45 (2018) - [j4]Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. ACM Trans. Comput. Theory 10(1): 3:1-3:30 (2018) - [c6]Noga Alon, Mrinal Kumar, Ben Lee Volk:
Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. CCC 2018: 11:1-11:16 - 2017
- [j3]Amir Shpilka, Avishay Tal, Ben lee Volk:
On the Structure of Boolean Functions with Small Spectral Norm. Comput. Complex. 26(1): 229-273 (2017) - [j2]Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Efficiently Decoding Reed-Muller Codes From Random Errors. IEEE Trans. Inf. Theory 63(4): 1954-1960 (2017) - [c5]Michael A. Forbes, Amir Shpilka, Ben Lee Volk:
Succinct hitting sets and barriers to proving algebraic circuits lower bounds. STOC 2017: 653-664 - [i13]Michael A. Forbes, Amir Shpilka, Ben Lee Volk:
Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds. CoRR abs/1701.05328 (2017) - [i12]Mrinal Kumar, Ben Lee Volk:
An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. CoRR abs/1708.02037 (2017) - [i11]Rohit Gurjar, Ben Lee Volk:
Pseudorandom Bits for Oblivious Branching Programs. CoRR abs/1708.02054 (2017) - [i10]Michael A. Forbes, Amir Shpilka, Ben Lee Volk:
Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds. Electron. Colloquium Comput. Complex. TR17 (2017) - [i9]Rohit Gurjar, Ben Lee Volk:
Pseudorandom Bits for Oblivious Branching Programs. Electron. Colloquium Comput. Complex. TR17 (2017) - [i8]Mrinal Kumar, Ben Lee Volk:
An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j1]Rafael Oliveira, Amir Shpilka, Ben lee Volk:
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. Comput. Complex. 25(2): 455-505 (2016) - [c4]Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. CCC 2016: 30:1-30:25 - [c3]Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Efficiently decoding Reed-Muller codes from random errors. STOC 2016: 227-235 - 2015
- [c2]Rafael Oliveira, Amir Shpilka, Ben Lee Volk:
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. CCC 2015: 304-322 - [i7]Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Decoding high rate Reed-Muller codes from random errors in near linear time. CoRR abs/1503.09092 (2015) - [i6]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 abs/1511.07136 (2015) - [i5]Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c1]Amir Shpilka, Avishay Tal, Ben lee Volk:
On the structure of boolean functions with small spectral norm. ITCS 2014: 37-48 - [i4]Rafael Oliveira, Amir Shpilka, Ben Lee Volk:
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. CoRR abs/1411.7492 (2014) - [i3]Rafael Oliveira, Amir Shpilka, Ben Lee Volk:
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [i2]Amir Shpilka, Ben lee Volk:
On the Structure of Boolean Functions with Small Spectral Norm. CoRR abs/1304.0371 (2013) - [i1]Amir Shpilka, Ben lee Volk:
On the Structure of Boolean Functions with Small Spectral Norm. Electron. Colloquium Comput. Complex. TR13 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
