Deletions That Preserve Randomness

Authors:
D. E. Knuth
Affiliations:
Department of Computer Science, Stanford University
Venue:
IEEE Transactions on Software Engineering
Year:
1977

Citing 0
Cited 8

Mastermind: an augment reality approach: [porting a legacy game to new interaction paradigms]

Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts
Randomness Preserving Deletions on Special Binary Search Trees

Electronic Notes in Theoretical Computer Science (ENTCS)
Sorting Algorithms in MOQA

Electronic Notes in Theoretical Computer Science (ENTCS)
ISB-tree: A new indexing scheme with efficient expected behaviour

Journal of Discrete Algorithms
Towards modular average-case timing in real-time languages: an application to real-time Java

ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
NEFOS: rapid cache-aware range query processing with probabilistic guarantees

DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
ISB-tree: a new indexing scheme with efficient expected behaviour

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting

Fundamenta Informaticae

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper discusses dynamic properties of data structures under insertions and deletions It is shown that, in certain circumstances, the result of n random insertions and m random deletions will be equivalent to n-m random insertions, under various interpretations of the world "random" and under various constraints on the order of insertions and deletions.