Recommendations
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3588046 (Why is no real title available?)
- scientific article; zbMATH DE number 3053340 (Why is no real title available?)
- A trivial algorithm whose analysis isn't
- Combinatorial aspects of continued fractions
- Sequence of operations analysis for dynamic data structures
- Stacks in a two-level store
- Sur Un Problème De Configurations Et Sur Les Fractions Continues
- The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
- Über Orthogonalpolynome, die q‐Differenzengleichungen genügen
Cited in
(11)- 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
- scientific article; zbMATH DE number 88934 (Why is no real title available?)
- scientific article; zbMATH DE number 5199066 (Why is no real title available?)
- Trie size in a dynamic list structure
- Analysis of dynamic algorithms in Knuth's model
- Random walks, Gaussian processes and list structures
- scientific article; zbMATH DE number 3947370 (Why is no real title available?)
- 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)
