On the analysis of stochastic divide and conquer algorithms
From MaRDI portal
Publication:1840514
zbMath0967.68168MaRDI QIDQ1840514
Publication date: 11 February 2001
Published in: Algorithmica (Search for Journal in Brave)
Related Items (33)
Distribution of distances in random binary search trees. ⋮ Limit laws for partial match queries in quadtrees ⋮ One-sided variations on binary search trees ⋮ On the contraction method with degenerate limit equation. ⋮ Distances in random digital search trees ⋮ The left-right-imbalance of binary search trees ⋮ Thin tails of fixed points of the nonhomogeneous smoothing transform ⋮ Higher moments of Banach space valued random variables ⋮ A limit process for partial match queries in random quadtrees and 2-d trees ⋮ Limit laws for two distance-based indices in random recursive tree models ⋮ Prediction of group patterns in social mammals based on a coalescent model ⋮ On densities for solutions to stochastic fixed point equations ⋮ A general limit theorem for recursive algorithms and combinatorial structures ⋮ A weakly 1-stable distribution for the number of random records and cuttings in split trees ⋮ On the Variety of Shapes on the Fringe of a Random Recursive Tree ⋮ Asymptotic distributions for random median quicksort ⋮ The total path length of split trees ⋮ Asymptotic Analysis of Hoppe Trees ⋮ The fluctuations of the giant cluster for percolation on random split trees ⋮ Dependence and phase changes in random m‐ary search trees ⋮ On stochastic recursive equations of sum and max type ⋮ A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree ⋮ Limit laws for the Randić index of random binary tree models ⋮ Inversions in Split Trees and Conditional Galton–Watson Trees ⋮ Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey ⋮ Partial match queries in random quadtrees ⋮ Limit distribution of distances in biased random tries ⋮ Precise tail asymptotics of fixed points of the smoothing transform with general weights ⋮ On a functional contraction method ⋮ On the Largest Common Subtree of Random Leaf-Labeled Binary Trees ⋮ Selection by rank inK-dimensional binary search trees ⋮ Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm ⋮ On binary search tree recursions with monomials as toll functions
This page was built for publication: On the analysis of stochastic divide and conquer algorithms
