Space-time trade-offs for some ranking and searching queries

DOI10.1016/S0020-0190(00)00226-XzbMath1032.68157MaRDI QIDQ1603491

William Steiger, Adrian Dumitrescu

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

AlgorithmsComputational geometrySearchingRanking

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Time and space efficient collinearity indexing

Cites Work

• Unnamed Item
• How good is the information theory bound in sorting?
• Algorithms for Reporting and Counting Geometric Intersections
• An Optimal-Time Algorithm for Slope Selection

This page was built for publication: Space-time trade-offs for some ranking and searching queries