| Read-once polynomial identity testing A Shpilka, I Volkovich Proceedings of the fortieth annual ACM symposium on Theory of computing, 507-516, 2008 | 99 | 2008 |
| Improved polynomial identity testing for read-once formulas A Shpilka, I Volkovich International Workshop on Approximation Algorithms for Combinatorial …, 2009 | 78 | 2009 |
| Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in ZS Karnin, P Mukhopadhyay, A Shpilka, I Volkovich Proceedings of the forty-second ACM symposium on Theory of computing, 649-658, 2010 | 63 | 2010 |
| On the relation between polynomial identity testing and finding variable disjoint factors A Shpilka, I Volkovich International Colloquium on Automata, Languages, and Programming, 408-419, 2010 | 52 | 2010 |
| Black-box identity testing of depth-4 multilinear circuits S Saraf, I Volkovich Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 50 | 2011 |
| The power of natural properties as oracles R Impagliazzo, V Kabanets, I Volkovich computational complexity 32 (2), 6, 2023 | 41 | 2023 |
| Derandomizing polynomial identity testing for multilinear constant-read formulae M Anderson, D van Melkebeek, I Volkovich 2011 IEEE 26th Annual Conference on Computational Complexity, 273-282, 2011 | 38 | 2011 |
| Complete derandomization of identity testing and reconstruction of read-once formulas D Minahan, I Volkovich ACM Transactions on Computation Theory (TOCT) 10 (3), 1-11, 2018 | 26 | 2018 |
| Black-box identity testing of depth-4 multilinear circuits S Saraf, I Volkovich Combinatorica 38, 1205-1238, 2018 | 22 | 2018 |
| A guide to learning arithmetic circuits I Volkovich Conference on Learning Theory, 1540-1561, 2016 | 22 | 2016 |
| Characterizing arithmetic read-once formulae I Volkovich ACM Transactions on Computation Theory (ToCT) 8 (1), 1-19, 2016 | 20 | 2016 |
| One-way functions and a conditional variant of MKTP E Allender, M Cheraghchi, D Myrisiotis, H Tirumala, I Volkovich Leibniz international proceedings in informatics 213, 2021 | 19 | 2021 |
| On reconstruction and testing of read-once formulas A Shpilka, I Volkovich Theory of Computing 10 (1), 465-514, 2014 | 19 | 2014 |
| Deterministic factorization of sparse polynomials with bounded individual degree V Bhargava, S Saraf, I Volkovich Journal of the ACM (JACM) 67 (2), 1-28, 2020 | 17 | 2020 |
| Deterministic polynomial identity tests for multilinear bounded-read formulae M Anderson, D van Melkebeek, I Volkovich computational complexity 24, 695-776, 2015 | 17 | 2015 |
| Deterministically factoring sparse polynomials into multilinear factors and sums of univariate polynomials I Volkovich Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015 | 15 | 2015 |
| Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits V Bhargava, S Saraf, I Volkovich Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 11 | 2021 |
| Reconstruction of depth-4 multilinear circuits V Bhargava, S Saraf, I Volkovich SODA 2020, 2020 | 9 | 2020 |
| On some computations on sparse polynomials I Volkovich Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017 | 9 | 2017 |
| On learning, lower bounds and (un) keeping promises I Volkovich International Colloquium on Automata, Languages, and Programming, 1027-1038, 2014 | 9 | 2014 |
