Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Smoothed analysis of left-to-right maxima with applications

Tools
- Tools
+ Tools

Damerow, Valentina, Manthey, Bodo, Heide, Friedhelm Meyer Auf Der, Räcke, Harald, Scheideler, Christian, Sohler, Christian and Tantau, Till (2012) Smoothed analysis of left-to-right maxima with applications. ACM Transactions on Algorithms , Volume 8 (Number 3). Article number 30. doi:10.1145/2229163.2229174

Research output not available from this repository, contact author.
Official URL: http://dx.doi.org/10.1145/2229163.2229174

Request Changes to record.

Abstract

A left-to-right maximum in a sequence of n numbers s(1), ..., s(n) is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s(i) is an element of[0, 1] that are perturbed by uniform noise from the interval [-epsilon, epsilon], the expected number of left-to-right maxima is Theta(root n/epsilon + log n) for epsilon > 1/n. For Gaussian noise with standard deviation sigma we obtain a bound of O((log(3/2) n)/sigma + log n).

We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Theta(root n/epsilon + log n) and Theta(n/epsilon+1 root n/epsilon + n log n), respectively, for uniform random noise from the interval [-epsilon, epsilon]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space.

Item Type: Journal Article
Divisions: Faculty of Science > Computer Science
Journal or Publication Title: ACM Transactions on Algorithms
Publisher: Association for Computing Machinery, Inc.
ISSN: 1549-6325
Official Date: July 2012
Dates:
DateEvent
July 2012Published
Volume: Volume 8
Number: Number 3
Page Range: Article number 30
DOI: 10.1145/2229163.2229174
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us