A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In this paper we develop an optimal cache-oblivious data structure that solves the iterated predecessor problem. Given k static sorted lists L1, L2, . . . , L k of average length n and a query value q, the iterated predecessor problem is to find the largest element in each list which is less than q. Our solution to this problem, called "range coalescing", requires O(log B+1 n + k/B) memory transfers for a query on a cache of block size B, which is information-theoretically optimal. Thedoi:10.1007/978-3-319-21840-3_21 fatcat:a2mvycosyvhm7kphnmcypvl4um