E-LIB Suche - Ergebnisse für: Dahlgaard, Søren

1

Constructing light spanners deterministically in near-linea..:

Alstrup, Stephen ; Dahlgaard, Søren ; Filtser, Arnold..
Theoretical Computer Science. 907 (2022) - p. 82-112 , 2022

Link: https://doi.org/10.1016/..

2

Finding even cycles faster via capped k-walks:

, In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing,

Dahlgaard, Søren ; Knudsen, Mathias Bæk Tejs ; Stöckel, Morten - p. 112-120 , 2017

Link: https://dl.acm.org/doi/1..

3

Optimal Induced Universal Graphs and Adjacency Labeling for..:

Alstrup, Stephen ; Dahlgaard, Søren ; Knudsen, Mathias Bæk Tejs
Journal of the ACM. 64 (2017) 4 - p. 1-22 , 2017

Link: https://doi.org/10.1145/..

4

Optimal Induced Universal Graphs and Adjacency Labeling for..:

Alstrup, Stephen ; Dahlgaard, Søren ; Knudsen, Mathias Bæk Tejs
Journal of the ACM (JACM). 64 (2017) 4 - p. 1-22 , 2017

Link: https://dl.acm.org/doi/1..

5

The power of two choices with simple tabulation:

, In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms,

Dahlgaard, Søren ; Knudsen, Mathias Bæk Tejs ; Rotenberg, Eva. - p. 1631-1642 , 2016

Link: https://dl.acm.org/doi/1..

6

Nearest neighbor classification using bottom-k sketches:

, In: 2013 IEEE International Conference on Big Data,

Dahlgaard, Soren ; Igel, Christian ; Thorup, Mikkel - p. 28-34 , 2013

Link: https://doi.org/10.1109/..

7

Practical Hash Functions for Similarity Estimation and Dime..:

Dahlgaard, Søren ; Knudsen, Mathias Bæk Tejs ; Thorup, Mikkel
http://arxiv.org/abs/1711.08797. , 2017

Link: http://arxiv.org/abs/171..

8

Fast and Compact Exact Distance Oracle for Planar Graphs:

Cohen-Addad, Vincent ; Dahlgaard, Søren ; Wulff-Nilsen, Christian
http://arxiv.org/abs/1702.03259. , 2017

Link: http://arxiv.org/abs/170..

9

Constructing Light Spanners Deterministically in Near-Linea..:

Alstrup, Stephen ; Dahlgaard, Søren ; Filtser, Arnold..
http://arxiv.org/abs/1709.01960. , 2017

Link: http://arxiv.org/abs/170..

10

Finding Even Cycles Faster via Capped k-Walks:

Dahlgaard, Søren ; Knudsen, Mathias Bæk Tejs ; Stöckel, Morten
http://arxiv.org/abs/1703.10380. , 2017

Link: http://arxiv.org/abs/170..

11

Fast Similarity Sketching:

Dahlgaard, Søren ; Knudsen, Mathias Bæk Tejs ; Thorup, Mikkel
http://arxiv.org/abs/1704.04370. , 2017

Link: http://arxiv.org/abs/170..

12

New Subquadratic Approximation Algorithms for the Girth:

Dahlgaard, Søren ; Knudsen, Mathias Bæk Tejs ; Stöckel, Morten
http://arxiv.org/abs/1704.02178. , 2017

Link: http://arxiv.org/abs/170..

13

On the Hardness of Partially Dynamic Graph Problems and Con..:

Dahlgaard, Søren
http://arxiv.org/abs/1602.06705. , 2016

Link: http://arxiv.org/abs/160..

14

Popular Conjectures as a Barrier for Dynamic Planar Graph A..:

Abboud, Amir ; Dahlgaard, Søren
http://arxiv.org/abs/1605.03797. , 2016

Link: http://arxiv.org/abs/160..

15

Tight Hardness Results for Distance and Centrality Problems..:

Dahlgaard, Søren ; Evald, Jacob
http://arxiv.org/abs/1609.08403. , 2016

Link: http://arxiv.org/abs/160..