The analysis of simple list structures (Q1067775)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The analysis of simple list structures |
scientific article |
Statements
The analysis of simple list structures (English)
0 references
1986
0 references
We present an analysis of simple lists, either sorted or unsorted, under the set of all their possible histories (i.e. evolutions considered up to order isomorphism) of length n. Using the theory of continued fractions and orthogonal polynomials. \textit{P. Flajolet, J. Françon} and \textit{J. Vuillemin} [J. Algorithms 1, 111-141 (1980; Zbl 0445.68036)] have determined average costs of sequences of operations for many data structures of the dictionary or priority queue type. We show here that for the simplest structures variance estimates can also be obtained. The method uses continued fractions and properties of nonclassical q- generalizations of Hermite and Laguerre polynomials.
0 references
performance
0 references
analysis of simple lists
0 references
continued fractions
0 references
orthogonal polynomials
0 references
data structures
0 references
dictionary
0 references
priority queue
0 references
q- generalizations of Hermite and Laguerre polynomials
0 references