Publication:5417613
From MaRDI portal
zbMath1288.05046MaRDI QIDQ5417613
Kunihiko Sadakane, Gonzalo Navarro
Publication date: 22 May 2014
05C05: Trees
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68P05: Data structures
Related Items
Unnamed Item, Spaces, Trees, and Colors, Random Access to Grammar-Compressed Strings and Trees, Fast matching statistics in small space, The Heaviest Induced Ancestors Problem Revisited, Linear-space data structures for range frequency queries on arrays and trees, Less space: indexing for queries with wildcards, 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, Ultra-succinct representation of ordered trees with applications, New algorithms on wavelet trees and applications to information retrieval, Succinct representations of permutations and functions, Compact navigation and distance oracles for graphs with small treewidth, Linear-space data structures for range minority query in arrays, Succinct indexes for reporting discriminating and generic words, A grouping approach for succinct dynamic dictionary matching, Combined data structure for previous- and next-smaller-values, Succinct representation of dynamic trees, Space-efficient construction of Lempel-Ziv compressed text indexes, Finding range minima in the middle: approximations and applications, Encoding 2D range maximum queries, Space-efficient indexes for forbidden extension queries, Practical compressed suffix trees, High-order entropy compressed bit vectors with rank/select, LRM-trees: compressed indices, adaptive sorting, and compressed permutations, Ranked document retrieval for multiple patterns, New space/time tradeoffs for top-\(k\) document retrieval on sequences, Range minimum queries in minimal space, The heaviest induced ancestors problem: better data structures and applications, Practical space-efficient index for structural pattern matching, A framework for designing space-efficient dictionaries for parameterized and order-preserving matching, Linear-time algorithms for tree root problems, A uniform paradigm to succinctly encode various families of trees, Fully Functional Static and Dynamic Succinct Trees, Fast Compressed Tries through Path Decompositions, General Document Retrieval in Compact 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, LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations, Space-Efficient Frameworks for Top- k String Retrieval
