The analysis of simple list structures

DOI10.1016/0020-0255(86)90016-2zbMath0581.68021MaRDI QIDQ1067775

Philippe Flajolet, Claude Puech, Jean E. Vuillemin

Publication date: 1986

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00076317/file/RR-0241.pdf

zbMATH Keywords

performance; orthogonal polynomials; continued fractions; data structures; priority queue; dictionary; analysis of simple lists; q- generalizations of Hermite and Laguerre polynomials

Mathematics Subject Classification ID

68P05: Data structures

68N99: Theory of software

Related Items

Dynamic analysis of some relational databases parameters, Analysis of dynamic algorithms in Knuth's model, Brownian motion and algorithm complexity, Random walks, Gaussian processes and list structures, A path integral approach to data structure evolution, Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial aspects of continued fractions
• A trivial algorithm whose analysis isn't
• Sequence of operations analysis for dynamic data structures
• Stacks in a two-level store
• The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
• Über Orthogonalpolynome, die q‐Differenzengleichungen genügen
• Sur Un Problème De Configurations Et Sur Les Fractions Continues