Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Recursive star-tree parallel data structure
SIAM Journal on Computing
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Efficient pattern matching with scaling
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
A unifying look at data structures
Communications of the ACM
An analysis of the Burrows—Wheeler transform
Journal of the ACM (JACM)
Efficient algorithms for document retrieval problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Low Redundancy in Static Dictionaries with Constant Query Time
SIAM Journal on Computing
Succinct Representation of Balanced Parentheses and Static Trees
SIAM Journal on Computing
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Parallel Triconnectivity in Logarithmic Time
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Finding dominators revisited: extended abstract
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
New text indexing functionalities of the compressed suffix arrays
Journal of Algorithms
SIAM Journal on Computing
Journal of the ACM (JACM)
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
SIAM Journal on Computing
Structuring labeled trees for optimal succinctness, and beyond
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Representing Trees of Higher Degree
Algorithmica
Squeezing succinct data structures into entropy bounds
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation (Art of Computer Programming)
ACM Computing Surveys (CSUR)
A simple optimal representation for balanced parentheses
Theoretical Computer Science
Succinct data structures for flexible text retrieval systems
Journal of Discrete Algorithms
Note: A simple storage scheme for strings achieving entropy bounds
Theoretical Computer Science
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
The cell probe complexity of succinct data structures
Theoretical Computer Science
Ultra-succinct representation of ordered trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
ACM Transactions on Algorithms (TALG)
Optimal lower bounds for rank and select indexes
Theoretical Computer Science
Compressed Suffix Trees with Full Functionality
Theory of Computing Systems
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
DCC '08 Proceedings of the Data Compression Conference
Space-efficient static trees and graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Space-Efficient Algorithms for Document Retrieval
CPM '07 Proceedings of the 18th annual symposium on Combinatorial Pattern Matching
An Online Algorithm for Finding the Longest Previous Factors
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Information Processing Letters
Faster entropy-bounded compressed suffix trees
Theoretical Computer Science
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Space-Efficient Framework for Top-k String Retrieval Problems
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Information Processing Letters
Radix sorting with no extra space
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Fully-functional succinct trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Data structures for range minimum queries in multidimensional arrays
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On space efficient two dimensional range minimum data structures
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Optimal string mining under frequency constraints
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Amortized rigidness in dynamic cartesian trees
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Statistical encoding of succinct data structures
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Optimal succinctness for range minimum queries
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On the range maximum-sum segment query problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A new succinct representation of RMQ-information and improvements in the enhanced suffix array
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Encoding 2d range maximum queries
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Efficient in-memory top-k document retrieval
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Compressed string dictionary look-up with edit distance one
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Two dimensional range minimum queries and fibonacci lattices
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Faster and smaller inverted indices with treaps
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Space-efficient data structures for Top-k completion
Proceedings of the 22nd international conference on World Wide Web
On (dynamic) range minimum queries in external memory
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
Making queries tractable on big data with preprocessing: through the eyes of complexity theory
Proceedings of the VLDB Endowment
Compressed property suffix trees
Information and Computation
Compact binary relation representations with rich functionality
Information and Computation
Multi-pattern matching with bidirectional indexes
Journal of Discrete Algorithms
| Hi-index | 0.00 |
Given a static array of $n$ totally ordered objects, the range minimum query problem is to build a data structure that allows us to answer efficiently subsequent on-line queries of the form “what is the position of a minimum element in the subarray ranging from $i$ to $j$?”. We focus on two settings, where (1) the input array is available at query time, and (2) the input array is available only at construction time. In setting (1), we show new data structures (a) of size $\frac{2n}{c(n)}-\Theta\bigl(\frac{n\lg\lg n}{c(n)\lg n}\bigr)$ bits and query time $O(c(n))$ for any positive integer function $c(n)\in O\bigl(n^\varepsilon\bigr)$ for an arbitrary constant $0