Show simple item record

dc.contributor.authorFrieze, Alan
dc.date.accessioned2018-05-23T19:16:02Z
dc.date.available2018-05-23T19:16:02Z
dc.date.issued2018-05-15
dc.identifier.urihttp://hdl.handle.net/1853/59712
dc.descriptionPresented as part of the Workshop on Algorithms and Randomness on May 15, 2018 at 9:30 a.m. in the Klaus Advanced Computing Building, Room 1116.en_US
dc.descriptionAlan Frieze is a University Professor in the Department of Mathematical Sciences at Carnegie Mellon University. His main research interest is Probabilistic Combinatorics and its applications in Theoretical Computer Science and Operations Research.en_US
dc.descriptionRuntime: 32:36 minutesen_US
dc.description.abstractWe 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 Pettien_US
dc.format.extent32:36 minutes
dc.language.isoen_USen_US
dc.relation.ispartofseriesWorkshop on Algorithms and Randomness 2018en_US
dc.titleInsertion time of random walk cuckoo hashingen_US
dc.typeLectureen_US
dc.typeVideoen_US
dc.contributor.corporatenameGeorgia Institute of Technology. Algorithms, Randomness and Complexity Centeren_US
dc.contributor.corporatenameCarnegie-Mellon University. Dept. of Mathematical Sciencesen_US


Files in this item

This item appears in the following Collection(s)

  • ARC Talks and Events [84]
    Distinguished lectures, colloquia, seminars and speakers of interest to the ARC community

Show simple item record