Distributed Computing

Papers
(The TQCC of Distributed Computing is 2. 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-06-01 to 2025-06-01.)
ArticleCitations
Special issue on PODC 20199
Long-lived counters with polylogarithmic amortized step complexity7
Last-use opacity: a strong safety property for transactional memory with prerelease support7
Extending the wait-free hierarchy to multi-threaded systems7
Distributed computing with the cloud7
Cross-chain payment protocols with success guarantees7
Early adapting to trends: self-stabilizing information spread using passive communication6
Massively parallel algorithms for approximate shortest paths6
A distributed algorithm for directed minimum-weight spanning tree6
Distributed symmetry breaking on power graphs via sparsification6
Distributed backup placement5
Special issue on PODC 2018 and DISC 20184
($$\Delta + 1$$) vertex coloring in O(n) communication4
Equivalence classes and conditional hardness in massively parallel computations3
Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case3
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts3
Special issue on PODC 20203
Distributed computations in fully-defective networks3
Strong eventual consistency of the collaborative editing framework WOOT3
Correction to: Distributed computations in fully-defective networks3
Dynamic scheduling in distributed transactional memory3
Distributed bare-bones communication in wireless networks3
PerformERL: a performance testing framework for erlang2
Low-congestion shortcut and graph parameters2
Improved weighted additive spanners2
Efficient bounded timestamping from standard synchronization primitives2
A speedup theorem for asynchronous computation with applications to consensus and approximate agreement2
Four shades of deterministic leader election in anonymous networks2
On atomic registers and randomized consensus in M&M systems2
When is recoverable consensus harder than consensus?2
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks2
0.079134941101074