Anatoly Zavyalov
I am a computer science PhD student at Boston University in the TCS Research Group, where I am fortunate to be advised by Sofya Raskhodnikova. I am interested in differential privacy and sublinear algorithms, especially in graph and distributed settings.
Outside of academia, I love game development, piano, learning languages, and long-distance biking.
Email: zavyalov AT bu DOT edu
News
- November 2026: I have received the NSERC Canada Graduate Research Scholarship (CGRS-D), valued at $120,000 CAD.
- November 2026: Our paper Subgraph Freeness Testing with Online Erasures via Fast Maker-Breaker Games got accepted to ITCS 2027!
- November 2026: I presented our paper Subgraph Counting with Local Node Differential Privacy at Boston University (with Connor Wagaman!).
- October 2026: I presented Subgraph Freeness Testing with Online Erasures via Fast Maker-Breaker Games at Tufts University and BU.
- September 2026: Our paper Subgraph Counting with Local Node Differential Privacy got accepted to SODA 2027!
- August 2026: I gave a talk at the University of Toronto Theory Seminar on our paper Local Node Differential Privacy.
- July 2026: Our paper Local Node Differential Privacy got accepted to FOCS 2026!
- June 2026: I presented our paper Local Node Differential Privacy as a poster at the TPDP 2026 (Northeastern University), as a Highlight Track Talk and poster at FORC 2026 (Harvard University), and as a talk at the Workshop on Differential Privacy and Unlearning in Machine Learning (University of Copenhagen).
- May 2026: I started a research internship at the Max Planck Institute for Security and Privacy, working with Tamalika Mukherjee.
- April 2026: I gave a talk at Columbia University on our paper Local Node Differential Privacy.
- March 2026: I gave a talk at the University of Oxford on our paper Local Node Differential Privacy.
- September 2024: I started my PhD at Boston University and received a Chair's Graduate Fellowship, worth $10,000 USD.
Publications
-
Subgraph Freeness Testing with Online Erasures via Fast Maker-Breaker Games
with Steve Choi, Ephraim Linder, Sofya Raskhodnikova. To appear at ITCS 2027. -
Subgraph Counting with Local Node Differential Privacy
with Sofya Raskhodnikova, Adam Smith, Connor Wagaman. To appear at SODA 2027. -
Local Node Differential Privacy
with Sofya Raskhodnikova, Adam Smith, Connor Wagaman. FOCS 2026. -
Transduction of Automatic Sequences and Applications
with Jeffrey Shallit. Conference on Implementation and Application of Automata, 2023. -
A graph database solution for tracking the deployment and layout of a large radio interferometer
with Adam D. Hincks, and Dhananjhay Bansal. SPIE Software and Cyberinfrastructure for Astronomy VII, 2022. -
Hydrogen Intensity and Real-time Analysis eXperiment: 256-Element Array Status and Overview.
with Devin Crichton, et al. Journal of Astronomical Telescopes, Instruments, and Systems, 2022.
Teaching
I am deeply passionate about teaching for all levels, ranging from teaching primary and high school students, to working as a teaching assistant for university courses with hundreds of students.Teaching Assistantships
Boston University- Teaching Fellow for CS237: Probability in Computing (Fall 2025, Fall 2026)
- Teaching Assistant for CSC363: Computational Complexity and Computability (Winter 2024)
- Lead Teaching Assistant for CSC373: Algorithm Design and Analysis (Fall 2023)
- Teaching Assistant for CSC240: Enriched Introduction to the Theory of Computation (Winter 2022)