Publication:4875211
From MaRDI portal
zbMath0847.68030MaRDI QIDQ4875211
Publication date: 28 April 1996
Related Items
Forty Years of Text Indexing, Unnamed Item, Sampling Geometric Inhomogeneous Random Graphs in Linear Time, Unnamed Item, Compressed property suffix trees, On-line construction of position heaps, Multi-pattern matching with bidirectional indexes, A framework for succinct labeled ordinal trees over large alphabets, Improved space-time tradeoffs for approximate full-text indexing with one edit error, I/O-efficient path traversal in succinct planar graphs, Succinct representation of dynamic trees, Space-efficient construction of Lempel-Ziv compressed text indexes, Improved data structures for the orthogonal range successor problem, Succinct data structures for searchable partial sums with optimal worst-case performance, The power and limitations of static binary search trees with lazy finger, A simple optimal representation for balanced parentheses, Two-dimensional range successor in optimal time and almost linear space, Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays, The range 1 query (R1Q) problem, Geometric inhomogeneous random graphs, Approximate query processing over static sets and sliding windows, Succinct navigational oracles for families of intersection graphs on a circle, Adaptive succinctness, The function-inversion problem: barriers and opportunities, How to pack directed acyclic graphs into small blocks, Reporting and counting maximal points in a query orthogonal rectangle, Geometric BWT: compressed text indexing via sparse suffixes and range searching, Worst-case optimal tree layout in external memory, Succinct representations of weighted trees supporting path queries, Parallel construction of succinct trees, Stronger Lempel-Ziv based compressed text indexing, Succinct representation of labeled graphs, Succinct and I/O efficient data structures for traversal in trees, A uniform paradigm to succinctly encode various families of trees, Adaptive searching in succinctly encoded binary relations and tree-structured documents, Distributed suffix trees, Succinct encodings for families of interval graphs, Faster repetition-aware compressed suffix trees based on block trees, Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number, Locally Compressed Suffix Arrays, Succinct and Implicit Data Structures for Computational Geometry, Succinct Representations of Ordinal Trees, On the Weak Prefix-Search Problem, Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing, A Uniform Approach Towards Succinct Representation of Trees
