ACM Symposium on Discrete Algorithms, SODA 2016


Article Details
Title: How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness
Article URLs:
Alternative Article URLs:
Authors: Michael A. Bender
  • Stony Brook University, Stony Brook, NY 11794-2424, USA, Department of Computer Science
Jeremy T. Fineman
  • Georgetown University, Department of Computer Science
Seth Gilbert
  • National University of Singapore, Singapore, Department of Computer Science
Maxwell Young
  • Mississippi State University, USA, Department of Computer Science
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1114809, 1217708, 1218188, 1314633, 1247726, 1251137, 1408695, 1420911, 1439084, 1318294
DBLP Key: conf/soda/BenderFGY16
Author Comments:

Discuss this paper and its artifacts below