E-Journal SPRINGER

Anno: 2021A distributed algorithm for directed minimum–weight spanning tree ; 2021
Optimistically tuning synchronous byzantine consensus: another win for null messages ; 2021
Optimal distributed covering algorithms ; 2021
Multi–shot distributed transaction commit ; 2021
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model ; 2021
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions ; 2021, Vol. 34, n. 1
Property testing of planarity in the CONGEST model ; 2021, Vol. 34, n. 1, pp. 15-32
Tractable low–delay atomic memory ; 2021, Vol. 34, n. 1, pp. 33-58
Optimal extension protocols for byzantine broadcast and agreement ; 2021, Vol. 34, n. 1, pp. 59-77
Low–Congestion shortcuts without embedding ; 2021, Vol. 34, n. 1, pp. 79-90
Time–space trade–offs in population protocols for the majority problem ; 2021, Vol. 34, n. 2, pp. 91-111
Redundancy in distributed proofs ; 2021, Vol. 34, n. 2, pp. 113-132
The complexity of verifying population protocols ; 2021, Vol. 34, n. 2, pp. 133-177
Lower bounds for in–network computation of arbitrary functions ; 2021, Vol. 34, n. 3, pp. 181-193
MinMax algorithms for stabilizing consensus ; 2021, Vol. 34, n. 3, pp. 195-206
Phase transition of the 2–Choices dynamics on core–periphery networks ; 2021, Vol. 34, n. 3, pp. 207-225