• DocumentCode
    748559
  • Title

    Deletions That Preserve Randomness

  • Author

    Knuth, Donald E.

  • Author_Institution
    Department of Computer Science, Stanford University
  • Issue
    5
  • fYear
    1977
  • Firstpage
    351
  • Lastpage
    359
  • 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.
  • Keywords
    Analysis of algorithms; binary search trees; data organization; deletions; priority queues; Artificial intelligence; Binary search trees; Computer science; Data structures; Tree data structures; US Government; Analysis of algorithms; binary search trees; data organization; deletions; priority queues;
  • fLanguage
    English
  • Journal_Title
    Software Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-5589
  • Type

    jour

  • DOI
    10.1109/TSE.1977.231160
  • Filename
    1702459
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=748559