Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- 1 January 2011
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 40 (2), 465-492
- https://doi.org/10.1137/090779759
Abstract
No abstract availableThis publication has 30 references indexed in Scilit:
- Wee LCPInformation Processing Letters, 2010
- Lempel–Ziv Factorization Using Less Time & SpaceMathematics in Computer Science, 2008
- Compressed representations of sequences and full-text indexesACM Transactions on Algorithms, 2007
- A simple storage scheme for strings achieving entropy boundsTheoretical Computer Science, 2007
- Lowest common ancestors in trees and directed acyclic graphsJournal of Algorithms, 2005
- Indexing compressed textJournal of the ACM, 2005
- Representing Trees of Higher DegreeAlgorithmica, 2005
- Dynamic LCA Queries on TreesSIAM Journal on Computing, 2005
- Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed EnvironmentTheory of Computing Systems, 2004
- Recursive Star-Tree Parallel Data StructureSIAM Journal on Computing, 1993