23 citations · 74 across the 22 of their papers we have counts for
38 papers
On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction
Kuan Cheng, Elena Grigorescu, Xin Li +2
The goal of the trace reconstruction problem is to recover a string given many independent {\em traces} of , where a trace is a subsequence obtained from deletin…
Approximation Algorithms for Directed Weighted Spanners
Elena Grigorescu, Nithish Kumar, Young-San Lin
In the pairwise weighted spanner problem, the input consists of an -vertex-directed graph, where each edge is assigned a cost and a length. Given vertex pairs and a distance…
Learning-Augmented Algorithms for Online Linear and Semidefinite Programming
Elena Grigorescu, Young-San Lin, Sandeep Silwal +2
Semidefinite programming (SDP) is a unifying framework that generalizes both linear programming and quadratically-constrained quadratic programming, while also yielding efficient s…
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity
Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee +1
We develop a framework for efficiently transforming certain approximation algorithms into differentially-private variants, in a black-box manner. Specifically, our results focus on…
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors
Alex Block, Jeremiah Blocki, Kuan Cheng +4
Locally Decodable Codes (LDCs) are error-correcting codes with super-fast decoding algorithms. They are important mathematical objects in many areas of theor…
On computing Discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions
Bhaskar DasGupta, Elena Grigorescu, Tamalika Mukherjee
Characterizing shapes of high-dimensional objects via Ricci curvatures plays a critical role in many research areas in mathematics and physics. However, even though several discret…