Algorithms - ESA 2003

DOI10.1007/B13632MaRDI QIDQ5897243zbMATH OpenOpenAlexFDO

Authors Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler

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

zbMATH Keywords

randomizationsmoothed analysiskinetic data structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Smoothed invariants
• Smoothing dynamic systems
• scientific article; zbMATH DE number 1962932
• Tractability through increasing smoothness
• Motion smoothing using wavelets
• Moving boundary simulations with dynamic mesh smoothing

Cited in

(6)

• Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise
• On Smoothed Analysis of Quicksort and Hoare’s Find
• Smoothed analysis of left-to-right maxima with applications
• Smoothed analysis of binary search trees
• Smoothed analysis of probabilistic roadmaps
• On the Most Likely Voronoi Diagram and Nearest Neighbor Searching

This page was built for publication: Algorithms - ESA 2003

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