scientific article; zbMATH DE number 1080355
From MaRDI portal
Publication:4361713
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199710)11:3<223::AID-RSA2>3.0.CO;2-2" /><223::AID-RSA2>3.0.CO;2-2 10.1002/(SICI)1098-2418(199710)11:3<223::AID-RSA2>3.0.CO;2-2zbMath0895.60010MaRDI QIDQ4361713
Conrado Martínez, Xavier Gourdon, Philippe Flajolet
Publication date: 8 September 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (32)
Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees ⋮ Limit Theorems for Subtree Size Profiles of Increasing Trees ⋮ Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics ⋮ On the richness of the collection of subtrees in random binary search trees ⋮ Stochastic analysis of the extra clustering model for animal grouping ⋮ Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves ⋮ Retracted: Strong limiting behavior in binary search trees ⋮ Compaction for two models of logarithmic‐depth trees: Analysis and experiments ⋮ Consecutive patterns in permutations ⋮ Rare event asymptotics for a random walk in the quarter plane ⋮ On the variety of shapes in digital trees ⋮ The effects of semantic simplifications on random \textit{BST}-like expression-trees ⋮ A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees ⋮ Simplifications of Uniform Expressions Specified by Systems ⋮ Unnamed Item ⋮ Central Limit Theorems for Additive Tree Parameters with Small Toll Functions ⋮ On the sub-permutations of pattern avoiding permutations ⋮ The depth first processes of Galton-Watson trees converge to the same Brownian excursion ⋮ A general limit theorem for recursive algorithms and combinatorial structures ⋮ On the Variety of Shapes on the Fringe of a Random Recursive Tree ⋮ Cost functionals for large (uniform and simply generated) random trees ⋮ Limiting theorems for the nodes in binary search trees ⋮ Maximal clades in random binary search trees ⋮ An asymptotic distribution theory for Eulerian recurrences with applications ⋮ Asymptotic joint normality of counts of uncorrelated motifs in recursive trees ⋮ An almost sure result for path lengths in binary search trees ⋮ Limit theorems for patterns in phylogenetic trees ⋮ Random unfriendly seating arrangement in a dining table ⋮ Distinct fringe subtrees in random trees ⋮ The distributions under two species-tree models of the number of root ancestral configurations for matching gene trees and species trees ⋮ Psi-series method for equality of random trees and quadratic convolution recurrences ⋮ Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
This page was built for publication:
