Mathias Bæk Tejs Knudsen

Tomasz Kociumaka

Theor. Comput. Sci., 2021

2020

Near-optimal induced universal graphs for cycles and paths.

[BibT_eX]

[DOI]

Mikkel Abrahamsen

Jacob Holm

Discret. Appl. Math., 2020

Fast hashing with strong concentration bounds.

[BibT_eX]

[DOI]

Anders Aamand

Jakob Bæk Tejs Knudsen

Peter Michael Reichstein Rasmussen

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019

Linear Hashing Is Awesome.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

2018

The Entropy of Backwards Analysis.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Power of d Choices with Simple Tabulation.

[BibT_eX]

[DOI]

Anders Aamand

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Optimal Induced Universal Graphs and Adjacency Labeling for Trees.

[BibT_eX]

[DOI]

J. ACM, 2017

New Subquadratic Approximation Algorithms for the Girth.

[BibT_eX]

[DOI]

CoRR, 2017

Finding even cycles faster via capped k-walks.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Practical Hash Functions for Similarity Estimation and Dimensionality Reduction.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Additive Spanners and Distance Oracles in Quadratic Time.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Near-Optimal Induced Universal Graphs for Bounded Degree Graphs.

[BibT_eX]

[DOI]

Mikkel Abrahamsen

Jacob Holm

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Fast Similarity Sketching.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Maximal Unbordered Factors of Random Strings.

[BibT_eX]

[DOI]

Patrick Hagge Cording

Proceedings of the String Processing and Information Retrieval, 2016

The Power of Two Choices with Simple Tabulation.

[BibT_eX]

[DOI]

Eva Rotenberg

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Sublinear Distance Labeling.

[BibT_eX]

[DOI]

Ely Porat

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Sublinear distance labeling for sparse graphs.

[BibT_eX]

[DOI]

Ely Porat

CoRR, 2015

A Simple and Optimal Ancestry Labeling Scheme for Trees.

[BibT_eX]

[DOI]

Noy Rotbart

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Hashing for Statistics over K-Partitions.

[BibT_eX]

[DOI]

Eva Rotenberg

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

Longest Common Extensions in Sublinear Space.

[BibT_eX]

[DOI]

Philip Bille

Inge Li Gørtz

Moshe Lewenstein

Hjalte Wedel Vildhøj

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

Improved ancestry labeling scheme for trees.

[BibT_eX]

[DOI]

Noy Rotbart

CoRR, 2014

On Dynamic and Multi-functional Labeling Schemes.

[BibT_eX]

[DOI]

Noy Rotbart

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Additive Spanners: A Simple Construction.

[BibT_eX]

[DOI]