Skip to main navigation Skip to search Skip to main content

Smoothed analysis of binary search trees and quicksort under additive noise

  • Bodo Manthey*
  • , Till Tantau
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Downloads (Pure)

Fingerprint

Dive into the research topics of 'Smoothed analysis of binary search trees and quicksort under additive noise'. Together they form a unique fingerprint.
Sort by

Mathematics

Computer Science