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