Mathias Bæk Tejs Knudsen

44 papers A* 11A 3B 2C 1Journal 24Unranked 3

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Maximal unbordered factors of random strings. Theor. Comput. Sci. Patrick Hagge Cording, Travis Gagie, Mathias Bæk Tejs Knudsen, Tomasz Kociumaka
2020	A*	`conf`	Fast hashing with strong concentration bounds. STOC Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen, Mikkel Thorup
2020	J	`jnl`	Near-optimal induced universal graphs for cycles and paths. Discret. Appl. Math. Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel
2019	J	`jnl`	Fast hashing with Strong Concentration Bounds. CoRR Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup
2019	J	`jnl`	Linear Hashing Is Awesome. SIAM J. Comput. Mathias Bæk Tejs Knudsen
2018	A*	`conf`	Power of d Choices with Simple Tabulation. ICALP Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup
2018	J	`jnl`	Power of d Choices with Simple Tabulation. CoRR Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup
2018	A*	`conf`	The Entropy of Backwards Analysis. SODA Mathias Bæk Tejs Knudsen, Mikkel Thorup
2017	A*	`conf`	Additive Spanners and Distance Oracles in Quadratic Time. ICALP Mathias Bæk Tejs Knudsen
2017	J	`jnl`	Additive Spanners and Distance Oracles in Quadratic Time. CoRR Mathias Bæk Tejs Knudsen
2017	A*	`conf`	Fast Similarity Sketching. FOCS Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup
2017	J	`jnl`	Fast Similarity Sketching. CoRR Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup
2017	J	`jnl`	Finding Even Cycles Faster via Capped k-Walks. CoRR Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel
2017	A*	`conf`	Finding even cycles faster via capped k-walks. STOC Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel
2017	J	`jnl`	Linear Hashing is Awesome. CoRR Mathias Bæk Tejs Knudsen
2017	J	`jnl`	Maximal Unbordered Factors of Random Strings. CoRR Patrick Hagge Cording, Mathias Bæk Tejs Knudsen
2017	A*	`conf`	Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. ICALP Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel
2017	J	`jnl`	New Subquadratic Approximation Algorithms for the Girth. CoRR Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel
2017	J	`jnl`	Optimal Induced Universal Graphs and Adjacency Labeling for Trees. J. ACM Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen
2017	—	`conf`	Practical Hash Functions for Similarity Estimation and Dimensionality Reduction. NIPS Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup
2017	J	`jnl`	Practical Hash Functions for Similarity Estimation and Dimensionality Reduction. CoRR Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup
2017	J	`jnl`	The Entropy of Backwards Analysis. CoRR Mathias Bæk Tejs Knudsen, Mikkel Thorup
2016	A*	`conf`	Linear Hashing Is Awesome. FOCS Mathias Bæk Tejs Knudsen
2016	C	`conf`	Maximal Unbordered Factors of Random Strings. SPIRE Patrick Hagge Cording, Mathias Bæk Tejs Knudsen
2016	J	`jnl`	Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. CoRR Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel
2016	A	`conf`	Sublinear Distance Labeling. ESA Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat
2016	A*	`conf`	The Power of Two Choices with Simple Tabulation. SODA Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup
2015	—	`conf`	A Simple and Optimal Ancestry Labeling Scheme for Trees. ICALP (2) Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart
2015	A*	`conf`	Hashing for Statistics over K-Partitions. FOCS Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup
2015	B	`conf`	Longest Common Extensions in Sublinear Space. CPM Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj
2015	J	`jnl`	Longest Common Extensions in Sublinear Space. CoRR Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj
2015	A*	`conf`	Optimal Induced Universal Graphs and Adjacency Labeling for Trees. FOCS Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen
2015	J	`jnl`	Optimal induced universal graphs and adjacency labeling for trees. CoRR Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen
2015	A	`conf`	Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence. ESA Mathias Bæk Tejs Knudsen, Morten Stöckel
2015	J	`jnl`	Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence. CoRR Mathias Bæk Tejs Knudsen, Morten Stöckel
2015	J	`jnl`	Sublinear distance labeling for sparse graphs. CoRR Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat
2014	—	`conf`	Additive Spanners: A Simple Construction. SWAT Mathias Bæk Tejs Knudsen
2014	J	`jnl`	Additive Spanners: A Simple Construction. CoRR Mathias Bæk Tejs Knudsen
2014	B	`conf`	Dynamic and Multi-Functional Labeling Schemes. ISAAC Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart
2014	J	`jnl`	Dynamic and Multi-functional Labeling Schemes. CoRR Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart
2014	J	`jnl`	Hashing for statistics over k-partitions. CoRR Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup
2014	J	`jnl`	Improved ancestry labeling scheme for trees. CoRR Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart
2014	A	`conf`	On Dynamic and Multi-functional Labeling Schemes. DISC Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart
2014	J	`jnl`	The Power of Two Choices with Simple Tabulation. CoRR Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup