暂无分享,去创建一个
[1] Frank Thomson Leighton,et al. Analysis of backoff protocols for multiple access channels , 1987, STOC '87.
[2] Thomas Sauerwald,et al. Balls-into-bins with nearly optimal load distribution , 2013, SPAA.
[3] Stephan Olariu,et al. Uniform leader election protocols for radio networks , 2001, International Conference on Parallel Processing, 2001..
[4] Aravind Srinivasan,et al. Contention resolution with constant expected delay , 2000, JACM.
[5] Dariusz R. Kowalski,et al. On the Wake-Up Problem in Radio Networks , 2005, ICALP.
[6] Michael A. Bender,et al. Contention Resolution with Heterogeneous Job Sizes , 2006, ESA.
[7] Calvin C. Newport,et al. Contention Resolution on a Fading Channel , 2016, PODC.
[8] Artur Czumaj,et al. Multiple-Choice Balanced Allocation in (Almost) Parallel , 2012, APPROX-RANDOM.
[9] Eli Upfal,et al. Efficient schemes for parallel communication , 1982, PODC '82.
[10] Peter March,et al. Stability of binary exponential backoff , 1988, JACM.
[11] Grzegorz Stachowiak,et al. Asynchronous Shared Channel , 2017, PODC.
[12] Christian Scheideler,et al. Competitive and Fair Medium Access Despite Reactive Jamming , 2011, 2011 31st International Conference on Distributed Computing Systems.
[13] Desh Ranjan,et al. Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.
[14] Thomas P. Hayes,et al. The Energy Complexity of Broadcast , 2017, PODC.
[15] Dariusz R. Kowalski,et al. Contention Resolution in a Non-synchronized Multiple Access Channel , 2013, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing.
[16] Alan M. Frieze,et al. On Balls and Bins with Deletions , 1998, RANDOM.
[17] Dariusz R. Kowalski,et al. Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel , 2015, SIAM J. Comput..
[18] Christian Scheideler,et al. A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks , 2010, DISC.
[19] Michael A. Bender,et al. Contention resolution with log-logstar channel accesses , 2016, STOC.
[20] Eli Upfal,et al. Stochastic contention resolution with short delays , 1995, STOC '95.
[21] Jim Kurose,et al. Computer Networking: A Top-Down Approach , 1999 .
[22] Dariusz R. Kowalski,et al. Scalable wake-up of multi-channel single-hop radio networks , 2016, Theor. Comput. Sci..
[23] Thanasis Tsantilas,et al. Efficient optical communication in parallel computers , 1992, SPAA '92.
[24] Antonio Fernández,et al. Unbounded Contention Resolution in Multiple-Access Channels , 2011, PODC '11.
[25] Leslie Ann Goldberg,et al. Analysis of practical backoff protocols for contention resolution with multiple servers , 1996, SODA '96.
[26] Robert Metcalfe,et al. Ethernet: distributed packet switching for local computer networks , 1976, CACM.
[27] Christian Scheideler,et al. Competitive and fair throughput for co-existing networks under adversarial interference , 2012, PODC '12.
[28] Tomasz Jurdzinski,et al. The Cost of Synchronizing Multiple-Access Channels , 2015, PODC.
[29] Frank Thomson Leighton,et al. Analysis of Backoff Protocols for Multiple Access Channels , 1996, SIAM J. Comput..
[30] Ruosong Wang,et al. Exponential separations in the energy complexity of leader election , 2016, STOC.
[31] Dariusz R. Kowalski,et al. A better wake-up in radio networks , 2004, PODC '04.
[32] Berthold Vöcking,et al. How asymmetry helps load balancing , 1999, JACM.
[33] Eli Upfal,et al. Balanced Allocations , 1999, SIAM J. Comput..
[34] Xinghua Sun,et al. Backoff Design for IEEE 802.11 DCF Networks: Fundamental Tradeoff and Design Criterion , 2015, IEEE/ACM Transactions on Networking.
[35] Christian Scheideler,et al. Sade: competitive MAC under adversarial SINR , 2018, Distributed Computing.
[36] Berthold Vöcking,et al. Balanced allocations: the heavily loaded case , 2000, STOC '00.
[37] Michael A. Bender,et al. How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness , 2016, SODA.
[38] Charles E. Leiserson,et al. Randomized Routing on Fat-Trees , 1989, Adv. Comput. Res..
[39] Marek Chrobak,et al. The wake-up problem in multi-hop radio networks , 2004, SODA '04.
[40] Artur Czumaj,et al. Randomized allocation processes , 2001, Random Struct. Algorithms.
[41] Ramesh K. Sitaraman,et al. The power of two random choices: a survey of tech-niques and results , 2001 .
[42] Eli Upfal,et al. Parallel hashing: an efficient implementation of shared memory , 1988, JACM.
[43] Calvin C. Newport,et al. Contention Resolution on Multiple Channels with Collision Detection , 2016, PODC.
[44] Eli Upfal,et al. Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .
[45] Michael A. Bender,et al. Adversarial contention resolution for simple channels , 2005, SPAA '05.
[46] Michael Mitzenmacher,et al. The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..
[47] Dan E. Willard,et al. Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel , 1986, SIAM J. Comput..
[48] Dariusz R. Kowalski,et al. Medium Access Control for Adversarial Channels with Jamming , 2011, SIROCCO.
[49] Kannan Ramchandran,et al. Fast and robust compressive phase retrieval with sparse-graph codes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[50] Christian Scheideler,et al. A jamming-resistant MAC protocol for single-hop wireless networks , 2008, PODC '08.
[51] Alessandro Panconesi,et al. Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .