Abstract
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.
The work of the first author was also supported by an Ontario Graduate scholarship, and the second author by a Natural Sciences and Engineering Research Council of Canada Grant No. A-3353.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
R. Baeza-Yates, G.H. Gonnet, and N. Ziviani. Expected behaviour analysis of AVL trees. Department of Computer Science, University of Waterloo, 1987.
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).
J.L. Bentley and J.H. Friedman. Data structures for range searching. ACM C. Surveys, 11(4):397–409, Dec 1979.
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.
P. Flajolet and C. Puech. Tree structures for partial match retrieval. J.ACM, 33:371–407, 1986.
Z. Galil and K. Park. An improved algorithm for approximate string matching. In ICALP'89, Stressa, Italy, 1989.
F.R. Gantmacher. The Theory of Matrices (2 Vols). Chelsea Publishing Company, New York, 1959.
R. Graham, D. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, Reading, Mass., 1989.
F Hildebrand. Finite-Difference Equations and Simulations. Prentice-Hall, Englewood Cliffs, New Jersey, 1968.
D.E. Knuth. The Art of Computer Programming: Fundamental Algorithms, volume 1. Addison-Wesley, Reading, Mass., 1969.
D.E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, Reading, Mass., 1973.
G. Lueker. Some techniques for solving recurrences. ACM Compuying Surveys, 12(4):419–436, 1980.
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.
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.
A.C-C. Yao. On random 2–3 trees. Acta Informatica, 9(2):159–170, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baeza-Yates, R.A., Gonnet, G.H. (1991). Average case analysis of algorithms using matrix recurrences. In: Akl, S.G., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '90. ICCI 1990. Lecture Notes in Computer Science, vol 468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53504-7_67
Download citation
DOI: https://doi.org/10.1007/3-540-53504-7_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53504-1
Online ISBN: 978-3-540-46677-2
eBook Packages: Springer Book Archive