10 citations · 12 across the 2 of their papers we have counts for
3 papers
stat.ML2017★ 10 cited
Practical Hash Functions for Similarity Estimation and Dimensionality Reduction
Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup
Hashing is a basic tool for dimensionality reduction employed in several aspects of machine learning. However, the perfomance analysis is often carried out under the abstract assum…
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 (a ) in an undirected graph with nodes and edges for constant . 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 such that we may support insertions and deletions of edges in as well as distance q…