Nadezhda Voronova (she/her)
Preferred name: Nadya
Contact
Nadezhda Voronova (she/her)
Preferred name: Nadya
About
I'm a PhD candidate working under the supervision of Mark Bun at the Department of Computer Science, Boston University.
I'm interested in various aspects of Theoretical Computer Science. Currently, I'm focused on the boundaries of computing big data, where the data is assumed to be so big that it either cannot be stored fully or cannot be read fully.
My most recent projects include working on lower bounds for the
approximate degree of Boolean functions, quantum query complexity, the space complexity of quantum streaming, and streaming for problems related to circuit complexity and to differential privacy.
I'm interested in various aspects of Theoretical Computer Science. Currently, I'm focused on the boundaries of computing big data, where the data is assumed to be so big that it either cannot be stored fully or cannot be read fully.
My most recent projects include working on lower bounds for the
approximate degree of Boolean functions, quantum query complexity, the space complexity of quantum streaming, and streaming for problems related to circuit complexity and to differential privacy.
🔥
News:
- August 2023: I have passed my qualifying exam. The slides of the talk can be found here.
- July 2023: I presented our paper at TQC 2023! Portugal was amazing :) The recording of the talk can be found here (20min, conference talk) and here (40min, full talk).
- April 2023: I presented a poster about our result at CRA-WP Grad Cohort for Women. Highly recommend the event!
- April 2023: I presented our paper at the BU Theory seminar.
- April 2023: Our paper Approximate degree lower bounds for oracle identification problems got accepted to TQC 2023, conference track! Guess who is going to Portugal in July :)
- March 2023: I've redone my webpage. :)
