A survey of max-type recursive distributional equations, Annals of Applied Probability, vol.15, pp.1047-1110, 2005. ,
A stochastic fixed point equation for weighted minima and maxima. Preprintreihe angewandte mathematik und informatik 01/05-s, 2005. ,
Combinatorial aspects of C.A.R. Hoare's find algorithm, Australian Journal of Combinatorics, vol.5, pp.109-119, 1992. ,
Some asymptotic theory for the bootstrap, Annals of Statistics, vol.9, pp.1196-1217, 1981. ,
Convergence of Probability Measures, Wiley Series in Probability and Statistics, 1968. ,
DOI : 10.1002/9780470316962
A characterization of the families of finite-dimensional distributions associated with countable additive stochastic processes whose sample paths are in d, pp.97-100, 1978. ,
A limit theorem for recursively defined processes in Lp, Statistics & Decisions, vol.25, issue.3/2007, pp.1001-1099, 2007. ,
DOI : 10.1524/stnd.2007.0901
Expected time bounds for selection, Communications of the ACM, vol.8, pp.165-173, 1975. ,
Asymptotic distribution theory for Hoare's selection algorithm, Advances in Applied Probability, vol.25, issue.01, pp.252-269, 1996. ,
DOI : 10.1016/0022-0000(84)90009-6
PARTITION (Algorithm 63);QUICKSORT (Algorithm 64);FIND (Algorithm 65, pp.321-322, 1961. ,
Stochastic Fixed Points for the Maximum, Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and probabilities, pp.325-338, 2004. ,
DOI : 10.1007/978-3-0348-7915-6_34
Struktur von Fixpunkten aus Prozessgleichungen, 2007. ,
Mathematical analysis of algorithms, Information Processing, vol.1, pp.19-27, 1972. ,
Partial quicksort and quickpartitionsort. Submitted to CRM, see Citeseer, 2009. ,
Optimal Sampling Strategies in Quicksort and Quickselect, SIAM Journal on Computing, vol.31, issue.3, pp.683-705, 2001. ,
DOI : 10.1137/S0097539700382108
Analysis of Algorithms by the Contraction Method: Additive and Max-recursive Sequences, Interacting stochastic Systems, pp.435-450, 2005. ,
DOI : 10.1007/3-540-27110-4_20
On stochastic recursive equations of sum-and max-type, Journal of Applied Probability, vol.43, pp.687-701, 2006. ,
Adaptive sampling strategies for quickselects, ACM Transactions on Algorithms, vol.6, issue.3, 2008. ,
DOI : 10.1145/1798596.1798606
Analysis of hoare's find algorithm with medianof-three partition. Random Structures and Algorithms, pp.143-156, 1997. ,
Time bounds for selection, Journal of Computer and System Sciences, vol.7, issue.4, pp.448-461, 1973. ,
DOI : 10.1016/S0022-0000(73)80033-9
A fixed point theorem for distributions, Stochastic Processes and their Applications, pp.195-214, 1992. ,
DOI : 10.1016/0304-4149(92)90035-O
Dynamics of complex and irregular systems, Bielefeld Encount. Math. Phys. VIII World Sci. Publishing, pp.154-165, 1991. ,
Quickselect revisited, Journal of the Iranian Statistical Institute, vol.3, pp.271-296, 2004. ,
The contraction method for recursive algorithms, Algorithmica, vol.25, issue.2, pp.3-33, 2001. ,
DOI : 10.1007/BF02679611
Exponential tail bounds for max-recursive sequences, Electronic Communications in Probability, vol.11, issue.0, pp.333-352, 2007. ,
DOI : 10.1214/ECP.v11-1227