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 2022-01-01 to 2026-01-01.)
ArticleCitations
Last-use opacity: a strong safety property for transactional memory with prerelease support12
Extending the wait-free hierarchy to multi-threaded systems12
Long-lived counters with polylogarithmic amortized step complexity9
Cross-chain payment protocols with success guarantees9
Contention resolution with message deadlines8
Massively parallel algorithms for approximate shortest paths8
Distributed symmetry breaking on power graphs via sparsification8
Distributed computing with the cloud8
Early adapting to trends: self-stabilizing information spread using passive communication7
($$\Delta + 1$$) vertex coloring in O(n) communication6
Distributed backup placement6
Special issue on PODC 20205
Equivalence classes and conditional hardness in massively parallel computations4
Strong eventual consistency of the collaborative editing framework WOOT4
Correction to: Distributed computations in fully-defective networks4
Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case4
When is recoverable consensus harder than consensus?3
Efficient bounded timestamping from standard synchronization primitives3
A speedup theorem for asynchronous computation with applications to consensus and approximate agreement3
PerformERL: a performance testing framework for erlang3
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks3
Distributed computations in fully-defective networks3
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts3
Improved weighted additive spanners3
Byzantine gathering in polynomial time2
Correction to: The consensus number of a cryptocurrency2
Four shades of deterministic leader election in anonymous networks2
Revisiting asynchronous fault tolerant computation with optimal resilience2
Deterministic fault-tolerant connectivity labeling scheme2
Tight bounds on the message complexity of distributed tree verification2
Near-optimal distributed dominating set in bounded arboricity graphs2
Permissionless and asynchronous asset transfer1
Node and edge averaged complexities of local graph problems1
Stochastic coordination in heterogeneous load balancing systems1
Towards distributed two-stage stochastic optimization1
Near-Optimal Leader Election in Population Protocols on Graphs1
Reaching consensus for asynchronous distributed key generation1
A wait-free queue with polylogarithmic step complexity1
Making Byzantine consensus live1
Efficient computation in congested anonymous dynamic networks1
Asynchronous opinion dynamics in social networks1
The canonical amoebot model: algorithms and concurrency control1
0.15309619903564