Elena Grigorescu
Computer Science · Purdue University West Lafayette
Publications
130
Citations
909
Est. group size
~3
Recurring co-author estimate
Active years
24
Publishing since 2003
Elena Grigorescu works in theoretical computer science, focusing on the design and analysis of algorithms, especially for problems involving error-correcting codes, graph structures, and data compression. Her recent work spans topics like locally decodable codes (methods for retrieving small pieces of encoded data efficiently), network design (building efficient routing structures called spanners), and learning-augmented algorithms (algorithms that use predictions to improve performance). This research is largely mathematical and aims to establish provable guarantees or limits on what algorithms can achieve.
Publication output has been somewhat variable over the past decade, with a higher rate around 2017-2018, a dip around 2019-2023, and a modest, steady pace of roughly 5-7 papers per year in recent years.
Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026
- Approximation Algorithms for Directed Weighted Spanners
Algorithmica · 2026
- Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes
2026
- SIGACT News Complexity Theory Column 126 <b>Locally Decodable Codes for Insertions and Deletions</b>
ACM SIGACT News · 2025
- Communication with Perfect Feedback for Bit Flips and Erasures
2025
- On the Hardness of the One-Sided Code Sparsifier Problem
arXiv (Cornell University) · 2025
- Noisy-Syndrome Decoding of Hypergraph Product Codes
arXiv (Cornell University) · 2025
- A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
arXiv (Cornell University) · 2024
- Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
arXiv (Cornell University) · 2024
- Directed Buy-At-Bulk Spanners
arXiv (Cornell University) · 2024
- Routing-Controlled Spanners
arXiv (Cornell University) · 2024
- Special Section on the Sixty-First Annual IEEE Symposium on Foundations of Computer Science (2020)
SIAM Journal on Computing · 2024
- On computing discretized Ricci curvatures of graphs: Local algorithms and (localized) fine-grained reductions
Theoretical Computer Science · 2023
- Learning-Augmented Algorithms for Online Linear and Semidefinite Programming
arXiv (Cornell University) · 2022
- Hardness of Maximum Likelihood Learning of DPPs
arXiv (Cornell University) · 2022
- On computing Discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions
arXiv (Cornell University) · 2022
- arXiv (Cornell University)×30
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)×6
- Leibniz-Zentrum für Informatik (Schloss Dagstuhl)×6
- IEEE Transactions on Information Theory×4
- Algorithmica×3
- Kent Quanrud
Computer Science · Purdue University West Lafayette
- Pooya Hatami
Computer Science · The Ohio State University
- Qin Zhang
Computer Science · Indiana University
- Billy Jin
Computer Science · Purdue University West Lafayette
- Hemanta K. Maji
Computer Science · Purdue University West Lafayette
This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.
Last updated Jul 20, 2026.
Claim or correct this profile