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

DOI10.1016/0020-0190(87)90174-8MaRDI QIDQ1108025zbMATH OpenOpenAlexFDO

Authors O. Fries, K. Mehlhorn, S. Näher, Athanasios K. Tsakalidis

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

data structureheaplowest common ancestorpriority search treerange search

Mathematics Subject Classification ID

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

Cites work

• Fast Algorithms for Finding Nearest Common Ancestors
• scientific article; zbMATH DE number 3887061 (Why is no real title available?)
• scientific article; zbMATH DE number 3864518 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Priority Search Trees

Cited in

(8)

• Finding maximum edge bicliques in convex bipartite graphs
• Towards using computational methods for real-time negotiations in electronic commerce
• Dynamic planar range skyline queries in log logarithmic expected time
• Computing rectangle enclosures
• Dynamic 3-sided planar range queries with expected doubly-logarithmic time
• Algorithms for three-dimensional dominance searching in linear space.
• Some Results for Elementary Operations
• I/O-efficient data structures for colored range and prefix reporting

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108025)