The following pages link to (Q3779735):
Displayed 39 items.
- Retracted: Strong limiting behavior in binary search trees (Q395794) (← links)
- Properties of complexity measures for PRAMs and WRAMs (Q580980) (← links)
- Generating alternating permutations lexicographically (Q583885) (← links)
- Left and right length of paths in binary trees or on a question of Knuth (Q659771) (← links)
- Mellin transforms and asymptotics: Harmonic sums (Q672981) (← links)
- Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees (Q707496) (← links)
- The left-right-imbalance of binary search trees (Q868958) (← links)
- A simulated annealing strategy for the detection of arbitrarily shaped spatial clusters (Q956831) (← links)
- Limit laws for the Randić index of random binary tree models (Q1019451) (← links)
- On-line sorting of twisted sequences in linear time (Q1104753) (← links)
- A new semigroup technique in Poisson approximation (Q1121585) (← links)
- A one-to-one correspondence between two classes of ordered trees (Q1123634) (← links)
- A path integral approach to data structure evolution (Q1179455) (← links)
- A special case the of dynamization problem for least cost paths (Q1183415) (← links)
- The asymptotic contour process of a binary tree is a Brownian excursion (Q1198554) (← links)
- On the optimality of multivariate Poisson approximation (Q1208932) (← links)
- The expected additive weight of trees (Q1262116) (← links)
- An analysis of a class of algorithms for \(S\)-box construction (Q1335025) (← links)
- The joint distribution of the three types of nodes in uniform binary trees (Q1346776) (← links)
- Distribution of distances in random binary search trees. (Q1872343) (← links)
- One-sided variations on binary search trees (Q1881001) (← links)
- Analytic methods in asymptotic enumeration (Q1917527) (← links)
- The scientific works of Rainer Kemp (1949--2004) (Q2369005) (← links)
- On the number of inversions in bimodal permutations (Q2568420) (← links)
- On the height of random <i>m</i>‐ary search trees (Q3977075) (← links)
- The limiting common distribution of two leaf heights in a random binary tree (Q3991290) (← links)
- The Variance of Level Numbers in Certain Families of Trees (Q4019372) (← links)
- Universal Limit Laws for Depths in Random Trees (Q4210155) (← links)
- On random cartesian trees (Q4286297) (← links)
- Connection reliabilities in stochastic acyclic networks (Q4288878) (← links)
- Balanced ordered trees (Q4288882) (← links)
- On the average minimal prefix-length of the generalized semi-Dycklanguage (Q4341038) (← links)
- Uniformly growing backtrack trees (Q4362277) (← links)
- On the average complexity of the membership problem for a generalized Dyck language (Q5055948) (← links)
- DEGREE-BASED GINI INDEX FOR GRAPHS (Q5111478) (← links)
- Limit Theorems for Record Indicators in Threshold $F^\alpha$-Schemes (Q5131240) (← links)
- Analytic analysis of algorithms (Q5204317) (← links)
- The multiplicity of left-to-right maxima in geometrically distributed words (Q5880791) (← links)
- The stack-size of tries: A combinatorial study (Q5958316) (← links)