4 citations · 7 across the 8 of their papers we have counts for
4 papers · 1 filter
When Shall We Meet Again? Tight Algorithms for Diameter and Radius under the Meet Distance
Yael Kirkpatrick, John Kuszmaul, Merey Temirzinova +1
Finding an optimal meeting point for a collection of agents on a directed graph is a classical problem studied in the context of network analysis, operations research and computati…
Dynamic and Optimal Function Inversion in the Small-Time Regime
John Kuszmaul, William Kuszmaul
The classic function-inversion problem considers the task of constructing a data structure which, given access to a constant-time oracle for a function , s…
The Semi-Oblivious Cup Game: an Imperfect Information Setting
Kalina Jasińska, John Kuszmaul, Gyudong Lee
In the cup game, an adversary distributes unit of water among initially empty cups during each time step. The player then selects a single cup from which to remove up to $1…
Preprocessed 3SUM for Unknown Universes with Subquadratic Space
Yael Kirkpatrick, John Kuszmaul, Surya Mathialagan +1
We consider the classic 3SUM problem: given sets of integers , determine whether there is a tuple satisfying . The 3SUM…