Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1983: Automata, Languages and Programming pp 466–477Cite as

On the study data structures: Binary tournaments with repeated keys

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 154))

Abstract

In this paper we develop a systematic way of analyzing tree like data structures and recursive algorithms on them; the method is shown on binary tournaments with repeated Keys extending previous applications to term trees. Tournaments are studied both as a combinatorial and as a computational object; the main line of our approach consists in showing strong correspondences between recursive definition of combinatorial parameters and of procedures on one hand and equations over generating power series on the other hand; we can then conclude by deriving closed formulae or asymtotic estimates for the average values of various quantities and running times of procedures.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W.H. BURGE: “An analysis of binary search trees formed from sequence of nondistinct keys” J. ACM 23 [1976], 451–454.

    Google Scholar 

  2. J. BERSTEL, C. REUTENAUR:“Recognizable formal power series on trees”, rapport LITP nℴ 80-26

    Google Scholar 

  3. Ph. FLAJOLET “Analyse d'algorithmes de manipulations d'arbres et de fichiers” Thèse Université de Paris-Orsay Septembre 1979, Also published in Cahiers du Bureau Universitaire de Recherche Opérationnelle BURO, 34–35, (1981).

    Google Scholar 

  4. Ph. FLAJOLET, J.M. STEYAERT:“A complexity calculus for classes of recursive search programs over tree structures”, in Proc. of ACH 22nd FOCS Symp., Nashville TN (1981).

    Google Scholar 

  5. D. FOATA, P. CARTIER: “Problèmes combinatoires de commutations et réarrangements”, Lecture Notes in Mathematics, 85 (1969), Springer Verlag, Berlin.

    Google Scholar 

  6. D. FOATA, M.P. SCHUTZENBERGER: “Théorie géométrique des polynÔmes eulériens” Lecture Notes in Mathematics, 138 (1970), Springer Verlag, Berlin.

    Google Scholar 

  7. J. FRANÇON: “Combinatoire des structures de données”. Thèse, Université Louis Pasteur, Strasbourg 1979.

    Google Scholar 

  8. J. FRANÇON, G. VIENNOT, J. VUILLEMIN: “Description and analysis of an efficient priority queue algorithms”, in Proc of 19th ACM Symp on FOCS (1978) pp. 1–7.

    Google Scholar 

  9. D.E. KNUTH: “The art of computer programming, vol 1: Fundamental algorithms”, addison Wesley, Reading, Mass (1968).

    Google Scholar 

  10. D.E. KNUTH: “The art of computer programming, vol. 3: Sorting and Searching”, Addison Wesley, Reading Mass (1973).

    Google Scholar 

  11. P. LESCANNE: “Analysis of data structures with non distinct Keys” Rapport CRIN 82-R-039 Centre de Recherche en Informatique de Nancy (1982).

    Google Scholar 

  12. P. LESCANNE: “Some properties of the recursive decomposition ordering” RAIRO Informatique théorique vol. 16, nℴ 4 (1982).

    Google Scholar 

  13. R. SEDGEWICK: “Quicksort with equal Keys” SIAM J. Comput 6, (1977), 240–267.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Campus Scientifique, CRIN, BP 239, 54506, Vandoeuvre Les Nancy, France

    P. Lescanne

  2. Laboratoires de Mathématiques Appliquées, Ecole Polytechnique, 91128, Palaiseau Cedex, France

    J. M. Steyaert

Authors
  1. P. Lescanne
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. M. Steyaert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josep Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lescanne, P., Steyaert, J.M. (1983). On the study data structures: Binary tournaments with repeated keys. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036930

Download citation

  • DOI: https://doi.org/10.1007/BFb0036930

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12317-0

  • Online ISBN: 978-3-540-40038-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation