Showing 2025Show all
2 papers · 1 filter
cs.CC2025
Unifying the Landscape of Super-Logarithmic Dynamic Cell-Probe Lower Bounds
Young Kun Ko
We prove a general translation theorem for converting one-way communication lower bounds over a product distribution to dynamic cell-probe lower bounds. Specifically, we consider a…
cs.CC2025
Lower Bounds for Linear Operators
Young Kun Ko
We consider a static data structure problem of computing a linear operator under cell-probe model. Given a linear operator , the goal is to pre-pro…