Author of the publication

Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness.

, , , and . J. ACM, 66 (1): 6:1-6:33 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Slow Links, Fast Links, and the Cost of Gossip., , and . IEEE Trans. Parallel Distributed Syst., 30 (9): 2130-2147 (2019)Robust Overlays Meet Blockchains - On Handling High Churn and Catastrophic Failures., , and . SSS, volume 14310 of Lecture Notes in Computer Science, page 191-206. Springer, (2023)Latency, Capacity, and Distributed MST., , , , and . CoRR, (2019)A Survey on Adversarial Contention Resolution., , , and . CoRR, (2024)Partial synchrony for free? New bounds for Byzantine agreement via a generic transformation across network models., , , , , , and . CoRR, (2024)How fast can you update your MST? (Dynamic algorithms for cluster computing)., and . CoRR, (2020)On the Validity of Consensus., , , , and . PODC, page 332-343. ACM, (2023)Polygraph: Accountable Byzantine Agreement., , and . ICDCS, page 403-413. IEEE, (2021)Crime and Punishment in Distributed Byzantine Decision Tasks., , , , , , and . ICDCS, page 34-44. IEEE, (2022)Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony!, , , , , , and . DISC, volume 246 of LIPIcs, page 14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)