Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Shen, A. (1997). Set representation. Hashing. In: Algorithms and Programming. Modern Birkhäuser Classics. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-4761-2_11
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4761-2_11
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-4760-5
Online ISBN: 978-0-8176-4761-2
eBook Packages: Springer Book Archive