Author

Gernot Zöcklein

h-index 1 View on Semantic Scholar

We have 3 of 7 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Low-Stretch Spanning Trees via Smoothed Analysis of Dijkstra's Algorithm

Given an undirected weighted graph $G$, a $\gamma$-approximate low-stretch spanning tree (LSST) $T \subseteq G$ is a tree that approximates the distance metric of $G$ up to a $\gamma$-factor in expectation. Currently, existing algorithms to find a provably good LSST carefully construct an approximate shortest-path tree...

Ioannis Dorkofikis, Bernhard Haeupler, Maximilian Probst Gutenberg et al. · 0 citations

Jul 2026

An Online Sparsification Algorithm from the Book

The original online leverage-score sampling algorithm is indeed robust to adaptive adversaries and is given the first online sparsification algorithm for adaptive streams that yields a sparsifier of near-optimal size $O(d \varepsilon^{-2}\log^2 d)$ whose working memory is proportional to the size of the sparsifier.

Gramoz Goranci, Rasmus Kyng, Maximilian Probst Gutenberg et al. · arXiv.org · 1 citation

Preprint Aug 2026

Partially-Dynamic All-Pairs Maxflow and Effective Resistance via Stable Sparsifiers

A randomized data structure for undirected weighted graphs that are partially dynamic, i.e., that undergo either only edge insertions or only edge deletions is given, which follows from a simple stability principle for partially dynamic graphs.

Gramoz Goranci, Rasmus Kyng, Maximilian Probst Gutenberg et al. · 0 citations