Sledovat
Søren Dahlgaard
Søren Dahlgaard
Co-founder of AI start-up SupWiz
E-mailová adresa ověřena na: supwiz.com - Domovská stránka
Název
Citace
Citace
Rok
Popular conjectures as a barrier for dynamic planar graph algorithms
A Abboud, S Dahlgaard
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
812016
On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter
S Dahlgaard
The 43rd International Colloquium on Automata, Languages and Programming …, 2016
672016
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
582017
Fast similarity sketching
S Dahlgaard, MBT Knudsen, M Thorup
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
472017
Fast and compact exact distance oracle for planar graphs
V Cohen-Addad, S Dahlgaard, C Wulff-Nilsen
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
402017
Practical hash functions for similarity estimation and dimensionality reduction
S Dahlgaard, M Knudsen, M Thorup
Advances in Neural Information Processing Systems 30, 2017
402017
Sublinear distance labeling
S Alstrup, S Dahlgaard, MBT Knudsen, E Porat
arXiv preprint arXiv:1507.02618, 2015
35*2015
Constructing light spanners deterministically in near-linear time
S Alstrup, S Dahlgaard, A Filtser, M Stöckel, C Wulff-Nilsen
Theoretical Computer Science 907, 82-112, 2022
302022
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
302017
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
302015
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
192016
Approximately minwise independence with twisted tabulation
S Dahlgaard, M Thorup
Scandinavian Workshop on Algorithm Theory, 134-145, 2014
182014
Tight hardness results for distance and centrality problems in constant degree graphs
S Dahlgaard, J Evald
arXiv preprint arXiv:1609.08403, 2016
172016
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
72015
New subquadratic approximation algorithms for the girth
S Dahlgaard, MBT Knudsen, M Stöckel
arXiv preprint arXiv:1704.02178, 2017
62017
Nearest neighbor classification using bottom-k sketches
S Dahlgaard, C Igel, M Thorup
2013 IEEE International Conference on Big Data, 28-34, 2013
62013
Dynamic and multi-functional labeling schemes
S Dahlgaard, MBT Knudsen, N Rotbart
International Symposium on Algorithms and Computation, 141-153, 2014
5*2014
Tabulation Hashing for Large-scale Data Processing
S Dahlgaard
University of Copenhagen, Faculty of Science [Department of Computer Science], 2017
2017
24th Annual European Symposium on Algorithms (ESA 2016)
L Georgiadis, GF Italiano, N Parotsidis, O Svensson, M Abolhassani, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2016
2016
3.8 Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms
S Dahlgaard
Structure and Hardness in P, 9, 0
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20