Derives the Pareto frontier for consistency C versus robustness R in randomized learning-augmented online bidding, with matching analytical bounds when R >= 2.885.
Learning augmented binary search trees
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A prediction-augmented data structure for incremental SCC maintenance achieves near-optimal update times with accurate edge-order predictions and degrades smoothly with prediction error.
citing papers explorer
-
The Pareto Frontier of Randomized Learning-Augmented Online Bidding
Derives the Pareto frontier for consistency C versus robustness R in randomized learning-augmented online bidding, with matching analytical bounds when R >= 2.885.
-
Incremental Strongly Connected Components with Predictions
A prediction-augmented data structure for incremental SCC maintenance achieves near-optimal update times with accurate edge-order predictions and degrades smoothly with prediction error.