( en | de | ru )

 

Disambiguation of "Dahlgaard, Søren"

Author of the publication

copydeleteadd this publication to your clipboard
Constructing light spanners deterministically in near-linear time.

, , , , and . Theor. Comput. Sci., (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Carl-Fredrik Sørensen

Pernille Sørensen

Jørgen Skov Sørensen

Knut Dahlgaard

Søren Jepsen

 

Other publications of authors with the same name

Tight Hardness Results for Distance and Centrality Problems in Constant Degree Graphs., and . CoRR, (2016)A Simple and Optimal Ancestry Labeling Scheme for Trees., , and . ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 564-574. Springer, (2015)Constructing Light Spanners Deterministically in Near-Linear Time., , , , and . CoRR, (2017)Approximately Minwise Independence with Twisted Tabulation., and . SWAT, volume 8503 of Lecture Notes in Computer Science, page 134-145. Springer, (2014)On Dynamic and Multi-functional Labeling Schemes., , and . DISC, volume 8784 of Lecture Notes in Computer Science, page 544-545. Springer, (2014)Practical Hash Functions for Similarity Estimation and Dimensionality Reduction., , and . NIPS, page 6615-6625. (2017)On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter.. ICALP, volume 55 of LIPIcs, page 48:1-48:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Hashing for statistics over k-partitions., , , and . CoRR, (2014)Sublinear distance labeling for sparse graphs., , , and . CoRR, (2015)Constructing Light Spanners Deterministically in Near-Linear Time., , , , and . ESA, volume 144 of LIPIcs, page 4:1-4:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)