The analysis of simple list structures

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

Claude Puech, Philippe Flajolet, 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

performanceorthogonal polynomialscontinued fractionsdata structurespriority queuedictionaryanalysis of simple listsq- generalizations of Hermite and Laguerre polynomials

Mathematics Subject Classification ID

Data structures (68P05) Theory of software (68N99)

Related Items

Brownian motion and algorithm complexity ⋮ Random walks, Gaussian processes and list structures ⋮ Analysis of dynamic algorithms in Knuth's model ⋮ Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence ⋮ A path integral approach to data structure evolution ⋮ Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis ⋮ Dynamic analysis of some relational databases parameters ⋮ Trie size in a dynamic list structure

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