2 problems

Linear-latency contention resolution in the GlobalClock model
GlobalClock contention-resolution conjecture. In the finite setting, there exists a protocol with latency $O(n)$ with high probability against an adaptive adversary. In the unbound…
openFrom paperscontention-resolution distributed-algorithms randomized-algorithms
0 responses
5
Impossibility of distributed algorithms for TP under limited communication constraints
Impossibility claim. Given these communication constraints, there exists no distributed algorithm that can solve TP without further conditions on the sequence of communication grap…
openFrom papersconsensus distributed-algorithms time-varying-digraphs
0 responses
5

Linear-latency contention resolution in the GlobalClock model