Pages that link to "Item:Q1840514"
From MaRDI portal
The following pages link to On the analysis of stochastic divide and conquer algorithms (Q1840514):
Displayed 33 items.
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm (Q261384) (← links)
- A limit process for partial match queries in random quadtrees and 2-d trees (Q389077) (← links)
- The total path length of split trees (Q691101) (← links)
- Distances in random digital search trees (Q852009) (← links)
- The left-right-imbalance of binary search trees (Q868958) (← links)
- Limit laws for the Randić index of random binary tree models (Q1019451) (← links)
- A general limit theorem for recursive algorithms and combinatorial structures (Q1431560) (← links)
- On binary search tree recursions with monomials as toll functions (Q1612304) (← links)
- Distribution of distances in random binary search trees. (Q1872343) (← links)
- Limit laws for partial match queries in quadtrees (Q1872463) (← links)
- One-sided variations on binary search trees (Q1881001) (← links)
- On the contraction method with degenerate limit equation. (Q1889801) (← links)
- Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey (Q2061784) (← links)
- Prediction of group patterns in social mammals based on a coalescent model (Q2216300) (← links)
- Precise tail asymptotics of fixed points of the smoothing transform with general weights (Q2345130) (← links)
- On a functional contraction method (Q2354151) (← links)
- Thin tails of fixed points of the nonhomogeneous smoothing transform (Q2402433) (← links)
- Asymptotic distributions for random median quicksort (Q2466023) (← links)
- Limit laws for two distance-based indices in random recursive tree models (Q2674149) (← links)
- Selection by rank in<i>K</i>-dimensional binary search trees (Q2877767) (← links)
- Higher moments of Banach space valued random variables (Q2944980) (← links)
- A weakly 1-stable distribution for the number of random records and cuttings in split trees (Q2996574) (← links)
- Limit distribution of distances in biased random tries (Q3410921) (← links)
- On the Variety of Shapes on the Fringe of a Random Recursive Tree (Q3550998) (← links)
- A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree (Q3633016) (← links)
- Asymptotic Analysis of Hoppe Trees (Q4918574) (← links)
- On the Largest Common Subtree of Random Leaf-Labeled Binary Trees (Q5028357) (← links)
- The fluctuations of the giant cluster for percolation on random split trees (Q5093986) (← links)
- Inversions in Split Trees and Conditional Galton–Watson Trees (Q5222541) (← links)
- On densities for solutions to stochastic fixed point equations (Q5381055) (← links)
- Dependence and phase changes in random <i>m</i>‐ary search trees (Q5739094) (← links)
- Partial match queries in random quadtrees (Q5743457) (← links)
- On stochastic recursive equations of sum and max type (Q5754680) (← links)