Algorithms - ESA 2003
From MaRDI portal
Publication:5897243
DOI10.1007/b13632zbMath1266.68095OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897243
Harald Räcke, Christian Scheideler, Valentina Damerow, Christian Sohler, Friedhelm Meyer auf der Heide
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Randomized algorithms (68W20)
Related Items (5)
Smoothed analysis of binary search trees ⋮ On Smoothed Analysis of Quicksort and Hoare’s Find ⋮ 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 2003
