Issue No. 05 - September (1977 vol. 3)
D.E. Knuth , Department of Computer Science, Stanford University
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.
priority queues, Analysis of algorithms, binary search trees, data organization, deletions
D. Knuth, "Deletions That Preserve Randomness," in IEEE Transactions on Software Engineering, vol. 3, no. , pp. 351-359, 1977.