scientific article; zbMATH DE number 2119724
From MaRDI portal
Publication:4828998
zbMath1093.68588MaRDI QIDQ4828998
No author found.
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Top-\(k\) term-proximity in succinct space, On succinct representations of binary trees, Document retrieval with one wildcard, Reporting consecutive substring occurrences under bounded gap constraints, Space-efficient indexes for forbidden extension queries, Indexing and querying color sets of images, Document listing on repetitive collections with guaranteed performance, Space-Efficient Frameworks for Top- k String Retrieval, Indexing factors with gaps, I/O-optimal categorical 3-sided skyline queries, Ranked Document Retrieval with Forbidden Pattern, Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints, Efficient range searching for categorical and plain data, Compact binary relation representations with rich functionality, Colored range queries and document retrieval, On compressing and indexing repetitive sequences, Top-\(k\) document retrieval in optimal space, Cross-document pattern matching, Efficient index for retrieving top-\(k\) most frequent documents, Ranked Document Retrieval in External Memory, Algorithms to compute the Burrows-Wheeler similarity distribution, A new efficient indexing algorithm for one-dimensional real scaled patterns, Cache oblivious algorithms for the RMQ and the RMSQ problems, New algorithms on wavelet trees and applications to information retrieval, Time-Optimal Top-$k$ Document Retrieval, Wavelet trees for all, Fast relative Lempel-Ziv self-index for similar sequences, Succinct data structures for flexible text retrieval systems, Text indexing with errors, Universal compressed text indexing, Property matching and weighted matching, Languages with mismatches, Improved space-time tradeoffs for approximate full-text indexing with one edit error, Self-indexing Based on LZ77, Counting Colours in Compressed Strings, Enumerating Range Modes, On space efficient two dimensional range minimum data structures, Spaces, Trees, and Colors, Forty Years of Text Indexing, A simple algorithm for computing the document array, Optimal prefix and suffix queries on texts, Fast set intersection and two-patterns matching, New space/time tradeoffs for top-\(k\) document retrieval on sequences, Lempel-Ziv compressed structures for document retrieval, Unnamed Item, Ranked document retrieval for multiple patterns, Range majorities and minorities in arrays, Compressed indexes for approximate string matching, Internal dictionary matching, Indexing weighted sequences: neat and efficient, Ranked document selection, Approximate colored range and point enclosure queries, General Document Retrieval in Compact Space, Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines, Tree path majority data structures, Orthogonal Range Searching for Text Indexing, Array Range Queries, Indexes for Document Retrieval with Relevance, Unnamed Item, On hardness of several string indexing problems, Improved and extended locating functionality on compressed suffix arrays, Succinct Color Searching in One Dimension, Practical Compact Indexes for Top-kDocument Retrieval, Linear-space data structures for range frequency queries on arrays and trees
