Tootfinder

Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
Yuichi Sudo
https://arxiv.org/abs/2505.23649 …

Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
We study the self-stabilizing leader election (SS-LE) problem in the population protocol model, assuming exact knowledge of the population size $n$. Burman, Chen, Chen, Doty, Nowak, Severson, and Xu (PODC 2021) showed that this problem can be solved in $O(n)$ expected time with $O(n)$ states. Recently, Gąsieniec, Grodzicki, and Stachowiak (PODC 2025) proved that $n+O(\log n)$ states suffice to achieve $O(n \log n)$ time both in expectation and with high probability (w.h.p.). If substantially m…

Be (5) Yourself
- released in 2021, but coming to Bandcamp for the first time -
#HammondB3
https://muz4now.bandcamp.com/album/be-5-yourself

Die USA ersetzen https://www.german-foreign-policy.com/news/detail/9923

This https://arxiv.org/abs/2402.13117 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCG_…

Faster, Deterministic and Space Efficient Subtrajectory Clustering
Given a trajectory $T$ and a distance $Δ$, we wish to find a set $C$ of curves of complexity at most $\ell$, such that we can cover $T$ with subcurves that each are within Fréchet distance $Δ$ to at least one curve in $C$. We call $C$ an $(\ell,Δ)$-clustering and aim to find an $(\ell,Δ)$-clustering of minimum cardinality. This problem variant was introduced by Akitaya $et$ $al.$ (2021) and shown to be NP-complete. The main focus has therefore been on bicriteria approximation algorithms, a…