activity
20192021
collaborators

5 papers

math.PR2021

On Sums of Monotone Random Integer Variables

Anders Aamand, Noga Alon, Jakob Bæk Tejs Knudsen +1

We say that a random integer variable is monotone if the modulus of the characteristic function of is decreasing on . This is the case for many commonly encountered…

cs.DS2021

Load Balancing with Dynamic Set of Balls and Bins

Anders Aamand, Jakob Bæk Tejs Knudsen, Mikkel Thorup

In dynamic load balancing, we wish to distribute balls into bins in an environment where both balls and bins can be added and removed. We want to minimize the maximum load of any b…

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…

cs.CG2019

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 $…