English

Predecessor problem on smooth distributions

Data Structures and Algorithms 2017-01-27 v2

Abstract

We follow a research thread studying the predecessor problem on "smooth" distribution families. We propose a conceptually simpler solution utilizing well-known results from much better studied variant of the problem that assumes nothing about the input. As a side effect, we are able to extend the range of handled input distributions for the most studied case needing expected O(loglogn)\mathcal O(\log \log n) time, and we provide better insight into why the related methods are faster on smooth inputs.

Cite

@article{arxiv.1511.08598,
  title  = {Predecessor problem on smooth distributions},
  author = {Vladimír Čunát},
  journal= {arXiv preprint arXiv:1511.08598},
  year   = {2017}
}

Comments

6 pages, to be submitted to DMTCS

R2 v1 2026-06-22T11:55:23.454Z