Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Fast Deterministic Distributed Degree Splitting
Yannic Maus, Alexandre Nolin, Florian Schager
We obtain better algorithms for computing more balanced orientations and degree splits in LOCAL. Important to our result is a connection to the hypergraph sinkless orientation prob…
cs.DS2024
Content-Oblivious Leader Election on Rings
Fabian Frei, Ran Gelles, Ahmed Ghazy +1
In content-oblivious computation, n nodes wish to compute a given task over an asynchronous network that suffers from an extremely harsh type of noise, which corrupts the content o…