Title:
Insertion time of random walk cuckoo hashing
Insertion time of random walk cuckoo hashing
No Thumbnail Available
Author(s)
Frieze, Alan
Advisor(s)
Editor(s)
Collections
Supplementary to
Permanent Link
Abstract
We consider the expected insertion time of Cuckoo Hashing when clashes are resolved randomly. We prove O(1) expected time insertion in two cases:
(i) d choices of location and location capacity one: joint with Tony Johansson.
(ii) 2 choices of location and location capacity d: joint with Samantha Petti
Sponsor
Date Issued
2018-05-15
Extent
32:36 minutes
Resource Type
Moving Image
Resource Subtype
Lecture