A log log n data structure for three-sided range queries

DOI10.1016/0020-0190(87)90174-8zbMath0653.68057OpenAlexW2081589479MaRDI QIDQ1108025

O. Fries, Kurt Mehlhorn, Athanasios K. Tsakalidis, Stefan Näher

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90174-8

zbMATH Keywords

priority search treeheapdata structurelowest common ancestorrange search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Related Items (8)

Computing rectangle enclosures ⋮ Dynamic planar range skyline queries in log logarithmic expected time ⋮ Dynamic 3-sided planar range queries with expected doubly-logarithmic time ⋮ Finding maximum edge bicliques in convex bipartite graphs ⋮ Some Results for Elementary Operations ⋮ Unnamed Item ⋮ Algorithms for three-dimensional dominance searching in linear space. ⋮ Towards using computational methods for real-time negotiations in electronic commerce

Cites Work

• Fast Algorithms for Finding Nearest Common Ancestors
• Priority Search Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A log log n data structure for three-sided range queries