research
∙
09/17/2022
A Nearly Tight Lower Bound for the d-Dimensional Cow-Path Problem
In the d-dimensional cow-path problem, a cow living in ℝ^d must locate a...
share
research
∙
07/21/2022
Tight Bounds for Monotone Minimal Perfect Hashing
The monotone minimal perfect hash function (MMPHF) problem is the follow...
research
∙
07/02/2022
Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings
Dynamic Time Warping (DTW) is a widely used similarity measure for compa...
research
∙
05/03/2022
Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game
The p-processor cup game is a classic and widely studied scheduling prob...
research
∙
03/05/2022
Online List Labeling: Breaking the log^2n Barrier
The online list labeling problem is an algorithmic primitive with a larg...
research
∙
09/09/2021
All-Purpose Hashing
Despite being one of the oldest data structures in computer science, has...
research
∙
04/12/2021
How Asymmetry Helps Buffer Management: Achieving Optimal Tail Size in Cup Games
The cup game on n cups is a multi-step game with two players, a filler a...
research
∙
11/30/2020
