Average case analysis of algorithms using matrix recurrences

  • Ricardo A. Baeza-Yates
  • Gaston H. Gonnet
Theory Of Computing, Algorithms And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 468)


We use matrix recurrences to analyze the expected behaviour of algorithms on trees. We apply this technique to the average case analysis of balanced search trees and digital trees. In particular we give the exact solution for a fringe analysis problem, a technique used for search trees, that was unknown before. This method also makes easier to solve some scalar recurrences.


Analysis of algorithms average case search trees digital trees matrix recurrences 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Apostolico and W. Szpankowski. Self-alignments in words and their applications. Technical Report CSD-TR-732, Department of Computer Science, Purdue University, West Lafayette, IN 47907, 1987.Google Scholar
  2. [2]
    R. Baeza-Yates and G.H. Gonnet. Efficient text searching of regular expressions. In G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Della Rocca, editors, ICALP'89, Lecture Notes in Computer Science 372, pages 46–62, Stresa, Italy, July 1989. Springer-Verlag. Also as UW Centre for the New OED Report, OED-89-01, Univ. of Waterloo, April, 1989.Google Scholar
  3. [3]
    R. Baeza-Yates, G.H. Gonnet, and N. Ziviani. Expected behaviour analysis of AVL trees. Department of Computer Science, University of Waterloo, 1987.Google Scholar
  4. [4]
    R.A. Baeza-Yates and P.V. Poblete. Reduction of the transition matrix of a fringe analysis and its application to the analysis of 2–3 trees. In 5th International Conference in Computer Science, pages 56–82, Santiago, Chile, 1985. (in Spanish).Google Scholar
  5. [5]
    J.L. Bentley and J.H. Friedman. Data structures for range searching. ACM C. Surveys, 11(4):397–409, Dec 1979.Google Scholar
  6. [6]
    B. Eisenbarth, N. Ziviani, Gaston H. Gonnet, Kurt Mehlhorn, and Derick Wood. The theory of fringe analysis and its application to 2–3 trees and B-trees. Information and Control, 55(1):125–174, Oct 1982.Google Scholar
  7. [7]
    P. Flajolet and C. Puech. Tree structures for partial match retrieval. J.ACM, 33:371–407, 1986.Google Scholar
  8. [8]
    Z. Galil and K. Park. An improved algorithm for approximate string matching. In ICALP'89, Stressa, Italy, 1989.Google Scholar
  9. [9]
    F.R. Gantmacher. The Theory of Matrices (2 Vols). Chelsea Publishing Company, New York, 1959.Google Scholar
  10. [10]
    R. Graham, D. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, Reading, Mass., 1989.Google Scholar
  11. [11]
    F Hildebrand. Finite-Difference Equations and Simulations. Prentice-Hall, Englewood Cliffs, New Jersey, 1968.Google Scholar
  12. [12]
    D.E. Knuth. The Art of Computer Programming: Fundamental Algorithms, volume 1. Addison-Wesley, Reading, Mass., 1969.Google Scholar
  13. [13]
    D.E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, Reading, Mass., 1973.Google Scholar
  14. [14]
    G. Lueker. Some techniques for solving recurrences. ACM Compuying Surveys, 12(4):419–436, 1980.Google Scholar
  15. [15]
    T. Nakamura and T. Mizoguchi. An analysis of storage utilization factor in block split data structuring scheme. In VLDB, volume 4, pages 489–495, Berlin, Sep 1978.Google Scholar
  16. [16]
    A.C-C. Yao. On random 3–2 trees. Technical Report UIUCDCS-R-74-679, Departament of Computer Science, University of Illinois at Urbana, Oct 1974.Google Scholar
  17. [17]
    A.C-C. Yao. On random 2–3 trees. Acta Informatica, 9(2):159–170, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Ricardo A. Baeza-Yates
    • 1
  • Gaston H. Gonnet
    • 2
  1. 1.Depto. de Ciencias de la ComputaciónUniversidad de ChileSantiagoChile
  2. 2.Dept. of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations