We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
LIPIcs - Leibniz International Proceedings in Informatics. 26th International Symposium on Theoretical Aspects of Computer Science
Doi
Abstract
Given string S[1..N] and integer k, the {em suffix selection} problem is to determine the kth lexicographically smallest amongst the suffixes S[ildotsN], 1leqileqN. We study the suffix selection problem in the cache-aware model that captures two-level memory inherent in computing systems, for a emph{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 Thetaleft(N/Bright) block transfers, for any string S over an unbounded alphabet (where characters can only be compared), under the common tall-cache assumption (i.e. M=Omegaleft(B1+epsilonright), where epsilon<1). Our algorithm beats the bottleneck bound for permuting an input array to the desired output array, which holds for nearly any nontrivial problem in hierarchical memory models
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.