scientific article

zbMath0605.68057MaRDI QIDQ3742733

Mireille Régnier, Philippe Jacquet

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

treesprobabilistic modelstrie structure

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (22)

On the distribution for the duration of a randomized leader election algorithm ⋮ Analytical depoissonization and its applications ⋮ On the variety of shapes in digital trees ⋮ Gaussian Distribution of Trie Depth for Strongly Tame Sources ⋮ Exact and asymptotic distributions in digital and binary search trees ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ On the height of digital trees and related problems ⋮ On tries, contention trees and their analysis ⋮ A characterization of digital search trees from the successful search viewpoint ⋮ Mellin transforms and asymptotics: Harmonic sums ⋮ On the variance of a class of inductive valuations of data structures for digital search ⋮ A note on binomial recurrences arising in the analysis of algorithms ⋮ The expected profile of digital search trees ⋮ The oscillatory distribution of distances in random tries ⋮ A probabilistic analysis of some tree algorithms ⋮ Dependence between path-length and size in random digital trees ⋮ Renewal theory in the analysis of tries and strings ⋮ Expected worst-case partial match in random quadtries ⋮ Universal Limit Laws for Depths in Random Trees ⋮ Some results on tries with adaptive branching. ⋮ Trie size in a dynamic list structure ⋮ Laws of large numbers and tail inequalities for random tries and PATRICIA trees

This page was built for publication: