Pages that link to "Item:Q4361713"
From MaRDI portal
The following pages link to Patterns in random binary search trees (Q4361713):
Displaying 37 items.
- On the richness of the collection of subtrees in random binary search trees (Q293237) (← links)
- Stochastic analysis of the extra clustering model for animal grouping (Q304209) (← links)
- Retracted: Strong limiting behavior in binary search trees (Q395794) (← links)
- Non-contiguous pattern avoidance in binary trees (Q456347) (← links)
- On the sub-permutations of pattern avoiding permutations (Q465287) (← links)
- Rare event asymptotics for a random walk in the quarter plane (Q622613) (← links)
- Pattern avoidance in binary trees (Q986111) (← links)
- Consecutive patterns in permutations (Q1398289) (← links)
- The depth first processes of Galton-Watson trees converge to the same Brownian excursion (Q1431505) (← links)
- A general limit theorem for recursive algorithms and combinatorial structures (Q1431560) (← links)
- On the variety of shapes in digital trees (Q1692230) (← links)
- Cost functionals for large (uniform and simply generated) random trees (Q1990219) (← links)
- Distinct fringe subtrees in random trees (Q2105315) (← links)
- The distributions under two species-tree models of the number of root ancestral configurations for matching gene trees and species trees (Q2108896) (← links)
- Analysis of an efficient reduction algorithm for random regular expressions based on universality detection (Q2117090) (← links)
- Maximal clades in random binary search trees (Q2256128) (← links)
- An asymptotic distribution theory for Eulerian recurrences with applications (Q2280063) (← links)
- Limit theorems for patterns in phylogenetic trees (Q2340020) (← links)
- Random unfriendly seating arrangement in a dining table (Q2343189) (← links)
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees (Q2363114) (← links)
- Reductions in binary search trees (Q2369002) (← links)
- Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves (Q2412994) (← links)
- Noncontiguous pattern containment in binary trees (Q2449274) (← links)
- Limiting theorems for the nodes in binary search trees (Q2481277) (← links)
- Asymptotic joint normality of counts of uncorrelated motifs in recursive trees (Q2513659) (← links)
- Psi-series method for equality of random trees and quadratic convolution recurrences (Q2874083) (← links)
- Limit theorems for subtree size profiles of increasing trees (Q2888869) (← links)
- On the Variety of Shapes on the Fringe of a Random Recursive Tree (Q3550998) (← links)
- Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees (Q3614199) (← links)
- An almost sure result for path lengths in binary search trees (Q4449502) (← links)
- Average case analysis of leaf-centric binary tree sources (Q5005115) (← links)
- Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics (Q5042237) (← links)
- A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees (Q5278119) (← links)
- Central Limit Theorems for Additive Tree Parameters with Small Toll Functions (Q5364224) (← links)
- Compaction for two models of logarithmic‐depth trees: Analysis and experiments (Q6074703) (← links)
- The effects of semantic simplifications on random \textit{BST}-like expression-trees (Q6124452) (← links)
- Simplifications of Uniform Expressions Specified by Systems (Q6169899) (← links)
