On the average cost of insertions on random relaxed K-d trees

DOI10.1137/1.9781611972979.4zbMath1430.68036OpenAlexW2243750089MaRDI QIDQ5194611

Amalia Duch, Conrado Martínez

Publication date: 16 September 2019

Published in: 2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972979.4

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Randomized algorithms (68W20)

This page was built for publication: On the average cost of insertions on random relaxed K-d trees