Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis
type: Item
instance of: scholarly article
title: Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis
zbMATH Open document ID: 0746.68041
DOI: 10.1016/0304-3975(92)90330-I
author: B. Randrianarimanana
author: Guy Louchard
author: R. Schott
published in: Theoretical Computer Science
publication date: 1992-06-28T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 36844
zbMATH Keywords: dynamically varying data structures
zbMATH Keywords: efficiency of a data organization
zbMATH Keywords: dynamic algorithms
MaRDI profile type: MaRDI publication profile
cites work: Q5560061
cites work: Excursions in Brownian motion
cites work: Sequence of operations analysis for dynamic data structures
cites work: The analysis of simple list structures
cites work: Q4155833
cites work: Analysis of dynamic algorithms in Knuth's model
cites work: A trivial algorithm whose analysis isn't
cites work: Deletions That Preserve Randomness
cites work: Q5791821
cites work: Kac's formula, levy's local time and brownian excursion
cites work: The Brownian excursion area: A numerical analysis
cites work: Brownian motion and algorithm complexity
cites work: Exact and asymptotic distributions in digital and binary search trees
cites work: Random walks, Gaussian processes and list structures
Recommended article: Q3789050
Recommended article: Analysis of dynamic algorithms in Knuth's model
Recommended article: Q3470253
Recommended article: Q3785925
Recommended article: Q3783526
Recommended article: Q4226449
Recommended article: A Probabilistic Analysis of Christofides’ Algorithm
Recommended article: Coarse-Grained Complexity for Dynamic Algorithms
Recommended article: Q5874224
Recommended article: STACS 2005
description: scientific article; zbMATH DE number 36844