论文信息 - On the insertion time of random walk cuckoo hashing - 字舞流文

On the insertion time of random walk cuckoo hashing

Presented 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.

Alan Frieze | Tony Johansson | A. Frieze | T. Johansson

[1] Henry Lin,et al. Online Bipartite Perfect Matching With Augmentations , 2009, IEEE INFOCOM 2009.

[2] Rasmus Pagh,et al. Cuckoo Hashing , 2001, Encyclopedia of Algorithms.

[3] Amit Kumar,et al. Maintaining Assignments Online: Matching, Scheduling, and Flows , 2014, SODA.

[4] Kai-Min Chung,et al. Why simple hash functions work: exploiting the entropy in a data stream , 2008, SODA '08.

[5] Alan M. Frieze,et al. Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables , 2009, Random Struct. Algorithms.

[6] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .

[7] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

[8] Michael Mitzenmacher,et al. Some Open Questions Related to Cuckoo Hashing , 2009, ESA.

[9] Dariusz Leniowski,et al. Online Bipartite Matching in Offline Time , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[10] Paul G. Spirakis,et al. Space Efficient Hash Tables with Worst Case Constant Access Time , 2003, Theory of Computing Systems.

[11] Megha Khosla,et al. Balls into Bins Made Faster , 2013, ESA.

[12] Alan M. Frieze,et al. An Analysis of Random-Walk Cuckoo Hashing , 2009, APPROX-RANDOM.

[13] Konstantinos Panagiotou,et al. On the Insertion Time of Cuckoo Hashing , 2010, SIAM J. Comput..