research
∙
11/17/2021
Optimal Decremental Connectivity in Non-Sparse Graphs
We present a dynamic algorithm for maintaining the connected and 2-edge-...
share
research
∙
11/22/2020
Tiling with Squares and Packing Dominos in Polynomial Time
We consider planar tiling and packing problems with polyomino pieces and...
research
∙
07/25/2020
Support of Closed Walks and Second Eigenvalue Multiplicity of the Normalized Adjacency Matrix
We show that the multiplicity of the second normalized adjacency matrix ...
research
∙
04/02/2020
No Repetition: Fast Streaming with Highly Concentrated Hashing
To get estimators that work within a certain error bound with high proba...
research
∙
05/01/2019
Fast hashing with Strong Concentration Bounds
Previous work on tabulation hashing of Pǎtraşcu and Thorup from STOC'11 ...
research
∙
09/28/2018
