Trie size in a dynamic list structure

DOI10.1002/RSA.3240050505zbMath0938.68558OpenAlexW2028923288MaRDI QIDQ4315393

Guy Louchard

Publication date: 21 June 2000

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240050505

Mathematics Subject Classification ID

Gaussian processes (60G15) General topics in the theory of software (68N01)

Related Items (4)

Occupancy urn models in the analysis of algorithms ⋮ Dynamic analysis of some relational databases parameters ⋮ On the variance of a class of inductive valuations of data structures for digital search ⋮ Probabilistic analysis of adaptative sampling

This page was built for publication: Trie size in a dynamic list structure