Journal of Algorithms
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct Representation of Balanced Parentheses and Static Trees
SIAM Journal on Computing
Waiting patterns for a printer
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
SIAM Journal on Computing
Representing Trees of Higher Degree
Algorithmica
Succinct ordinal trees with level-ancestor queries
ACM Transactions on Algorithms (TALG)
ACM Computing Surveys (CSUR)
Compressed Suffix Trees with Full Functionality
Theory of Computing Systems
A Uniform Approach Towards Succinct Representation of Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A Compressed Enhanced Suffix Array Supporting Fast String Matching
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Faster entropy-bounded compressed suffix trees
Theoretical Computer Science
Information Processing Letters
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Fully-functional succinct trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Optimal succinctness for range minimum queries
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Practical compressed suffix trees
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Succinct ordinal trees based on tree covering
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Improved algorithms for the range next value problem and applications
Theoretical Computer Science
A faster grammar-based self-index
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
| Hi-index | 5.23 |
Let A be a static array storing n elements from a totally ordered set. We present a data structure of optimal size at most nlog"2(3+22)+o(n) bits that allows us to answer the following queries on A in constant time, without accessing A: (1) previous smaller value queries, where given an index i, we wish to find the first index to the left of i where A is strictly smaller than at i, and (2) next smaller value queries, which search to the right of i. As an additional bonus, our data structure also allows one to answer a third kind of query: given indices i