This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Deletions That Preserve Randomness
September 1977 (vol. 3 no. 5)
pp. 351-359
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.
Index Terms:
priority queues, Analysis of algorithms, binary search trees, data organization, deletions
Citation:
D.E. Knuth, "Deletions That Preserve Randomness," IEEE Transactions on Software Engineering, vol. 3, no. 5, pp. 351-359, Sept. 1977, doi:10.1109/TSE.1977.231160
Usage of this product signifies your acceptance of the Terms of Use.