default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlya Volkovich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j13]Vishwas Bhargava
, Shubhangi Saraf, Ilya Volkovich:
Linear Independence, Alternants and Applications. SIAM J. Comput. 55(1): 28-64 (2026)- [c30]Ilya Volkovich:
Yet Another Proof that BPP ⊆ PH. SOSA 2026: 551-556 - [c29]Edward A. Hirsch, Ilya Volkovich:
Upper and Lower Bounds for the Linear Ordering Principle. STACS 2026: 52:1-52:19 - [i35]Ilya Volkovich:
Yet Another Proof that $BPP \subseteq PH$. Electron. Colloquium Comput. Complex. TR26: Article TR26-004 (2026) - 2025
- [j12]Pranav Bisht, Ilya Volkovich:
On Solving Sparse Polynomial Factorization Related Problems. Comput. Complex. 34(1): 7 (2025) - [j11]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Reconstruction of Depth-4 Multilinear Circuits. ACM Trans. Comput. Theory 17(3): 17:1-17:23 (2025) - [c28]Dale Jacobs, John Jeang, Vladimir Podolskii, Morgan E. Prior, Ilya Volkovich:
Communication Complexity of Equality and Error-Correcting Codes. FSTTCS 2025: 37:1-37:19 - [i34]Edward A. Hirsch, Ilya Volkovich:
Upper and Lower Bounds for the Linear Ordering Principle. CoRR abs/2503.19188 (2025) - [i33]Karthik Gajulapalli, Zeyong Li, Ilya Volkovich:
Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies. CoRR abs/2510.15268 (2025) - [i32]Edward A. Hirsch, Ilya Volkovich:
A Note on Avoid vs MCSP. CoRR abs/2512.21764 (2025) - [i31]Edward A. Hirsch, Ilya Volkovich:
Upper and Lower Bounds for the Linear Ordering Principle. Electron. Colloquium Comput. Complex. TR25: Article TR25-142 (2025) - [i30]Edward A. Hirsch, Ilya Volkovich:
A Note on Avoid vs MCSP. Electron. Colloquium Comput. Complex. TR25: Article TR25-220 (2025) - [i29]Dale Jacobs, John Jeang, Vladimir Podolskii, Morgan E. Prior, Ilya Volkovich:
Communication Complexity of Equality and Error Correcting Codes. Electron. Colloquium Comput. Complex. TR25: Article TR25-068 (2025) - 2024
- [c27]Karthik Gajulapalli, Zeyong Li, Ilya Volkovich:
Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies. FSTTCS 2024: 23:1-23:19 - [i28]Pranav Bisht, Nikhil Gupta, Prajakta Nimbhorkar, Ilya Volkovich:
Launching Identity Testing into (Bounded) Space. Electron. Colloquium Comput. Complex. TR24: Article TR24-041 (2024) - [i27]Karthik Gajulapalli, Zeyong Li, Ilya Volkovich:
Oblivious Classes Revisited: Lower Bounds and Hierarchies. Electron. Colloquium Comput. Complex. TR24: Article TR24-049 (2024) - 2023
- [j10]Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich:
The Power of Natural Properties as Oracles. Comput. Complex. 32(2): 6 (2023) - [j9]Ilya Volkovich:
The final nail in the coffin of statistically-secure obfuscator. Inf. Process. Lett. 182: 106366 (2023) - [c26]Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich:
Synergy Between Circuit Obfuscation and Circuit Minimization. APPROX/RANDOM 2023: 31:1-31:21 - [c25]Pranav Bisht, Nikhil Gupta, Ilya Volkovich:
Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae. FSTTCS 2023: 9:1-9:23 - [c24]Aditya Ravi, Ilya Volkovich:
New Characterization of the Factor Refinement Algorithm with Applications. ISSAC 2023: 490-497 - [c23]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Linear Independence, Alternants, and Applications. STOC 2023: 441-454 - [i26]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Linear Independence, Alternants and Applications. Electron. Colloquium Comput. Complex. TR23: Article TR23-032 (2023) - [i25]Pranav Bisht, Nikhil Gupta, Ilya Volkovich:
Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae. Electron. Colloquium Comput. Complex. TR23: Article TR23-109 (2023) - [i24]Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich:
Mutual Empowerment between Circuit Obfuscation and Circuit Minimization. Electron. Colloquium Comput. Complex. TR23: Article TR23-079 (2023) - 2022
- [c22]Pranav Bisht, Ilya Volkovich:
On Solving Sparse Polynomial Factorization Related Problems. FSTTCS 2022: 10:1-10:22 - [i23]Pranav Bisht, Ilya Volkovich:
On Solving Sparse Polynomial Factorization Related Problems. Electron. Colloquium Comput. Complex. TR22: Article TR22-070 (2022) - 2021
- [c21]Eric Allender, Mahdi Cheraghchi, Dimitrios Myrisiotis, Harsha Tirumala, Ilya Volkovich:
One-Way Functions and a Conditional Variant of MKTP. FSTTCS 2021: 7:1-7:19 - [c20]Yang Du, Ilya Volkovich:
Approximating the Number of Prime Factors Given an Oracle to Euler's Totient Function. FSTTCS 2021: 17:1-17:10 - [c19]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits. STOC 2021: 809-822 - [i22]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits. CoRR abs/2105.01751 (2021) - [i21]Eric Allender, Mahdi Cheraghchi, Dimitrios Myrisiotis, Harsha Tirumala, Ilya Volkovich:
One-way Functions and Partial MCSP. Electron. Colloquium Comput. Complex. TR21: Article TR21-009 (2021) - [i20]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits. Electron. Colloquium Comput. Complex. TR21: Article TR21-045 (2021) - [i19]Ilya Volkovich:
The Final Nail in the Coffin of Statistically-Secure Obfuscator. Electron. Colloquium Comput. Complex. TR21: Article TR21-085 (2021) - 2020
- [j8]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree. J. ACM 67(2): 8:1-8:28 (2020) - [c18]Jaeyoon Kim, Ilya Volkovich, Nelson Xuzhi Zhang:
The Power of Leibniz-Like Functions as Oracles. CSR 2020: 263-275 - [c17]Ilya Volkovich:
The Untold Story of SBP. CSR 2020: 393-405 - [c16]Bruno Grenet, Ilya Volkovich:
One (more) line on the most Ancient Algorithm in History. SOSA 2020: 15-17 - [c15]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Reconstruction of Depth-4 Multilinear Circuits. SODA 2020: 2144-2160
2010 – 2019
- 2019
- [c14]Sanjana Kolisetty, Linh Le, Ilya Volkovich, Mihalis Yannakakis:
The Complexity of Finding S-Factors in Regular Graphs. FSTTCS 2019: 21:1-21:12 - [i18]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Reconstruction of Depth-$4$ Multilinear Circuits. Electron. Colloquium Comput. Complex. TR19: Article TR19-104 (2019) - [i17]Sanjana Kolisetty, Linh Le, Ilya Volkovich, Mihalis Yannakakis:
The Complexity of Finding S-factors in Regular Graphs. Electron. Colloquium Comput. Complex. TR19: Article TR19-040 (2019) - 2018
- [j7]Shubhangi Saraf, Ilya Volkovich:
Black-Box Identity Testing of Depth-4 Multilinear Circuits. Comb. 38(5): 1205-1238 (2018) - [j6]Daniel Minahan, Ilya Volkovich:
Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas. ACM Trans. Comput. Theory 10(3): 10:1-10:11 (2018) - [c13]Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich:
The Power of Natural Properties as Oracles. CCC 2018: 7:1-7:20 - [c12]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree. FOCS 2018: 485-496 - [i16]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree. CoRR abs/1808.06655 (2018) - [i15]Ilya Volkovich:
One (more) line on the most Ancient Algorithm in History. CoRR abs/1808.07957 (2018) - [i14]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree. Electron. Colloquium Comput. Complex. TR18: Article TR18-130 (2018) - [i13]Ilya Volkovich:
A story of AM and Unique-SAT. Electron. Colloquium Comput. Complex. TR18: Article TR18-088 (2018) - 2017
- [c11]Ilya Volkovich:
On Some Computations on Sparse Polynomials. APPROX-RANDOM 2017: 48:1-48:21 - [c10]Daniel Minahan, Ilya Volkovich:
Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas. CCC 2017: 32:1-32:13 - [i12]Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich:
The Power of Natural Properties as Oracles. Electron. Colloquium Comput. Complex. TR17: Article TR17-023 (2017) - 2016
- [j5]Ilya Volkovich:
Characterizing Arithmetic Read-Once Formulae. ACM Trans. Comput. Theory 8(1): 2:1-2:19 (2016) - [c9]Ilya Volkovich:
A Guide to Learning Arithmetic Circuits. COLT 2016: 1540-1561 - [i11]Daniel Minahan, Ilya Volkovich:
Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas. Electron. Colloquium Comput. Complex. TR16: Article TR16-171 (2016) - 2015
- [j4]Amir Shpilka, Ilya Volkovich:
Read-once polynomial identity testing. Comput. Complex. 24(3): 477-532 (2015) - [j3]Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich:
Deterministic polynomial identity tests for multilinear bounded-read formulae. Comput. Complex. 24(4): 695-776 (2015) - [c8]Ilya Volkovich:
Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials. APPROX-RANDOM 2015: 943-958 - [i10]Ilya Volkovich:
Computations beyond Exponentiation Gates and Applications. Electron. Colloquium Comput. Complex. TR15: Article TR15-042 (2015) - [i9]Ilya Volkovich:
A Guide to Learning Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR15: Article TR15-115 (2015) - 2014
- [j2]Amir Shpilka, Ilya Volkovich:
On Reconstruction and Testing of Read-Once Formulas. Theory Comput. 10: 465-514 (2014) - [c7]Ilya Volkovich:
On Learning, Lower Bounds and (un)Keeping Promises. ICALP (1) 2014: 1027-1038 - [i8]Ilya Volkovich:
Characterizing Arithmetic Read-Once Formulae. CoRR abs/1408.1995 (2014) - [i7]Ilya Volkovich:
On Learning, Lower Bounds and (un)Keeping Promises. Electron. Colloquium Comput. Complex. TR14: Article TR14-058 (2014) - [i6]Ilya Volkovich:
Deterministically Factoring Sparse Polynomials into Multilinear Factors. Electron. Colloquium Comput. Complex. TR14: Article TR14-168 (2014) - 2013
- [j1]Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich:
Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in. SIAM J. Comput. 42(6): 2114-2131 (2013) - 2011
- [b1]Ilya Volkovich:
Polynomial identity testing and its relation to some algebraic problems. Technion - Israel Institute of Technology, Israel, 2011 - [c6]Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich:
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae. CCC 2011: 273-282 - [c5]Shubhangi Saraf, Ilya Volkovich:
Black-box identity testing of depth-4 multilinear circuits. STOC 2011: 421-430 - [i5]Shubhangi Saraf, Ilya Volkovich:
Black-Box Identity Testing of Depth-4 Multilinear Circuits. Electron. Colloquium Comput. Complex. TR11: Article TR11-046 (2011) - 2010
- [c4]Amir Shpilka, Ilya Volkovich:
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors. ICALP (1) 2010: 408-419 - [c3]Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich:
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in. STOC 2010: 649-658 - [i4]Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich:
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae. Electron. Colloquium Comput. Complex. TR10: Article TR10-188 (2010) - [i3]Amir Shpilka, Ilya Volkovich:
Read-Once Polynomial Identity Testing. Electron. Colloquium Comput. Complex. TR10: Article TR10-011 (2010) - [i2]Amir Shpilka, Ilya Volkovich:
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors. Electron. Colloquium Comput. Complex. TR10: Article TR10-036 (2010)
2000 – 2009
- 2009
- [c2]Amir Shpilka, Ilya Volkovich:
Improved Polynomial Identity Testing for Read-Once Formulas. APPROX-RANDOM 2009: 700-713 - [i1]Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich:
Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in. Electron. Colloquium Comput. Complex. TR09: Article TR09-116 (2009) - 2008
- [c1]Amir Shpilka, Ilya Volkovich:
Read-once polynomial identity testing. STOC 2008: 507-516
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 2026-02-26 23:30 CET 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:
