Ilya Volkovich
Scholar

Ilya Volkovich

Google Scholar ID: Xd6_27cAAAAJ
Boston College
Theoretical Computer ScienceDerandomizationComputational ComplexityComputational Learning TheoryRandomness in Computatio
Citations & Impact
All-time
Citations
326
 
H-index
11
 
i10-index
13
 
Publications
20
 
Co-authors
2
list available
Resume (English only)
Academic Achievements
  • Co-organized the 66th Midwest Theory Day at the University of Michigan; on the PC for ITCS 2026; student Daniel Minahan received honorable mention in the CRA Undergraduate Research Award.
Research Experience
  • Currently an Assistant Professor in the Computer Science Department at Boston College; previously on the faculty of the Computer Science and Engineering Division at the University of Michigan; was a Postdoctoral Research Associate (postdoc) in the Computer Science Department at Princeton University and the School of Mathematics at the Institute of Advanced Study.
Education
  • Ph.D. in Computer Science from Technion, Israel Institute of Technology, advised by Amir Shpilka.
Background
  • Research interests include Computational Complexity with applications to Cryptography and Machine Learning, particularly Algebraic Complexity, Randomness in Computation, Meta Complexity, and Computational Learning Theory. Additionally, interested in teaching Theory of Computation to undergraduate students.
Miscellany
  • Contact Info: Office 428F, Phone (617)-552-3905, E-mail ilya.volkovich@bc.edu.