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-05-01 to 2024-05-01.)
ArticleCitations
Redundancy in distributed proofs8
Phase transition of the 2-Choices dynamics on core–periphery networks5
Time-space trade-offs in population protocols for the majority problem5
The complexity of verifying population protocols5
Optimal extension protocols for byzantine broadcast and agreement5
The consensus number of a cryptocurrency5
Byzantine gathering in polynomial time5
The sum of its parts: Analysis of federated byzantine agreement systems5
Unbeatable consensus4
Fast approximate shortest paths in the congested clique4
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model4
Making Byzantine consensus live4
Concurrent disjoint set union4
Equivalence classes and conditional hardness in massively parallel computations3
A distributed algorithm for directed minimum-weight spanning tree3
Sublinear-time distributed algorithms for detecting small cliques and even cycles3
Property testing of planarity in the CONGEST model3
Genuinely distributed Byzantine machine learning3
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks3
Precision, recall, and sensitivity of monitoring partially synchronous distributed programs3
Asynchronous reconfiguration with Byzantine failures2
Communication complexity of byzantine agreement, revisited2
MinMax algorithms for stabilizing consensus2
Improved distributed $$\Delta $$-coloring2
Composable computation in discrete chemical reaction networks2
Lower bounds for in-network computation of arbitrary functions2
Tractable low-delay atomic memory2
Revisiting asynchronous fault tolerant computation with optimal resilience2
0.014863014221191