Additive Spanners: A Simple Construction. - Mathias Bæk Tejs Knudsen (SWAT, 2014)

On Dynamic and Multi-functional Labeling Schemes. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Noy Rotbart (DISC, 2014)

Improved ancestry labeling scheme for trees. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Noy Rotbart (CoRR, 2014)

Longest Common Extensions in Sublinear Space. - Philip Bille; Inge Li Gørtz; Mathias Bæk Tejs Knudsen; Moshe Lewenstein; Hjalte Wedel Vildhøj (CPM, 2015)

Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence. - Mathias Bæk Tejs Knudsen; Morten Stöckel (ESA, 2015)

Hashing for Statistics over K-Partitions. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Eva Rotenberg; Mikkel Thorup (FOCS, 2015)

A Simple and Optimal Ancestry Labeling Scheme for Trees. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Noy Rotbart (ICALP (2), 2015)

Sublinear distance labeling for sparse graphs. - Stephen Alstrup; Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Ely Porat (CoRR, 2015)

Sublinear Distance Labeling. - Stephen Alstrup; Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Ely Porat (ESA, 2016)

The Power of Two Choices with Simple Tabulation. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Eva Rotenberg; Mikkel Thorup (SODA, 2016)

Maximal Unbordered Factors of Random Strings. - Patrick Hagge Cording; Mathias Bæk Tejs Knudsen (SPIRE, 2016)

Fast Similarity Sketching. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Mikkel Thorup (FOCS, 2017)

Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. - Mikkel Abrahamsen; Stephen Alstrup; Jacob Holm; Mathias Bæk Tejs Knudsen; Morten Stöckel (ICALP, 2017)

Additive Spanners and Distance Oracles in Quadratic Time. - Mathias Bæk Tejs Knudsen (ICALP, 2017)

Practical Hash Functions for Similarity Estimation and Dimensionality Reduction. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Mikkel Thorup (NIPS, 2017)

Finding even cycles faster via capped k-walks. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Morten Stöckel (STOC, 2017)

New Subquadratic Approximation Algorithms for the Girth. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Morten Stöckel (CoRR, 2017)

Optimal Induced Universal Graphs and Adjacency Labeling for Trees. - Stephen Alstrup; Søren Dahlgaard; Mathias Bæk Tejs Knudsen (J. ACM, 2017)

Power of d Choices with Simple Tabulation. - Anders Aamand; Mathias Bæk Tejs Knudsen; Mikkel Thorup (ICALP, 2018)

The Entropy of Backwards Analysis. - Mathias Bæk Tejs Knudsen; Mikkel Thorup (SODA, 2018)

Linear Hashing Is Awesome. - Mathias Bæk Tejs Knudsen (SIAM J. Comput., 2019)

Fast hashing with strong concentration bounds. - Anders Aamand; Jakob Bæk Tejs Knudsen; Mathias Bæk Tejs Knudsen; Peter Michael Reichstein Rasmussen; Mikkel Thorup (STOC, 2020)

Near-optimal induced universal graphs for cycles and paths. - Mikkel Abrahamsen; Stephen Alstrup; Jacob Holm; Mathias Bæk Tejs Knudsen; Morten Stöckel (Discret. Appl. Math., 2020)

Maximal unbordered factors of random strings. - Patrick Hagge Cording; Travis Gagie; Mathias Bæk Tejs Knudsen; Tomasz Kociumaka (Theor. Comput. Sci., 2021)