1. Arbitman, Y., Naor, M., Segev, G.: De-amortized cuckoo hashing: Provable worst-case performance and experimental results. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I, ICALP ’09, pp. 107–118 (2009)
2. Aumüller, M., Dietzfelbinger, M., Woelfel, P.: A Simple hash class with strong randomness properties in graphs and hypergraphs. ArXiv e-prints (2016)
3. Cain, J.A., Sanders, P., Wormald, N.: The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation. In: Proceedings of the 18th annual ACM-SIAM symposium on Discrete algorithms (SODA 2007), pp. 469–476 (2007)
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009). ISBN 0262033844, 9780262033848
5. Czumaj, A., Stemann, V.: Randomized allocation processes. Random Struct. Algorithms 18(4), 297–331 (2001)