Anders Aamand

collaborators

4 papers

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.CG2019

Disks in Curves of Bounded Convex Curvature

Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup

We say that a simple, closed curve $γ$ in the plane has bounded convex curvature if for every point $x$ on $γ$ , there is an open unit disk $U_{x}$ and $ε_{x} > 0$ such that $x\…

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 $A$ is a convex body in the plane and that $A_{1}, \dots, A_{n}$ are translates of $A$ . Such translates give rise to an intersection graph of $A$ , $G = (V, E)$ , with vertices $…