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
Given string S[1..N ] and integer k, the suffix selection problem is to determine the kth lexicographically smallest amongst the suffixes S[i . . . N ], 1 ≤ i ≤ N . We study the suffix selection problem in the cache-aware model that captures two-level memory inherent in computing systems, for a cache of limited size M and block size B. The complexity of interest is the number of block transfers. We present an optimal suffix selection algorithm in the cache-aware model, requiring Θ (N/B) blockdoi:10.4230/lipics.stacs.2009.1845 dblp:conf/stacs/FranceschiniGM09 fatcat:iq7duwvk7ngabgr3hax7pxo36y