Abstract
By dynamic algorithms, we mean algorithms that operate on dynamically varying data structures (dictionaries, priority queues, linear lists) subject to insertions I, deletions D, positive (resp. negative) queries Q+ (resp. Q−). Let us remember that dictionaries are implementable by unsorted or sorted lists, binary search trees, priority queues by sorted lists, binary search trees, binary tournaments, pagodas, binomial queues and linear lists by sorted or unsorted lists etc. At this point the following question is very natural in computer science: for a given data structure which representation is the most efficient? In comparing the space or time costs of two data organizations A and B for the same operations, we cannot merely compare the costs of individual operations for data of given sizes: A may be better than B on some data, and conversely on others. A reasonable way to measure the efficiency of a data organization is to consider sequences of operations on the structure. J. Françon [6], [7] and D.E. Knuth [12] discovered that the number of possibilities for the i-th insertion or negative query is equal to i but that for deletions and positive queries this number depends of the size of the data structure. Answering the questions raised in [6], [7] and [12] is the main object of this paper. More precisely we show:
-
i)
how to compute explicitely the average costs,
-
ii)
how to obtain variance estimates,
-
iii)
that the costs converge as n→∞ to random variables either Gaussian or depending on Brownian Excursions functionals (the limiting distributions are therefore completely described). At our knowledge such a complete analysis has never been done before for dynamic algorithms in Knuth's model.
Preview
Unable to display preview. Download preview PDF.
References
P. BILLINGSLEY Convergence of Probability Measures, Wiley, 1968.
K.L. CHUNG Excursions in Brownian Motion, Ark. Mat., 14, 155–177, 1976.
P. FLAJOLET, J. FRANÇON, J. VUILLEMIN Sequence of Operations Analysis for Dynamic Data Structures, J. of Algorithms 1, 111–141, 1980.
P. FLAJOLET, C. PUECH, J. VUILLEMIN The Analysis of Simple Lists Structures, Inf. Sc. 38, 121–146, 1986.
P. FLAJOLET Analyse d'algorithmes de manipulation d'arbres et de fichiers, B.U.R.O., cahier 34–35, 1981.
J. FRANÇON Combinatoire des structures de données, Thèse de doc. d'Etat, Université de Strasbourg, 1979.
J. FRANÇON Histoires de fichiers, RAIRO Inf. Th. 12, 49–62, 1978.
J. FRANÇON, B. RANDRIANARIMANANA, R. SCHOTT Analysis of Dynamic Data Structures in D.E. Knuth's Model. Rapport C.R.I.N., 1986 (submitted).
J. FRANÇON, B. RANDRIANARIMANANA, R. SCHOTT Analysis of Dynamic Algorithms in D.E. Knuth's Model, Proc. C.A.A.P. '88, L.N.C.S. 299, 72–88, Springer Verlag.
A. JONASSEN, D.E. KNUTH A Trivial Algorithm whose Analysis isn't, J. of Comp. and System Sc., 16, 301–332, 1978.
G.D. KNOTT Deletion in Binary Storage Trees. Report Stan-CS, 75–491, May 1975.
D.E. KNUTH Deletions that Preserve Randomness. Trans. Software Eng., 351–359, 1977.
D.E. KNUTH The Art of Computer Programming: Sorting and Searching, vol.3, second printing, 1975.
P. LEVY Processus stochastiques et mouvement Brownien, Gauthier-Villars, 1948.
G. LOUCHARD Kac's Formula, Levy's Local Time and Brownian Excursion, J. Appl. Probab., 21, 479–499, 1984.
G. LOUCHARD The Brownian Excursion Area: A Numerical Analysis, Comput. Math. Appl., 10, 6, 413–417, 1986.
G. LOUCHARD Brownian Motion and Algorithms Complexity, B.I.T.26, 17–34, 1986.
G. LOUCHARD Exact and Asymptotic Distributions in Digital and Binary Search Trees, Theor. Inf. Appl.21, 4,479–496, 1987.
G. LOUCHARD Random Walks, Gaussian Processes and List Structures, Th. Comp. Sc. 53, 99–124, 1987.
G. LOUCHARD, B. RANDRIANARIMANANA, R. SCHOTT Dynamic Algorithms in D.E. Knuth's Model: A Probabilistic Analysis (submitted)
E. PARZEN Stochastic Processes, Holden-Day, 1962.
B. RANDRIANARIMANANA Analyse des structures de données dynamiques dans le modèle de D.E. Knuth, Thèse de 3ème cycle, Université de Nancy 1, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Louchard, G., Randrianarimanana, B., Schott, R. (1989). Dynamic algorithms in D.E. Knuth's model: A probabilistic analysis. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035781
Download citation
DOI: https://doi.org/10.1007/BFb0035781
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51371-1
Online ISBN: 978-3-540-46201-9
eBook Packages: Springer Book Archive