Set representation. Hashing

  • Alexander Shen
Part of the Modern Birkhäuser Classics book series (MBC)


In section 6 we considered several representations for sets whose elements are integers of arbitrary size. However, all those representations are rather inefficient: at least one of the operations (membership test, adding or deleting an element) runs in time proportional to the number of elements in the set. This is unacceptable in almost all practical applications.


Hash Function Distinct Element English Word Arbitrary Size Correct Word 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Alexander Shen
    • 1
  1. 1.Institute of Problems of Information TransmissionMoscowRussia

Personalised recommendations