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 2020-11-01 to 2024-11-01.)
ArticleCitations
The consensus number of a cryptocurrency7
Sublinear-time distributed algorithms for detecting small cliques and even cycles7
Making Byzantine consensus live6
Concurrent disjoint set union6
Single-source shortest paths in the CONGEST model with improved bounds6
The complexity of verifying population protocols5
Byzantine gathering in polynomial time5
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model5
The sum of its parts: Analysis of federated byzantine agreement systems5
Phase transition of the 2-Choices dynamics on core–periphery networks5
Genuinely distributed Byzantine machine learning4
Communication complexity of byzantine agreement, revisited4
Unbeatable consensus4
Equivalence classes and conditional hardness in massively parallel computations3
Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity3
MinMax algorithms for stabilizing consensus3
The canonical amoebot model: algorithms and concurrency control3
Linial for lists3
Phase transition of the k-majority dynamics in biased communication models3
A distributed algorithm for directed minimum-weight spanning tree3
Precision, recall, and sensitivity of monitoring partially synchronous distributed programs3
Improved distributed $$\Delta $$-coloring2
Lower bounds for in-network computation of arbitrary functions2
Asynchronous reconfiguration with Byzantine failures2
Distributed computing with the cloud2
Revisiting asynchronous fault tolerant computation with optimal resilience2
Dynamic scheduling in distributed transactional memory2
Last-use opacity: a strong safety property for transactional memory with prerelease support2
Cross-chain payment protocols with success guarantees2
Expected linear round synchronization: the missing link for linear Byzantine SMR1
Synthesizing optimal bias in randomized self-stabilization1
Improved weighted additive spanners1
Node and edge averaged complexities of local graph problems1
Distributed bare-bones communication in wireless networks1
Long-lived counters with polylogarithmic amortized step complexity1
Distributed computations in fully-defective networks1
Byzantine consensus is $$\Theta (n^2)$$: the Dolev-Reischuk bound is tight even in partial synchrony!1
Time-optimal construction of overlay networks1
Optimal distributed covering algorithms1
Multi-shot distributed transaction commit1
PerformERL: a performance testing framework for erlang1
Optimistically tuning synchronous byzantine consensus: another win for null messages1
Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case1
Correction to: The consensus number of a cryptocurrency1
The splay-list: a distribution-adaptive concurrent skip-list1
Distributed computation and reconfiguration in actively dynamic networks1
Windowed backoff algorithms for WiFi: theory and performance under batched arrivals1
On atomic registers and randomized consensus in M&M systems1
Extending the wait-free hierarchy to multi-threaded systems1
Distributed computation with continual population growth1
0.044940948486328