OOIR: Observatory of International Research

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-03-01 to 2024-03-01.)

Article	Citations
Derandomizing local distributed algorithms under bandwidth restrictions	8
Redundancy in distributed proofs	7
Fooling views: a new lower bound technique for distributed computations under congestion	6
The complexity of verifying population protocols	5
Phase transition of the 2-Choices dynamics on core–periphery networks	5
The sum of its parts: Analysis of federated byzantine agreement systems	5
Time-space trade-offs in population protocols for the majority problem	5
Optimal extension protocols for byzantine broadcast and agreement	4
Unbeatable consensus	4
Concurrent disjoint set union	4
Byzantine gathering in polynomial time	4
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model	4
Fast approximate shortest paths in the congested clique	4
The consensus number of a cryptocurrency	4
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks	3
Equivalence classes and conditional hardness in massively parallel computations	3
Property testing of planarity in the CONGEST model	3
A distributed algorithm for directed minimum-weight spanning tree	3
Precision, recall, and sensitivity of monitoring partially synchronous distributed programs	3
Genuinely distributed Byzantine machine learning	2
Making Byzantine consensus live	2
Lower bounds for in-network computation of arbitrary functions	2
Sublinear-time distributed algorithms for detecting small cliques and even cycles	2
Composable computation in discrete chemical reaction networks	2
Improved distributed $$\Delta $$-coloring	2

Tractable low-delay atomic memory	2
MinMax algorithms for stabilizing consensus	2
Almost global problems in the LOCAL model	1
Windowed backoff algorithms for WiFi: theory and performance under batched arrivals	1
On atomic registers and randomized consensus in M&M systems	1
Optimistically tuning synchronous byzantine consensus: another win for null messages	1
Phase transition of the k-majority dynamics in biased communication models	1
Expected linear round synchronization: the missing link for linear Byzantine SMR	1
Asynchronous reconfiguration with Byzantine failures	1
Improved weighted additive spanners	1
Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity	1
Single-source shortest paths in the CONGEST model with improved bounds	1
Distributed bare-bones communication in wireless networks	1
Low-Congestion shortcuts without embedding	1
Revisiting asynchronous fault tolerant computation with optimal resilience	1
Extending the wait-free hierarchy to multi-threaded systems	1
Dynamic scheduling in distributed transactional memory	1
Time-optimal construction of overlay networks	1
Optimal distributed covering algorithms	1
Distributed computation and reconfiguration in actively dynamic networks	1
Communication complexity of byzantine agreement, revisited	1
PerformERL: a performance testing framework for erlang	1
Linial for lists	1
Cross-chain payment protocols with success guarantees	1
Synthesizing optimal bias in randomized self-stabilization	1
The splay-list: a distribution-adaptive concurrent skip-list	1
Fault-tolerant simulation of population protocols	1