Scholars@Duke

• Background
• 

  Education, Training, & Certifications

  • Ph.D., Massachusetts Institute of Technology 1989
• 

  Previous Appointments & Affiliations

  • Professor in the Department of Electrical and Computer Engineering, Electrical and Computer Engineering, Pratt School of Engineering 2013 - 2022
  • Visiting Professor in Computer Science, Computer Science, Trinity College of Arts & Sciences 2007 - 2009
• Recognition
• 

  In the News

  • APR 13, 2022

    Web Surfing That Feels Instantaneous, Even Though It’s Not

  • DEC 5, 2018

    Bruce Maggs Elected Fellow of Association for Computing Machinery
• Research
• 

  Selected Grants

  • AI Institute: Athena: AI-Driven Next-generation Networks at the Edge awarded by  National Science Foundation 2021 - 2026
  • CNS Core:Small: Optimizing IP Anycast Performance at Scale awarded by  National Science Foundation 2022 - 2025
  • NeTS: Medium: Collaborative Research: The Internet at the Speed of Light awarded by  National Science Foundation 2018 - 2022
  • CNS Core: Large: Collaborative Research: Towards an Evolvable Public Key Infrastructure awarded by  National Science Foundation 2019 - 2022
  • AitF: FULL: Collaborative Research: Optimizing Networked Systems with Limited Information awarded by  National Science Foundation 2015 - 2020
  • NeTS: Small: Collaborative Research: Studying Internet Interconnections in the Era of Cloud Computing awarded by  National Science Foundation 2017 - 2020
  • EAGER: Cybermanufacturing: Design of an Agile and Smart Manufacturing Exchange: Enabling Small Businesses through Standardized Protocols and Distributed Optimization awarded by  National Science Foundation 2015 - 2018
  • Geolocation on a Global Scale (year 3 funding) awarded by Air Force Research Laboratory 2014 - 2017
  • FIA-NP: Collaborative Research: Deployment-Driven Evaluation and Evolution of the eXpressive Internet Architecture awarded by  National Science Foundation 2014 - 2017
• 

  External Relationships

  • Akamai Technologies
  • Emerald Innovations
  • bloXroute Labs
