HTTP/2 200 server: GitHub.com content-type: text/html; charset=utf-8 last-modified: Thu, 13 Nov 2025 16:35:08 GMT access-control-allow-origin: * strict-transport-security: max-age=31556952 etag: W/"691608bc-1fa5" expires: Tue, 30 Dec 2025 19:03:54 GMT cache-control: max-age=600 content-encoding: gzip x-proxy-cache: MISS x-github-request-id: 54F0:123DE:A641DD:BABA1D:69541FC2 accept-ranges: bytes date: Tue, 30 Dec 2025 18:53:54 GMT via: 1.1 varnish age: 0 x-served-by: cache-bom-vanm7210032-BOM x-cache: MISS x-cache-hits: 0 x-timer: S1767120835.525118,VS0,VE214 vary: Accept-Encoding x-fastly-request-id: 68954276fdca520c18b46e64e5a8cd53ff9004ff content-length: 3414

Elena Gribelyuk

Hi! I'm a fourth-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

• Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, and Samson Zhou

STOC 2025 [Talk: STOC]

• 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 [Talk: Samson at Simons] [Talk: FOCS]

• Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald
Elena Gribelyuk, Pachara Sawettamalya, Hongxun Wu, Huacheng Yu

PODS 2024

---

Previous Research Projects

• Senior thesis: Temperley-Lieb categories and dynamics in commutative monoids (2020-2022)
  • Advisor: Mikhail Khovanov

---

Teaching

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

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. I previously taught the High School Contest Math summer class (Summer 2023, 2025), Algebra 2 (AY 2023-2024), and Pre-Calculus (AY 2024-2025). I am teaching High School Contest Math during the 2025-2026 academic year. Previously, 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. 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.

---

Talks

1. Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
• EnCORE Workshop on New Horizons in Adaptive Robustness
• ACM Symposium on Theory of Computing, June 2025
• NYC Graduate Student TCS Day, NYU Tandon, May 2025 (Slides)
• Workshop on Algorithms for Large Data (Online) 2025 (Poster)
• Princeton Gems of TCS Seminar, March 2025
2. A Strong Separation for Adversarially Robust $l_0$ Estimation for Linear Sketches
• Swiss Winter School on Theoretical Computer Science, January 2025 (Poster and selected talk)
• IEEE Symposium on Foundations of Computer Science, October 2024
• NYC Graduate Student TCS Day, NYU Tandon, October 2024
• Princeton Gems of TCS Seminar, April 2024
3. Miscellaneous talks:
• Streaming lower bounds for $F_p$ moment estimation via communication complexity (Princeton Communication Complexity Seminar, August 2024)
• Techniques for proving streaming lower bounds via communication complexity (Princeton Communication Complexity Seminar, July 2024)
• Connections between Adversarially Robust Streaming, Differential Privacy, and Adaptive Data Analysis (Princeton Gems of TCS Seminar, November 2023)

---

Service

I was a co-organizer for Princeton Theory Lunch from 2023-2024, and am organizing theory lunch again this academic year.
Reviewer: FOCS 2024, SODA 2025, FOCS 2025, SODA 2026, SOSA 2026, ITCS 2026

---

Other

Outside of TCS/math, I love classical music and playing the piano (my favorite composer is Rachmaninoff :)). I also love to run, hike, and bake in my free time.

---