par Louchard, Guy
Référence Lecture notes in computer science, 668, page (717-731)
Publication Publié, 1993
Article révisé par les pairs
Résumé : This paper considers a classical binary tree implementation of a set of keys: the trie. The trie size properties in a static environment are well known: the size is asymptotically Gaussian when the keys number gets large, In this paper we analyze the trie in a, dynamic environment, where the trie is allowed to grow and shrink in a probabilistic way. It appears that the trie size can be described by a stochastic process which is asymptotically non-Markovian Gaussian. This also allows the complete asymptotic analysis of the trie size maximum and the trie size integrated cost.