• Publications & Artistic Works
• 

  Selected Publications

  • Academic Articles

    • Ganesh, A., B. M. Maggs, and D. Panigrahi. “Universal Algorithms for Clustering Problems.” Acm Transactions on Algorithms 19, no. 2 (March 9, 2023). https://doi.org/10.1145/3572840.
       Full Text
    • Chan, T. H. H., K. M. Chung, B. Maggs, and E. Shi. “Foundations of Differentially Oblivious Algorithms.” Journal of the Acm 69, no. 4 (August 26, 2022). https://doi.org/10.1145/3555984.
       Full Text
    • Ciavaglia, L., P. Chemouil, and B. Maggs. “Techniques for smart and secure 5G softwarized networks.” Annales Des Telecommunications/Annals of Telecommunications 74, no. 9–10 (October 1, 2019): 543–44. https://doi.org/10.1007/s12243-019-00732-8.
       Full Text
    • Motamedi, R., B. Yeganeh, B. Chandrasekaran, R. Rejaie, B. M. Maggs, and W. Willinger. “On mapping the interconnections in today's internet.” Ieee/Acm Transactions on Networking 27, no. 5 (October 1, 2019): 2056–70. https://doi.org/10.1109/TNET.2019.2940369.
       Full Text
    • Hubert Chan, T. H., A. Gupta, B. M. Maggs, and S. Zhou. “On hierarchical routing in doubling metrics.” Acm Transactions on Algorithms 12, no. 4 (August 1, 2016). https://doi.org/10.1145/2915183.
       Full Text
    • Bozkurt, I. N., H. Huang, B. Maggs, A. Richa, and M. Woo. “Mutual Embeddings.” Journal of Interconnection Networks 15, no. 1–2 (October 1, 2015). https://doi.org/10.1142/S0219265915500012.
       Full Text
    • Gillman, D., Y. Lin, B. Maggs, and R. K. Sitaraman. “Protecting Websites from Attack with Secure Delivery Networks.” Computer 48, no. 4 (April 1, 2015): 26–34. https://doi.org/10.1109/MC.2015.116.
       Full Text
    • Zhao, M., P. Aditya, A. Chen, Y. Lin, A. Haeberlen, P. Druschel, B. Maggs, B. Wishon, and M. Ponec. “Peer-assisted content distribution in Akamai netsession.” Proceedings of the Acm Sigcomm Internet Measurement Conference, Imc, December 16, 2013, 31–42. https://doi.org/10.1145/2504730.2504752.
       Full Text
    • Fayazbakhsh, S. K., Y. Lin, A. Tootoonchian, A. Ghodsi, T. Koponen, B. Maggs, K. C. Ng, V. Sekar, and S. Shenker. “Less pain, most of the gain: Incrementally deployable ICN.” Computer Communication Review 43, no. 4 (December 1, 2013): 147–58. https://doi.org/10.1145/2534169.2486023.
       Full Text
    • Fayazbakhsh, S. K., Y. Lin, A. Tootoonchian, A. Ghodsi, T. Koponen, B. Maggs, K. C. Ng, V. Sekar, and S. Shenker. “Less pain, most of the gain: Incrementally deployable ICN.” Sigcomm 2013  Proceedings of the Acm Sigcomm 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, September 5, 2013, 147–58. https://doi.org/10.1145/2486001.2486023.
       Full Text
    • Poese, I., B. Frank, G. Smaragdakis, S. Uhlig, A. Feldmann, and B. Maggs. “Enabling content-aware traffic engineering.” Computer Communication Review 42, no. 5 (October 1, 2012): 22–28. https://doi.org/10.1145/2378956.2378960.
       Full Text
    • Andreev, K., C. Garrod, D. Golovin, B. Maggs, and A. Meyerson. “Simultaneous source location.” Acm Transactions on Algorithms 6, no. 1 (December 1, 2009). https://doi.org/10.1145/1644015.1644031.
       Full Text
    • Qureshi, A., R. Weber, H. Balakrishnan, J. Guttag, and B. Maggs. “Cutting the electric bill for internet-scale systems.” Computer Communication Review 39, no. 4 (November 30, 2009): 123–34. https://doi.org/10.1145/1594977.1592584.
       Full Text
    • Manjhi, A., C. Garrod, B. M. Maggs, T. C. Mowry, and A. Tomasic. “Holistic query transformations for dynamic web applications.” Proceedings  International Conference on Data Engineering, July 8, 2009, 1175–78. https://doi.org/10.1109/ICDE.2009.194.
       Full Text
    • Akella, A., B. Maggs, S. Seshan, A. Shaikh, and R. K. Sitaraman. “Erratum: "On the performance benefits of multihoming route control" (IEEE/ACM Transactions on Networking).” Ieee/Acm Transactions on Networking 16, no. 2 (April 1, 2008): 496. https://doi.org/10.1109/TNET.2008.922012.
       Full Text
    • Akella, A., B. Maggs, S. Seshan, and A. Shaikh. “On the performance benefits of multihoming route control.” Ieee/Acm Transactions on Networking 16, no. 1 (February 1, 2008): 91–104. https://doi.org/10.1109/TNET.2007.899068.
       Full Text
    • Garrod, C., A. Manjhi, A. Ailamaki, B. Maggs, T. Mowry, C. Olston, and A. Tomasic. “Scalable query result caching for web applications.” Proceedings of the Vldb Endowment 1, no. 1 (January 1, 2008): 550–61. https://doi.org/10.14778/1453856.1453917.
       Full Text
    • Parno, B., D. Wendlandt, E. Shi, A. Perrig, B. Maggs, and Y. C. Hu. “Portcullis: Protecting connection setup from denial-of-capability attacks.” Acm Sigcomm 2007: Conference on Computer Communications, December 17, 2007, 289–300. https://doi.org/10.1145/1282380.1282413.
       Full Text
    • Zhang, Y., Z. Zhang, Z. M. Mao, Y. C. Hu, and B. M. Maggs. “On the impact of route monitor selection.” Proceedings of the Acm Sigcomm Internet Measurement Conference, Imc, December 1, 2007, 215–20. https://doi.org/10.1145/1298306.1298336.
       Full Text
    • Parno, B., D. Wendlandt, E. Shi, A. Perrig, B. Maggs, and Y. C. Hu. “Portcullis: Protecting connection setup from denial-of-capability attacks.” Computer Communication Review 37, no. 4 (October 1, 2007): 289–300. https://doi.org/10.1145/1282427.1282413.
       Full Text
    • Manjhi, A., P. B. Gibbons, A. Ailamaki, C. Garrod, B. M. Maggs, T. C. Mowry, C. Olston, A. Tomasic, and H. Yu. “Invalidation clues for database scalability services.” Proceedings  International Conference on Data Engineering, September 24, 2007, 316–25. https://doi.org/10.1109/ICDE.2007.367877.
       Full Text
    • Manjhi, A., A. Ailamaki, B. M. Maggs, T. C. Mowry, C. Olston, and A. Tomasic. “Simultaneous scalability and security for data-intensive web applications.” Proceedings of the Acm Sigmod International Conference on Management of Data, December 1, 2006, 241–52. https://doi.org/10.1145/1142473.1142501.
       Full Text
    • Maggs, B. M. “A survey of congestion+dilation results for packet scheduling.” 2006 Ieee Conference on Information Sciences and Systems, Ciss 2006  Proceedings, January 1, 2006, 1505–10. https://doi.org/10.1109/CISS.2006.286378.
       Full Text
    • Maggs, B. M., G. L. Miller, O. Parekh, R. Ravi, and S. L. M. Woo. “Finding effective support-tree preconditioned.” Annual Acm Symposium on Parallelism in Algorithms and Architectures, December 1, 2005, 176–85. https://doi.org/10.1145/1073970.1073996.
       Full Text
    • Olston, C., A. Manjhi, C. Garrod, A. Ailamaki, B. M. Maggs, and T. C. Mowry. “A scalability service for dynamic Web applications.” 2nd Biennial Conference on Innovative Data Systems Research, Cidr 2005, December 1, 2005, 56–69.
    • Akella, A., J. Pang, B. Maggs, S. Seshan, and A. Shaikh. “A comparison of overlay routing and multihoming route control.” Computer Communication Review 34, no. 4 (December 1, 2004): 93–106. https://doi.org/10.1145/1030194.1015479.
       Full Text
    • Feldmann, A., O. Maennel, Z. M. Mao, A. Berger, and B. Maggs. “Locating Internet routing instabilities.” Computer Communication Review 34, no. 4 (December 1, 2004): 205–18. https://doi.org/10.1145/1030194.1015491.
       Full Text
    • Sripanidkulchai, K., A. Ganjam, B. Maggs, and H. Zhang. “The feasibility of supporting large-scale live streaming applications with dynamic application end-points.” Computer Communication Review 34, no. 4 (December 1, 2004): 107–20. https://doi.org/10.1145/1030194.1015480.
       Full Text
    • Andreev, K., C. Garrod, B. Maggs, and A. Meyerson. “Simultaneous source location.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3122 (January 1, 2004): 13–26. https://doi.org/10.1007/978-3-540-27821-4_2.
       Full Text
    • Feldmann, A., N. Kammenhuber, O. Maennel, B. Maggs, R. De Prisco, and R. Sundaram. “A methodology for estimating interdomain Web traffic demand.” Proceedings of the 2004 Acm Sigcomm Internet Measurement Conference, Imc 2004, January 1, 2004, 322–35. https://doi.org/10.1145/1028788.1028833.
       Full Text
    • Pang, J., R. De Prisco, J. Hendricks, B. Maggs, A. Akella, and S. Seshan. “Availability, usage, and deployment characteristics of the domain name system.” Proceedings of the 2004 Acm Sigcomm Internet Measurement Conference, Imc 2004, January 1, 2004, 1–14. https://doi.org/10.1145/1028788.1028790.
       Full Text
    • Sripanidkulchai, K., B. Maggs, and H. Zhang. “An analysis of live streaming workloads on the internet.” Proceedings of the 2004 Acm Sigcomm Internet Measurement Conference, Imc 2004, January 1, 2004, 41–54. https://doi.org/10.1145/1028788.1028795.
       Full Text
    • Sripanidkulchai, K., B. Maggs, and H. Zhang. “Efficient content location using interest-based locality in peer-to-peer systems.” Proceedings  Ieee Infocom 3 (December 1, 2003): 2166–76. https://doi.org/10.1109/INFCOM.2003.1209237.
       Full Text
    • Akella, A., B. Maggs, S. Seshan, A. Shaikh, and R. Sitaraman. “A Measurement-Based Analysis of Multihoming.” Computer Communication Review 33, no. 4 (January 1, 2003): 353–64. https://doi.org/10.1145/863993.863995.
       Full Text
    • Andreev, K., B. M. Maggs, A. Meyerson, and R. K. Sitaraman. “Designing overlay multicast networks for streaming.” Annual Acm Symposium on Parallel Algorithms and Architectures, January 1, 2003, 149–58. https://doi.org/10.1145/777436.777437.
       Full Text
    • Blelloch, G. E., B. M. Maggs, and S. L. M. Woo. “Space-efficient finger search on degree-balanced search trees.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, January 1, 2003, 374–83.
    • Leiserson, C. E., and B. M. Maggs. “COMMUNICATION-EFFICIENT PARALLEL ALGORITHMS FOR DISTRIBUTED RANDOM-ACCESS MACHINES.” Algorithmica (New York) 38, no. 9 (January 1, 2003): 53–77.
    • Dilley, J., B. Maggs, J. Parikh, H. Prokop, R. Sitaraman, and B. Weihl. “Globally distributed content delivery.” Ieee Internet Computing 6, no. 5 (September 1, 2002): 50–58. https://doi.org/10.1109/MIC.2002.1036038.
       Full Text
    • Fan, T., R. Higashi, and D. E. Hinton. “Preface.” Aquatic Toxicology 57, no. 1–2 (January 1, 2002): 8. https://doi.org/10.1016/S0166-445X(01)00270-3.
       Full Text
    • Sripanidkulchai, K., B. Maggs, and H. Zhang. “Enabling efficient content location and retrieval in peer-to-peer systems by exploiting locality in interests.” Computer Communication Review 32, no. 1 (January 1, 2002): 80. https://doi.org/10.1145/510726.510754.
       Full Text
    • Adler, M., and B. M. Maggs. “Protocols for asymmetric communication channels.” Journal of Computer and System Sciences 63, no. 4 (January 1, 2001): 573–96. https://doi.org/10.1006/jcss.2001.1779.
       Full Text
    • Bornstein, C. F., A. Litman, B. M. Maggs, R. K. Sitaraman, and T. Yatzkar. “On the bisection width and expansion of butterfly networks.” Theory of Computing Systems 34, no. 6 (January 1, 2001): 491–518. https://doi.org/10.1007/s00224-001-1026-2.
       Full Text
    • Cole, R. J., B. M. Maggs, and R. K. Sitaraman. “On the benefit of supporting virtual channels in wormhole routers.” Journal of Computer and System Sciences 62, no. 1 (January 1, 2001): 152–77. https://doi.org/10.1006/jcss.2000.1701.
       Full Text
    • Maggs, B. M., and B. Vöcking. “Improved routing and sorting on multibutterflies.” Algorithmica (New York) 28, no. 4 (December 1, 2000): 438–64. https://doi.org/10.1007/s004530010049.
       Full Text
    • Berthomé, P., A. Ferreira, B. M. Maggs, S. Perennes, and C. G. Plaxton. “Sorting-based selection algorithms for hypercubic networks.” Algorithmica (New York) 26, no. 2 (January 1, 2000): 237–54. https://doi.org/10.1007/s004539910011.
       Full Text
    • Bornstein, C. F., B. M. Maggs, and G. L. Miller. “Tradeoffs between parallelism and fill in nested dissection.” Annual Acm Symposium on Parallel Algorithms and Architectures, January 1, 1999, 191–200. https://doi.org/10.1145/305619.305640.
       Full Text
    • Ghosh, B., F. T. Leighton, B. M. Maggs, S. Muthukrishnan, C. G. Plaxton, R. Rajaraman, A. W. Richa, R. E. Tarjan, and D. Zuckerman. “Tight analyses of two local load balancing algorithms.” Siam Journal on Computing 29, no. 1 (January 1, 1999): 29–64. https://doi.org/10.1137/S0097539795292208.
       Full Text
    • Leighton, T., B. Maggs, and A. W. Richa. “Fast algorithms for finding O(congestion + dilation) packet routing schedules.” Combinatorica 19, no. 3 (January 1, 1999): 375–401. https://doi.org/10.1007/s004930050061.
       Full Text
    • Maggs, B. M., and R. K. Sitaraman. “Simple algorithms for routing on butterfly networks with bounded queues.” Siam Journal on Computing 28, no. 3 (January 1, 1999): 984–1003. https://doi.org/10.1137/s0097539796311818.
       Full Text
    • Adler, M., and B. M. Maggs. “Protocols for asymmetric communication channels.” Annual Symposium on Foundations of Computer Science  Proceedings, December 1, 1998, 522–33.
    • Maggs, B. M., and E. J. Schwabe. “Real-time emulations of bounded-degree networks.” Information Processing Letters 66, no. 5 (June 16, 1998): 269–76. https://doi.org/10.1016/s0020-0190(98)00064-7.
       Full Text
    • Blelloch, G. E., C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha. “An experimental analysis of parallel sorting algorithms.” Theory of Computing Systems 31, no. 2 (January 1, 1998): 135–67. https://doi.org/10.1007/s002240000083.
       Full Text
    • Bornstein, C., A. Litman, B. M. Maggs, R. K. Sitaraman, and T. Yatzkar. “On the bisection width and expansion of butterfly networks.” Proceedings of the 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, Ipps/Spdp 1998 1998-March (January 1, 1998): 144–50. https://doi.org/10.1109/IPPS.1998.669902.
       Full Text
    • Cole, R., B. M. Maggs, F. M. auf der Heide, M. Mitzenmacher, A. W. Richa, K. Schroder, R. K. Sitaraman, and B. Vocking. “Randomized protocols for low-congestion circuit routing in multistage interconnection networks.” Conference Proceedings of the Annual Acm Symposium on Theory of Computing, January 1, 1998, 378–88. https://doi.org/10.1145/276698.276790.
       Full Text
    • Bornstein, C., B. Maggs, G. Miller, and R. Ravi. “Parallelizing elimination orders with linear fill.” Annual Symposium on Foundations of Computer Science  Proceedings, December 1, 1997, 274–83.
    • Maggs, B. M., F. M. auf der Heide, M. Westermann, and B. Voecking. “Exploiting locality for data management in systems of limited bandwidth.” Annual Symposium on Foundations of Computer Science  Proceedings, December 1, 1997, 284–93.
    • Cole, R. J., B. M. Maggs, and R. K. Sitaraman. “Reconfiguring arrays with faults part I: Worst-case faults.” Siam Journal on Computing 26, no. 6 (January 1, 1997): 1581–1611. https://doi.org/10.1137/S0097539793255011.
       Full Text
    • Koch, R. R., F. T. Leighton, B. M. Maggs, S. B. Rao, A. L. Rosenberg, and E. J. Schwabe. “Work-preserving emulations of fixed-connection networks.” Journal of the Acm 44, no. 1 (January 1, 1997): 104–47. https://doi.org/10.1145/256292.256299.
       Full Text
    • Maggs, B. M., and B. Voecking. “Improved routing and sorting on multibutterflies.” Conference Proceedings of the Annual Acm Symposium on Theory of Computing, January 1, 1997, 517–30. https://doi.org/10.1145/258533.258645.
       Full Text
    • Blelloch, G. E., and B. M. Maggs. “Parallel Algorithms.” Acm Computing Surveys 28, no. 1 (March 1, 1996): 51–54. https://doi.org/10.1145/234313.234339.
       Full Text
    • Arora, S., F. T. Leighton, and B. M. Maggs. “On-line algorithms for path selection in a nonblocking network.” Siam Journal on Computing 25, no. 3 (January 1, 1996): 600–625. https://doi.org/10.1137/S0097539791221499.
       Full Text
    • Cole, R. J., B. M. Maggs, and R. K. Sitaraman. “On the benefit of supporting virtual channels in wormhole routers.” Annual Acm Symposium on Parallel Algorithms and Architectures, January 1, 1996, 131–41. https://doi.org/10.1145/237502.237517.
       Full Text
    • Cox, I. J., S. L. Hingorani, S. B. Rao, and B. M. Maggs. “A Maximum Likelihood Stereo Algorithm.” Computer Vision and Image Understanding 63, no. 3 (January 1, 1996): 542–67. https://doi.org/10.1006/cviu.1996.0040.
       Full Text
    • Maggs, B. M. “Critical look at three of parallel computing's maxims.” Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I Span, January 1, 1996, 1–7.
    • Cole, R., B. Maggs, and R. Sitaraman. “Routing on butterfly networks with random faults.” Annual Symposium on Foundations of Computer Science  Proceedings, December 1, 1995, 558–70.
    • Leighton, F. T., B. M. Maggs, and S. B. Rao. “Packet routing and job-shop scheduling in O(congestion+dilation) steps.” Combinatorica 14, no. 2 (June 1, 1994): 167–86. https://doi.org/10.1007/BF01215349.
       Full Text
    • Lejghton, F. T., B. M. Maggs, A. G. Ranade, and S. B. Rao. “Randomized routing and sorting on fixed-connection networks.” Journal of Algorithms 17, no. 1 (January 1, 1994): 157–205. https://doi.org/10.1006/jagm.1994.1030.
       Full Text
    • Maggs, B. M., A. V. Goldberg, and S. A. Plotkin. “A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches.” Ieee Transactions on Computers 43, no. 3 (January 1, 1994): 321–26. https://doi.org/10.1109/12.272432.
       Full Text
    • Aiello, W., B. Awerbuch, B. Zkfaggs, and S. Rao. “Approximate load balancing on dynamic and asynchronous networks.” Proceedings of the Annual Acm Symposium on Theory of Computing Part F129585 (June 1, 1993): 632–41. https://doi.org/10.1145/167088.167250.
       Full Text
    • Cole, R., B. Maggs, and R. Sitaraman. “Multi-scale self-simulation: A technique reconfiguring arrays with faults.” Proceedings of the Annual Acm Symposium on Theory of Computing Part F129585 (June 1, 1993): 561–72. https://doi.org/10.1145/167088.167235.
       Full Text
    • Maggs, B. M. “Randomly wired multistage networks.” Statistical Science 8, no. 1 (January 1, 1993): 70–75. https://doi.org/10.1214/ss/1177011086.
       Full Text
    • Maggs, B. M., and R. K. Sitaraman. “Simple algorithms for routing on butterfly networks with bounded queues.” Proceedings of the Annual Acm Symposium on Theory of Computing Part F129722 (July 1, 1992): 150–61. https://doi.org/10.1145/129712.129728.
       Full Text
    • Leighton, F. T., and B. M. Maggs. “Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks.” Ieee Transactions on Computers 41, no. 5 (January 1, 1992): 578–87. https://doi.org/10.1109/12.142684.
       Full Text
    • Aiello, W. A., F. T. Leighton, B. M. Maggs, and M. Newman. “Fast algorithms for bit-serial routing on a hypercube.” Mathematical Systems Theory 24, no. 1 (December 1, 1991): 253–71. https://doi.org/10.1007/BF02090402.
       Full Text
    • Leighton, T., D. Lisinski, and B. Maggs. “Empirical evaluation of randomly-wired multistage networks.” Proceedings  Ieee International Conference on Computer Design: Vlsi in Computers and Processors, September 1, 1990, 380–85.
    • Aiello, B., T. Leighton, B. Maggs, and M. Newman. “Fast algorithms for bit-serial routing on a hypercube.” Algorithms and Architectures, January 1, 1990, 55–64. https://doi.org/10.1145/97444.97459.
       Full Text
    • Arora, S., T. Leighton, and B. Maggs. “On-line algorithms for path selection in a nonblocking network,” January 1, 1990, 149–58. https://doi.org/10.1145/100216.100232.
       Full Text
    • Koch, R., T. Leighton, B. Maggs, S. Rao, and A. Rosenberg. “Work-preserving emulations of fixed-connection networks,” January 1, 1989, 227–40. https://doi.org/10.1145/73007.73029.
       Full Text
    • Leighton, T., and B. Maggs. “Expanders might be practical: Fast algorithms for routing around faults on multibutterflies.” Annual Symposium on Foundations of Computer Science (Proceedings), January 1, 1989, 384–89. https://doi.org/10.1109/sfcs.1989.63507.
       Full Text
    • “Communication-efficient parallel algorithms for distributed random-access machines.” Algorithmica 3, no. 1 (March 1, 1988): 53–77. https://doi.org/10.1007/BF01762110.
       Full Text
    • Maggs, B. M., and S. A. Plotkin. “Minimum-cost spanning tree as a path-finding problem.” Information Processing Letters 26, no. 6 (January 25, 1988): 291–93. https://doi.org/10.1016/0020-0190(88)90185-8.
       Full Text
    • Leighton, T., B. Maggs, and S. Rao. “Universal packet routing algorithms.” Annual Symposium on Foundations of Computer Science (Proceedings), January 1, 1988, 256–69. https://doi.org/10.1109/sfcs.1988.21942.
       Full Text
    • Leiserson, C. E., and B. M. Maggs. “COMMUNICATION-EFFICIENT PARALLEL GRAPH ALGORITHMS.” Proceedings of the International Conference on Parallel Processing, December 1, 1986, 861–68.
    • Birnbaumer, L., and B. W. O’Malley. “Preface.” Methods in Enzymology 109, no. C (January 1, 1985): 17. https://doi.org/10.1016/0076-6879(85)09069-3.
       Full Text

  • Book Sections

    • Blelloch, G. E., and B. M. Maggs. “Parallel algorithms.” In Algorithms and Theory of Computation Handbook, Second Edition, Volume 2: Special Topics and Techniques, 25.1-25.43, 2009.
    • Blelloch, G. E., and B. M. Maggs. “Parallel algorithms.” In Computer Science Handbook, Second Edition, 10-1-10–41, 2004.

  • Other Articles

    • Ganesh, A., B. M. Maggs, and D. Panigrahi. “Robust algorithms for TSP and steiner tree.” Leibniz International Proceedings in Informatics, Lipics, June 1, 2020. https://doi.org/10.4230/LIPIcs.ICALP.2020.54.
       Full Text

  • Conference Papers

    • Ganesh, A., B. M. Maggs, and D. Panigrahi. “Robust Algorithms for TSP and Steiner Tree.” In Acm Transactions on Algorithms, Vol. 19, 2023. https://doi.org/10.1145/3570957.
       Full Text
    • Larisch, J., W. Aqeel, M. Lum, Y. Goldschlag, L. Kannan, K. Torshizi, Y. Wang, et al. “Hammurabi: A Framework for Pluggable, Logic-Based X.509 Certificate Validation Policies.” In Proceedings of the Acm Conference on Computer and Communications Security, 1857–70, 2022. https://doi.org/10.1145/3548606.3560594.
       Full Text
    • Zhang, X., T. Sen, Z. Zhang, T. April, B. Chandrasekaran, D. Choffnes, B. M. Maggs, H. Shen, R. K. Sitaraman, and X. Yang. “AnyOpt: Predicting and optimizing IP Anycast performance.” In Sigcomm 2021  Proceedings of the Acm Sigcomm 2021 Conference, 447–62, 2021. https://doi.org/10.1145/3452296.3472935.
       Full Text
    • Shi, E., W. Aqeel, B. Chandrasekaran, and B. Maggs. “Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 12828 LNCS:641–69, 2021. https://doi.org/10.1007/978-3-030-84259-8_22.
       Full Text
    • Bhattacherjee, D., W. Aqeel, G. Laughlin, B. M. Maggs, and A. Singla. “A Bird's Eye View of the World's Fastest Networks.” In Proceedings of the Acm Sigcomm Internet Measurement Conference, Imc, 521–27, 2020. https://doi.org/10.1145/3419394.3423620.
       Full Text
    • Aqeel, W., D. Bhattacherjee, B. Chandrasekaran, P. B. Godfrey, G. Laughlin, B. Maggs, and A. Singla. “Untangling Header Bidding Lore: Some Myths, Some Truths, and Some Hope.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 12048 LNCS:280–97, 2020. https://doi.org/10.1007/978-3-030-44081-7_17.
       Full Text
    • Chung, T., B. Chandrasekaran, B. M. Maggs, E. Aben, D. Choffnes, A. Mislove, T. Bruijnzeels, et al. “RPKI is coming of age: A longitudinal study of RPKI deployment and invalid route origins.” In Proceedings of the Acm Sigcomm Internet Measurement Conference, Imc, 406–19, 2019. https://doi.org/10.1145/3355369.3355596.
       Full Text
    • Chan, T. H. H., K. M. Chung, B. M. Maggs, and E. Shi. “Foundations of differentially oblivious algorithms.” In Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, 2448–67, 2019. https://doi.org/10.1137/1.9781611975482.150.
       Full Text
    • Bhattacherjee, D., W. Aqeel, I. N. Bozkurt, A. Aguirre, B. Chandrasekaran, P. B. Godfrey, G. Laughlin, B. Maggs, and A. Singla. “Gearing up for the 21 ^st century space race.” In Hotnets 2018  Proceedings of the 2018 Acm Workshop on Hot Topics in Networks, 113–19, 2018. https://doi.org/10.1145/3286062.3286079.
       Full Text
    • Chung, T., D. Choffnes, A. Mislove, J. Lok, D. Levin, J. Rula, C. Wilson, B. Chandrasekaran, B. M. Maggs, and N. Sullivan. “Is the web ready for OCSP must-staple?” In Proceedings of the Acm Sigcomm Internet Measurement Conference, Imc, 105–18, 2018. https://doi.org/10.1145/3278532.3278543.
       Full Text
    • Chemouil, P., B. Maggs, L. Ciavaglia, and R. Tafazolli. “Message from the chairs.” In 21st Conference on Innovation in Clouds, Internet and Networks, Icin 2018, 1, 2018. https://doi.org/10.1109/ICIN.2018.8401573.
       Full Text
    • Mukerjee, M. K., I. N. Bozkurt, D. Ray, B. M. Maggs, S. Seshan, and H. Zhang. “Redesigning cdn-broker interactions for improved content delivery.” In Conext 2017  Proceedings of the 2017 13th International Conference on Emerging Networking Experiments and Technologies, 68–80, 2017. https://doi.org/10.1145/3143361.3143366.
       Full Text
    • Chung, T., D. Levin, R. Van Rijswijk-Deij, B. M. Maggs, C. Wilson, D. Choffnes, and A. Mislove. “Understanding the role of registrars in DNSSEC deployment.” In Proceedings of the Acm Sigcomm Internet Measurement Conference, Imc, Part F131937:369–83, 2017. https://doi.org/10.1145/3131365.3131373.
       Full Text
    • Chiang, M., and B. Maggs. “Message from the program chairs.” In 2017 2nd Acm/Ieee Symposium on Edge Computing, Sec 2017, 2017. https://doi.org/10.1145/3132211.3134446.
       Full Text
    • Haney, S., B. Maggs, B. Maiti, D. Panigrahi, R. Rajaraman, and R. Sundaram. “Symmetric interdiction for matching problems.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 81, 2017. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2017.9.
       Full Text
    • Larisch, J., D. Choffnes, D. Levin, B. M. Maggs, A. Mislove, and C. Wilson. “CRLite: A Scalable System for Pushing All TLS Revocations to All Browsers.” In Proceedings  Ieee Symposium on Security and Privacy, 539–56, 2017. https://doi.org/10.1109/SP.2017.17.
       Full Text
    • Bozkurt, I. N., A. Aguirre, B. Chandrasekaran, P. B. Godfrey, G. Laughlin, B. Maggs, and A. Singla. “Why is the internet so slow?!.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10176 LNCS:173–87, 2017. https://doi.org/10.1007/978-3-319-54328-4_13.
       Full Text
    • Chung, T., R. Van Rijswijk-Deij, B. Chandrasekaran, D. Choffnes, D. Levin, B. M. Maggs, A. Mislove, and C. Wilson. “A longitudinal, end-to-end view of the DnSSec ecosystem.” In Proceedings of the 26th Usenix Security Symposium, 1307–22, 2017.
    • Chung, T., Y. Liu, D. Choffnes, D. Levin, B. M. Maggs, A. Mislove, and C. Wilson. “Measuring and applying invalid SSL Certificates: The silent majority.” In Proceedings of the Acm Sigcomm Internet Measurement Conference, Imc, 14-16-November-2016:527–41, 2016. https://doi.org/10.1145/2987443.2987454.
       Full Text
    • Cangialosi, F., T. Chung, D. Choffnes, D. Levin, B. M. Maggs, A. Mislove, and C. Wilson. “Measurement and analysis of private key sharing in the HTTPS ecosystem.” In Proceedings of the Acm Conference on Computer and Communications Security, 24-28-October-2016:628–40, 2016. https://doi.org/10.1145/2976749.2978301.
       Full Text
    • Puzhavakath Narayanan, S., Y. S. Nam, A. Sivakumar, B. Chandrasekaran, B. Maggs, and S. Rao. “Reducing Latency through Page-aware Management of Web Objects by Content Delivery Networks.” In Performance Evaluation Review, 44:89–100, 2016. https://doi.org/10.1145/2896377.2901472.
       Full Text
    • Liu, Y., W. Tome, L. Zhang, D. Choffnes, D. Levin, B. Maggs, A. Mislove, A. Schulman, and C. Wilson. “An end-to-end measurement of certificate revocation in the Web's PKI.” In Proceedings of the Acm Sigcomm Internet Measurement Conference, Imc, 2015-October:183–96, 2015. https://doi.org/10.1145/2815675.2815685.
       Full Text
    • Maggs, B. M., and R. K. Sitaraman. “Algorithmic nuggets in content delivery.” In Computer Communication Review, 45:52–66, 2015. https://doi.org/10.1145/2805789.2805800.
       Full Text
    • Akella, A., T. Benson, B. Chandrasekaran, C. Huang, B. Maggs, and D. Maltz. “A universal approach to data center network design.” In Acm International Conference Proceeding Series, Vol. 04-07-January-2015, 2015. https://doi.org/10.1145/2684464.2684505.
       Full Text
    • Pujol, E., P. Richter, B. Chandrasekaran, G. Smaragdakis, A. Feldmann, B. Maggs, and K. C. Ng. “Back-office web traffic on the internet.” In Proceedings of the Acm Sigcomm Internet Measurement Conference, Imc, 257–70, 2014. https://doi.org/10.1145/2663716.2663756.
       Full Text
    • Singla, A., B. Chandrasekaran, P. Brighten Godfrey, and B. Maggs. “The internet at the speed of light.” In Proceedings of the 13th Acm Workshop on Hot Topics in Networks, Hotnets 2014, 2014. https://doi.org/10.1145/2670518.2673876.
       Full Text
    • Aditya, P., M. Zhao, Y. Lin, A. Haeberlen, P. Druschel, B. Maggs, and B. Wishon. “Reliable client accounting for P2P-infrastructure hybrids.” In Proceedings of Nsdi 2012: 9th Usenix Symposium on Networked Systems Design and Implementation, 99–112, 2012.
    • Kushman, N., S. Kandula, D. Katabi, and B. M. Maggs. “R-BGP: Staying connected in a connected world.” In 4th Symposium on Networked Systems Design and Implementation, Nsdi 2007, 341–54, 2007.
    • Golovin, D., A. Gupta, B. M. Maggs, F. Oprea, and M. K. Reiter. “Quorum placement in networks: Minimizing network congestion.” In Proceedings of the Annual Acm Symposium on Principles of Distributed Computing, 2006:16–25, 2006.
    • Gupta, A., B. M. Maggs, F. Oprea, and M. K. Reiter. “Quorum placement in networks to minimize access delays.” In Proceedings of the Annual Acm Symposium on Principles of Distributed Computing, 24:87–96, 2005. https://doi.org/10.1145/1073814.1073829.
       Full Text
    • Flammini, M., B. Maggs, J. Sibeyn, and B. Vöcking. “Routing and communication in interconnection networks.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2400, 2002.
    • Bilardi, G., R. Feldmann, K. Herley, and B. Maggs. “Topic 06, complexity theory and algorithms.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2150:332, 2001.
    • Cole, R., A. Frieze, B. M. Maggs, M. Mitzenmacher, A. W. Richa, R. Sitaraman, and E. Upfal. “On balls and bins with deletions.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1518:145–58, 1998. https://doi.org/10.1007/3-540-49543-6_12.
       Full Text
    • Wu, J. S., D. F. Hsu, F. Lai, B. Maggs, J. F. Chang, S. Horiguchi, and C. C. Hsu. “Messagfer om the organizers.” In 3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I Span 1997, xi, 1997.
    • Leighton, T., and B. Maggs. “Fast algorithms for finding O(congestion+dilation) packet routing schedules.” In Proceedings of the Annual Hawaii International Conference on System Sciences, 2:555–63, 1995. https://doi.org/10.1109/HICSS.1995.375501.
       Full Text
    • Maggs, B. M., L. R. Matheson, and R. E. Tarjan. “Models of parallel computation: A survey and synthesis.” In Proceedings of the Annual Hawaii International Conference on System Sciences, 2:61–70, 1995. https://doi.org/10.1109/HICSS.1995.375476.
       Full Text
    • Berthome, P., A. Ferreira, B. M. Maggs, S. Perennes, and C. G. Plaxton. “Sorting-based selection algorithms for hypercubic networks.” In Proceedings of 7th International Parallel Processing Symposium, Ipps 1993, 89–95, 1993. https://doi.org/10.1109/IPPS.1993.262861.
       Full Text
    • Leighton, T., and B. Maggs. “The role of randomness in the design of interconnection networks.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 678 LNCS:131–45, 1993. https://doi.org/10.1007/3-540-56731-3_13.
       Full Text
    • Maggs, B., and M. Rauch. “An algorithm for finding predecessors in integer sets.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 709 LNCS:483–93, 1993. https://doi.org/10.1007/3-540-57155-8_273.
       Full Text
    • Leighton, T., B. Maggs, and R. Sitaraman. “On the fault tolerance of some popular bounded-degree networks.” In Proceedings  Annual Ieee Symposium on Foundations of Computer Science, Focs, 1992-October:542–52, 1992. https://doi.org/10.1109/SFCS.1992.267797.
       Full Text
    • Bielloch, G. E., C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha. “A comparison of sorting algorithms for the connection machine CM-2.” In Proceedings of the 3rd Annual Acm Symposium on Parallel Algorithms and Architectures, Spaa 1991, 3–16, 1991. https://doi.org/10.1145/113379.113380.
       Full Text
• Teaching & Mentoring
• 

  Recent Courses

  • COMPSCI 514: Advanced Computer Networks 2023
  • ECE 558: Advanced Computer Networks 2023
  • COMPSCI 514: Advanced Computer Networks 2022
  • ECE 558: Advanced Computer Networks 2022
  • COMPSCI 514: Advanced Computer Networks 2021
  • ECE 558: Advanced Computer Networks 2021

Some information on this profile has been compiled automatically from Duke databases and external sources. (Our About page explains how this works.) If you see a problem with the information, please write to Scholars@Duke and let us know. We will reply promptly.