4 papers
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…
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…
Classifying Convex Bodies by their Contact and Intersection Graphs
Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen +1
Suppose that is a convex body in the plane and that are translates of . Such translates give rise to an intersection graph of , , with vertices $…
On a Conjecture on the Representation of Positive Integers as the Sum of Three Terms of the Sequence
Sebastian Tim Holdum, Frederik Ravn Klausen, Peter Michael Reichstein Rasmussen
We prove some cases of a conjecture by Farhi on the representation of every positive integer as the sum of three terms of the sequence . Th…