| Optimal induced universal graphs and adjacency labeling for trees S Alstrup, S Dahlgaard, MBT Knudsen Journal of the ACM (JACM) 64 (4), 1-22, 2017 | 58 | 2017 |
| Fast similarity sketching S Dahlgaard, MBT Knudsen, M Thorup 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 48 | 2017 |
| Practical hash functions for similarity estimation and dimensionality reduction S Dahlgaard, M Knudsen, M Thorup Advances in Neural Information Processing Systems 30, 2017 | 41 | 2017 |
| Additive spanners: A simple construction MBT Knudsen Scandinavian Workshop on Algorithm Theory, 277-281, 2014 | 37 | 2014 |
| Finding even cycles faster via capped k-walks S Dahlgaard, MBT Knudsen, M Stöckel Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 33 | 2017 |
| Longest common extensions in sublinear space P Bille, IL Gørtz, MBT Knudsen, M Lewenstein, HW Vildhøj Annual Symposium on Combinatorial Pattern Matching, 65-76, 2015 | 32 | 2015 |
| Hashing for statistics over k-partitions S Dahlgaard, MBT Knudsen, E Rotenberg, M Thorup 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1292-1310, 2015 | 31 | 2015 |
| Sublinear distance labeling S Alstrup, S Dahlgaard, MBT Knudsen, E Porat arXiv preprint arXiv:1507.02618, 2015 | 30 | 2015 |
| Additive spanners and distance oracles in quadratic time MBT Knudsen arXiv preprint arXiv:1704.04473, 2017 | 21 | 2017 |
| The power of two choices with simple tabulation S Dahlgaard, MBT Knudsen, E Rotenberg, M Thorup Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 19 | 2016 |
| Linear hashing is awesome MBT Knudsen 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 10 | 2016 |
| Near-optimal induced universal graphs for bounded degree graphs M Abrahamsen, S Alstrup, J Holm, MBT Knudsen, M Stöckel arXiv preprint arXiv:1607.04911, 2016 | 10 | 2016 |
| Power of Choices with Simple Tabulation A Aamand, MBT Knudsen, M Thorup arXiv preprint arXiv:1804.09684, 2018 | 9 | 2018 |
| Fast hashing with strong concentration bounds A Aamand, JBT Knudsen, MBT Knudsen, PMR Rasmussen, M Thorup Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 8 | 2020 |
| Maximal unbordered factors of random strings PH Cording, MBT Knudsen International Symposium on String Processing and Information Retrieval, 93-96, 2016 | 8* | 2016 |
| A simple and optimal ancestry labeling scheme for trees S Dahlgaard, MBT Knudsen, N Rotbart International Colloquium on Automata, Languages, and Programming, 564-574, 2015 | 7 | 2015 |
| New subquadratic approximation algorithms for the girth S Dahlgaard, MBT Knudsen, M Stöckel arXiv preprint arXiv:1704.02178, 2017 | 6 | 2017 |
| Near-optimal induced universal graphs for cycles and paths M Abrahamsen, S Alstrup, J Holm, MBT Knudsen, M Stöckel Discrete Applied Mathematics 282, 1-13, 2020 | 5 | 2020 |
| Sublinear distance labeling for sparse graphs S Alstrup, S Dahlgaard, MBT Knudsen, E Porat CoRR, abs/1507.02618, 2015 | 5 | 2015 |
| Dynamic and multi-functional labeling schemes S Dahlgaard, MBT Knudsen, N Rotbart International Symposium on Algorithms and Computation, 141-153, 2014 | 5 | 2014 |
Søren DahlgaardCo-founder of AI start-up SupWizVerificeret mail på supwiz.com
