https://hal.inria.fr/hal-00990593Knof, DietherDietherKnofMathematisches Seminar [Kiel] - CAU - Christian-Albrechts-Universität zu KielRoesler, UweUweRoeslerMathematisches Seminar [Kiel] - CAU - Christian-Albrechts-Universität zu KielThe analysis of find and versions of itHAL CCSD2012[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Inria Sophia Antipolis-Méditerranée / I3s, Service Ist2014-05-13 16:27:452017-09-07 01:03:372014-05-13 16:39:05enJournal articleshttps://hal.inria.fr/hal-00990593/document10.46298/dmtcs.581application/pdf1In 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.