Diether Knof ; Uwe Roesler - The analysis of find and versions of it

dmtcs:581 - Discrete Mathematics & Theoretical Computer Science, September 23, 2012, Vol. 14 no. 2 -
The analysis of find and versions of itArticle

Authors: Diether Knof 1; Uwe Roesler 1

  • 1 Mathematisches Seminar [Kiel]

In the running time analysis of the algorithm Find and versions of it appear as limiting distributions solutions of stochastic fixed points equation of the form X D = Sigma(i) AiXi o Bi + C on the space D of cadlag functions. The distribution of the D-valued process X is invariant by some random linear affine transformation of space and random time change. We show the existence of solutions in some generality via the Weighted Branching Process. Finite exponential moments are connected to stochastic fixed point of supremum type X D = sup(i) (A(i)X(i) + C-i) on the positive reals. Specifically we present a running time analysis of m-median and adapted versions of Find. The finite dimensional distributions converge in L-1 and are continuous in the cylinder coordinates. We present the optimal adapted version in the sense of low asymptotic average number of comparisons. The limit distribution of the optimal adapted version of Find is a point measure on the function [0, 1] there exists t -> 1 + mint, 1 - t.

Volume: Vol. 14 no. 2
Section: Analysis of Algorithms
Published on: September 23, 2012
Accepted on: June 9, 2015
Submitted on: November 12, 2007
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 354 times.
This article's PDF has been downloaded 740 times.