Dynamic closest pairs — A probabilistic approach

DOI10.1007/3-540-55706-7_31zbMath1502.68319OpenAlexW1842201078MaRDI QIDQ5056153

Mordecai J. Golin

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55706-7_31

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• The design of dynamic data structures
• A guided tour of Chernoff bounds
• An optimal algorithm for the on-line closest-pair problem
• Optimal Expected-Time Algorithms for Closest Point Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dynamic closest pairs — A probabilistic approach