• DocumentCode
    2188720
  • Title

    Storing a sparse table with O(1) worst case access time

  • Author

    Fredman, Michael L. ; Fredman, Michael L. ; Fredman, Michael L. ; Fredman, Michael L. ; Komlos, Janos ; Komlos, Janos ; Komlos, Janos ; Komlos, Janos ; Szemeredi, Endre ; Szemeredi, Endre ; Szemeredi, Endre ; Szemeredi, Endre

  • fYear
    1982
  • fDate
    3-5 Nov. 1982
  • Firstpage
    165
  • Lastpage
    169
  • Abstract
    We describe a data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time. Both the data structure and the query algorithm are easy to implement.
  • Keywords
    Computer aided software engineering; Data structures; Mathematics; Polynomials; Probes; Size measurement; Time measurement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1982. SFCS '08. 23rd Annual Symposium on
  • Conference_Location
    Chicago, IL, USA
  • ISSN
    0272-5428
  • Type

    conf

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