A trivial algorithm whose analysis isn't

DOI10.1016/0022-0000(78)90020-XzbMath0376.68030MaRDI QIDQ1245568

Donald E. Knuth, Arne T. Jonassen

Publication date: 1978

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Information storage and retrieval of data (68P20)

Related Items (16)

A trivial algorithm whose analysis is not: a continuation ⋮ A class of random recursive tree algorithms with deletion ⋮ Emerging behavior as binary search trees are symmetrically updated. ⋮ Analysis of the standard deletion algorithms in exact fit domain binary search trees ⋮ Analysis of dynamic algorithms in Knuth's model ⋮ Automatic average-case analysis of algorithms ⋮ Dynamic behaviour in updating process over BST of size two with probabilistic deletion algorithms ⋮ A path integral approach to data structure evolution ⋮ Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis ⋮ Algorithmic probabilistic game semantics. Playing games with automata ⋮ A note on a generalization of two well-known Cominatorial identities via a Hypergeometric series approach ⋮ Deletions in random binary search trees: a story of errors ⋮ Randomness Preserving Deletions on Special Binary Search Trees ⋮ Maintaining Ideally Distributed Random Search Trees without Extra Space ⋮ \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis ⋮ The analysis of simple list structures

Cites Work

• Deletions That Preserve Randomness
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
• Unnamed Item

This page was built for publication: A trivial algorithm whose analysis isn't