• DocumentCode
    2184451
  • Title

    Storing a dynamic sparse table

  • Author

    Aho, Alfred V. ; Lee, David

  • fYear
    1986
  • fDate
    27-29 Oct. 1986
  • Firstpage
    55
  • Lastpage
    60
  • Abstract
    We present a family of data structures that can process a sequence of insert, delete, and lookup instructions such that each lookup and deletion is done in constant worst-case time and each insertion is done in constant expected time. The amount of space used by each data structure is proportional to the maximal number of elements that need to be stored at any moment in time.
  • Keywords
    Algorithm design and analysis; Compaction; Computer science; Data structures; Dictionaries;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1986., 27th Annual Symposium on
  • Conference_Location
    Toronto, ON, Canada
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-0740-8
  • Type

    conf

  • DOI
    10.1109/SFCS.1986.50
  • Filename
    4568195
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2184451