Skip to content

Author

Young-Kun Ko

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Unconditional Boolean Dynamic Lower Bounds from Disjointness

We prove an unconditional $\Omega((\log n/\log\log n)^2)$ lower bound on the maximum of the worst-case update time and expected query time for the insert-only version of Patrascu's multiphase Disjointness problem [STOC 2010]. The bound holds in the zero-error cell-probe model with logarithmic word size. Patrascu's redu...

Young-Kun Ko · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.