Algorithms – ESA 2004
From MaRDI portal
Publication:5464585
DOI10.1007/b100428zbMath1111.68722OpenAlexW2483610301MaRDI QIDQ5464585
Christian Sohler, Valentina Damerow
Publication date: 18 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100428
Related Items (8)
Smoothed analysis of binary search trees ⋮ A fast and efficient algorithm for determining the connected orthogonal convex hulls ⋮ Unnamed Item ⋮ Smoothed analysis of partitioning algorithms for Euclidean functionals ⋮ A Friendly Smoothed Analysis of the Simplex Method ⋮ On the Most Likely Voronoi Diagram and Nearest Neighbor Searching ⋮ Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise ⋮ Smoothed analysis of probabilistic roadmaps
This page was built for publication: Algorithms – ESA 2004
