Distributed Computing

Papers
(The median citation count of Distributed Computing is 0. 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-05-01 to 2026-05-01.)
ArticleCitations
Cross-chain payment protocols with success guarantees15
Long-lived counters with polylogarithmic amortized step complexity12
Massively parallel algorithms for approximate shortest paths12
Distributed computing with the cloud11
Improved all-pairs approximate shortest paths in congested clique*9
Distributed symmetry breaking on power graphs via sparsification8
Contention resolution with message deadlines8
Early adapting to trends: self-stabilizing information spread using passive communication7
($$\Delta + 1$$) vertex coloring in O(n) communication6
Special issue on PODC 20206
Correction to: Distributed computations in fully-defective networks5
Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case4
Polylogarithmic time algorithms for shortest path forests in programmable matter4
When is recoverable consensus harder than consensus?4
Distributed computations in fully-defective networks4
Efficient bounded timestamping from standard synchronization primitives4
Content-oblivious leader election on rings4
PerformERL: a performance testing framework for erlang4
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks3
A speedup theorem for asynchronous computation with applications to consensus and approximate agreement3
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts3
Near-optimal distributed dominating set in bounded arboricity graphs2
Tight bounds on the message complexity of distributed tree verification2
Four shades of deterministic leader election in anonymous networks2
Deterministic fault-tolerant connectivity labeling scheme2
Improved weighted additive spanners2
Node and edge averaged complexities of local graph problems1
Byzantine-tolerant distributed grow-only sets: specification and applications1
Towards distributed two-stage stochastic optimization1
Asynchronous opinion dynamics in social networks1
Permissionless and asynchronous asset transfer1
Making Byzantine consensus live1
The canonical amoebot model: algorithms and concurrency control1
Efficient computation in congested anonymous dynamic networks1
Near-Optimal Leader Election in Population Protocols on Graphs1
Reaching consensus for asynchronous distributed key generation1
Self-stabilizing MIS computation in the beeping model0
Fast deterministic rendezvous in labeled lines0
Locally checkable problems in rooted trees0
Communication complexity of byzantine agreement, revisited0
Deterministic self-stabilising leader election for programmable matter with constant memory0
On implementing SWMR registers from SWSR registers in systems with Byzantine failures0
Narrowing the LOCAL–CONGEST gaps in sparse networks via expander decompositions0
Connectivity Labeling in Faulty Colored Graphs0
Silent anonymous snap-stabilizing termination detection0
Special issue on DISC 20190
Near-linear time dispersion of mobile agents0
Exponential speedup over locality in MPC with optimal memory0
Linial for lists0
Genuinely distributed Byzantine machine learning0
Stochastic coordination in heterogeneous load balancing systems0
Expected linear round synchronization: the missing link for linear Byzantine SMR0
The splay-list: a distribution-adaptive concurrent skip-list0
Deterministic near-optimal distributed listing of cliques0
Component stability in low-space massively parallel computation0
Constant-round spanners and shortest paths in congested clique and MPC0
Asymmetric distributed trust0
Near-optimal distributed computation of small vertex cuts0
Universal pattern formation by oblivious robots under sequential schedulers0
Gathering teams of bounded memory agents on a line0
On the power of bounded asynchrony: convergence by autonomous robots with limited visibility0
Distributed MIS in O(log log n) Awake Complexity0
Liveness and latency of Byzantine state-machine replication0
The computational power of distributed shared-memory models with bounded-size registers0
Massively parallel computation in a heterogeneous regime0
Special issue on DISC 20200
Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity0
Lower bounds on the state complexity of population protocols0
Time-optimal construction of overlay networks0
Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC0
Termination of amnesiac flooding0
The sum of its parts: Analysis of federated byzantine agreement systems0
Fast and fair randomized wait-free locks0
On the limits of information spread by memory-less agents0
Iterative approximate Byzantine consensus in arbitrary directed graphs0
Special issue on PODC 2021 and DISC 20210
Optimal message-passing with noisy beeps0
Phase transition of the k-majority dynamics in biased communication models0
Communication lower bounds for cryptographic broadcast protocols0
Byzantine consensus is $$\Theta (n^2)$$: the Dolev-Reischuk bound is tight even in partial synchrony!0
A wait-free queue with polylogarithmic step complexity0
0.044351100921631