BibTeX records: Rolf Fagerberg

download as .bib file

@inproceedings{DBLP:conf/isbra/EriksenAFM23,
  author       = {Casper Asbj{\o}rn Eriksen and
                  Jakob Lykke Andersen and
                  Rolf Fagerberg and
                  Daniel Merkle},
  editor       = {Xuan Guo and
                  Serghei Mangul and
                  Murray Patterson and
                  Alexander Zelikovsky},
  title        = {Reconciling Inconsistent Molecular Structures from Biochemical Databases},
  booktitle    = {Bioinformatics Research and Applications - 19th International Symposium,
                  {ISBRA} 2023, Wroc{\l}aw, Poland, October 9-12, 2023, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {14248},
  pages        = {58--71},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-981-99-7074-2\_5},
  doi          = {10.1007/978-981-99-7074-2\_5},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/isbra/EriksenAFM23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isbra/AndersenBFFMS23,
  author       = {Jakob L. Andersen and
                  Sissel Banke and
                  Rolf Fagerberg and
                  Christoph Flamm and
                  Daniel Merkle and
                  Peter F. Stadler},
  editor       = {Xuan Guo and
                  Serghei Mangul and
                  Murray Patterson and
                  Alexander Zelikovsky},
  title        = {On the Realisability of Chemical Pathways},
  booktitle    = {Bioinformatics Research and Applications - 19th International Symposium,
                  {ISBRA} 2023, Wroc{\l}aw, Poland, October 9-12, 2023, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {14248},
  pages        = {409--419},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-981-99-7074-2\_32},
  doi          = {10.1007/978-981-99-7074-2\_32},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/isbra/AndersenBFFMS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-12735,
  author       = {Casper Asbj{\o}rn Eriksen and
                  Jakob Lykke Andersen and
                  Rolf Fagerberg and
                  Daniel Merkle},
  title        = {Reconciling Inconsistent Molecular Structures from Biochemical Databases},
  journal      = {CoRR},
  volume       = {abs/2308.12735},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2308.12735},
  doi          = {10.48550/ARXIV.2308.12735},
  eprinttype    = {arXiv},
  eprint       = {2308.12735},
  timestamp    = {Fri, 25 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2308-12735.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-10629,
  author       = {Jakob L. Andersen and
                  Sissel Banke and
                  Rolf Fagerberg and
                  Christoph Flamm and
                  Daniel Merkle and
                  Peter F. Stadler},
  title        = {On the Realisability of Chemical Pathways},
  journal      = {CoRR},
  volume       = {abs/2309.10629},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2309.10629},
  doi          = {10.48550/ARXIV.2309.10629},
  eprinttype    = {arXiv},
  eprint       = {2309.10629},
  timestamp    = {Tue, 26 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2309-10629.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcisd/AndersenFFFKLMN22,
  author       = {Jakob L. Andersen and
                  Rolf Fagerberg and
                  Christoph Flamm and
                  Walter Fontana and
                  Juraj Kolc{\'{a}}k and
                  Christophe V. F. P. Laurent and
                  Daniel Merkle and
                  Nikolai N{\o}jgaard},
  title        = {Representing Catalytic Mechanisms with Rule Composition},
  journal      = {J. Chem. Inf. Model.},
  volume       = {62},
  number       = {22},
  pages        = {5513--5524},
  year         = {2022},
  url          = {https://doi.org/10.1021/acs.jcim.2c00426},
  doi          = {10.1021/ACS.JCIM.2C00426},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcisd/AndersenFFFKLMN22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoseCFIJL22,
  author       = {Prosenjit Bose and
                  Pilar Cano and
                  Rolf Fagerberg and
                  John Iacono and
                  Riko Jacob and
                  Stefan Langerman},
  title        = {Fragile complexity of adaptive algorithms},
  journal      = {Theor. Comput. Sci.},
  volume       = {919},
  pages        = {92--102},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2022.03.034},
  doi          = {10.1016/J.TCS.2022.03.034},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BoseCFIJL22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-04360,
  author       = {Jakob L. Andersen and
                  Rolf Fagerberg and
                  Juraj Kolc{\'{a}}k and
                  Christophe V. F. P. Laurent and
                  Daniel Merkle and
                  Nikolai N{\o}jgaard},
  title        = {Efficient Modular Graph Transformation Rule Application},
  journal      = {CoRR},
  volume       = {abs/2201.04360},
  year         = {2022},
  url          = {https://arxiv.org/abs/2201.04360},
  eprinttype    = {arXiv},
  eprint       = {2201.04360},
  timestamp    = {Thu, 20 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2201-04360.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-04515,
  author       = {Jakob L. Andersen and
                  Rolf Fagerberg and
                  Christoph Flamm and
                  Walter Fontana and
                  Juraj Kolc{\'{a}}k and
                  Christophe V. F. P. Laurent and
                  Daniel Merkle and
                  Nikolai N{\o}jgaard},
  title        = {Characterizing Catalytic Mechanisms with Overlay Graphs},
  journal      = {CoRR},
  volume       = {abs/2201.04515},
  year         = {2022},
  url          = {https://arxiv.org/abs/2201.04515},
  eprinttype    = {arXiv},
  eprint       = {2201.04515},
  timestamp    = {Thu, 20 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2201-04515.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/AndersenFFFKLMN21,
  author       = {Jakob L. Andersen and
                  Rolf Fagerberg and
                  Christoph Flamm and
                  Walter Fontana and
                  Juraj Kolc{\'{a}}k and
                  Christophe V. F. P. Laurent and
                  Daniel Merkle and
                  Nikolai N{\o}jgaard},
  title        = {Graph transformation for enzymatic mechanisms},
  journal      = {Bioinform.},
  volume       = {37},
  number       = {Supplement},
  pages        = {392--400},
  year         = {2021},
  url          = {https://doi.org/10.1093/bioinformatics/btab296},
  doi          = {10.1093/BIOINFORMATICS/BTAB296},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/bioinformatics/AndersenFFFKLMN21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BoseCFIJL21,
  author       = {Prosenjit Bose and
                  Pilar Cano and
                  Rolf Fagerberg and
                  John Iacono and
                  Riko Jacob and
                  Stefan Langerman},
  editor       = {Tiziana Calamoneri and
                  Federico Cor{\`{o}}},
  title        = {Fragile Complexity of Adaptive Algorithms},
  booktitle    = {Algorithms and Complexity - 12th International Conference, {CIAC}
                  2021, Virtual Event, May 10-12, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12701},
  pages        = {144--157},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-75242-2\_10},
  doi          = {10.1007/978-3-030-75242-2\_10},
  timestamp    = {Sun, 16 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/ciac/BoseCFIJL21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/BrodalFH0PT21,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  David Hammer and
                  Ulrich Meyer and
                  Manuel Penschuck and
                  Hung Tran},
  editor       = {David Coudert and
                  Emanuele Natale},
  title        = {An Experimental Study of External Memory Algorithms for Connected
                  Components},
  booktitle    = {19th International Symposium on Experimental Algorithms, {SEA} 2021,
                  June 7-9, 2021, Nice, France},
  series       = {LIPIcs},
  volume       = {190},
  pages        = {23:1--23:23},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.SEA.2021.23},
  doi          = {10.4230/LIPICS.SEA.2021.23},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wea/BrodalFH0PT21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-00338,
  author       = {Prosenjit Bose and
                  Pilar Cano and
                  Rolf Fagerberg and
                  John Iacono and
                  Riko Jacob and
                  Stefan Langerman},
  title        = {Fragile Complexity of Adaptive Algorithms},
  journal      = {CoRR},
  volume       = {abs/2102.00338},
  year         = {2021},
  url          = {https://arxiv.org/abs/2102.00338},
  eprinttype    = {arXiv},
  eprint       = {2102.00338},
  timestamp    = {Tue, 09 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2102-00338.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-03292,
  author       = {Jakob L. Andersen and
                  Rolf Fagerberg and
                  Christoph Flamm and
                  Walter Fontana and
                  Juraj Kolc{\'{a}}k and
                  Christophe V. F. P. Laurent and
                  Daniel Merkle and
                  Nikolai N{\o}jgaard},
  title        = {Graph Transformation for Enzymatic Mechanisms},
  journal      = {CoRR},
  volume       = {abs/2102.03292},
  year         = {2021},
  url          = {https://arxiv.org/abs/2102.03292},
  eprinttype    = {arXiv},
  eprint       = {2102.03292},
  timestamp    = {Wed, 10 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2102-03292.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoseFRV19,
  author       = {Prosenjit Bose and
                  Rolf Fagerberg and
                  Andr{\'{e}} van Renssen and
                  Sander Verdonschot},
  title        = {On Plane Constrained Bounded-Degree Spanners},
  journal      = {Algorithmica},
  volume       = {81},
  number       = {4},
  pages        = {1392--1415},
  year         = {2019},
  url          = {https://doi.org/10.1007/s00453-018-0476-8},
  doi          = {10.1007/S00453-018-0476-8},
  timestamp    = {Fri, 12 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BoseFRV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/ChiarandiniFG19,
  author       = {Marco Chiarandini and
                  Rolf Fagerberg and
                  Stefano Gualandi},
  title        = {Handling preferences in student-project allocation},
  journal      = {Ann. Oper. Res.},
  volume       = {275},
  number       = {1},
  pages        = {39--78},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10479-017-2710-1},
  doi          = {10.1007/S10479-017-2710-1},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/ChiarandiniFG19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AfshaniFHJK0PS19,
  author       = {Peyman Afshani and
                  Rolf Fagerberg and
                  David Hammer and
                  Riko Jacob and
                  Irina Kostitsyna and
                  Ulrich Meyer and
                  Manuel Penschuck and
                  Nodari Sitchinava},
  editor       = {Michael A. Bender and
                  Ola Svensson and
                  Grzegorz Herman},
  title        = {Fragile Complexity of Comparison-Based Algorithms},
  booktitle    = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
                  9-11, 2019, Munich/Garching, Germany},
  series       = {LIPIcs},
  volume       = {144},
  pages        = {2:1--2:19},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2019.2},
  doi          = {10.4230/LIPICS.ESA.2019.2},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/AfshaniFHJK0PS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FagerbergH019,
  author       = {Rolf Fagerberg and
                  David Hammer and
                  Ulrich Meyer},
  editor       = {Pinyan Lu and
                  Guochuan Zhang},
  title        = {On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect
                  Shape?},
  booktitle    = {30th International Symposium on Algorithms and Computation, {ISAAC}
                  2019, December 8-11, 2019, Shanghai University of Finance and Economics,
                  Shanghai, China},
  series       = {LIPIcs},
  volume       = {149},
  pages        = {35:1--35:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.35},
  doi          = {10.4230/LIPICS.ISAAC.2019.35},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/FagerbergH019.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-02857,
  author       = {Peyman Afshani and
                  Rolf Fagerberg and
                  David Hammer and
                  Riko Jacob and
                  Irina Kostitsyna and
                  Ulrich Meyer and
                  Manuel Penschuck and
                  Nodari Sitchinava},
  title        = {Fragile Complexity of Comparison-Based Algorithms},
  journal      = {CoRR},
  volume       = {abs/1901.02857},
  year         = {2019},
  url          = {http://arxiv.org/abs/1901.02857},
  eprinttype    = {arXiv},
  eprint       = {1901.02857},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1901-02857.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BakhsheshBBCDFF18,
  author       = {Davood Bakhshesh and
                  Luis Barba and
                  Prosenjit Bose and
                  Jean{-}Lou De Carufel and
                  Mirela Damian and
                  Rolf Fagerberg and
                  Mohammad Farshi and
                  Andr{\'{e}} van Renssen and
                  Perouz Taslakian and
                  Sander Verdonschot},
  title        = {Continuous Yao graphs},
  journal      = {Comput. Geom.},
  volume       = {67},
  pages        = {42--52},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.comgeo.2017.10.002},
  doi          = {10.1016/J.COMGEO.2017.10.002},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/BakhsheshBBCDFF18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcheminf/FagerbergFKMS18,
  author       = {Rolf Fagerberg and
                  Christoph Flamm and
                  Rojin Kianian and
                  Daniel Merkle and
                  Peter F. Stadler},
  title        = {Finding the {K} best synthesis plans},
  journal      = {J. Cheminformatics},
  volume       = {10},
  number       = {1},
  pages        = {19:1--19:21},
  year         = {2018},
  url          = {https://doi.org/10.1186/s13321-018-0273-z},
  doi          = {10.1186/S13321-018-0273-Z},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcheminf/FagerbergFKMS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BoseFRV17,
  author       = {Prosenjit Bose and
                  Rolf Fagerberg and
                  Andr{\'{e}} van Renssen and
                  Sander Verdonschot},
  title        = {Competitive local routing with constraints},
  journal      = {J. Comput. Geom.},
  volume       = {8},
  number       = {1},
  pages        = {125--152},
  year         = {2017},
  url          = {https://doi.org/10.20382/jocg.v8i1a7},
  doi          = {10.20382/JOCG.V8I1A7},
  timestamp    = {Thu, 10 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jocg/BoseFRV17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoseFRV17,
  author       = {Prosenjit Bose and
                  Rolf Fagerberg and
                  Andr{\'{e}} van Renssen and
                  Sander Verdonschot},
  title        = {On Plane Constrained Bounded-Degree Spanners},
  journal      = {CoRR},
  volume       = {abs/1704.03596},
  year         = {2017},
  url          = {http://arxiv.org/abs/1704.03596},
  eprinttype    = {arXiv},
  eprint       = {1704.03596},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BoseFRV17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoseFHM17,
  author       = {Prosenjit Bose and
                  Rolf Fagerberg and
                  John Howat and
                  Pat Morin},
  title        = {Biased Predecessor Search},
  journal      = {CoRR},
  volume       = {abs/1707.01182},
  year         = {2017},
  url          = {http://arxiv.org/abs/1707.01182},
  eprinttype    = {arXiv},
  eprint       = {1707.01182},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BoseFHM17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoseFHM16,
  author       = {Prosenjit Bose and
                  Rolf Fagerberg and
                  John Howat and
                  Pat Morin},
  title        = {Biased Predecessor Search},
  journal      = {Algorithmica},
  volume       = {76},
  number       = {4},
  pages        = {1097--1105},
  year         = {2016},
  url          = {https://doi.org/10.1007/s00453-016-0146-7},
  doi          = {10.1007/S00453-016-0146-7},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BoseFHM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Fagerberg16,
  author       = {Rolf Fagerberg},
  title        = {Cache-Oblivious B-Tree},
  booktitle    = {Encyclopedia of Algorithms},
  pages        = {261--264},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-1-4939-2864-4\_61},
  doi          = {10.1007/978-1-4939-2864-4\_61},
  timestamp    = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Fagerberg16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Fagerberg16a,
  author       = {Rolf Fagerberg},
  title        = {Cache-Oblivious Model},
  booktitle    = {Encyclopedia of Algorithms},
  pages        = {264--269},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-1-4939-2864-4\_62},
  doi          = {10.1007/978-1-4939-2864-4\_62},
  timestamp    = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Fagerberg16a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Fagerberg16b,
  author       = {Rolf Fagerberg},
  title        = {String Sorting},
  booktitle    = {Encyclopedia of Algorithms},
  pages        = {2117--2121},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-1-4939-2864-4\_408},
  doi          = {10.1007/978-1-4939-2864-4\_408},
  timestamp    = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Fagerberg16b.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BarbaBDFKORTVX15,
  author       = {Luis Barba and
                  Prosenjit Bose and
                  Mirela Damian and
                  Rolf Fagerberg and
                  Wah Loon Keng and
                  Joseph O'Rourke and
                  Andr{\'{e}} van Renssen and
                  Perouz Taslakian and
                  Sander Verdonschot and
                  Ge Xia},
  title        = {New and improved spanning ratios for Yao graphs},
  journal      = {J. Comput. Geom.},
  volume       = {6},
  number       = {2},
  pages        = {19--53},
  year         = {2015},
  url          = {https://doi.org/10.20382/jocg.v6i2a3},
  doi          = {10.20382/JOCG.V6I2A3},
  timestamp    = {Thu, 10 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jocg/BarbaBDFKORTVX15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoseFRV15,
  author       = {Prosenjit Bose and
                  Rolf Fagerberg and
                  Andr{\'{e}} van Renssen and
                  Sander Verdonschot},
  title        = {Optimal Local Routing on Delaunay Triangulations Defined by Empty
                  Equilateral Triangles},
  journal      = {{SIAM} J. Comput.},
  volume       = {44},
  number       = {6},
  pages        = {1626--1649},
  year         = {2015},
  url          = {https://doi.org/10.1137/140988103},
  doi          = {10.1137/140988103},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BoseFRV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BoseFRV15,
  author       = {Prosenjit Bose and
                  Rolf Fagerberg and
                  Andr{\'{e}} van Renssen and
                  Sander Verdonschot},
  editor       = {Khaled M. Elbassioni and
                  Kazuhisa Makino},
  title        = {Competitive Local Routing with Constraints},
  booktitle    = {Algorithms and Computation - 26th International Symposium, {ISAAC}
                  2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9472},
  pages        = {23--34},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-48971-0\_3},
  doi          = {10.1007/978-3-662-48971-0\_3},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/BoseFRV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BarbaBCDFRTV14,
  author       = {Luis Barba and
                  Prosenjit Bose and
                  Jean{-}Lou De Carufel and
                  Mirela Damian and
                  Rolf Fagerberg and
                  Andr{\'{e}} van Renssen and
                  Perouz Taslakian and
                  Sander Verdonschot},
  title        = {Continuous Yao Graphs},
  booktitle    = {Proceedings of the 26th Canadian Conference on Computational Geometry,
                  {CCCG} 2014, Halifax, Nova Scotia, Canada, 2014},
  publisher    = {Carleton University, Ottawa, Canada},
  year         = {2014},
  url          = {http://www.cccg.ca/proceedings/2014/papers/paper15.pdf},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cccg/BarbaBCDFRTV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BarbaBDFKORTVX14,
  author       = {Luis Barba and
                  Prosenjit Bose and
                  Mirela Damian and
                  Rolf Fagerberg and
                  Wah Loon Keng and
                  Joseph O'Rourke and
                  Andr{\'{e}} van Renssen and
                  Perouz Taslakian and
                  Sander Verdonschot and
                  Ge Xia},
  editor       = {Siu{-}Wing Cheng and
                  Olivier Devillers},
  title        = {New and Improved Spanning Ratios for Yao Graphs},
  booktitle    = {30th Annual Symposium on Computational Geometry, SoCG'14, Kyoto, Japan,
                  June 08 - 11, 2014},
  pages        = {30},
  publisher    = {{ACM}},
  year         = {2014},
  url          = {https://doi.org/10.1145/2582112.2582143},
  doi          = {10.1145/2582112.2582143},
  timestamp    = {Mon, 14 Jun 2021 16:39:30 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/BarbaBDFKORTVX14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BoseFHM14,
  author       = {Prosenjit Bose and
                  Rolf Fagerberg and
                  John Howat and
                  Pat Morin},
  editor       = {Alberto Pardo and
                  Alfredo Viola},
  title        = {Biased Predecessor Search},
  booktitle    = {{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium,
                  Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8392},
  pages        = {755--764},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-642-54423-1\_65},
  doi          = {10.1007/978-3-642-54423-1\_65},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/BoseFHM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BarbaBCDFRTV14,
  author       = {Luis Barba and
                  Prosenjit Bose and
                  Jean{-}Lou De Carufel and
                  Mirela Damian and
                  Rolf Fagerberg and
                  Andr{\'{e}} van Renssen and
                  Perouz Taslakian and
                  Sander Verdonschot},
  title        = {Continuous Yao Graphs},
  journal      = {CoRR},
  volume       = {abs/1408.4099},
  year         = {2014},
  url          = {http://arxiv.org/abs/1408.4099},
  eprinttype    = {arXiv},
  eprint       = {1408.4099},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BarbaBCDFRTV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoseFRV14,
  author       = {Prosenjit Bose and
                  Rolf Fagerberg and
                  Andr{\'{e}} van Renssen and
                  Sander Verdonschot},
  title        = {Optimal local routing on Delaunay triangulations defined by empty
                  equilateral triangles},
  journal      = {CoRR},
  volume       = {abs/1409.6397},
  year         = {2014},
  url          = {http://arxiv.org/abs/1409.6397},
  eprinttype    = {arXiv},
  eprint       = {1409.6397},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BoseFRV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoseFRV14a,
  author       = {Prosenjit Bose and
                  Rolf Fagerberg and
                  Andr{\'{e}} van Renssen and
                  Sander Verdonschot},
  title        = {Competitive Local Routing with Constraints},
  journal      = {CoRR},
  volume       = {abs/1412.0760},
  year         = {2014},
  url          = {http://arxiv.org/abs/1412.0760},
  eprinttype    = {arXiv},
  eprint       = {1412.0760},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BoseFRV14a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/SandBFPM13,
  author       = {Andreas Sand and
                  Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Christian N. S. Pedersen and
                  Thomas Mailund},
  title        = {A practical O(n log\({}^{\mbox{2 }}\) n) time algorithm for computing
                  the triplet distance on binary trees},
  journal      = {{BMC} Bioinform.},
  volume       = {14},
  number       = {{S-2}},
  pages        = {S18},
  year         = {2013},
  url          = {https://doi.org/10.1186/1471-2105-14-S2-S18},
  doi          = {10.1186/1471-2105-14-S2-S18},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/bmcbi/SandBFPM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mics/FagerbergFMPS13,
  author       = {Rolf Fagerberg and
                  Christoph Flamm and
                  Daniel Merkle and
                  Philipp Peters and
                  Peter F. Stadler},
  title        = {On the Complexity of Reconstructing Chemical Reaction Networks},
  journal      = {Math. Comput. Sci.},
  volume       = {7},
  number       = {3},
  pages        = {275--292},
  year         = {2013},
  url          = {https://doi.org/10.1007/s11786-013-0160-y},
  doi          = {10.1007/S11786-013-0160-Y},
  timestamp    = {Wed, 12 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mics/FagerbergFMPS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrodalFMPS13,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Thomas Mailund and
                  Christian N. S. Pedersen and
                  Andreas Sand},
  editor       = {Sanjeev Khanna},
  title        = {Efficient algorithms for computing the triplet and quartet distance
                  between trees of arbitrary degree},
  booktitle    = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
                  2013},
  pages        = {1814--1832},
  publisher    = {{SIAM}},
  year         = {2013},
  url          = {https://doi.org/10.1137/1.9781611973105.130},
  doi          = {10.1137/1.9781611973105.130},
  timestamp    = {Tue, 02 Feb 2021 17:07:29 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BrodalFMPS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BarbaBDFORTV13,
  author       = {Luis Barba and
                  Prosenjit Bose and
                  Mirela Damian and
                  Rolf Fagerberg and
                  Joseph O'Rourke and
                  Andr{\'{e}} van Renssen and
                  Perouz Taslakian and
                  Sander Verdonschot},
  title        = {New and Improved Spanning Ratios for Yao Graphs},
  journal      = {CoRR},
  volume       = {abs/1307.5829},
  year         = {2013},
  url          = {http://arxiv.org/abs/1307.5829},
  eprinttype    = {arXiv},
  eprint       = {1307.5829},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BarbaBDFORTV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FagerbergFMPS13,
  author       = {Rolf Fagerberg and
                  Christoph Flamm and
                  Daniel Merkle and
                  Philipp Peters and
                  Peter F. Stadler},
  title        = {On the Complexity of Reconstructing Chemical Reaction Networks},
  journal      = {CoRR},
  volume       = {abs/1309.7198},
  year         = {2013},
  url          = {http://arxiv.org/abs/1309.7198},
  eprinttype    = {arXiv},
  eprint       = {1309.7198},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/FagerbergFMPS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BoseFRV12,
  author       = {Prosenjit Bose and
                  Rolf Fagerberg and
                  Andr{\'{e}} van Renssen and
                  Sander Verdonschot},
  title        = {Competitive Routing on a Bounded-Degree Plane Spanner},
  booktitle    = {Proceedings of the 24th Canadian Conference on Computational Geometry,
                  {CCCG} 2012, Charlottetown, Prince Edward Island, Canada, August 8-10,
                  2012},
  pages        = {285--290},
  year         = {2012},
  url          = {http://2012.cccg.ca/papers/paper74.pdf},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cccg/BoseFRV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/FagerbergFMP12,
  author       = {Rolf Fagerberg and
                  Christoph Flamm and
                  Daniel Merkle and
                  Philipp Peters},
  editor       = {Michela Milano},
  title        = {Exploring Chemistry Using {SMT}},
  booktitle    = {Principles and Practice of Constraint Programming - 18th International
                  Conference, {CP} 2012, Qu{\'{e}}bec City, QC, Canada, October
                  8-12, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7514},
  pages        = {900--915},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-33558-7\_64},
  doi          = {10.1007/978-3-642-33558-7\_64},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/cp/FagerbergFMP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BoseCFL12,
  author       = {Prosenjit Bose and
                  S{\'{e}}bastien Collette and
                  Rolf Fagerberg and
                  Stefan Langerman},
  editor       = {Artur Czumaj and
                  Kurt Mehlhorn and
                  Andrew M. Pitts and
                  Roger Wattenhofer},
  title        = {De-amortizing Binary Search Trees},
  booktitle    = {Automata, Languages, and Programming - 39th International Colloquium,
                  {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7391},
  pages        = {121--132},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-31594-7\_11},
  doi          = {10.1007/978-3-642-31594-7\_11},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/BoseCFL12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BoseFRV12,
  author       = {Prosenjit Bose and
                  Rolf Fagerberg and
                  Andr{\'{e}} van Renssen and
                  Sander Verdonschot},
  editor       = {David Fern{\'{a}}ndez{-}Baca},
  title        = {On Plane Constrained Bounded-Degree Spanners},
  booktitle    = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
                  Arequipa, Peru, April 16-20, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7256},
  pages        = {85--96},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-29344-3\_8},
  doi          = {10.1007/978-3-642-29344-3\_8},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/BoseFRV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BoseFRV12,
  author       = {Prosenjit Bose and
                  Rolf Fagerberg and
                  Andr{\'{e}} van Renssen and
                  Sander Verdonschot},
  editor       = {Yuval Rabani},
  title        = {Competitive routing in the half-{\texttheta}\({}_{\mbox{6}}\)-graph},
  booktitle    = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
  pages        = {1319--1328},
  publisher    = {{SIAM}},
  year         = {2012},
  url          = {https://doi.org/10.1137/1.9781611973099.104},
  doi          = {10.1137/1.9781611973099.104},
  timestamp    = {Tue, 02 Feb 2021 17:07:31 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BoseFRV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BenderBFGHHIL11,
  author       = {Michael A. Bender and
                  Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Dongdong Ge and
                  Simai He and
                  Haodong Hu and
                  John Iacono and
                  Alejandro L{\'{o}}pez{-}Ortiz},
  title        = {The Cost of Cache-Oblivious Searching},
  journal      = {Algorithmica},
  volume       = {61},
  number       = {2},
  pages        = {463--505},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9394-0},
  doi          = {10.1007/S00453-010-9394-0},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BenderBFGHHIL11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-1665,
  author       = {Prosenjit Bose and
                  S{\'{e}}bastien Collette and
                  Rolf Fagerberg and
                  Stefan Langerman},
  title        = {De-amortizing Binary Search Trees},
  journal      = {CoRR},
  volume       = {abs/1111.1665},
  year         = {2011},
  url          = {http://arxiv.org/abs/1111.1665},
  eprinttype    = {arXiv},
  eprint       = {1111.1665},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1111-1665.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BenderBFJV10,
  author       = {Michael A. Bender and
                  Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Riko Jacob and
                  Elias Vicari},
  title        = {Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model},
  journal      = {Theory Comput. Syst.},
  volume       = {47},
  number       = {4},
  pages        = {934--962},
  year         = {2010},
  url          = {https://doi.org/10.1007/s00224-010-9285-4},
  doi          = {10.1007/S00224-010-9285-4},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BenderBFJV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoseDDF10,
  author       = {Prosenjit Bose and
                  Karim Dou{\"{\i}}eb and
                  Vida Dujmovic and
                  Rolf Fagerberg},
  editor       = {Haim Kaplan},
  title        = {An \emph{O}(log log \emph{n})-Competitive Binary Search Tree with
                  Optimal Worst-Case Access Times},
  booktitle    = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
                  on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6139},
  pages        = {38--49},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13731-0\_5},
  doi          = {10.1007/978-3-642-13731-0\_5},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/BoseDDF10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-0139,
  author       = {Prosenjit Bose and
                  Karim Dou{\"{\i}}eb and
                  Vida Dujmovic and
                  Rolf Fagerberg},
  title        = {An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case
                  Access Times},
  journal      = {CoRR},
  volume       = {abs/1003.0139},
  year         = {2010},
  url          = {http://arxiv.org/abs/1003.0139},
  eprinttype    = {arXiv},
  eprint       = {1003.0139},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1003-0139.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BilleFG09,
  author       = {Philip Bille and
                  Rolf Fagerberg and
                  Inge Li G{\o}rtz},
  title        = {Improved approximate string matching and regular expression matching
                  on Ziv-Lempel compressed texts},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {6},
  number       = {1},
  pages        = {3:1--3:14},
  year         = {2009},
  url          = {https://doi.org/10.1145/1644015.1644018},
  doi          = {10.1145/1644015.1644018},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/talg/BilleFG09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BrodalFGL09,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Mark Greve and
                  Alejandro L{\'{o}}pez{-}Ortiz},
  editor       = {Yingfei Dong and
                  Ding{-}Zhu Du and
                  Oscar H. Ibarra},
  title        = {Online Sorted Range Reporting},
  booktitle    = {Algorithms and Computation, 20th International Symposium, {ISAAC}
                  2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5878},
  pages        = {173--182},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-10631-6\_19},
  doi          = {10.1007/978-3-642-10631-6\_19},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/BrodalFGL09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbcb/StissingMPBF08,
  author       = {Martin Stig Stissing and
                  Thomas Mailund and
                  Christian N. S. Pedersen and
                  Gerth St{\o}lting Brodal and
                  Rolf Fagerberg},
  title        = {Computing the All-Pairs Quartet Distance on a Set of Evolutionary
                  Trees},
  journal      = {J. Bioinform. Comput. Biol.},
  volume       = {6},
  number       = {1},
  pages        = {37--50},
  year         = {2008},
  url          = {https://doi.org/10.1142/S0219720008003266},
  doi          = {10.1142/S0219720008003266},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jbcb/StissingMPBF08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BrodalFM08,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Gabriel Moruz},
  title        = {On the adaptiveness of Quicksort},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {12},
  pages        = {3.2:1--3.2:20},
  year         = {2008},
  url          = {https://doi.org/10.1145/1227161.1402294},
  doi          = {10.1145/1227161.1402294},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/BrodalFM08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Fagerberg08,
  author       = {Rolf Fagerberg},
  editor       = {Ming{-}Yang Kao},
  title        = {Cache-Oblivious B-Tree},
  booktitle    = {Encyclopedia of Algorithms - 2008 Edition},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-0-387-30162-4\_61},
  doi          = {10.1007/978-0-387-30162-4\_61},
  timestamp    = {Thu, 27 Jun 2019 16:25:31 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Fagerberg08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Fagerberg08a,
  author       = {Rolf Fagerberg},
  editor       = {Ming{-}Yang Kao},
  title        = {Cache-Oblivious Model},
  booktitle    = {Encyclopedia of Algorithms - 2008 Edition},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-0-387-30162-4\_62},
  doi          = {10.1007/978-0-387-30162-4\_62},
  timestamp    = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Fagerberg08a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Fagerberg08b,
  author       = {Rolf Fagerberg},
  editor       = {Ming{-}Yang Kao},
  title        = {String Sorting},
  booktitle    = {Encyclopedia of Algorithms - 2008 Edition},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-0-387-30162-4\_408},
  doi          = {10.1007/978-0-387-30162-4\_408},
  timestamp    = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Fagerberg08b.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BrodalFV07,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Kristoffer Vinther},
  title        = {Engineering a cache-oblivious sorting algorithm},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {12},
  pages        = {2.2:1--2.2:23},
  year         = {2007},
  url          = {https://doi.org/10.1145/1227161.1227164},
  doi          = {10.1145/1227161.1227164},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/BrodalFV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apbc/StissingMPBF07,
  author       = {Martin Stig Stissing and
                  Thomas Mailund and
                  Christian N. S. Pedersen and
                  Gerth St{\o}lting Brodal and
                  Rolf Fagerberg},
  editor       = {David Sankoff and
                  Lusheng Wang and
                  Francis Y. L. Chin},
  title        = {Computing the All-Pairs Quartet Distance on a Set of Evolutionary
                  Trees},
  booktitle    = {Proceedings of 5th Asia-Pacific Bioinformatics Conference, {APBC}
                  2007, 15-17 January 2007, Hong Kong, China},
  series       = {Advances in Bioinformatics and Computational Biology},
  volume       = {5},
  pages        = {91--100},
  publisher    = {Imperial College Press},
  year         = {2007},
  url          = {http://www.comp.nus.edu.sg/\%7Ewongls/psZ/apbc2007/apbc145a.pdf},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/apbc/StissingMPBF07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apbc/StissingPMBF07,
  author       = {Martin Stig Stissing and
                  Christian N. S. Pedersen and
                  Thomas Mailund and
                  Gerth St{\o}lting Brodal and
                  Rolf Fagerberg},
  editor       = {David Sankoff and
                  Lusheng Wang and
                  Francis Y. L. Chin},
  title        = {Computing the Quartet Distance Between Evolutionary Trees of Bounded
                  Degree},
  booktitle    = {Proceedings of 5th Asia-Pacific Bioinformatics Conference, {APBC}
                  2007, 15-17 January 2007, Hong Kong, China},
  series       = {Advances in Bioinformatics and Computational Biology},
  volume       = {5},
  pages        = {101--110},
  publisher    = {Imperial College Press},
  year         = {2007},
  url          = {http://www.comp.nus.edu.sg/\%7Ewongls/psZ/apbc2007/apbc146a.pdf},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/apbc/StissingPMBF07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleFG07,
  author       = {Philip Bille and
                  Rolf Fagerberg and
                  Inge Li G{\o}rtz},
  editor       = {Bin Ma and
                  Kaizhong Zhang},
  title        = {Improved Approximate String Matching and Regular Expression Matching
                  on Ziv-Lempel Compressed Texts},
  booktitle    = {Combinatorial Pattern Matching, 18th Annual Symposium, {CPM} 2007,
                  London, Canada, July 9-11, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4580},
  pages        = {52--62},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-73437-6\_8},
  doi          = {10.1007/978-3-540-73437-6\_8},
  timestamp    = {Mon, 13 Mar 2023 16:58:28 +0100},
  biburl       = {https://dblp.org/rec/conf/cpm/BilleFG07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BrodalFFGIJMM07,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Irene Finocchi and
                  Fabrizio Grandoni and
                  Giuseppe F. Italiano and
                  Allan Gr{\o}nlund J{\o}rgensen and
                  Gabriel Moruz and
                  Thomas M{\o}lhave},
  editor       = {Lars Arge and
                  Michael Hoffmann and
                  Emo Welzl},
  title        = {Optimal Resilient Dynamic Dictionaries},
  booktitle    = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,
                  October 8-10, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4698},
  pages        = {347--358},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-75520-3\_32},
  doi          = {10.1007/978-3-540-75520-3\_32},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/BrodalFFGIJMM07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/BenderBFJV07,
  author       = {Michael A. Bender and
                  Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Riko Jacob and
                  Elias Vicari},
  editor       = {Phillip B. Gibbons and
                  Christian Scheideler},
  title        = {Optimal sparse matrix dense vector multiplication in the I/O-model},
  booktitle    = {{SPAA} 2007: Proceedings of the 19th Annual {ACM} Symposium on Parallelism
                  in Algorithms and Architectures, San Diego, California, USA, June
                  9-11, 2007},
  pages        = {61--70},
  publisher    = {{ACM}},
  year         = {2007},
  url          = {https://doi.org/10.1145/1248377.1248391},
  doi          = {10.1145/1248377.1248391},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/spaa/BenderBFJV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/MailundBFPP06,
  author       = {Thomas Mailund and
                  Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Christian N. S. Pedersen and
                  Derek Phillips},
  title        = {Recrafting the neighbor-joining method},
  journal      = {{BMC} Bioinform.},
  volume       = {7},
  pages        = {29},
  year         = {2006},
  url          = {https://doi.org/10.1186/1471-2105-7-29},
  doi          = {10.1186/1471-2105-7-29},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/bmcbi/MailundBFPP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrodalF06,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg},
  title        = {Cache-oblivious string dictionaries},
  booktitle    = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  pages        = {581--590},
  publisher    = {{ACM} Press},
  year         = {2006},
  url          = {http://dl.acm.org/citation.cfm?id=1109557.1109621},
  timestamp    = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BrodalF06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FagerbergPP06,
  author       = {Rolf Fagerberg and
                  Anna Pagh and
                  Rasmus Pagh},
  editor       = {Bruno Durand and
                  Wolfgang Thomas},
  title        = {External String Sorting: Faster and Cache-Oblivious},
  booktitle    = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
                  Science, Marseille, France, February 23-25, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3884},
  pages        = {68--79},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11672142\_4},
  doi          = {10.1007/11672142\_4},
  timestamp    = {Wed, 19 May 2021 12:05:43 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/FagerbergPP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0609085,
  author       = {Philip Bille and
                  Rolf Fagerberg and
                  Inge Li G{\o}rtz},
  title        = {Improved Approximate String Matching and Regular Expression Matching
                  on Ziv-Lempel Compressed Texts},
  journal      = {CoRR},
  volume       = {abs/cs/0609085},
  year         = {2006},
  url          = {http://arxiv.org/abs/cs/0609085},
  eprinttype    = {arXiv},
  eprint       = {cs/0609085},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0609085.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BrodalFM05,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Gabriel Moruz},
  editor       = {Camil Demetrescu and
                  Robert Sedgewick and
                  Roberto Tamassia},
  title        = {On the Adaptiveness of Quicksort},
  booktitle    = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
                  and the Second Workshop on Analytic Algorithmics and Combinatorics,
                  {ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
  pages        = {130--140},
  publisher    = {{SIAM}},
  year         = {2005},
  url          = {http://www.siam.org/meetings/alenex05/papers/12gbrodal.pdf},
  timestamp    = {Tue, 30 Jan 2007 13:47:28 +0100},
  biburl       = {https://dblp.org/rec/conf/alenex/BrodalFM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ArgeBFL05,
  author       = {Lars Arge and
                  Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Morten Laustsen},
  editor       = {Joseph S. B. Mitchell and
                  G{\"{u}}nter Rote},
  title        = {Cache-oblivious planar orthogonal range searching and counting},
  booktitle    = {Proceedings of the 21st {ACM} Symposium on Computational Geometry,
                  Pisa, Italy, June 6-8, 2005},
  pages        = {160--169},
  publisher    = {{ACM}},
  year         = {2005},
  url          = {https://doi.org/10.1145/1064092.1064119},
  doi          = {10.1145/1064092.1064119},
  timestamp    = {Mon, 14 Jun 2021 16:24:54 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/ArgeBFL05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BrodalFM05,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Gabriel Moruz},
  editor       = {Lu{\'{\i}}s Caires and
                  Giuseppe F. Italiano and
                  Lu{\'{\i}}s Monteiro and
                  Catuscia Palamidessi and
                  Moti Yung},
  title        = {Cache-Aware and Cache-Oblivious Adaptive Sorting},
  booktitle    = {Automata, Languages and Programming, 32nd International Colloquium,
                  {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3580},
  pages        = {576--588},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11523468\_47},
  doi          = {10.1007/11523468\_47},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/BrodalFM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrodalFP03,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Christian N. S. Pedersen},
  title        = {Computing the Quartet Distance between Evolutionary Trees in Time
                  O(n log n)},
  journal      = {Algorithmica},
  volume       = {38},
  number       = {2},
  pages        = {377--395},
  year         = {2004},
  url          = {https://doi.org/10.1007/s00453-003-1065-y},
  doi          = {10.1007/S00453-003-1065-Y},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BrodalFP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BrodalFV04,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Kristoffer Vinther},
  editor       = {Lars Arge and
                  Giuseppe F. Italiano and
                  Robert Sedgewick},
  title        = {Engineering a Cache-Oblivious Sorting Algorith},
  booktitle    = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
                  and the First Workshop on Analytic Algorithmics and Combinatorics,
                  New Orleans, LA, USA, January 10, 2004},
  pages        = {4--17},
  publisher    = {{SIAM}},
  year         = {2004},
  timestamp    = {Thu, 03 Mar 2005 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/alenex/BrodalFV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrodalFMZ04,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Ulrich Meyer and
                  Norbert Zeh},
  editor       = {Torben Hagerup and
                  Jyrki Katajainen},
  title        = {Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First
                  Search and Shortest Paths},
  booktitle    = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
                  Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3111},
  pages        = {480--492},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-27810-8\_41},
  doi          = {10.1007/978-3-540-27810-8\_41},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/BrodalFMZ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/AnderssonFL04,
  author       = {Arne Andersson and
                  Rolf Fagerberg and
                  Kim S. Larsen},
  editor       = {Dinesh P. Mehta and
                  Sartaj Sahni},
  title        = {Balanced Binary Search Trees},
  booktitle    = {Handbook of Data Structures and Applications},
  publisher    = {Chapman and Hall/CRC},
  year         = {2004},
  url          = {https://doi.org/10.1201/9781420035179.ch10},
  doi          = {10.1201/9781420035179.CH10},
  timestamp    = {Thu, 19 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/reference/crc/AnderssonFL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/ArgeBF04,
  author       = {Lars Arge and
                  Gerth St{\o}lting Brodal and
                  Rolf Fagerberg},
  editor       = {Dinesh P. Mehta and
                  Sartaj Sahni},
  title        = {Cache-Oblivious Data Structures},
  booktitle    = {Handbook of Data Structures and Applications},
  publisher    = {Chapman and Hall/CRC},
  year         = {2004},
  url          = {https://doi.org/10.1201/9781420035179.ch34},
  doi          = {10.1201/9781420035179.CH34},
  timestamp    = {Thu, 19 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/reference/crc/ArgeBF04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BenderBFGHHIL03,
  author       = {Michael A. Bender and
                  Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Dongdong Ge and
                  Simai He and
                  Haodong Hu and
                  John Iacono and
                  Alejandro L{\'{o}}pez{-}Ortiz},
  title        = {The Cost of Cache-Oblivious Searching},
  booktitle    = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
                  October 2003, Cambridge, MA, USA, Proceedings},
  pages        = {271--282},
  publisher    = {{IEEE} Computer Society},
  year         = {2003},
  url          = {https://doi.org/10.1109/SFCS.2003.1238201},
  doi          = {10.1109/SFCS.2003.1238201},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BenderBFGHHIL03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrodalF03,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg},
  title        = {Lower bounds for external memory dictionaries},
  booktitle    = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
  pages        = {546--554},
  publisher    = {{ACM/SIAM}},
  year         = {2003},
  url          = {http://dl.acm.org/citation.cfm?id=644108.644201},
  timestamp    = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BrodalF03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrodalF03,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg},
  editor       = {Lawrence L. Larmore and
                  Michel X. Goemans},
  title        = {On the limits of cache-obliviousness},
  booktitle    = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
                  June 9-11, 2003, San Diego, CA, {USA}},
  pages        = {307--315},
  publisher    = {{ACM}},
  year         = {2003},
  url          = {https://doi.org/10.1145/780542.780589},
  doi          = {10.1145/780542.780589},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/BrodalF03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/BrodalFOPR03,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Anna {\"{O}}stlin and
                  Christian N. S. Pedersen and
                  S. Srinivasa Rao},
  editor       = {Gary Benson and
                  Roderic D. M. Page},
  title        = {Computing Refined Buneman Trees in Cubic Time},
  booktitle    = {Algorithms in Bioinformatics, Third International Workshop, {WABI}
                  2003, Budapest, Hungary, September 15-20, 2003, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2812},
  pages        = {259--270},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/978-3-540-39763-2\_20},
  doi          = {10.1007/978-3-540-39763-2\_20},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wabi/BrodalFOPR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BrodalF02,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg},
  editor       = {Peter Widmayer and
                  Francisco Triguero Ruiz and
                  Rafael Morales Bueno and
                  Matthew Hennessy and
                  Stephan J. Eidenbenz and
                  Ricardo Conejo},
  title        = {Cache Oblivious Distribution Sweeping},
  booktitle    = {Automata, Languages and Programming, 29th International Colloquium,
                  {ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2380},
  pages        = {426--438},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45465-9\_37},
  doi          = {10.1007/3-540-45465-9\_37},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/BrodalF02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BrodalF02,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg},
  editor       = {Prosenjit Bose and
                  Pat Morin},
  title        = {Funnel Heap - {A} Cache Oblivious Priority Queue},
  booktitle    = {Algorithms and Computation, 13th International Symposium, {ISAAC}
                  2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2518},
  pages        = {219--228},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-36136-7\_20},
  doi          = {10.1007/3-540-36136-7\_20},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/BrodalF02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrodalFJ02,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Riko Jacob},
  editor       = {David Eppstein},
  title        = {Cache oblivious search trees via binary trees of small height},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {39--48},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545386},
  timestamp    = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BrodalFJ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BrodalFPO01,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Christian N. S. Pedersen and
                  Anna {\"{O}}stlin},
  editor       = {Fernando Orejas and
                  Paul G. Spirakis and
                  Jan van Leeuwen},
  title        = {The Complexity of Constructing Evolutionary Trees Using Experiments},
  booktitle    = {Automata, Languages and Programming, 28th International Colloquium,
                  {ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2076},
  pages        = {140--151},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-48224-5\_12},
  doi          = {10.1007/3-540-48224-5\_12},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/BrodalFPO01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BrodalFP01,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Christian N. S. Pedersen},
  editor       = {Peter Eades and
                  Tadao Takaoka},
  title        = {Computing the Quartet Distance between Evolutionary Trees in Time
                  O(n log\({}^{\mbox{2}}\) n)},
  booktitle    = {Algorithms and Computation, 12th International Symposium, {ISAAC}
                  2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2223},
  pages        = {731--742},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45678-3\_62},
  doi          = {10.1007/3-540-45678-3\_62},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/BrodalFP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/FagerbergJL01,
  author       = {Rolf Fagerberg and
                  Rune E. Jensen and
                  Kim S. Larsen},
  editor       = {Frank K. H. A. Dehne and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Roberto Tamassia},
  title        = {Search Trees with Relaxed Balance and Near-Optimal Height},
  booktitle    = {Algorithms and Data Structures, 7th International Workshop, {WADS}
                  2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2125},
  pages        = {414--425},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-44634-6\_38},
  doi          = {10.1007/3-540-44634-6\_38},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/FagerbergJL01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Fagerberg99,
  author       = {Rolf Fagerberg},
  editor       = {C. Pandu Rangan and
                  Venkatesh Raman and
                  Ramaswamy Ramanujam},
  title        = {The Complexity of Rebalancing a Binary Search Tree},
  booktitle    = {Foundations of Software Technology and Theoretical Computer Science,
                  19th Conference, Chennai, India, December 13-15, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1738},
  pages        = {72--83},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-46691-6\_6},
  doi          = {10.1007/3-540-46691-6\_6},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/fsttcs/Fagerberg99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BrodalF99,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg},
  editor       = {Frank K. H. A. Dehne and
                  Arvind Gupta and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Roberto Tamassia},
  title        = {Dynamic Representation of Sparse Graphs},
  booktitle    = {Algorithms and Data Structures, 6th International Workshop, {WADS}
                  '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1663},
  pages        = {342--351},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-48447-7\_34},
  doi          = {10.1007/3-540-48447-7\_34},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/BrodalF99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BoyarFL97,
  author       = {Joan Boyar and
                  Rolf Fagerberg and
                  Kim S. Larsen},
  title        = {Amortization Results for Chromatic Search Trees, with an Application
                  to Priority Queues},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {55},
  number       = {3},
  pages        = {504--521},
  year         = {1997},
  url          = {https://doi.org/10.1006/jcss.1997.1511},
  doi          = {10.1006/JCSS.1997.1511},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/BoyarFL97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/LarsenF96,
  author       = {Kim S. Larsen and
                  Rolf Fagerberg},
  title        = {Efficient Rebalancing of B-Trees with Relaxed Balance},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {7},
  number       = {2},
  pages        = {169--186},
  year         = {1996},
  url          = {https://doi.org/10.1142/S0129054196000142},
  doi          = {10.1142/S0129054196000142},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/LarsenF96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fagerberg96,
  author       = {Rolf Fagerberg},
  title        = {A Generalization of Binomial Queues},
  journal      = {Inf. Process. Lett.},
  volume       = {57},
  number       = {2},
  pages        = {109--114},
  year         = {1996},
  url          = {https://doi.org/10.1016/0020-0190(95)00194-8},
  doi          = {10.1016/0020-0190(95)00194-8},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Fagerberg96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Fagerberg96,
  author       = {Rolf Fagerberg},
  editor       = {Rolf G. Karlsson and
                  Andrzej Lingas},
  title        = {Binary Search Trees: How Low Can You Go?},
  booktitle    = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
                  Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1097},
  pages        = {428--439},
  publisher    = {Springer},
  year         = {1996},
  url          = {https://doi.org/10.1007/3-540-61422-2\_151},
  doi          = {10.1007/3-540-61422-2\_151},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/Fagerberg96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/LarsenF95,
  author       = {Kim S. Larsen and
                  Rolf Fagerberg},
  title        = {B-trees with relaxed balance},
  booktitle    = {Proceedings of {IPPS} '95, The 9th International Parallel Processing
                  Symposium, April 25-28, 1995, Santa Barbara, California, {USA}},
  pages        = {196--202},
  publisher    = {{IEEE} Computer Society},
  year         = {1995},
  url          = {https://doi.org/10.1109/IPPS.1995.395932},
  doi          = {10.1109/IPPS.1995.395932},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ipps/LarsenF95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarFL95,
  author       = {Joan Boyar and
                  Rolf Fagerberg and
                  Kim S. Larsen},
  editor       = {Selim G. Akl and
                  Frank K. H. A. Dehne and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Nicola Santoro},
  title        = {Amortization Results for Chromatic Search Trees, with an Application
                  to Priority Queues},
  booktitle    = {Algorithms and Data Structures, 4th International Workshop, {WADS}
                  '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {955},
  pages        = {270--281},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/3-540-60220-8\_69},
  doi          = {10.1007/3-540-60220-8\_69},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/BoyarFL95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics