Sequence of operations analysis for dynamic data structures☆
References (35)
- et al.
Linear expected time of a simple union-find algorithm
- et al.
The Design and Analysis of Computer Algorithms
(1974) Implementation and analysis of binomial queue algorithms
SIAM J. Comput.
(August 1978)- et al.
A representation for linear lists with movable fingers
Formes asymptotiques des coûts de files de priorité
An Introduction to Orthogonal Polynomials
(1978)Analyse d'algorithmes de manipulation de fichiers
Iria-Laboria Report No. 321
(August 1978)Analyse d'algorithmes de manipulation d'arbres et de fichiers
- P. Flajolet and J. Françon, Sequence of operations analysis of data structures under restricted sets of keys, in...
- P. Flajolet, J. Françon, G. Viennot, and J. Vuillemin, Algorithmique et combinatoire des arbres et des permutations, to...
Computing the integrated cost of dictionaries
Arbres binaires de recherche, propriétés combinatoires et applications
RAIRO Inform. Theor.
(1976)
Histoires de fichiers
RAIRO Inform. Theor.
(1978)
Combinatoire des structures de données
A new representation for linear lists
Cited by (55)
Enumeration of 4-regular one-face maps
2017, European Journal of CombinatoricsBasic analytic combinatorics of directed lattice paths
2002, Theoretical Computer ScienceThéorie combinatoire des T-fractions et approximants de Padé en deux points
1996, Discrete MathematicsDynamic analysis of some relational databases parameters
1995, Theoretical Computer ScienceUne preuve bijective d'une formule de Touchard-Riordan
1995, Discrete MathematicsData structures' maxima
1997, SIAM Journal on Computing
- ☆
A preliminary version of this paper was presented at the 20th IEEE Symposium on Foundations of Computer Science, at Puerto Rico, October 1979.
Copyright © 1980 Published by Elsevier Inc.