Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Unconditional Boolean Dynamic Lower Bounds from Disjointness
Young Kun Ko
We prove an unconditional lower bound on the maximum of the worst-case update time and expected query time for the insert-only version of Patrascu's mult…
cs.DS2019
An Adaptive Step Toward the Multiphase Conjecture
Young Kun Ko, Omri Weinstein
In 2010, Pǎtraşcu proposed the following three-phase dynamic problem, as a candidate for proving polynomial lower bounds on the operational time of dynamic data structures: I: Prep…