default search action
Mathias Bæk Tejs Knudsen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j4]Patrick Hagge Cording, Travis Gagie
, Mathias Bæk Tejs Knudsen, Tomasz Kociumaka
Maximal unbordered factors of random strings. Theor. Comput. Sci. 852: 78-83 (2021) - 2020
- [j3]Mikkel Abrahamsen
Near-optimal induced universal graphs for cycles and paths. Discret. Appl. Math. 282: 1-13 (2020) - [c20]Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen
Fast hashing with strong concentration bounds. STOC 2020: 1265-1278
2010 – 2019
- 2019
- [j2]Mathias Bæk Tejs Knudsen
Linear Hashing Is Awesome. SIAM J. Comput. 48(2): 736-741 (2019) - [i20]Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup:
Fast hashing with Strong Concentration Bounds. CoRR abs/1905.00369 (2019) - 2018
- [c19]Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup
Power of d Choices with Simple Tabulation. ICALP 2018: 5:1-5:14 - [c18]Mathias Bæk Tejs Knudsen, Mikkel Thorup
The Entropy of Backwards Analysis. SODA 2018: 867-880 - [i19]Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Power of d Choices with Simple Tabulation. CoRR abs/1804.09684 (2018) - 2017
- [j1]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen:
Optimal Induced Universal Graphs and Adjacency Labeling for Trees. J. ACM 64(4): 27:1-27:22 (2017) - [c17]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup
Fast Similarity Sketching. FOCS 2017: 663-671 - [c16]Mathias Bæk Tejs Knudsen:
Additive Spanners and Distance Oracles in Quadratic Time. ICALP 2017: 64:1-64:12 - [c15]Mikkel Abrahamsen
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. ICALP 2017: 128:1-128:14 - [c14]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Practical Hash Functions for Similarity Estimation and Dimensionality Reduction. NIPS 2017: 6615-6625 - [c13]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Finding even cycles faster via capped k-walks. STOC 2017: 112-120 - [i18]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Finding Even Cycles Faster via Capped k-Walks. CoRR abs/1703.10380 (2017) - [i17]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel:
New Subquadratic Approximation Algorithms for the Girth. CoRR abs/1704.02178 (2017) - [i16]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Fast Similarity Sketching. CoRR abs/1704.04370 (2017) - [i15]Patrick Hagge Cording, Mathias Bæk Tejs Knudsen:
Maximal Unbordered Factors of Random Strings. CoRR abs/1704.04472 (2017) - [i14]Mathias Bæk Tejs Knudsen:
Additive Spanners and Distance Oracles in Quadratic Time. CoRR abs/1704.04473 (2017) - [i13]Mathias Bæk Tejs Knudsen, Mikkel Thorup:
The Entropy of Backwards Analysis. CoRR abs/1704.04509 (2017) - [i12]Mathias Bæk Tejs Knudsen:
Linear Hashing is Awesome. CoRR abs/1706.02783 (2017) - [i11]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Practical Hash Functions for Similarity Estimation and Dimensionality Reduction. CoRR abs/1711.08797 (2017) - 2016
- [c12]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat:
Sublinear Distance Labeling. ESA 2016: 5:1-5:15 - [c11]Mathias Bæk Tejs Knudsen:
Linear Hashing Is Awesome. FOCS 2016: 345-352 - [c10]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg
The Power of Two Choices with Simple Tabulation. SODA 2016: 1631-1642 - [c9]Patrick Hagge Cording, Mathias Bæk Tejs Knudsen:
Maximal Unbordered Factors of Random Strings. SPIRE 2016: 93-96 - [i10]Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. CoRR abs/1607.04911 (2016) - 2015
- [c8]Philip Bille
Longest Common Extensions in Sublinear Space. CPM 2015: 65-76 - [c7]Mathias Bæk Tejs Knudsen, Morten Stöckel:
Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence. ESA 2015: 828-839 - [c6]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg
Hashing for Statistics over K-Partitions. FOCS 2015: 1292-1310 - [c5]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen:
Optimal Induced Universal Graphs and Adjacency Labeling for Trees. FOCS 2015: 1311-1326 - [c4]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart:
A Simple and Optimal Ancestry Labeling Scheme for Trees. ICALP (2) 2015: 564-574 - [i9]Mathias Bæk Tejs Knudsen, Morten Stöckel:
Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence. CoRR abs/1502.05729 (2015) - [i8]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen:
Optimal induced universal graphs and adjacency labeling for trees. CoRR abs/1504.02306 (2015) - [i7]Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj:
Longest Common Extensions in Sublinear Space. CoRR abs/1504.02671 (2015) - [i6]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat:
Sublinear distance labeling for sparse graphs. CoRR abs/1507.02618 (2015) - 2014
- [c3]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart:
Dynamic and Multi-Functional Labeling Schemes. ISAAC 2014: 141-153 - [c2]Mathias Bæk Tejs Knudsen:
Additive Spanners: A Simple Construction. SWAT 2014: 277-281 - [c1]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart:
On Dynamic and Multi-functional Labeling Schemes. DISC 2014: 544-545 - [i5]Mathias Bæk Tejs Knudsen:
Additive Spanners: A Simple Construction. CoRR abs/1403.0178 (2014) - [i4]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart:
Dynamic and Multi-functional Labeling Schemes. CoRR abs/1404.4982 (2014) - [i3]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart:
Improved ancestry labeling scheme for trees. CoRR abs/1407.5011 (2014) - [i2]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup:
The Power of Two Choices with Simple Tabulation. CoRR abs/1407.6846 (2014) - [i1]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup:
Hashing for statistics over k-partitions. CoRR abs/1411.7191 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: