Elena Gribelyuk
Hi! I'm a third-year CS PhD student at Princeton University, where I'm fortunate to be advised by Huacheng Yu . In 2022, I graduated from Columbia University, where I double-majored in mathematics (with honors) and computer science. I'm very lucky to have been advised by Alexandr Andoni, who introduced me to sketching/streaming and inspired me to pursue TCS, and Mikhail Khovanov, who generously shared his love for mathematics with me and provided endless support throughout my work with him.
Contact: eg5539 [at] princeton [dot] edu | Office: 35 Olden Street #318b
Research Interests
I'm primarily interested in streaming and sketching algorithms, communication complexity, and graph algorithms, although I'm broadly interested in theoretical computer science. Most recently, I've been thinking about adversarial robustness in the streaming model.
Publications
- Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
Elena Gribelyuk, Pachara Sawettamalya, Hongxun Wu, and Huacheng Yu (SODA 2025)
- A Strong Separation for Adversarially Robust $l_0$ Estimation for Linear Sketches
Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, and Samson Zhou (FOCS 2024)
- Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald
Elena Gribelyuk, Pachara Sawettamalya, Hongxun Wu, Huacheng Yu (PODS 2024)
Previous Research Projects
Teaching
During the summers of 2020-2022, I was a mathematics instructor at the King Summer Institute, where I taught the six-week accelerated Pre-Calculus course to 10-15 students. My responsibilities included teaching for 3 hours/weekday, writing all course materials, holding instructor office hours, and meeting with students individually to check in and offer additional help when needed.
Also, I have been a teaching assistant for the following courses at Princeton and Columbia University. My responsibilities included grading homework and exams, holding office hours and recitations, writing practice problems, and editing lecture notes.
- COS 423 Theory of Algorithms, taught by Professor Robert Tarjan in Spring 2024
- COS 521 Advanced Algorithm Design, taught by Professor Huacheng Yu in Fall 2023
- COMS 4995 Advanced Algorithms, taught by Professor Alexandr Andoni in Spring 2022
- CSOR W4231 Analysis of Algorithms, taught by Professor Alexandr Andoni in Fall 2021
- MATH UN2030 Ordinary Differential Equations, taught by Professor Evgeni Dimitrov in Fall 2021
- CSOR W4231 Analysis of Algorithms, taught by Professor Xi Chen in Summer 2021
- COMS W3261 Computer Science Theory, taught by Timothy Randolph in Summer 2021
- MATH GU4042 Modern Algebra II, taught by Professor Inbar Klang in Spring 2021
- COMS W3203 Discrete Math: Combinatorics and Graph Theory, taught by Professor Ansaf Salleb-Aouissi in Fall 2020 and Spring 2021
Lastly, I gave lectures and served as a TA for the Columbia Undergraduate Math Society's Introduction to Proofs workshop in
Fall 2020 and Fall 2021.
This was a 4-week workshop series for undergraduate students that teaches how to write mathematical proofs.
Other
Outside of TCS/math, I love classical music and playing the piano (my favorite composer is Rachmaninoff :)). I'm also passionate about math education, and I am a part-time mathematics instructor at Art of Problem Solving (Princeton location) in my free time.
