scientific article; zbMATH DE number 6297696

zbMath1288.05046MaRDI QIDQ5417613

Kunihiko Sadakane, Gonzalo Navarro

Publication date: 22 May 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (44)

Less space: indexing for queries with wildcards ⋮ Space-efficient indexes for forbidden extension queries ⋮ The heaviest induced ancestors problem: better data structures and applications ⋮ Space-Efficient Frameworks for Top- k String Retrieval ⋮ Practical space-efficient index for structural pattern matching ⋮ Colored range queries and document retrieval ⋮ On compressing and indexing repetitive sequences ⋮ Space-efficient data-analysis queries on grids ⋮ On compressing permutations and adaptive sorting ⋮ Top-\(k\) document retrieval in optimal space ⋮ Encoding 2D range maximum queries ⋮ Ultra-succinct representation of ordered trees with applications ⋮ Finding range minima in the middle: approximations and applications ⋮ New algorithms on wavelet trees and applications to information retrieval ⋮ Succinct representations of permutations and functions ⋮ A uniform paradigm to succinctly encode various families of trees ⋮ A framework for designing space-efficient dictionaries for parameterized and order-preserving matching ⋮ Compact navigation and distance oracles for graphs with small treewidth ⋮ Practical compressed suffix trees ⋮ High-order entropy compressed bit vectors with rank/select ⋮ Linear-space data structures for range minority query in arrays ⋮ Succinct indexes for reporting discriminating and generic words ⋮ LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations ⋮ A grouping approach for succinct dynamic dictionary matching ⋮ LRM-trees: compressed indices, adaptive sorting, and compressed permutations ⋮ Combined data structure for previous- and next-smaller-values ⋮ Succinct representation of dynamic trees ⋮ Spaces, Trees, and Colors ⋮ Space-efficient construction of Lempel-Ziv compressed text indexes ⋮ New space/time tradeoffs for top-\(k\) document retrieval on sequences ⋮ Unnamed Item ⋮ Ranked document retrieval for multiple patterns ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Fast Compressed Tries through Path Decompositions ⋮ General Document Retrieval in Compact Space ⋮ Range minimum queries in minimal space ⋮ From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ Succinct Representations of Ordinal Trees ⋮ Random Access to Grammar-Compressed Strings and Trees ⋮ Linear-time algorithms for tree root problems ⋮ Fast matching statistics in small space ⋮ The Heaviest Induced Ancestors Problem Revisited ⋮ Linear-space data structures for range frequency queries on arrays and trees

This page was built for publication: