Fast hashing with strong concentration bounds

Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen, Mikkel Thorup. Fast hashing with strong concentration bounds. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath 0001, Julia Chuzhoy, editors, Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020. pages 1265-1278, ACM, 2020. [doi]

Authors

Anders Aamand

This author has not been identified. Look up 'Anders Aamand' in Google

Jakob Bæk Tejs Knudsen

This author has not been identified. Look up 'Jakob Bæk Tejs Knudsen' in Google

Mathias Bæk Tejs Knudsen

This author has not been identified. Look up 'Mathias Bæk Tejs Knudsen' in Google

Peter Michael Reichstein Rasmussen

This author has not been identified. Look up 'Peter Michael Reichstein Rasmussen' in Google

Mikkel Thorup

This author has not been identified. Look up 'Mikkel Thorup' in Google