Space-Efficient Algorithms for Document Retrieval
From MaRDI portal
Recommendations
Cited in
(23)- A simple algorithm for computing the document array
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- Lempel-Ziv compressed structures for document retrieval
- On succinct representations of binary trees
- Improved compressed indexes for full-text document retrieval
- Wavelet trees for all
- General document retrieval in compact space
- Indexes for document retrieval with relevance
- Cross-document pattern matching
- Fast construction of wavelet trees
- Time-optimal top-k document retrieval
- Colored range queries and document retrieval
- Top-k document retrieval in optimal space
- Cross-document pattern matching
- New algorithms on wavelet trees and applications to information retrieval
- scientific article; zbMATH DE number 1979483 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- Document listing on repetitive collections
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Top-\(k\) document retrieval in optimal time and linear space
- Efficient index for retrieving top-\(k\) most frequent documents
- Quantum data structure for range minimum query
- On space efficient two dimensional range minimum data structures
This page was built for publication: Space-Efficient Algorithms for Document Retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506923)