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-08-01 to 2025-08-01.)
ArticleCitations
Last-use opacity: a strong safety property for transactional memory with prerelease support10
Special issue on PODC 201910
Cross-chain payment protocols with success guarantees9
Extending the wait-free hierarchy to multi-threaded systems8
Distributed computing with the cloud7
Massively parallel algorithms for approximate shortest paths7
Contention resolution with message deadlines7
Long-lived counters with polylogarithmic amortized step complexity7
Early adapting to trends: self-stabilizing information spread using passive communication6
Distributed backup placement6
Distributed symmetry breaking on power graphs via sparsification6
Special issue on PODC 20205
($$\Delta + 1$$) vertex coloring in O(n) communication5
Equivalence classes and conditional hardness in massively parallel computations4
Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case4
Correction to: Distributed computations in fully-defective networks4
Dynamic scheduling in distributed transactional memory4
Strong eventual consistency of the collaborative editing framework WOOT3
On atomic registers and randomized consensus in M&M systems3
Distributed bare-bones communication in wireless networks3
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts3
Distributed computations in fully-defective networks3
PerformERL: a performance testing framework for erlang3
Deterministic fault-tolerant connectivity labeling scheme2
Improved weighted additive spanners2
Low-congestion shortcut and graph parameters2
Correction to: The consensus number of a cryptocurrency2
Revisiting asynchronous fault tolerant computation with optimal resilience2
Near-optimal distributed dominating set in bounded arboricity graphs2
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks2
When is recoverable consensus harder than consensus?2
Tight bounds on the message complexity of distributed tree verification2
Four shades of deterministic leader election in anonymous networks2
A speedup theorem for asynchronous computation with applications to consensus and approximate agreement2
Efficient bounded timestamping from standard synchronization primitives2
Windowed backoff algorithms for WiFi: theory and performance under batched arrivals1
The canonical amoebot model: algorithms and concurrency control1
A wait-free queue with polylogarithmic step complexity1
Reaching consensus for asynchronous distributed key generation1
Making Byzantine consensus live1
Efficient computation in congested anonymous dynamic networks1
Asynchronous opinion dynamics in social networks1
Stochastic coordination in heterogeneous load balancing systems1
Towards distributed two-stage stochastic optimization1
Byzantine gathering in polynomial time1
Near-Optimal Leader Election in Population Protocols on Graphs1
TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications1
Node and edge averaged complexities of local graph problems1
Permissionless and asynchronous asset transfer1
0.015347003936768