Morten Stöckel

activity

20122017

most citedFinding Even Cycles Faster via Capped k-Walks

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

collaborators

3 papers

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

Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence

Mathias Bæk Tejs Knudsen, Morten Stöckel

Randomized algorithms and data structures are often analyzed under the assumption of access to a perfect source of randomness. The most fundamental metric used to measure how "rand…

cs.CC2012

The Hardness of the Functional Orientation 2-Color Problem

Søren Bøg, Morten Stöckel, Hjalte Wedel Vildhøj

We consider the Functional Orientation 2-Color problem, which was introduced by Valiant in his seminal paper on holographic algorithms [SIAM J. Comput., 37(5), 2008]. For this deci…