2 citations · 6 across the 7 of their papers we have counts for
11 papers
Powers in prime bases and a problem on central binomial coefficients
Sebastian Tim Holdum, Frederik Ravn Klausen, Peter Michael Reichstein Rasmussen
It is an open problem whether is divisible by 4 or 9 for all . In connection with this, we prove that for a fixed uneven the asymptotic density of '…
Optimal Decremental Connectivity in Non-Sparse Graphs
Anders Aaman, Adam Karczmarz, Jakub Łącki +3
We present a dynamic algorithm for maintaining the connected and 2-edge-connected components in an undirected graph subject to edge deletions. The algorithm is Monte-Carlo randomiz…
Tiling with Squares and Packing Dominos in Polynomial Time
Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle +1
A polyomino is a polygonal region with axis parallel edges and corners of integral coordinates, which may have holes. In this paper, we consider planar tiling and packing problems…
Support of Closed Walks and Second Eigenvalue Multiplicity of the Normalized Adjacency Matrix
Theo McKenzie, Peter M. R. Rasmussen, Nikhil Srivastava
We show that the multiplicity of the second normalized adjacency matrix eigenvalue of any connected graph of maximum degree is bounded by for an…
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…