default search action
Søren Dahlgaard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j2]Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:
Constructing light spanners deterministically in near-linear time. Theor. Comput. Sci. 907: 82-112 (2022)
2010 – 2019
- 2019
- [c16]Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:
Constructing Light Spanners Deterministically in Near-Linear Time. ESA 2019: 4:1-4:15 - 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) - [c15]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Fast Similarity Sketching. FOCS 2017: 663-671 - [c14]Vincent Cohen-Addad, Søren Dahlgaard, Christian Wulff-Nilsen:
Fast and Compact Exact Distance Oracle for Planar Graphs. FOCS 2017: 962-973 - [c13]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Practical Hash Functions for Similarity Estimation and Dimensionality Reduction. NIPS 2017: 6615-6625 - [c12]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Finding even cycles faster via capped k-walks. STOC 2017: 112-120 - [i16]Vincent Cohen-Addad, Søren Dahlgaard, Christian Wulff-Nilsen:
Fast and Compact Exact Distance Oracle for Planar Graphs. CoRR abs/1702.03259 (2017) - [i15]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Finding Even Cycles Faster via Capped k-Walks. CoRR abs/1703.10380 (2017) - [i14]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel:
New Subquadratic Approximation Algorithms for the Girth. CoRR abs/1704.02178 (2017) - [i13]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Fast Similarity Sketching. CoRR abs/1704.04370 (2017) - [i12]Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:
Constructing Light Spanners Deterministically in Near-Linear Time. CoRR abs/1709.01960 (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
- [c11]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat:
Sublinear Distance Labeling. ESA 2016: 5:1-5:15 - [c10]Amir Abboud, Søren Dahlgaard:
Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms. FOCS 2016: 477-486 - [c9]Søren Dahlgaard:
On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter. ICALP 2016: 48:1-48:14 - [c8]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup:
The Power of Two Choices with Simple Tabulation. SODA 2016: 1631-1642 - [i10]Søren Dahlgaard:
On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter. CoRR abs/1602.06705 (2016) - [i9]Amir Abboud, Søren Dahlgaard:
Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms. CoRR abs/1605.03797 (2016) - [i8]Jacob Evald, Søren Dahlgaard:
Tight Hardness Results for Distance and Centrality Problems in Constant Degree Graphs. CoRR abs/1609.08403 (2016) - 2015
- [c7]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup:
Hashing for Statistics over K-Partitions. FOCS 2015: 1292-1310 - [c6]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen:
Optimal Induced Universal Graphs and Adjacency Labeling for Trees. FOCS 2015: 1311-1326 - [c5]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart:
A Simple and Optimal Ancestry Labeling Scheme for Trees. ICALP (2) 2015: 564-574 - [i7]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen:
Optimal induced universal graphs and adjacency labeling for trees. CoRR abs/1504.02306 (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
- [c4]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart:
Dynamic and Multi-Functional Labeling Schemes. ISAAC 2014: 141-153 - [c3]Søren Dahlgaard, Mikkel Thorup:
Approximately Minwise Independence with Twisted Tabulation. SWAT 2014: 134-145 - [c2]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart:
On Dynamic and Multi-functional Labeling Schemes. DISC 2014: 544-545 - [i5]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart:
Dynamic and Multi-functional Labeling Schemes. CoRR abs/1404.4982 (2014) - [i4]Søren Dahlgaard, Mikkel Thorup:
Approximately Minwise Independence with Twisted Tabulation. CoRR abs/1404.6724 (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) - 2013
- [c1]Søren Dahlgaard, Christian Igel, Mikkel Thorup:
Nearest neighbor classification using bottom-k sketches. IEEE BigData 2013: 28-34
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:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint