Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Extendible hashing with overflow

From MaRDI portal
Publication:1172380
Jump to:navigation, search

DOI10.1016/0020-0190(82)90123-5zbMath0501.68004OpenAlexW1994963518MaRDI QIDQ1172380

Markku Tamminen

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90123-5


zbMATH Keywords

performance analysis


Mathematics Subject Classification ID

Data structures (68P05)


Related Items (1)

On search by address computation




Cites Work

  • On the performance evaluation of extendible hashing and trie searching
  • A note on the analysis of extendible hashing
  • Order preserving extendible hashing and bucket tries
  • On the average height of trees in digital search and dynamic hashing
  • The extendible cell method for closest point problems




This page was built for publication: Extendible hashing with overflow

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1172380&oldid=13242759"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki