Data structures with dynamical random transitions


We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered dynamic random walks. The basic operations (insertion, deletion, positive and negative queries, batched insertion, lazy deletion, etc.) are time-dependent random variables. This model is a (small) step toward the analysis of these structures when the distribution of the set of histories is not uniform. As an illustration, we focus on list structures (linear lists, priority queues, and dictionaries) but the technique is applicable as well to more advanced data structures. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 28, 403–426, 2006

DOI: 10.1002/rsa.20091

Extracted Key Phrases

6 Figures and Tables

Cite this paper

@article{Dombry2006DataSW, title={Data structures with dynamical random transitions}, author={Cl{\'e}ment Dombry and Nadine Guillotin-Plantard and Bruno Pinçon and Ren{\'e} Schott}, journal={Random Struct. Algorithms}, year={2006}, volume={28}, pages={403-426} }