Søren Dahlgaard

most citedPractical Hash Functions for Similarity Estimation and Dimensionality Reduction

10 citations · 12 across the 2 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2017★ 2 cited

Finding Even Cycles Faster via Capped k-Walks

Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel

In this paper, we consider the problem of finding a cycle of length $2 k$ (a $C_{2 k}$ ) in an undirected graph $G$ with $n$ nodes and $m$ edges for constant $k \geq 2$ . A classic result…

cs.DS2016

Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms

Amir Abboud, Søren Dahlgaard

The dynamic shortest paths problem on planar graphs asks us to preprocess a planar graph $G$ such that we may support insertions and deletions of edges in $G$ as well as distance q…