The asymptotic evolution of data structures

  • Robert S. Maier
Theory Of Computing, Algorithms And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 468)


The evolution of certain pointer-based implementations of dictionaries, linear lists and priority queues is studied. Under the assumption of equiprobability of histories, i.e., of paths through the internal state space of the implementation, the n → ∞ asymptotics of the space and time costs of a sequence of n supported operations are computed.

For list implementations the mean integrated spatial cost is asymptotically proportional to n2, and its standard deviation to n3/2. For d-heap implementations of priority queues the mean integrated space cost grows only as n2/√log n, i.e. more slowly than the worst-case integrated cost. The standard deviation grows as n3/2.

These asymptotics reflect the convergence as n → ∞ of the normalized structure sizes to datatype-dependent deterministic functions of time, as earlier discovered by Louchard. This phenomenon is clarified with the aid of large deviation theory, and path integral techniques.


dynamic data structures expected costs stochastic modelling large deviations 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    N. I. Akhiezer, The Calculus of Variations. Blaisdell, New York, 1962.Google Scholar
  2. [2]
    B. Bollobás and I. Simon, “Repeated Random Insertions into a Priority Queue.” J. Algorithms 6 (1985), 466–477.Google Scholar
  3. [3]
    L. Chéno, P. Flajolct, J. Françon, C. Puech and J. Vuillemin, “Dynamic Data Structures: Finite Files, Limiting Profiles and Variance Analysis.” In Proceedings of the 18th Allerton Conference, pp. 223–232. Monticello, Ill., 1980.Google Scholar
  4. [4]
    P. Flajolet, J. Françon and J. Vuillemin, “Sequence of Operations Analysis for Dynamic Data Structures.” J. Algorithms 1 (1980), 111–141.Google Scholar
  5. [5]
    P. Flajolet, C. Puech and J. Vuillemin, “The Analysis of Simple List Structures.” Inform. Sci. 38 (1986), 121–146.Google Scholar
  6. [6]
    M. I. Freidlin and A. D. Wentzell, Random Perturbations of Dynamical Systems. Springer-Verlag, New York, 1984.Google Scholar
  7. [7]
    H. Goldstein, Classical Mechanics. Addison-Wesley, Reading MA, 1950.Google Scholar
  8. [8]
    N. J. Günther, “Path Integral Methods for Computer Performance Analysis.” Inf. Proc. Lett. 32 (1989), 7–13.Google Scholar
  9. [9]
    A. Jonassen and O.-J. Dahl, “Analysis of an Algorithm for Priority Queue Administration.” BIT 15 (1975), 409–422.Google Scholar
  10. [10]
    A. Jonassen and D. Knuth, “A Trivial Algorithm Whose Analysis Isn't.” J. Comput. System Sci. 16 (1978), 301–322.Google Scholar
  11. [11]
    R. Kemp, Fundamentals of the Average Case Analysis of Particular Algorithms. Wiley, New York, 1984.Google Scholar
  12. [12]
    G. Louchard, “Random Walks, Gaussian Processes and List Structures.” Theor. Comp. Sci. 53 (1987), 99–124.Google Scholar
  13. [13]
    G. Louchard, B. Randrianarimanana and R. Schott, “Dynamic Algorithms in D. E. Knuth's Model: A Probabilistic Analysis,” in Automata, Languages and Programming: Proceedings of ICALP '89, Springer-Verlag, 1989.Google Scholar
  14. [14]
    L. S. Schulman, Techniques and Applications of Path Integration. Wiley, New York, 1981.Google Scholar
  15. [15]
    S. R. S. Varadhan, Large Deviations and Applications. SIAM, Philadelphia, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Robert S. Maier
    • 1
  1. 1.Department of MathematicsUniversity of ArizonaTucsonUSA

Personalised recommendations