15 citations · 35 across the 12 of their papers we have counts for
4 papers · 1 filter
Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
Gramoz Goranci, Peter Kiss, Neel Patel +3
We consider the Euclidean bi-chromatic matching problem in the dynamic setting, where the goal is to efficiently process point insertions and deletions while maintaining a high-qua…
Online List Labeling with Near-Logarithmic Writes
Martin P. Seybold
In the Online List Labeling problem, a set of elements from a totally ordered universe must be stored in sorted order in an array with s…
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems
Monika Henzinger, Barna Saha, Martin P. Seybold +1
{\em Algorithms with predictions} incorporate machine learning predictions into algorithm design. A plethora of recent works incorporated predictions to improve on worst-case optim…
B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load
Roodabeh Safavi, Martin P. Seybold
Uniquely represented data structures represent each logical state with a unique storage state. We study the problem of maintaining a dynamic set of keys from a totally ordered…