Publication:4471381
From MaRDI portal
zbMath1092.68584MaRDI QIDQ4471381
Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter
Publication date: 28 July 2004
Related Items
Priority Queues and Sorting for Read-Only Data, Compressed matching for feature vectors, Fast construction of wavelet trees, Random access to Fibonacci encoded files, Succinct posets, Compressed directed acyclic word graph with application in local alignment, Compact binary relation representations with rich functionality, Space efficient data structures for dynamic orthogonal range counting, Entropy-bounded representation of point grids, Compressed indexes for text 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, Cross-document pattern matching, Ultra-succinct representation of ordered trees with applications, Bidirectional search in a string with wavelet trees and bidirectional matching statistics, New algorithms on wavelet trees and applications to information retrieval, Improved algorithms for the range next value problem and applications, Compact navigation and distance oracles for graphs with small treewidth, Efficient fully-compressed sequence representations, Optimal indexes for sparse bit vectors, A quick tour on suffix arrays and compressed suffix arrays, Space-efficient construction of Lempel-Ziv compressed text indexes, Improved data structures for the orthogonal range successor problem, On optimally partitioning a text to improve its compression, On approximate jumbled pattern matching in strings, Succinct data structures for searchable partial sums with optimal worst-case performance, Lempel-Ziv-78 compressed string dictionaries, Speeding up dynamic programming in the line-constrained \(k\)-median, Dynamic rank/select structures with applications to run-length encoded texts, Rank/select on dynamic compressed sequences and applications, Selection from read-only memory with limited workspace, A simple storage scheme for strings achieving entropy bounds, Two-dimensional range successor in optimal time and almost linear space, Succinct data structures for flexible text retrieval systems, Move-to-front, distance coding, and inversion frequencies revisited, On compact representations of all-pairs-shortest-path-distance matrices, Wee LCP, Faster entropy-bounded compressed suffix trees, Lyndon array construction during Burrows-Wheeler inversion, Space-efficient indexes for forbidden extension queries, Approximate string matching with compressed indexes, Wheeler graphs: a framework for BWT-based data structures, Time-space trade-offs for Lempel-Ziv compressed indexing, Fixed block compression boosting in FM-indexes: theory and practice, Path queries on functions, On the string matching with \(k\) mismatches, Dynamic relative compression, dynamic partial sums, and substring concatenation, LRM-trees: compressed indices, adaptive sorting, and compressed permutations, Distribution-aware compressed full-text indexes, Space-efficient fully dynamic DFS in undirected graphs, Computing the Burrows-Wheeler transform in place and in small space, Geometric BWT: compressed text indexing via sparse suffixes and range searching, Faster average case low memory semi-external construction of the Burrows-Wheeler transform, The cell probe complexity of succinct data structures, Succinct representations of weighted trees supporting path queries, The myriad virtues of wavelet trees, Succinct 2D dictionary matching, Parallel lightweight wavelet tree, suffix array and FM-index construction, Range selection and predecessor queries in data aware space and time, A space efficient direct access data structure, Grammar compressed sequences with rank/select support, Parallel construction of succinct trees, Algorithms to compute the Burrows-Wheeler similarity distribution, Stronger Lempel-Ziv based compressed text indexing, Wavelet trees for all, Computing the Burrows-Wheeler transform of a string and its reverse in parallel, Fast relative Lempel-Ziv self-index for similar sequences, A simpler analysis of Burrows-Wheeler-based compression, Adaptive searching in succinctly encoded binary relations and tree-structured documents, Compressed data structures: Dictionaries and data-aware measures, Rank and select revisited and extended, Document listing on repetitive collections with guaranteed performance, GLOUDS: representing tree-like graphs, Fully Functional Static and Dynamic Succinct Trees, Speeding up Dynamic Programming in the Line-Constrained k-median, Locally Compressed Suffix Arrays, 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, Orthogonal Range Searching for Text Indexing, Array Range Queries, Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis, Compact Indexes for Flexible Top-$$k$$ Retrieval, Time-Optimal Top-$k$ Document Retrieval, A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs, Lempel-Ziv Factorization Revisited, Succincter Text Indexing with Wildcards, Self-indexing Based on LZ77, Counting Colours in Compressed Strings, On Wavelet Tree Construction, LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations, Range Majority in Constant Time and Linear Space, Compact Navigation and Distance Oracles for Graphs with Small Treewidth, Self-indexed Text Compression Using Straight-Line Programs, Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing, Space-Efficient Frameworks for Top- k String Retrieval, Access, Rank, and Select in Grammar-compressed Strings, Compressed Data Structures for Dynamic Sequences, Forty Years of Text Indexing, Spaces, Trees, and Colors, Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier, Practical Compact Indexes for Top-kDocument Retrieval, Bidirectional Variable-Order de Bruijn Graphs, Efficient Data Structures for the Orthogonal Range Successor Problem, Unnamed Item
