| No. |
Title |
Author |
Year |
| 1 |
An Experimental Study of External Memory Algorithms for Connected Components |
Brodal, Gerth Stølting et al. |
2021 |
| 2 |
Simulating Population Protocols in Sub-Constant Time per Interaction |
Berenbrink, Petra et al. |
2020 |
| 3 |
Data Structures for the Cloud and External Memory Data (Dagstuhl Seminar 19051) |
Brodal, Gerth Stølting et al. |
2019 |
| 4 |
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs |
Bläsius, Thomas et al. |
2019 |
| 5 |
Fragile Complexity of Comparison-Based Algorithms |
Afshani, Peyman et al. |
2019 |
| 6 |
On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? |
Fagerberg, Rolf et al. |
2019 |
| 7 |
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades |
Carstens, Corrie Jacobien et al. |
2018 |
| 8 |
Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101) |
Lopez-Ortiz, Alejandro et al. |
2016 |
| 9 |
High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461) |
Meyer, Ulrich Carsten et al. |
2015 |
| 10 |
Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 14091) |
López-Ortiz, Alejandro et al. |
2014 |
| 11 |
On Dynamic Breadth-First Search in External-Memory |
Meyer, Ulrich |
2008 |
