A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
[chapter]
2013
Lecture Notes in Computer Science
In this paper we investigate the problem of building a static data structure that represents a string s using space close to its compressed size, and allows fast access to individual characters of s. This type of structures was investigated by the recent paper of Bille et al. [3] . Let n be the size of a context-free grammar that derives a unique string s of length L. (Note that L might be exponential in n.) Bille et al. showed a data structure that uses space O(n) and allows to query for the
doi:10.1007/978-3-642-38905-4_24
fatcat:kywb33jslzbrrblpblangd5bz4