Publications

Found 12 results
Author Title Type [ Year(Desc)]
Filters: Author is John W. Byers  [Clear All Filters]
1995
Adler, M., Byers J. W., & Karp R. M. (1995).  Parallel Sorting With Limited Bandwidth.
Adler, M., Byers J. W., & Karp R. M. (1995).  Parallel sorting with limited bandwidth. Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '95). 129-136.
Adler, M., Byers J. W., & Karp R. M. (1995).  Scheduling Parallel Communication: The h-Relation Problem.
Adler, M., Byers J. W., & Karp R. M. (1995).  Scheduling parallel communication: the h-relation problem. Proceedings of the 20th International Mathematical Foundations of Computer Science Symposium, (MFCS '95). 1-20.
1997
Adler, M., Bartal Y., Byers J. W., Luby M., & Raz D. (1997).  A Modular Analysis of Network Transmission Protocols.
1998
Byers, J. W., Luby M., Mitzenmacher M., & Rege A. (1998).  Digital Fountain Approach to Reliable Distribution of Bulk Data.
Byers, J. W., Luby M., Mitzenmacher M., & Rege A. (1998).  A Digital Fountain Approach to Reliable Distribution of Bulk Data.
Byers, J. W. (1998).  Maximizing Throughput of Reliable Bulk Network Transmissions.
2000
Adler, M., Byers J. W., & Karp R. M. (2000).  Parallel Sorting with Limited Bandwidth. 29(6), 1997-2015.
2001
Medina, A., Lakhina A., Matta I., & Byers J. W. (2001).  BRITE: An Approach to Universal Topology Generation. Proceedings of MASCOTS 2001.
Medina, A., Lakhina A., Matta I., & Byers J. W. (2001).  BRITE: Universal Topology Generation From a User's Perspective.
2019
Byers, J. W., Luby M., & Mitzenmacher M. (2019).  A digital fountain retrospective. ACM SIGCOMM Computer Communication Review. 49(5), 82-85.