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-02-01 to 2025-02-01.)
ArticleCitations
Distributed computation with continual population growth7
Strong eventual consistency of the collaborative editing framework WOOT7
Cross-chain payment protocols with success guarantees6
Special issue on PODC 20196
Phase transition of the k-majority dynamics in biased communication models6
Extending the wait-free hierarchy to multi-threaded systems6
Last-use opacity: a strong safety property for transactional memory with prerelease support5
Lower bounds for in-network computation of arbitrary functions5
MinMax algorithms for stabilizing consensus5
Revisiting asynchronous fault tolerant computation with optimal resilience5
Precision, recall, and sensitivity of monitoring partially synchronous distributed programs4
Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case4
Termination of amnesiac flooding4
Fast and fair randomized wait-free locks3
Permissionless and asynchronous asset transfer3
Making Byzantine consensus live3
Optimistically tuning synchronous byzantine consensus: another win for null messages3
Linial for lists3
Byzantine gathering in polynomial time3
Lower bounds on the state complexity of population protocols3
Distributed computations in fully-defective networks3
Long-lived counters with polylogarithmic amortized step complexity3
Communication complexity of byzantine agreement, revisited2
Windowed backoff algorithms for WiFi: theory and performance under batched arrivals2
Distributed bare-bones communication in wireless networks2
On atomic registers and randomized consensus in M&M systems2
Component stability in low-space massively parallel computation2
Distributed computing with the cloud2
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts2
Liveness and latency of Byzantine state-machine replication2
Phase transition of the 2-Choices dynamics on core–periphery networks1
A distributed algorithm for directed minimum-weight spanning tree1
PerformERL: a performance testing framework for erlang1
Distributed computation and reconfiguration in actively dynamic networks1
Asynchronous opinion dynamics in social networks1
Deterministic near-optimal distributed listing of cliques1
Single-source shortest paths in the CONGEST model with improved bounds1
The canonical amoebot model: algorithms and concurrency control1
Asymmetric distributed trust1
Reaching consensus for asynchronous distributed key generation1
Early adapting to trends: self-stabilizing information spread using passive communication1
Sublinear-time distributed algorithms for detecting small cliques and even cycles1
On the power of bounded asynchrony: convergence by autonomous robots with limited visibility1
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks1
Low-congestion shortcut and graph parameters1
Communication lower bounds for cryptographic broadcast protocols1
Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC1
Multi-shot distributed transaction commit1
Concurrent disjoint set union1
Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity1
0.073111057281494