List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| A simple dynamic spanner via APSP | 2026-09-29 | Paper |
| Bootstrapping dynamic apsp via sparsification | 2026-08-31 | Paper |
| Expander pruning with polylogarithmic worst-case recourse and update time | 2026-07-13 | Paper |
| Dynamic connectivity with expected polylogarithmic worst-case update time | 2026-07-13 | Paper |
| Parallel and distributed expander decomposition: simple, fast, and near-optimal | 2026-07-03 | Paper |
| Almost-linear time algorithms for decremental graphs: min-cost flow and more via duality | 2026-06-23 | Paper |
| Derandomizing directed random walks in almost-linear time | 2025-08-15 | Paper |
| Incremental SSSP for sparse digraphs beyond the hopset barrier | 2024-07-19 | Paper |
| Resilient Dictionaries for Randomly Unreliable Memory | 2022-05-11 | Paper |
Research outcomes over time
This page was built for person: Simon Meierhans
