Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
No Repetition: Fast Streaming with Highly Concentrated Hashing
Anders Aamand, Debarati Das, Evangelos Kipouridis +3
To get estimators that work within a certain error bound with high probability, a common strategy is to design one that works with constant probability, and then boost the probabil…
cs.DS2019
Fast hashing with Strong Concentration Bounds
Anders Aamand, Jakob B. T. Knudsen, Mathias B. T. Knudsen +2
Previous work on tabulation hashing by Patrascu and Thorup from STOC'11 on simple tabulation and from SODA'13 on twisted tabulation offered Chernoff-style concentration bounds on h…