Publication:3421283
From MaRDI portal
zbMath1116.68117MaRDI QIDQ3421283
Daniel A. Spielman, Shang-Hua Teng
Publication date: 12 February 2007
68W40: Analysis of algorithms
Related Items
On Smoothed Analysis of Quicksort and Hoare’s Find, Running time of the treapsort algorithm, Adversarial smoothed analysis, Communication complexity of approximate Nash equilibria, Average-case complexity without the black swans, The probability that a slightly perturbed numerical analysis problem is difficult, Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise