Photo is missed

Nadya Voronova

PhD student
Boston University
Email: voronova "at" bu "dot" edu

About me

I'm a third-year PhD student working at the Department of Computer Science, Boston University. My advisor is Mark Bun.
Before joining the PhD program at BU, I completed my Master's degree at Saint Petersburg Academic University in Theoretical CS under the supervision of Alexander Kulikov. I received my Bachelor's degree from Moscow State University where I studied Applied Mathematics.

Research

I'm interested in various topics across Theoretical Computer Science and Algorithm design. My current projects include projects in the areas of real polynomial approximations of boolean functions, quantum computation, sublinear algorithms and complexity theory.

Teaching

Fall 2021 Algorithmic Techniques for Taming Big Data, Teaching Fellow
Spring 2021 Theory of Computation, Teaching Fellow
Fall 2020 Advanced Algorithms, Grader
Spring 2020 Theory of Computation, Teaching Fellow

Awards

2022 Early-career AMS-NSF-Simons-ICM Travel Grant and Kovalevskaya Grant
2022 Invited participant for the Grad Cohort for Women Workshop 2022
2022 Invited participant for the Grad Cohort Workshop for IDEALS 2022
2020 Grace Hopper conference award, Boston University
2020 Invited participant for the Swiss Winter School on Theoretical Computer Science
2019 Boston University Dean's Fellowship
2018 Invited participant for the ICALP 2018

CV

My academic CV can be download here -- Updated February 2022.

Publications

  • Existence of Universal Functions for the Class of Linear k-Valued Functions with Moderate k, Voronenko, A.A., Voronova, N.K., Il’yutko, V.P., Comput Math Model (2017) 28: 78.
  • Coursework

    CS 538 (Spring'22) Cryptography
    CS 599 B1 (Spring'22) Mathematical Methods for Theoretical CS
    CS 599 T1 (Fall'21) Graph Analytics
    CS 591 K1 (Spring'21) Data Stream Processing and Analytics
    CS 591 R1 (Fall'20) Sublinear Algorithms
    CS 591 H1 (Spring'20) New Methods in Complexity Theory
    CS 591 B1 (Fall'19) Communication Complexity
    CS 591 S2 (Fall'19) Software Foundations via Formal Languages
    ... Numerous TCS courses during Master degree