The analysis of simple list structures
From MaRDI portal
Publication:1067775
DOI10.1016/0020-0255(86)90016-2zbMATH Open0581.68021OpenAlexW2159186660MaRDI QIDQ1067775FDOQ1067775
Claude Puech, Jean E. Vuillemin, Philippe Flajolet
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
performancedata structurescontinued fractionsorthogonal polynomialspriority queuedictionaryanalysis of simple listsq- generalizations of Hermite and Laguerre polynomials
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
- Über Orthogonalpolynome, die q‐Differenzengleichungen genügen
- Combinatorial aspects of continued fractions
- Sequence of operations analysis for dynamic data structures
- Sur Un Problème De Configurations Et Sur Les Fractions Continues
- A trivial algorithm whose analysis isn't
- Stacks in a two-level store
Cited In (10)
- Brownian motion and algorithm complexity
- A path integral approach to data structure evolution
- Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis
- Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trie size in a dynamic list structure
- Analysis of dynamic algorithms in Knuth's model
- Random walks, Gaussian processes and list structures
- Dynamic analysis of some relational databases parameters
This page was built for publication: The analysis of simple list structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1067775)
