Space Efficient Hash Tables with Worst Case Constant Access Time

Fotakis, D; Pagh, R; Sanders, P; Spirakis, P

dc.contributor.author	Fotakis, D	en
dc.contributor.author	Pagh, R	en
dc.contributor.author	Sanders, P	en
dc.contributor.author	Spirakis, P	en
dc.date.accessioned	2014-03-01T02:49:21Z
dc.date.available	2014-03-01T02:49:21Z
dc.date.issued	2003	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34541
dc.subject	Data Structure	en
dc.subject	Hash Function	en
dc.subject	Hash Table	en
dc.title	Space Efficient Hash Tables with Worst Case Constant Access Time	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-36494-3_25	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-36494-3_25	en
heal.publicationDate	2003	en
heal.abstract	We generalize Cuckoo Hashing (23) to d-ary Cuckoo Hashing and show how this yields a simple hash table data structure that stores n elements in (1 + ! )n memory cells, for any constant ! > 0. Assuming uniform hashing, accessing or deleting table entries takes at most d = O(ln(1/! )) probes and the expected amortized insertion time is	en
heal.journalName	Symposium on Theoretical Aspects of Computer Science	en
dc.identifier.doi	10.1007/3-540-36494-3_25	en