Published in: Dagstuhl Reports, Volume 13, Issue 5 (2023)
Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, and Justin Dallant. Scalable Data Structures (Dagstuhl Seminar 23211). In Dagstuhl Reports, Volume 13, Issue 5, pp. 114-135, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Article{brodal_et_al:DagRep.13.5.114, author = {Brodal, Gerth St{\o}lting and Iacono, John and Kozma, L\'{a}szl\'{o} and Ramachandran, Vijaya and Dallant, Justin}, title = {{Scalable Data Structures (Dagstuhl Seminar 23211)}}, pages = {114--135}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2023}, volume = {13}, number = {5}, editor = {Brodal, Gerth St{\o}lting and Iacono, John and Kozma, L\'{a}szl\'{o} and Ramachandran, Vijaya and Dallant, Justin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.5.114}, URN = {urn:nbn:de:0030-drops-193676}, doi = {10.4230/DagRep.13.5.114}, annote = {Keywords: algorithms, big data, computational models, data structures, GPU computing, parallel computation} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Gerth Stølting Brodal and Sebastian Wild. Funnelselect: Cache-Oblivious Multiple Selection. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 25:1-25:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{brodal_et_al:LIPIcs.ESA.2023.25, author = {Brodal, Gerth St{\o}lting and Wild, Sebastian}, title = {{Funnelselect: Cache-Oblivious Multiple Selection}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.25}, URN = {urn:nbn:de:0030-drops-186789}, doi = {10.4230/LIPIcs.ESA.2023.25}, annote = {Keywords: Multiple selection, cache-oblivious algorithm, randomized algorithm, entropy bounds} }
Published in: LIPIcs, Volume 226, 11th International Conference on Fun with Algorithms (FUN 2022)
Gerth Stølting Brodal. Priority Queues with Decreasing Keys. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 8:1-8:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{brodal:LIPIcs.FUN.2022.8, author = {Brodal, Gerth St{\o}lting}, title = {{Priority Queues with Decreasing Keys}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {8:1--8:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.8}, URN = {urn:nbn:de:0030-drops-159787}, doi = {10.4230/LIPIcs.FUN.2022.8}, annote = {Keywords: priority queue, decreasing keys, post-order heap, Dijkstra’s algorithm} }
Published in: Dagstuhl Reports, Volume 11, Issue 1 (2021)
Gerth Stølting Brodal, John Iacono, Markus E. Nebel, and Vijaya Ramachandran. Scalable Data Structures (Dagstuhl Seminar 21071). In Dagstuhl Reports, Volume 11, Issue 1, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Article{brodal_et_al:DagRep.11.1.1, author = {Brodal, Gerth St{\o}lting and Iacono, John and Nebel, Markus E. and Ramachandran, Vijaya}, title = {{Scalable Data Structures (Dagstuhl Seminar 21071)}}, pages = {1--23}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2021}, volume = {11}, number = {1}, editor = {Brodal, Gerth St{\o}lting and Iacono, John and Nebel, Markus E. and Ramachandran, Vijaya}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.1.1}, URN = {urn:nbn:de:0030-drops-143481}, doi = {10.4230/DagRep.11.1.1}, annote = {Keywords: algorithms, big data, data structures, GPU computing, large data sets, models of computation, parallel algorithms} }
Published in: LIPIcs, Volume 190, 19th International Symposium on Experimental Algorithms (SEA 2021)
Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, and Hung Tran. An Experimental Study of External Memory Algorithms for Connected Components. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 23:1-23:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{brodal_et_al:LIPIcs.SEA.2021.23, author = {Brodal, Gerth St{\o}lting and Fagerberg, Rolf and Hammer, David and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung}, title = {{An Experimental Study of External Memory Algorithms for Connected Components}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {23:1--23:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.23}, URN = {urn:nbn:de:0030-drops-137958}, doi = {10.4230/LIPIcs.SEA.2021.23}, annote = {Keywords: Connected Components, Experimental Evaluation, External Memory, Graph Algorithms, Randomization} }
Published in: Dagstuhl Reports, Volume 9, Issue 1 (2019)
Gerth Stølting Brodal, Ulrich Carsten Meyer, Bernhard E. Nebel, and Robert Sedgewick. Data Structures for the Cloud and External Memory Data (Dagstuhl Seminar 19051). In Dagstuhl Reports, Volume 9, Issue 1, pp. 104-124, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@Article{brodal_et_al:DagRep.9.1.104, author = {Brodal, Gerth St{\o}lting and Meyer, Ulrich Carsten and Nebel, Bernhard E. and Sedgewick, Robert}, title = {{Data Structures for the Cloud and External Memory Data (Dagstuhl Seminar 19051)}}, pages = {104--124}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2019}, volume = {9}, number = {1}, editor = {Brodal, Gerth St{\o}lting and Meyer, Ulrich Carsten and Nebel, Bernhard E. and Sedgewick, Robert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.9.1.104}, URN = {urn:nbn:de:0030-drops-105722}, doi = {10.4230/DagRep.9.1.104}, annote = {Keywords: algorithms, big data, cloud computing, data structures, external memory methods, large data sets, web-scale} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Edvin Berglin and Gerth Stølting Brodal. A Simple Greedy Algorithm for Dynamic Graph Orientation. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 12:1-12:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{berglin_et_al:LIPIcs.ISAAC.2017.12, author = {Berglin, Edvin and St{\o}lting Brodal, Gerth}, title = {{A Simple Greedy Algorithm for Dynamic Graph Orientation}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {12:1--12:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.12}, URN = {urn:nbn:de:0030-drops-82637}, doi = {10.4230/LIPIcs.ISAAC.2017.12}, annote = {Keywords: Dynamic graph algorithms, graph arboricity, edge orientations} }
Published in: LIPIcs, Volume 87, 25th Annual European Symposium on Algorithms (ESA 2017)
Gerth Stølting Brodal and Konstantinos Mampentzidis. Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{stltingbrodal_et_al:LIPIcs.ESA.2017.21, author = {St{\o}lting Brodal, Gerth and Mampentzidis, Konstantinos}, title = {{Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.21}, URN = {urn:nbn:de:0030-drops-78820}, doi = {10.4230/LIPIcs.ESA.2017.21}, annote = {Keywords: Phylogenetic tree, tree comparison, triplet distance, cache oblivious algorithm} }
Published in: LIPIcs, Volume 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)
Gerth Stølting Brodal. External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 23:1-23:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{brodal:LIPIcs.STACS.2016.23, author = {Brodal, Gerth St{\o}lting}, title = {{External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {23:1--23:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.23}, URN = {urn:nbn:de:0030-drops-57241}, doi = {10.4230/LIPIcs.STACS.2016.23}, annote = {Keywords: External memory, priority search tree, 3-sided range reporting, top-k queries} }
Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Gerth Stølting Brodal and Casper Kejlberg-Rasmussen. Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 112-123, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{stltingbrodal_et_al:LIPIcs.STACS.2012.112, author = {St{\o}lting Brodal, Gerth and Kejlberg-Rasmussen, Casper}, title = {{Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {112--123}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.112}, URN = {urn:nbn:de:0030-drops-34101}, doi = {10.4230/LIPIcs.STACS.2012.112}, annote = {Keywords: working-set property, dictionary, implicit, cache-oblivious, worst-case, external memory, I/O efficient} }
Feedback for Dagstuhl Publishing