Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis

DOI10.1016/0304-3975(92)90330-IzbMath0746.68041MaRDI QIDQ1186603

B. Randrianarimanana, René Schott, Guy Louchard

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

dynamic algorithmsdynamically varying data structuresefficiency of a data organization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (5)

A Probabilistic Analysis of a String Editing Problem and its Variations ⋮ Generalized covariances of multi-dimensional Brownian excursion local times. ⋮ Dynamic analysis of some relational databases parameters ⋮ A Markovian concurrency measure ⋮ Trie size in a dynamic list structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of dynamic algorithms in Knuth's model
• The Brownian excursion area: A numerical analysis
• The analysis of simple list structures
• Brownian motion and algorithm complexity
• Random walks, Gaussian processes and list structures
• Excursions in Brownian motion
• A trivial algorithm whose analysis isn't
• Kac's formula, levy's local time and brownian excursion
• Exact and asymptotic distributions in digital and binary search trees
• Sequence of operations analysis for dynamic data structures
• Deletions That Preserve Randomness

This page was built for publication: Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis