A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A Selectable Sloppy Heap
[article]
2017
arXiv
pre-print
We study the selection problem, namely that of computing the ith order statistic of n given elements. Here we offer a data structure called selectable sloppy heap handling a dynamic version in which upon request: (i) a new element is inserted or (ii) an element of a prescribed quantile group is deleted from the data structure. Each operation is executed in (ideal!) constant time---and is thus independent of n (the number of elements stored in the data structure)---provided that the number of
arXiv:1607.07673v2
fatcat:ctjmqaefezhkxfqan6j27urbny