Distributed Computing

Papers
(The median citation count of Distributed Computing is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-05-01 to 2025-05-01.)
ArticleCitations
Special issue on PODC 20199
Long-lived counters with polylogarithmic amortized step complexity7
Extending the wait-free hierarchy to multi-threaded systems7
Last-use opacity: a strong safety property for transactional memory with prerelease support7
Cross-chain payment protocols with success guarantees7
Distributed computing with the cloud6
Massively parallel algorithms for approximate shortest paths6
A distributed algorithm for directed minimum-weight spanning tree6
Distributed backup placement5
Early adapting to trends: self-stabilizing information spread using passive communication5
($$\Delta + 1$$) vertex coloring in O(n) communication5
Special issue on PODC 20204
Special issue on PODC 2018 and DISC 20184
Correction to: Distributed computations in fully-defective networks3
Distributed computations in fully-defective networks3
Equivalence classes and conditional hardness in massively parallel computations3
Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case3
Distributed bare-bones communication in wireless networks3
Dynamic scheduling in distributed transactional memory3
When is recoverable consensus harder than consensus?3
Strong eventual consistency of the collaborative editing framework WOOT3
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts2
Efficient bounded timestamping from standard synchronization primitives2
Improved weighted additive spanners2
On atomic registers and randomized consensus in M&M systems2
Low-congestion shortcut and graph parameters2
Four shades of deterministic leader election in anonymous networks2
PerformERL: a performance testing framework for erlang2
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks2
A speedup theorem for asynchronous computation with applications to consensus and approximate agreement2
Efficient computation in congested anonymous dynamic networks1
Deterministic fault-tolerant connectivity labeling scheme1
Byzantine gathering in polynomial time1
Stochastic coordination in heterogeneous load balancing systems1
Asynchronous opinion dynamics in social networks1
TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications1
Correction to: The consensus number of a cryptocurrency1
Revisiting asynchronous fault tolerant computation with optimal resilience1
Permissionless and asynchronous asset transfer1
Reaching consensus for asynchronous distributed key generation1
The canonical amoebot model: algorithms and concurrency control1
Special issue on DISC 20201
Near-optimal distributed dominating set in bounded arboricity graphs1
Making Byzantine consensus live1
Windowed backoff algorithms for WiFi: theory and performance under batched arrivals1
Node and edge averaged complexities of local graph problems1
A wait-free queue with polylogarithmic step complexity1
Expected linear round synchronization: the missing link for linear Byzantine SMR1
0.011871814727783