Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.68371OpenAlexW2495578842MaRDI QIDQ5431306

Kurt Mehlhorn, Rene Beier, Cyril Banderier

Publication date: 7 December 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11836

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (13)

The multiplicity of left-to-right maxima in geometrically distributed words ⋮ Smoothed analysis of binary search trees ⋮ Smoothed Analysis of Local Search Algorithms ⋮ On Smoothed Analysis of Quicksort and Hoare’s Find ⋮ Smoothed analysis of integer programming ⋮ Running time of the treapsort algorithm ⋮ Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design ⋮ Beyond the worst case: semi-random complexity analysis of winner determination ⋮ On smoothed analysis of quicksort and Hoare's find ⋮ Left-to-right maxima in words and multiset permutations ⋮ Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise ⋮ Unnamed Item ⋮ Smoothed analysis of probabilistic roadmaps

This page was built for publication: Mathematical Foundations of Computer Science 2003