论文信息 - Functional Equations for Data Structures

Functional Equations for Data Structures

We show how tree-like data structures (B-trees, AVL trees, binary trees, etc. ...) can be characterized by functional equations in the context of the theory of species of structures which has been introduced as a conceptual framework for enumerative combinatorics. The generating functions associated to these abstract data structures are directly derived from the corresponding functional equations.

François Bergeron | Gilbert Labelle | Pierre Leroux

[1] Jean Vuillemin,et al. A unifying look at data structures , 1980, CACM.

[2] Philippe Flajolet. Elements of a general theory of combinatorial structures , 1985, FCT.

[3] Derick Wood,et al. 1-2 Brother Trees or AVL Trees Revisited , 1980, Comput. J..

[4] Gilbert Labelle,et al. Some new computational methods in the theory of species , 1986 .

[5] H. T. Kung,et al. Fast Algorithms for Manipulating Formal Power Series , 1978, JACM.

[6] Jean Françon,et al. On the Analysis of Algorithms for Trees , 1977, Theor. Comput. Sci..

[7] Gilbert Labelle,et al. Une approche combinatoire pour l'itération de Newton - Raphson , 1982 .

[8] A. Joyal. Une théorie combinatoire des séries formelles , 1981 .

[9] A. Odlyzko. Periodic oscillations of coefficients of power series that satisfy functional equations , 1982 .

[10] Gilbert Labelle,et al. Une combinatoire sous-jacente au théorème des fonctions implicites , 1985, J. Comb. Theory, Ser. A.

[11] Gérard Viennot,et al. Combinatorial resolution of systems of differential equations, I. Ordinary differential equations , 1986 .

[12] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[13] Jean Françon,et al. Sur Le Nombre de Registres Nécessaires a L'évaluation D'une Expression Arithmétique , 1984, RAIRO Theor. Informatics Appl..