Distributed Computing

Papers
(The TQCC of Distributed Computing is 2. 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.)
ArticleCitations
Derandomizing local distributed algorithms under bandwidth restrictions8
Redundancy in distributed proofs7
Fooling views: a new lower bound technique for distributed computations under congestion6
The sum of its parts: Analysis of federated byzantine agreement systems5
Time-space trade-offs in population protocols for the majority problem5
The complexity of verifying population protocols5
Phase transition of the 2-Choices dynamics on core–periphery networks5
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model4
Fast approximate shortest paths in the congested clique4
The consensus number of a cryptocurrency4
Optimal extension protocols for byzantine broadcast and agreement4
Unbeatable consensus4
Concurrent disjoint set union4
Byzantine gathering in polynomial time4
Equivalence classes and conditional hardness in massively parallel computations3
Property testing of planarity in the CONGEST model3
A distributed algorithm for directed minimum-weight spanning tree3
Precision, recall, and sensitivity of monitoring partially synchronous distributed programs3
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks3
Sublinear-time distributed algorithms for detecting small cliques and even cycles2
Composable computation in discrete chemical reaction networks2
Improved distributed $$\Delta $$-coloring2
Tractable low-delay atomic memory2
MinMax algorithms for stabilizing consensus2
Genuinely distributed Byzantine machine learning2
Making Byzantine consensus live2
Lower bounds for in-network computation of arbitrary functions2
0.014441967010498