Sequence of operations analysis for dynamic data structures
From MaRDI portal
Cited in
(25)- The analysis of simple list structures
- Path generating functions and continued fractions
- Über die Koeffizienten der Stieltjes-Matrix eines Jacobi-Kettenbruchs. (On the coefficients of the Stieltjes matrix of a Jacobi continued fraction)
- On congruences and continued fractions for some classical combinatorial quantities
- A combinatorial approach to nonlinear functional expansions: An introduction with an example
- A path integral approach to data structure evolution
- Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis
- Basic analytic combinatorics of directed lattice paths
- A bijective proof of a Touchard-Riordan formula
- Combinatorial theory of \(\text{T}\)-fractions and two points Padé approximants
- Large deviations for combinatorial distributions. I: Central limit theorems
- Connected chord diagrams and bridgeless maps
- On the principal recurrence of data structures organization and orthogonal polynomials
- Formulae for Askey-Wilson moments and enumeration of staircase tableaux
- Topological classification and enumeration of RNA structures by genus
- Improved bounds for colouring circle graphs
- Connected chord diagrams and the combinatorics of asymptotic expansions
- Trie size in a dynamic list structure
- Enumeration of 4-regular one-face maps
- Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence
- Tubings, chord diagrams, and Dyson-Schwinger equations
- Dynamic analysis of some relational databases parameters
- Maximum queue size and hashing with lazy deletion
- Non-overlapping partitions, continued fractions, Bessel functions and a divergent series
- Analysis of dynamic algorithms in Knuth's model
This page was built for publication: Sequence of operations analysis for dynamic data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3890114)
