scientific article; zbMATH DE number 1246231
From MaRDI portal
Publication:4226454
zbMath0924.60077MaRDI QIDQ4226454
Publication date: 8 November 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of branching processes (60J85) Parallel algorithms in computer science (68W10) Data structures (68P05)
Related Items
The shape of large Galton-Watson trees with possibly infinite variance, Random subgraphs of the 2D Hamming graph: The supercritical phase, The density of the ISE and local limit laws for embedded trees, Parameterised branching processes: a functional version of Kesten \& Stigum theorem, Finding paths in sparse random graphs requires many queries, Community modulated recursive trees and population dependent branching processes, Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point, Long and short paths in uniform random recursive dags, Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation, Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees, Search trees: metric aspects and strong limit theorems, Random binary trees: from the average case analysis to the asymptotics of distributions, The height of increasing trees, Supercritical percolation on large scale-free random trees, On a multivariate contraction method for random recursive structures with applications to Quicksort, Minima in branching random walks, A functional limit theorem for the profile of \(b\)-ary trees, The Wiener Index of simply generated random trees, Random suffix search trees, Non-parametric Bayesian estimation for multitype branching processes through simulation-based methods, Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey, The probabilistic analysis of a greedy satisfiability algorithm, Graph limits of random graphs from a subset of connected k‐trees, Scaling limits for a family of unrooted trees, Continuous and discontinuous phase transitions in hypergraph processes, Correction terms for the height of weighted recursive trees, Random cutting and records in deterministic and random trees, Selecting Complementary Pairs of Literals
