BibTeX records: Søren Dahlgaard

download as .bib file

@article{DBLP:journals/tcs/AlstrupDFSW22,
  author       = {Stephen Alstrup and
                  S{\o}ren Dahlgaard and
                  Arnold Filtser and
                  Morten St{\"{o}}ckel and
                  Christian Wulff{-}Nilsen},
  title        = {Constructing light spanners deterministically in near-linear time},
  journal      = {Theor. Comput. Sci.},
  volume       = {907},
  pages        = {82--112},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2022.01.021},
  doi          = {10.1016/J.TCS.2022.01.021},
  timestamp    = {Tue, 01 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AlstrupDFSW22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AlstrupDFSW19,
  author       = {Stephen Alstrup and
                  S{\o}ren Dahlgaard and
                  Arnold Filtser and
                  Morten St{\"{o}}ckel and
                  Christian Wulff{-}Nilsen},
  editor       = {Michael A. Bender and
                  Ola Svensson and
                  Grzegorz Herman},
  title        = {Constructing Light Spanners Deterministically in Near-Linear Time},
  booktitle    = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
                  9-11, 2019, Munich/Garching, Germany},
  series       = {LIPIcs},
  volume       = {144},
  pages        = {4:1--4:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2019.4},
  doi          = {10.4230/LIPICS.ESA.2019.4},
  timestamp    = {Sun, 08 Sep 2019 01:20:11 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/AlstrupDFSW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlstrupDK17,
  author       = {Stephen Alstrup and
                  S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen},
  title        = {Optimal Induced Universal Graphs and Adjacency Labeling for Trees},
  journal      = {J. {ACM}},
  volume       = {64},
  number       = {4},
  pages        = {27:1--27:22},
  year         = {2017},
  url          = {https://doi.org/10.1145/3088513},
  doi          = {10.1145/3088513},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/AlstrupDK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DahlgaardKT17,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Mikkel Thorup},
  editor       = {Chris Umans},
  title        = {Fast Similarity Sketching},
  booktitle    = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2017, Berkeley, CA, USA, October 15-17, 2017},
  pages        = {663--671},
  publisher    = {{IEEE} Computer Society},
  year         = {2017},
  url          = {https://doi.org/10.1109/FOCS.2017.67},
  doi          = {10.1109/FOCS.2017.67},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/DahlgaardKT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadDW17,
  author       = {Vincent Cohen{-}Addad and
                  S{\o}ren Dahlgaard and
                  Christian Wulff{-}Nilsen},
  editor       = {Chris Umans},
  title        = {Fast and Compact Exact Distance Oracle for Planar Graphs},
  booktitle    = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2017, Berkeley, CA, USA, October 15-17, 2017},
  pages        = {962--973},
  publisher    = {{IEEE} Computer Society},
  year         = {2017},
  url          = {https://doi.org/10.1109/FOCS.2017.93},
  doi          = {10.1109/FOCS.2017.93},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Cohen-AddadDW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/DahlgaardKT17,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Mikkel Thorup},
  editor       = {Isabelle Guyon and
                  Ulrike von Luxburg and
                  Samy Bengio and
                  Hanna M. Wallach and
                  Rob Fergus and
                  S. V. N. Vishwanathan and
                  Roman Garnett},
  title        = {Practical Hash Functions for Similarity Estimation and Dimensionality
                  Reduction},
  booktitle    = {Advances in Neural Information Processing Systems 30: Annual Conference
                  on Neural Information Processing Systems 2017, December 4-9, 2017,
                  Long Beach, CA, {USA}},
  pages        = {6615--6625},
  year         = {2017},
  url          = {https://proceedings.neurips.cc/paper/2017/hash/62dad6e273d32235ae02b7d321578ee8-Abstract.html},
  timestamp    = {Thu, 21 Jan 2021 13:58:27 +0100},
  biburl       = {https://dblp.org/rec/conf/nips/DahlgaardKT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DahlgaardKS17,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Morten St{\"{o}}ckel},
  editor       = {Hamed Hatami and
                  Pierre McKenzie and
                  Valerie King},
  title        = {Finding even cycles faster via capped k-walks},
  booktitle    = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages        = {112--120},
  publisher    = {{ACM}},
  year         = {2017},
  url          = {https://doi.org/10.1145/3055399.3055459},
  doi          = {10.1145/3055399.3055459},
  timestamp    = {Sun, 02 Jun 2019 21:10:31 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/DahlgaardKS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Cohen-AddadDW17,
  author       = {Vincent Cohen{-}Addad and
                  S{\o}ren Dahlgaard and
                  Christian Wulff{-}Nilsen},
  title        = {Fast and Compact Exact Distance Oracle for Planar Graphs},
  journal      = {CoRR},
  volume       = {abs/1702.03259},
  year         = {2017},
  url          = {http://arxiv.org/abs/1702.03259},
  eprinttype    = {arXiv},
  eprint       = {1702.03259},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Cohen-AddadDW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DahlgaardKS17,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Morten St{\"{o}}ckel},
  title        = {Finding Even Cycles Faster via Capped k-Walks},
  journal      = {CoRR},
  volume       = {abs/1703.10380},
  year         = {2017},
  url          = {http://arxiv.org/abs/1703.10380},
  eprinttype    = {arXiv},
  eprint       = {1703.10380},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DahlgaardKS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DahlgaardKS17a,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Morten St{\"{o}}ckel},
  title        = {New Subquadratic Approximation Algorithms for the Girth},
  journal      = {CoRR},
  volume       = {abs/1704.02178},
  year         = {2017},
  url          = {http://arxiv.org/abs/1704.02178},
  eprinttype    = {arXiv},
  eprint       = {1704.02178},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DahlgaardKS17a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DahlgaardKT17,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Mikkel Thorup},
  title        = {Fast Similarity Sketching},
  journal      = {CoRR},
  volume       = {abs/1704.04370},
  year         = {2017},
  url          = {http://arxiv.org/abs/1704.04370},
  eprinttype    = {arXiv},
  eprint       = {1704.04370},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DahlgaardKT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-01960,
  author       = {Stephen Alstrup and
                  S{\o}ren Dahlgaard and
                  Arnold Filtser and
                  Morten St{\"{o}}ckel and
                  Christian Wulff{-}Nilsen},
  title        = {Constructing Light Spanners Deterministically in Near-Linear Time},
  journal      = {CoRR},
  volume       = {abs/1709.01960},
  year         = {2017},
  url          = {http://arxiv.org/abs/1709.01960},
  eprinttype    = {arXiv},
  eprint       = {1709.01960},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1709-01960.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-08797,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Mikkel Thorup},
  title        = {Practical Hash Functions for Similarity Estimation and Dimensionality
                  Reduction},
  journal      = {CoRR},
  volume       = {abs/1711.08797},
  year         = {2017},
  url          = {http://arxiv.org/abs/1711.08797},
  eprinttype    = {arXiv},
  eprint       = {1711.08797},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1711-08797.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AlstrupDKP16,
  author       = {Stephen Alstrup and
                  S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Ely Porat},
  editor       = {Piotr Sankowski and
                  Christos D. Zaroliagis},
  title        = {Sublinear Distance Labeling},
  booktitle    = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
                  2016, Aarhus, Denmark},
  series       = {LIPIcs},
  volume       = {57},
  pages        = {5:1--5:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2016.5},
  doi          = {10.4230/LIPICS.ESA.2016.5},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/AlstrupDKP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbboudD16,
  author       = {Amir Abboud and
                  S{\o}ren Dahlgaard},
  editor       = {Irit Dinur},
  title        = {Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms},
  booktitle    = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
                  2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
                  {USA}},
  pages        = {477--486},
  publisher    = {{IEEE} Computer Society},
  year         = {2016},
  url          = {https://doi.org/10.1109/FOCS.2016.58},
  doi          = {10.1109/FOCS.2016.58},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AbboudD16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Dahlgaard16,
  author       = {S{\o}ren Dahlgaard},
  editor       = {Ioannis Chatzigiannakis and
                  Michael Mitzenmacher and
                  Yuval Rabani and
                  Davide Sangiorgi},
  title        = {On the Hardness of Partially Dynamic Graph Problems and Connections
                  to Diameter},
  booktitle    = {43rd International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2016, July 11-15, 2016, Rome, Italy},
  series       = {LIPIcs},
  volume       = {55},
  pages        = {48:1--48:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2016.48},
  doi          = {10.4230/LIPICS.ICALP.2016.48},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/Dahlgaard16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DahlgaardKRT16,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Eva Rotenberg and
                  Mikkel Thorup},
  editor       = {Robert Krauthgamer},
  title        = {The Power of Two Choices with Simple Tabulation},
  booktitle    = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  pages        = {1631--1642},
  publisher    = {{SIAM}},
  year         = {2016},
  url          = {https://doi.org/10.1137/1.9781611974331.ch111},
  doi          = {10.1137/1.9781611974331.CH111},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/DahlgaardKRT16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Dahlgaard16,
  author       = {S{\o}ren Dahlgaard},
  title        = {On the Hardness of Partially Dynamic Graph Problems and Connections
                  to Diameter},
  journal      = {CoRR},
  volume       = {abs/1602.06705},
  year         = {2016},
  url          = {http://arxiv.org/abs/1602.06705},
  eprinttype    = {arXiv},
  eprint       = {1602.06705},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Dahlgaard16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbboudD16,
  author       = {Amir Abboud and
                  S{\o}ren Dahlgaard},
  title        = {Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms},
  journal      = {CoRR},
  volume       = {abs/1605.03797},
  year         = {2016},
  url          = {http://arxiv.org/abs/1605.03797},
  eprinttype    = {arXiv},
  eprint       = {1605.03797},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AbboudD16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EvaldD16,
  author       = {Jacob Evald and
                  S{\o}ren Dahlgaard},
  title        = {Tight Hardness Results for Distance and Centrality Problems in Constant
                  Degree Graphs},
  journal      = {CoRR},
  volume       = {abs/1609.08403},
  year         = {2016},
  url          = {http://arxiv.org/abs/1609.08403},
  eprinttype    = {arXiv},
  eprint       = {1609.08403},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/EvaldD16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DahlgaardKRT15,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Eva Rotenberg and
                  Mikkel Thorup},
  editor       = {Venkatesan Guruswami},
  title        = {Hashing for Statistics over K-Partitions},
  booktitle    = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
                  2015, Berkeley, CA, USA, 17-20 October, 2015},
  pages        = {1292--1310},
  publisher    = {{IEEE} Computer Society},
  year         = {2015},
  url          = {https://doi.org/10.1109/FOCS.2015.83},
  doi          = {10.1109/FOCS.2015.83},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/DahlgaardKRT15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlstrupDK15,
  author       = {Stephen Alstrup and
                  S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen},
  editor       = {Venkatesan Guruswami},
  title        = {Optimal Induced Universal Graphs and Adjacency Labeling for Trees},
  booktitle    = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
                  2015, Berkeley, CA, USA, 17-20 October, 2015},
  pages        = {1311--1326},
  publisher    = {{IEEE} Computer Society},
  year         = {2015},
  url          = {https://doi.org/10.1109/FOCS.2015.84},
  doi          = {10.1109/FOCS.2015.84},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AlstrupDK15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DahlgaardKR15,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Noy Rotbart},
  editor       = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Kazuo Iwama and
                  Naoki Kobayashi and
                  Bettina Speckmann},
  title        = {A Simple and Optimal Ancestry Labeling Scheme for Trees},
  booktitle    = {Automata, Languages, and Programming - 42nd International Colloquium,
                  {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {9135},
  pages        = {564--574},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-47666-6\_45},
  doi          = {10.1007/978-3-662-47666-6\_45},
  timestamp    = {Fri, 27 Mar 2020 09:02:59 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/DahlgaardKR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlstrupDK15,
  author       = {Stephen Alstrup and
                  S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen},
  title        = {Optimal induced universal graphs and adjacency labeling for trees},
  journal      = {CoRR},
  volume       = {abs/1504.02306},
  year         = {2015},
  url          = {http://arxiv.org/abs/1504.02306},
  eprinttype    = {arXiv},
  eprint       = {1504.02306},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AlstrupDK15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlstrupDKP15,
  author       = {Stephen Alstrup and
                  S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Ely Porat},
  title        = {Sublinear distance labeling for sparse graphs},
  journal      = {CoRR},
  volume       = {abs/1507.02618},
  year         = {2015},
  url          = {http://arxiv.org/abs/1507.02618},
  eprinttype    = {arXiv},
  eprint       = {1507.02618},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AlstrupDKP15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DahlgaardKR14,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Noy Rotbart},
  editor       = {Hee{-}Kap Ahn and
                  Chan{-}Su Shin},
  title        = {Dynamic and Multi-Functional Labeling Schemes},
  booktitle    = {Algorithms and Computation - 25th International Symposium, {ISAAC}
                  2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8889},
  pages        = {141--153},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-13075-0\_12},
  doi          = {10.1007/978-3-319-13075-0\_12},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/DahlgaardKR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DahlgaardT14,
  author       = {S{\o}ren Dahlgaard and
                  Mikkel Thorup},
  editor       = {R. Ravi and
                  Inge Li G{\o}rtz},
  title        = {Approximately Minwise Independence with Twisted Tabulation},
  booktitle    = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
                  Copenhagen, Denmark, July 2-4, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8503},
  pages        = {134--145},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-08404-6\_12},
  doi          = {10.1007/978-3-319-08404-6\_12},
  timestamp    = {Sun, 02 Jun 2019 21:15:18 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/DahlgaardT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/DahlgaardKR14,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Noy Rotbart},
  editor       = {Fabian Kuhn},
  title        = {On Dynamic and Multi-functional Labeling Schemes},
  booktitle    = {Distributed Computing - 28th International Symposium, {DISC} 2014,
                  Austin, TX, USA, October 12-15, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8784},
  pages        = {544--545},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://link.springer.com/content/pdf/bbm\%3A978-3-662-45174-8\%2F1.pdf\#page=14},
  timestamp    = {Thu, 24 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wdag/DahlgaardKR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DahlgaardKR14,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Noy Rotbart},
  title        = {Dynamic and Multi-functional Labeling Schemes},
  journal      = {CoRR},
  volume       = {abs/1404.4982},
  year         = {2014},
  url          = {http://arxiv.org/abs/1404.4982},
  eprinttype    = {arXiv},
  eprint       = {1404.4982},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DahlgaardKR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DahlgaardT14,
  author       = {S{\o}ren Dahlgaard and
                  Mikkel Thorup},
  title        = {Approximately Minwise Independence with Twisted Tabulation},
  journal      = {CoRR},
  volume       = {abs/1404.6724},
  year         = {2014},
  url          = {http://arxiv.org/abs/1404.6724},
  eprinttype    = {arXiv},
  eprint       = {1404.6724},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DahlgaardT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DahlgaardKR14a,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Noy Rotbart},
  title        = {Improved ancestry labeling scheme for trees},
  journal      = {CoRR},
  volume       = {abs/1407.5011},
  year         = {2014},
  url          = {http://arxiv.org/abs/1407.5011},
  eprinttype    = {arXiv},
  eprint       = {1407.5011},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DahlgaardKR14a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DahlgaardKRT14,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Eva Rotenberg and
                  Mikkel Thorup},
  title        = {The Power of Two Choices with Simple Tabulation},
  journal      = {CoRR},
  volume       = {abs/1407.6846},
  year         = {2014},
  url          = {http://arxiv.org/abs/1407.6846},
  eprinttype    = {arXiv},
  eprint       = {1407.6846},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DahlgaardKRT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DahlgaardKRT14a,
  author       = {S{\o}ren Dahlgaard and
                  Mathias B{\ae}k Tejs Knudsen and
                  Eva Rotenberg and
                  Mikkel Thorup},
  title        = {Hashing for statistics over k-partitions},
  journal      = {CoRR},
  volume       = {abs/1411.7191},
  year         = {2014},
  url          = {http://arxiv.org/abs/1411.7191},
  eprinttype    = {arXiv},
  eprint       = {1411.7191},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DahlgaardKRT14a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bigdataconf/DahlgaardIT13,
  author       = {S{\o}ren Dahlgaard and
                  Christian Igel and
                  Mikkel Thorup},
  editor       = {Xiaohua Hu and
                  Tsau Young Lin and
                  Vijay V. Raghavan and
                  Benjamin W. Wah and
                  Ricardo Baeza{-}Yates and
                  Geoffrey C. Fox and
                  Cyrus Shahabi and
                  Matthew Smith and
                  Qiang Yang and
                  Rayid Ghani and
                  Wei Fan and
                  Ronny Lempel and
                  Raghunath Nambiar},
  title        = {Nearest neighbor classification using bottom-k sketches},
  booktitle    = {2013 {IEEE} International Conference on Big Data {(IEEE} BigData 2013),
                  6-9 October 2013, Santa Clara, CA, {USA}},
  pages        = {28--34},
  publisher    = {{IEEE} Computer Society},
  year         = {2013},
  url          = {https://doi.org/10.1109/BigData.2013.6691730},
  doi          = {10.1109/BIGDATA.2013.6691730},
  timestamp    = {Fri, 19 Nov 2021 16:08:20 +0100},
  biburl       = {https://dblp.org/rec/conf/bigdataconf/DahlgaardIT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics