scientific article; zbMATH DE number 871936
From MaRDI portal
Publication:4875211
zbMATH Open0847.68030MaRDI QIDQ4875211FDOQ4875211
Publication date: 28 April 1996
Title of this publication is not available (Why is that?)
Cited In (51)
- How to pack directed acyclic graphs into small blocks
- Multi-pattern matching with bidirectional indexes
- Adaptive succinctness
- Succinct representation of dynamic trees
- A uniform paradigm to succinctly encode various families of trees
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Title not available (Why is that?)
- Adaptive succinctness
- Succinct data structures for searchable partial sums with optimal worst-case performance
- Improved space-time tradeoffs for approximate full-text indexing with one edit error
- Space efficient suffix trees
- Faster repetition-aware compressed suffix trees based on block trees
- A simple optimal representation for balanced parentheses
- Maintaining range trees is secondary memory. Part II: Lower bounds
- Compressed property suffix trees
- A theoretical and experimental study on the construction of suffix arrays in external memory
- On-line construction of position heaps
- Sampling Geometric Inhomogeneous Random Graphs in Linear Time
- Succinct and I/O efficient data structures for traversal in trees
- 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
- Reporting and counting maximal points in a query orthogonal rectangle
- Succinct representation of labeled graphs
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- Locally compressed suffix arrays
- Parallel construction of succinct trees
- Geometric inhomogeneous random graphs
- Forty Years of Text Indexing
- Improved data structures for the orthogonal range successor problem
- The range 1 query (R1Q) problem
- Succinct encodings for families of interval graphs
- Succinct representations of weighted trees supporting path queries
- Stronger Lempel-Ziv based compressed text indexing
- Title not available (Why is that?)
- Two-dimensional range successor in optimal time and almost linear space
- On the Weak Prefix-Search Problem
- Succinct and Implicit Data Structures for Computational Geometry
- Succinct Representations of Ordinal Trees
- The function-inversion problem: barriers and opportunities
- Faster repetition-aware compressed suffix trees based on block trees
- A framework for succinct labeled ordinal trees over large alphabets
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
- Worst-case optimal tree layout in external memory
- Succinct data structures for bounded clique-width graphs
- Geometric BWT: compressed text indexing via sparse suffixes and range searching
- Distributed suffix trees
- A Uniform Approach Towards Succinct Representation of Trees
- Succinct navigational oracles for families of intersection graphs on a circle
- I/O-efficient path traversal in succinct planar graphs
- Approximate query processing over static sets and sliding windows
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
Recommendations
- Title not available (Why is that?) 👍 👎
- Space efficient suffix trees 👍 👎
- Obtaining Provably Good Performance from Suffix Trees in Secondary Storage 👍 👎
- Compressed suffix trees 👍 👎
- String Processing and Information Retrieval 👍 👎
- Space-efficient construction of compressed suffix trees 👍 👎
- Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875211)
