2 papers
cs.DC2026
Solvability of Approximate Agreement on Graphs and Simplicial Complexes
Joel Rybicki, Yaroslav Verbitsky
Approximate agreement tasks on graphs are discrete relaxations of consensus, where each process in a distributed system is given as input a vertex on a graph , and processes hav…
cs.DC2026
What can be computed in average anonymous networks?
Joel Rybicki, Oleg Verbitsky, Maksim Zhukovskii
We study what deterministic distributed algorithms can compute on random input graphs in extremely weak models of distributed computing: all nodes are anonymous, and in each commun…