Space-time trade-offs for some ranking and searching queries
type: Item
instance of: scholarly article
title: Space-time trade-offs for some ranking and searching queries
zbMATH Open document ID: 1032.68157
DOI: 10.1016/S0020-0190(00)00226-X
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1767385
zbMATH Keywords: Algorithms
zbMATH Keywords: Ranking
zbMATH Keywords: Searching
zbMATH Keywords: Computational geometry
author: Adrian Dumitrescu
author: William Steiger
MaRDI profile type: Publication
cites work: Algorithms for Reporting and Counting Geometric Intersections
cites work: An Optimal-Time Algorithm for Slope Selection
cites work: How good is the information theory bound in sorting?
cites work: Q3992847
Recommended article: Foundations of Information and Knowledge Systems
Recommended article: Space-Time Trade-Offs for Orthogonal Range Queries
Recommended article: Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval
Recommended article: Space-Time Tradeoffs for Emptiness Queries
Recommended article: Space-time tradeoffs for approximate nearest neighbor searching
Recommended article: New space/time tradeoffs for top-\(k\) document retrieval on sequences
Recommended article: On the time-space tradeoff for sorting with linear queries
description: scientific article; zbMATH DE number 1767385