The contraction method for recursive algorithms
From MaRDI portal
Publication:1840499
zbMATH Open0967.68166MaRDI QIDQ1840499FDOQ1840499
Authors: Uwe Rösler, Ludger Rüschendorf 
Publication date: 11 February 2001
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
Cited In (74)
- Central limit theorem in uniform metrics for generalized Kac equations
- Degree profile of hierarchical lattice networks
- Complexity Questions in Non-Uniform Random Variate Generation
- On the protected nodes in exponential recursive trees
- Asymptotic distributions for random median quicksort
- The weighted branching process
- Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
- A recursive distributional equation for the stable tree
- Limit laws for two distance-based indices in random recursive tree models
- On the size of paged recursive trees
- All solutions of the stochastic fixed point equation of the Quicksort process
- On the total length of the random minimal directed spanning tree
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
- Title not available (Why is that?)
- Cost functionals for large (uniform and simply generated) random trees
- Convergence of two-dimensional branching recursions
- On the silhouette of binary search trees
- Random binary trees: from the average case analysis to the asymptotics of distributions
- Weighted height of random trees
- On the number of segregating sites for populations with large family sizes
- The quicksort process
- Exact and approximate limit behaviour of the Yule tree's cophenetic index
- Revisiting Shao and Sokal's \(B_2\) index of phylogenetic balance
- A survey of max-type recursive distributional equations
- Symmetric fixed points of a smoothing transformation
- Mini-workshop: Probability theory on trees and analysis of algorithms
- Tail behavior of solutions of linear recursions on trees
- Distances in random digital search trees
- Stochastic fixed-point equations
- Limit laws for partial match queries in quadtrees
- On the contraction method with degenerate limit equation.
- Perpetuities in fair leader election algorithms
- The functional equation of the smoothing transform
- Towards rigorous analysis of the Levitov-Mirlin-Evers recursion
- A general limit theorem for recursive algorithms and combinatorial structures
- Endogeny for the logistic recursive distributional equation
- Distribution of distances in random binary search trees.
- On binary search tree recursions with monomials as toll functions
- Recursive partition structures
- Implicit renewal theory and power tails on trees
- A survey of multivariate aspects of the contraction method
- On the number of jumps of random walks with a barrier
- On a functional contraction method
- Distributional convergence for the number of symbol comparisons used by QuickSort
- Information ranking and power laws on trees
- Convergence of the population dynamics algorithm in the Wasserstein metric
- Inversions in split trees and conditional Galton-Watson trees
- Maximums on trees
- A limit field for orthogonal range searches in two-dimensional random point search trees
- The smoothing transform: a review of contraction results
- Parameterised branching processes: a functional version of Kesten \& Stigum theorem
- Asymptotic properties of a leader election algorithm
- On stochastic recursive equations of sum and max type
- One-sided variations on binary search trees
- A functional-analytical approach to the asymptotics of recursions
- On weighted branching processes in random environment.
- Convergence rates in the implicit renewal theorem on trees
- Singularity analysis, Hadamard products, and tree recurrences
- Fixed points with finite variance of a smoothing transformation.
- Limit distribution of distances in biased random tries
- The analysis of range quickselect and related problems
- Limit laws for the Randić index of random binary tree models
- Implicit renewal theorem for trees with general weights
- The size of random fragmentation trees
- Distributional convergence for the number of symbol comparisons used by QuickSelect
- Almost sure convergence to the quicksort process
- Smoothing equations for large Pólya urns
- On the variety of shapes on the fringe of a random recursive tree
- Process convergence for the complexity of radix selection on Markov sources
- Limit distributions for multitype branching processes of \(m\)-ary search trees
- Title not available (Why is that?)
- Note on the exponential recursive k-ary trees
- Selection by rank in K-dimensional binary search trees
- Asymptotic joint normality of counts of uncorrelated motifs in recursive trees
This page was built for publication: The contraction method for recursive algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1840499)
