Improved Polynomial Identity Testing for Read-Once Formulas. - Amir Shpilka; Ilya Volkovich (APPROX-RANDOM, 2009)

Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae. - Matthew Anderson; Dieter van Melkebeek; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2010)

On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors. - Amir Shpilka; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2010)

Black-Box Identity Testing of Depth-4 Multilinear Circuits. - Shubhangi Saraf; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2011)

Polynomial identity testing and its relation to some algebraic problems. - Ilya Volkovich (2011)

Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in. - Zohar Shay Karnin; Partha Mukhopadhyay; Amir Shpilka; Ilya Volkovich (SIAM J. Comput., 2013)

On Learning, Lower Bounds and (un)Keeping Promises. - Ilya Volkovich (Electron. Colloquium Comput. Complex., 2014)

Deterministically Factoring Sparse Polynomials into Multilinear Factors. - Ilya Volkovich (Electron. Colloquium Comput. Complex., 2014)

On Reconstruction and Testing of Read-Once Formulas. - Amir Shpilka; Ilya Volkovich (Theory Comput., 2014)

Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials. - Ilya Volkovich (APPROX-RANDOM, 2015)

Deterministic polynomial identity tests for multilinear bounded-read formulae. - Matthew Anderson; Dieter van Melkebeek; Ilya Volkovich (Comput. Complex., 2015)

Read-once polynomial identity testing. - Amir Shpilka; Ilya Volkovich (Comput. Complex., 2015)

Computations beyond Exponentiation Gates and Applications. - Ilya Volkovich (Electron. Colloquium Comput. Complex., 2015)

A Guide to Learning Arithmetic Circuits. - Ilya Volkovich (Electron. Colloquium Comput. Complex., 2015)

Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas. - Daniel Minahan; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2016)

Characterizing Arithmetic Read-Once Formulae. - Ilya Volkovich (ACM Trans. Comput. Theory, 2016)

On Some Computations on Sparse Polynomials. - Ilya Volkovich (APPROX-RANDOM, 2017)

One (more) line on the most Ancient Algorithm in History. - Ilya Volkovich (CoRR, 2018)

Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree. - Vishwas Bhargava; Shubhangi Saraf; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2018)

A story of AM and Unique-SAT. - Ilya Volkovich (Electron. Colloquium Comput. Complex., 2018)

The Complexity of Finding S-Factors in Regular Graphs. - Sanjana Kolisetty; Linh Le; Ilya Volkovich; Mihalis Yannakakis (FSTTCS, 2019)

Reconstruction of Depth-$4$ Multilinear Circuits. - Vishwas Bhargava; Shubhangi Saraf; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2019)

The Complexity of Finding S-factors in Regular Graphs. - Sanjana Kolisetty; Linh Le; Ilya Volkovich; Mihalis Yannakakis (Electron. Colloquium Comput. Complex., 2019)

The Power of Leibniz-Like Functions as Oracles. - Jaeyoon Kim; Ilya Volkovich; Nelson Xuzhi Zhang (CSR, 2020)

The Untold Story of SBP. - Ilya Volkovich (CSR, 2020)

One (more) line on the most Ancient Algorithm in History. - Bruno Grenet; Ilya Volkovich (SOSA, 2020)

One-Way Functions and a Conditional Variant of MKTP. - Eric Allender; Mahdi Cheraghchi; Dimitrios Myrisiotis; Harsha Tirumala; Ilya Volkovich (FSTTCS, 2021)

Approximating the Number of Prime Factors Given an Oracle to Euler's Totient Function. - Yang Du; Ilya Volkovich (FSTTCS, 2021)

One-way Functions and Partial MCSP. - Eric Allender; Mahdi Cheraghchi; Dimitrios Myrisiotis; Harsha Tirumala; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2021)

Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits. - Vishwas Bhargava; Shubhangi Saraf; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2021)

Synergy Between Circuit Obfuscation and Circuit Minimization. - Russell Impagliazzo; Valentine Kabanets; Ilya Volkovich (APPROX/RANDOM, 2023)

New Characterization of the Factor Refinement Algorithm with Applications. - Aditya Ravi; Ilya Volkovich (ISSAC, 2023)

Linear Independence, Alternants and Applications. - Vishwas Bhargava; Shubhangi Saraf; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2023)

Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae. - Pranav Bisht; Nikhil Gupta 008; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2023)

Mutual Empowerment between Circuit Obfuscation and Circuit Minimization. - Russell Impagliazzo; Valentine Kabanets; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2023)

The final nail in the coffin of statistically-secure obfuscator. - Ilya Volkovich (Inf. Process. Lett., 2023)

The Power of Natural Properties as Oracles. - Russell Impagliazzo; Valentine Kabanets; Ilya Volkovich (Comput. Complex., 2023)

Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies. - Karthik Gajulapalli; Zeyong Li; Ilya Volkovich (FSTTCS, 2024)

Launching Identity Testing into (Bounded) Space. - Pranav Bisht; Nikhil Gupta 008; Prajakta Nimbhorkar; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2024)

Oblivious Classes Revisited: Lower Bounds and Hierarchies. - Karthik Gajulapalli; Zeyong Li; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2024)

Communication Complexity of Equality and Error Correcting Codes. - Dale Jacobs; John Jeang; Vladimir Podolskii 001; Morgan E. Prior; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2025)

Upper and Lower Bounds for the Linear Ordering Principle. - Edward A. Hirsch; Ilya Volkovich (CoRR, 2025)

On Solving Sparse Polynomial Factorization Related Problems. - Pranav Bisht; Ilya Volkovich (Comput. Complex., 2025)