Self-Improving Algorithms

DOI10.1137/090766437zbMath1223.68052arXiv0907.0884OpenAlexW3099794728MaRDI QIDQ3020010

Wolfgang Mulzer, Ding Liu, Nir Ailon, C. Seshadhri, Kenneth L. Clarkson, Bernard Chazelle

Publication date: 29 July 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0907.0884

zbMATH Keywords

sortingDelaunay triangulationaverage case analysislow entropy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Randomized algorithms (68W20)

Related Items (4)

Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models ⋮ The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times ⋮ Unnamed Item ⋮ Extensions of self-improving sorters

This page was built for publication: Self-Improving Algorithms