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
In this paper we investigate the top-k-selection problem, i.e. determine the largest, second largest, ..., and the k-th largest elements, in the dynamic data model. In this model the order of elements evolves dynamically over time. In each time step the algorithm can only probe the changes of data by comparing a pair of elements. Previously only two special cases were studied: finding the largest element and the median; and sorting all elements. This paper systematically deals with k∈ [n]arXiv:1412.8164v1 fatcat:edh67cwezvahvbetmx4cabhugq