Bruce Maggs

Computer Science

Pelham Wilder Distinguished Professor of Computer Science

Bruce Maggs Profile Photo

Education

Ph.D. Massachusetts Institute of Technology, 1989

Positions

Pelham Wilder Distinguished Professor of Computer Science
Professor of Computer Science
Professor in the Department of Electrical and Computer Engineering
Core Faculty in Innovation & Entrepreneurship
Associate of the Duke Initiative for Science & Society

Courses Taught

ECE 558: Advanced Computer Networks
ECE 356: Computer Network Architecture
COMPSCI 514: Advanced Computer Networks
COMPSCI 512: Distributed Systems
COMPSCI 356: Computer Network Architecture

Publications

Larisch J, Aqeel W, Chung T, Kohler E, Levin D, Maggs BM, et al. No Root Store Left Behind. In: HotNets 2023 - Proceedings of the 22nd ACM Workshop on Hot Topics in Networks. 2023. p. 295u2013301.
Ganesh A, Maggs BM, Panigrahi D. Universal Algorithms for Clustering Problems. ACM Transactions on Algorithms. 2023 Mar 9;19(2).
Ganesh A, Maggs BM, Panigrahi D. Robust Algorithms for TSP and Steiner Tree. In: ACM Transactions on Algorithms. 2023.
Sentosa W, Chandrasekaran B, Godfrey PB, Hassanieh H, Maggs B. DChannel: Accelerating Mobile Applications With Parallel High-bandwidth and Low-latency Channels. In: Proceedings of the 20th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2023. 2023. p. 419u201336.
Larisch J, Aqeel W, Lum M, Goldschlag Y, Kannan L, Torshizi K, 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. 2022. p. 1857u201370.
Chan THH, Chung KM, Maggs B, Shi E. Foundations of Differentially Oblivious Algorithms. Journal of the ACM. 2022 Aug 26;69(4).
Zhang X, Sen T, Zhang Z, April T, Chandrasekaran B, Choffnes D, et al. AnyOpt: Predicting and optimizing IP Anycast performance. In: SIGCOMM 2021 - Proceedings of the ACM SIGCOMM 2021 Conference. 2021. p. 447u201362.
Shi E, Aqeel W, Chandrasekaran B, Maggs B. 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). 2021. p. 641u201369.
Bhattacherjee D, Aqeel W, Laughlin G, Maggs BM, Singla A. A Bird's Eye View of the World's Fastest Networks. In: Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC. 2020. p. 521u20137.
Ganesh A, Maggs BM, Panigrahi D. Robust algorithms for TSP and steiner tree. Vol. 168, Leibniz International Proceedings in Informatics, LIPIcs. 2020.
Aqeel W, Bhattacherjee D, Chandrasekaran B, Godfrey PB, Laughlin G, Maggs B, et al. 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). 2020. p. 280u201397.
Chung T, Chandrasekaran B, Maggs BM, Aben E, Choffnes D, Mislove A, 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. 2019. p. 406u201319.
Motamedi R, Yeganeh B, Chandrasekaran B, Rejaie R, Maggs BM, Willinger W. On mapping the interconnections in today's internet. IEEE/ACM Transactions on Networking. 2019 Oct 1;27(5):2056u201370.
Ciavaglia L, Chemouil P, Maggs B. Techniques for smart and secure 5G softwarized networks. Annales des Telecommunications/Annals of Telecommunications. 2019 Oct 1;74(9u201310):543u20134.
Chan THH, Chung KM, Maggs BM, Shi E. Foundations of differentially oblivious algorithms. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2019. p. 2448u201367.
Bhattacherjee D, Aqeel W, Bozkurt IN, Aguirre A, Chandrasekaran B, Godfrey PB, et al. Gearing up for the 21 ^st century space race. In: HotNets 2018 - Proceedings of the 2018 ACM Workshop on Hot Topics in Networks. 2018. p. 113u20139.
Chung T, Choffnes D, Mislove A, Lok J, Levin D, Rula J, et al. Is the web ready for OCSP must-staple? In: Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC. 2018. p. 105u201318.
Chemouil P, Maggs B, Ciavaglia L, Tafazolli R. Message from the chairs. In: 21st Conference on Innovation in Clouds, Internet and Networks, ICIN 2018. 2018. p. 1.
Mukerjee MK, Bozkurt IN, Ray D, Maggs BM, Seshan S, Zhang H. Redesigning cdn-broker interactions for improved content delivery. In: CoNEXT 2017 - Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies. 2017. p. 68u201380.
Chung T, Levin D, Van Rijswijk-Deij R, Maggs BM, Wilson C, Choffnes D, et al. Understanding the role of registrars in DNSSEC deployment. In: Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC. 2017. p. 369u201383.
Chiang M, Maggs B. Message from the program chairs. In: 2017 2nd ACM/IEEE Symposium on Edge Computing, SEC 2017. 2017.
Haney S, Maggs B, Maiti B, Panigrahi D, Rajaraman R, Sundaram R. Symmetric interdiction for matching problems. In: Leibniz International Proceedings in Informatics, LIPIcs. 2017.
Larisch J, Choffnes D, Levin D, Maggs BM, Mislove A, Wilson C. CRLite: A Scalable System for Pushing All TLS Revocations to All Browsers. In: Proceedings - IEEE Symposium on Security and Privacy. 2017. p. 539u201356.
Chung T, Van Rijswijk-Deij R, Chandrasekaran B, Choffnes D, Levin D, Maggs BM, et al. A longitudinal, end-to-end view of the DnSSec ecosystem. In: Proceedings of the 26th USENIX Security Symposium. 2017. p. 1307u201322.
Bozkurt IN, Aguirre A, Chandrasekaran B, Godfrey PB, Laughlin G, Maggs B, et al. Why is the internet so slow?!. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2017. p. 173u201387.
Chung T, Liu Y, Choffnes D, Levin D, Maggs BM, Mislove A, et al. Measuring and applying invalid SSL Certificates: The silent majority. In: Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC. 2016. p. 527u201341.
Cangialosi F, Chung T, Choffnes D, Levin D, Maggs BM, Mislove A, et al. Measurement and analysis of private key sharing in the HTTPS ecosystem. In: Proceedings of the ACM Conference on Computer and Communications Security. 2016. p. 628u201340.
Hubert Chan TH, Gupta A, Maggs BM, Zhou S. On hierarchical routing in doubling metrics. ACM Transactions on Algorithms. 2016 Aug 1;12(4).
Puzhavakath Narayanan S, Nam YS, Sivakumar A, Chandrasekaran B, Maggs B, Rao S. Reducing Latency through Page-aware Management of Web Objects by Content Delivery Networks. In: Performance Evaluation Review. 2016. p. 89u2013100.
Liu Y, Tome W, Zhang L, Choffnes D, Levin D, Maggs B, et al. An end-to-end measurement of certificate revocation in the Web's PKI. In: Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC. 2015. p. 183u201396.
Bozkurt IN, Huang H, Maggs B, Richa A, Woo M. Mutual Embeddings. Journal of Interconnection Networks. 2015 Oct 1;15(1u20132).
Maggs BM, Sitaraman RK. Algorithmic nuggets in content delivery. In: Computer Communication Review. 2015. p. 52u201366.
Gillman D, Lin Y, Maggs B, Sitaraman RK. Protecting Websites from Attack with Secure Delivery Networks. Computer. 2015 Apr 1;48(4):26u201334.
Akella A, Benson T, Chandrasekaran B, Huang C, Maggs B, Maltz D. A universal approach to data center network design. In: ACM International Conference Proceeding Series. 2015.
Pujol E, Richter P, Chandrasekaran B, Smaragdakis G, Feldmann A, Maggs B, et al. Back-office web traffic on the internet. In: Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC. 2014. p. 257u201370.
Singla A, Chandrasekaran B, Brighten Godfrey P, Maggs B. The internet at the speed of light. In: Proceedings of the 13th ACM Workshop on Hot Topics in Networks, HotNets 2014. 2014.
Zhao M, Aditya P, Chen A, Lin Y, Haeberlen A, Druschel P, et al. Peer-assisted content distribution in Akamai netsession. Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC. 2013 Dec 16;31u201342.
Fayazbakhsh SK, Lin Y, Tootoonchian A, Ghodsi A, Koponen T, Maggs B, et al. Less pain, most of the gain: Incrementally deployable ICN. Computer Communication Review. 2013 Dec 1;43(4):147u201358.
Fayazbakhsh SK, Lin Y, Tootoonchian A, Ghodsi A, Koponen T, Maggs B, et al. 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. 2013 Sep 5;147u201358.
Poese I, Frank B, Smaragdakis G, Uhlig S, Feldmann A, Maggs B. Enabling content-aware traffic engineering. Computer Communication Review. 2012 Oct 1;42(5):22u20138.
Aditya P, Zhao M, Lin Y, Haeberlen A, Druschel P, Maggs B, et al. Reliable client accounting for P2P-infrastructure hybrids. In: Proceedings of NSDI 2012: 9th USENIX Symposium on Networked Systems Design and Implementation. 2012. p. 99u2013112.
Andreev K, Garrod C, Golovin D, Maggs B, Meyerson A. Simultaneous source location. ACM Transactions on Algorithms. 2009 Dec 1;6(1).
Qureshi A, Weber R, Balakrishnan H, Guttag J, Maggs B. Cutting the electric bill for internet-scale systems. Computer Communication Review. 2009 Nov 30;39(4):123u201334.
Blelloch GE, Maggs BM. Parallel algorithms. In: Algorithms and Theory of Computation Handbook, Second Edition, Volume 2: Special Topics and Techniques. 2009. p. 25.1-25.43.
Manjhi A, Garrod C, Maggs BM, Mowry TC, Tomasic A. Holistic query transformations for dynamic web applications. Proceedings - International Conference on Data Engineering. 2009 Jul 8;1175u20138.
Akella A, Maggs B, Seshan S, Shaikh A. On the performance benefits of multihoming route control. IEEE/ACM Transactions on Networking. 2008 Feb 1;16(1):91u2013104.
Akella A, Maggs B, Seshan S, Shaikh A, Sitaraman RK. Erratum: "On the performance benefits of multihoming route control" (IEEE/ACM Transactions on Networking). IEEE/ACM Transactions on Networking. 2008 Jan 1;16(2):496.
Garrod C, Manjhi A, Ailamaki A, Maggs B, Mowry T, Olston C, et al. Scalable query result caching for web applications. Proceedings of the VLDB Endowment. 2008 Jan 1;1(1):550u201361.
Parno B, Wendlandt D, Shi E, Perrig A, Maggs B, Hu YC. Portcullis: Protecting connection setup from denial-of-capability attacks. ACM SIGCOMM 2007: Conference on Computer Communications. 2007 Dec 17;289u2013300.
Zhang Y, Zhang Z, Mao ZM, Hu YC, Maggs BM. On the impact of route monitor selection. Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC. 2007 Dec 1;215u201320.
Parno B, Wendlandt D, Shi E, Perrig A, Maggs B, Hu YC. Portcullis: Protecting connection setup from denial-of-capability attacks. Computer Communication Review. 2007 Oct 1;37(4):289u2013300.
Manjhi A, Gibbons PB, Ailamaki A, Garrod C, Maggs BM, Mowry TC, et al. Invalidation clues for database scalability services. Proceedings - International Conference on Data Engineering. 2007 Sep 24;316u201325.
Kushman N, Kandula S, Katabi D, Maggs BM. R-BGP: Staying connected in a connected world. In: 4th Symposium on Networked Systems Design and Implementation, NSDI 2007. 2007. p. 341u201354.
Manjhi A, Ailamaki A, Maggs BM, Mowry TC, Olston C, Tomasic A. Simultaneous scalability and security for data-intensive web applications. Proceedings of the ACM SIGMOD International Conference on Management of Data. 2006 Dec 1;241u201352.
Golovin D, Gupta A, Maggs BM, Oprea F, Reiter MK. Quorum placement in networks: Minimizing network congestion. In: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. 2006. p. 16u201325.
Maggs BM. A survey of congestion+dilation results for packet scheduling. 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings. 2006 Jan 1;1505u201310.
Olston C, Manjhi A, Garrod C, Ailamaki A, Maggs BM, Mowry TC. A scalability service for dynamic Web applications. 2nd Biennial Conference on Innovative Data Systems Research, CIDR 2005. 2005 Dec 1;56u201369.
Maggs BM, Miller GL, Parekh O, Ravi R, Woo SLM. Finding effective support-tree preconditioned. Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2005 Dec 1;176u201385.
Gupta A, Maggs BM, Oprea F, Reiter MK. Quorum placement in networks to minimize access delays. In: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. 2005. p. 87u201396.
Akella A, Pang J, Maggs B, Seshan S, Shaikh A. A comparison of overlay routing and multihoming route control. Computer Communication Review. 2004 Dec 1;34(4):93u2013106.
Feldmann A, Maennel O, Mao ZM, Berger A, Maggs B. Locating Internet routing instabilities. Computer Communication Review. 2004 Dec 1;34(4):205u201318.
Sripanidkulchai K, Ganjam A, Maggs B, Zhang H. The feasibility of supporting large-scale live streaming applications with dynamic application end-points. Computer Communication Review. 2004 Dec 1;34(4):107u201320.
Feldmann A, Kammenhuber N, Maennel O, Maggs B, De Prisco R, Sundaram R. A methodology for estimating interdomain Web traffic demand. Proceedings of the 2004 ACM SIGCOMM Internet Measurement Conference, IMC 2004. 2004 Jan 1;322u201335.
Blelloch GE, Maggs BM. Parallel algorithms. In: Computer Science Handbook, Second Edition. 2004. p. 10-1-10u201341.
Sripanidkulchai K, Maggs B, Zhang H. An analysis of live streaming workloads on the internet. Proceedings of the 2004 ACM SIGCOMM Internet Measurement Conference, IMC 2004. 2004 Jan 1;41u201354.
Pang J, De Prisco R, Hendricks J, Maggs B, Akella A, Seshan S. Availability, usage, and deployment characteristics of the domain name system. Proceedings of the 2004 ACM SIGCOMM Internet Measurement Conference, IMC 2004. 2004 Jan 1;1u201314.
Andreev K, Garrod C, Maggs B, Meyerson A. Simultaneous source location. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2004 Jan 1;3122:13u201326.
Sripanidkulchai K, Maggs B, Zhang H. Efficient content location using interest-based locality in peer-to-peer systems. Proceedings - IEEE INFOCOM. 2003 Dec 1;3:2166u201376.
Andreev K, Maggs BM, Meyerson A, Sitaraman RK. Designing overlay multicast networks for streaming. Annual ACM Symposium on Parallel Algorithms and Architectures. 2003 Jan 1;149u201358.
Blelloch GE, Maggs BM, Woo SLM. Space-efficient finger search on degree-balanced search trees. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2003 Jan 1;374u201383.
Leiserson CE, Maggs BM. COMMUNICATION-EFFICIENT PARALLEL ALGORITHMS FOR DISTRIBUTED RANDOM-ACCESS MACHINES. Algorithmica (New York). 2003 Jan 1;38(9):53u201377.
Akella A, Maggs B, Seshan S, Shaikh A, Sitaraman R. A Measurement-Based Analysis of Multihoming. Computer Communication Review. 2003 Jan 1;33(4):353u201364.
Dilley J, Maggs B, Parikh J, Prokop H, Sitaraman R, Weihl B. Globally distributed content delivery. IEEE Internet Computing. 2002 Sep 1;6(5):50u20138.
Flammini M, Maggs B, Sibeyn J, Vu00f6cking B. Routing and communication in interconnection networks. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2002.
Sripanidkulchai K, Maggs B, Zhang H. Enabling efficient content location and retrieval in peer-to-peer systems by exploiting locality in interests. Computer Communication Review. 2002 Jan 1;32(1):80.
Fan T, Higashi R, Hinton DE. Preface. Aquatic Toxicology. 2002 Jan 1;57(1u20132):8.
Cole RJ, Maggs BM, Sitaraman RK. On the benefit of supporting virtual channels in wormhole routers. Journal of Computer and System Sciences. 2001 Jan 1;62(1):152u201377.
Bilardi G, Feldmann R, Herley K, Maggs B. Topic 06, complexity theory and algorithms. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2001. p. 332.
Bornstein CF, Litman A, Maggs BM, Sitaraman RK, Yatzkar T. On the bisection width and expansion of butterfly networks. Theory of Computing Systems. 2001 Jan 1;34(6):491u2013518.
Adler M, Maggs BM. Protocols for asymmetric communication channels. Journal of Computer and System Sciences. 2001 Jan 1;63(4):573u201396.
Maggs BM, Vu00f6cking B. Improved routing and sorting on multibutterflies. Algorithmica (New York). 2000 Dec 1;28(4):438u201364.
Berthomu00e9 P, Ferreira A, Maggs BM, Perennes S, Plaxton CG. Sorting-based selection algorithms for hypercubic networks. Algorithmica (New York). 2000 Jan 1;26(2):237u201354.
Maggs BM, Sitaraman RK. Simple algorithms for routing on butterfly networks with bounded queues. SIAM Journal on Computing. 1999 Jan 1;28(3):984u20131003.
Leighton T, Maggs B, Richa AW. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica. 1999 Jan 1;19(3):375u2013401.
Ghosh B, Leighton FT, Maggs BM, Muthukrishnan S, Plaxton CG, Rajaraman R, et al. Tight analyses of two local load balancing algorithms. SIAM Journal on Computing. 1999 Jan 1;29(1):29u201364.
Bornstein CF, Maggs BM, Miller GL. Tradeoffs between parallelism and fill in nested dissection. Annual ACM Symposium on Parallel Algorithms and Architectures. 1999 Jan 1;191u2013200.
Adler M, Maggs BM. Protocols for asymmetric communication channels. Annual Symposium on Foundations of Computer Science - Proceedings. 1998 Dec 1;522u201333.
Maggs BM, Schwabe EJ. Real-time emulations of bounded-degree networks. Information Processing Letters. 1998 Jun 16;66(5):269u201376.
Cole R, Frieze A, Maggs BM, Mitzenmacher M, Richa AW, Sitaraman R, et al. On balls and bins with deletions. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1998. p. 145u201358.
Cole R, Maggs BM, auf der Heide FM, Mitzenmacher M, Richa AW, Schroder K, et al. Randomized protocols for low-congestion circuit routing in multistage interconnection networks. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 1998 Jan 1;378u201388.
Bornstein C, Litman A, Maggs BM, Sitaraman RK, Yatzkar T. 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 Jan 1;1998-March:144u201350.
Blelloch GE, Leiserson CE, Maggs BM, Plaxton CG, Smith SJ, Zagha M. An experimental analysis of parallel sorting algorithms. Theory of Computing Systems. 1998 Jan 1;31(2):135u201367.
Bornstein C, Maggs B, Miller G, Ravi R. Parallelizing elimination orders with linear fill. Annual Symposium on Foundations of Computer Science - Proceedings. 1997 Dec 1;274u201383.
Maggs BM, auf der Heide FM, Westermann M, Voecking B. Exploiting locality for data management in systems of limited bandwidth. Annual Symposium on Foundations of Computer Science - Proceedings. 1997 Dec 1;284u201393.
Koch RR, Leighton FT, Maggs BM, Rao SB, Rosenberg AL, Schwabe EJ. Work-preserving emulations of fixed-connection networks. Journal of the ACM. 1997 Jan 1;44(1):104u201347.
Maggs BM, Voecking B. Improved routing and sorting on multibutterflies. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 1997 Jan 1;517u201330.
Cole RJ, Maggs BM, Sitaraman RK. Reconfiguring arrays with faults part I: Worst-case faults. SIAM Journal on Computing. 1997 Jan 1;26(6):1581u2013611.
Wu JS, Hsu DF, Lai F, Maggs B, Chang JF, Horiguchi S, et al. Messagfer om the organizers. In: 3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997. 1997. p. xi.
Blelloch GE, Maggs BM. Parallel Algorithms. ACM Computing Surveys. 1996 Mar 1;28(1):51u20134.
Cox IJ, Hingorani SL, Rao SB, Maggs BM. A Maximum Likelihood Stereo Algorithm. Computer Vision and Image Understanding. 1996 Jan 1;63(3):542u201367.
Maggs BM. Critical look at three of parallel computing's maxims. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. 1996 Jan 1;1u20137.
Cole RJ, Maggs BM, Sitaraman RK. On the benefit of supporting virtual channels in wormhole routers. Annual ACM Symposium on Parallel Algorithms and Architectures. 1996 Jan 1;131u201341.
Arora S, Leighton FT, Maggs BM. On-line algorithms for path selection in a nonblocking network. SIAM Journal on Computing. 1996 Jan 1;25(3):600u201325.
Cole R, Maggs B, Sitaraman R. Routing on butterfly networks with random faults. Annual Symposium on Foundations of Computer Science - Proceedings. 1995 Dec 1;558u201370.
Leighton T, Maggs B. Fast algorithms for finding O(congestion+dilation) packet routing schedules. In: Proceedings of the Annual Hawaii International Conference on System Sciences. 1995. p. 555u201363.
Maggs BM, Matheson LR, Tarjan RE. Models of parallel computation: A survey and synthesis. In: Proceedings of the Annual Hawaii International Conference on System Sciences. 1995. p. 61u201370.
Leighton FT, Maggs BM, Rao SB. Packet routing and job-shop scheduling in O(congestion+dilation) steps. Combinatorica. 1994 Jun 1;14(2):167u201386.
Lejghton FT, Maggs BM, Ranade AG, Rao SB. Randomized routing and sorting on fixed-connection networks. Journal of Algorithms. 1994 Jan 1;17(1):157u2013205.
Maggs BM, Goldberg AV, Plotkin SA. A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches. IEEE Transactions on Computers. 1994 Jan 1;43(3):321u20136.
Aiello W, Awerbuch B, Zkfaggs B, Rao S. Approximate load balancing on dynamic and asynchronous networks. Proceedings of the Annual ACM Symposium on Theory of Computing. 1993 Jun 1;Part F129585:632u201341.
Cole R, Maggs B, Sitaraman R. Multi-scale self-simulation: A technique reconfiguring arrays with faults. Proceedings of the Annual ACM Symposium on Theory of Computing. 1993 Jun 1;Part F129585:561u201372.
Berthome P, Ferreira A, Maggs BM, Perennes S, Plaxton CG. Sorting-based selection algorithms for hypercubic networks. In: Proceedings of 7th International Parallel Processing Symposium, IPPS 1993. 1993. p. 89u201395.
Leighton T, Maggs B. 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). 1993. p. 131u201345.
Maggs BM. Randomly wired multistage networks. Statistical Science. 1993 Jan 1;8(1):70u20135.
Maggs B, Rauch M. 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). 1993. p. 483u201393.
Maggs BM, Sitaraman RK. Simple algorithms for routing on butterfly networks with bounded queues. Proceedings of the Annual ACM Symposium on Theory of Computing. 1992 Jul 1;Part F129722:150u201361.
Leighton T, Maggs B, Sitaraman R. On the fault tolerance of some popular bounded-degree networks. In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 1992. p. 542u201352.
Leighton FT, Maggs BM. Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks. IEEE Transactions on Computers. 1992 Jan 1;41(5):578u201387.
Aiello WA, Leighton FT, Maggs BM, Newman M. Fast algorithms for bit-serial routing on a hypercube. Mathematical Systems Theory. 1991 Dec 1;24(1):253u201371.
Bielloch GE, Leiserson CE, Maggs BM, Plaxton CG, Smith SJ, Zagha M. 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. 1991. p. 3u201316.
Leighton T, Lisinski D, Maggs B. Empirical evaluation of randomly-wired multistage networks. Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors. 1990 Sep 1;380u20135.
Arora S, Leighton T, Maggs B. On-line algorithms for path selection in a nonblocking network. 1990 Jan 1;149u201358.
Aiello B, Leighton T, Maggs B, Newman M. Fast algorithms for bit-serial routing on a hypercube. Algorithms and Architectures. 1990 Jan 1;55u201364.
Koch R, Leighton T, Maggs B, Rao S, Rosenberg A. Work-preserving emulations of fixed-connection networks. 1989 Jan 1;227u201340.
Leighton T, Maggs B. Expanders might be practical: Fast algorithms for routing around faults on multibutterflies. Annual Symposium on Foundations of Computer Science (Proceedings). 1989 Jan 1;384u20139.
Communication-efficient parallel algorithms for distributed random-access machines. Algorithmica. 1988 Mar 1;3(1):53u201377.
Maggs BM, Plotkin SA. Minimum-cost spanning tree as a path-finding problem. Information Processing Letters. 1988 Jan 25;26(6):291u20133.
Leighton T, Maggs B, Rao S. Universal packet routing algorithms. Annual Symposium on Foundations of Computer Science (Proceedings). 1988 Jan 1;256u201369.
Leiserson CE, Maggs BM. COMMUNICATION-EFFICIENT PARALLEL GRAPH ALGORITHMS. Proceedings of the International Conference on Parallel Processing. 1986 Dec 1;861u20138.
Birnbaumer L, Ou2019Malley BW. Preface. Methods in Enzymology. 1985 Jan 1;109(C):17.

In The News

Web Surfing That Feels Instantaneous, Even Though Itu2019s Not (Apr 13, 2022 | )
Bruce Maggs Elected Fellow of Association for Computing Machinery (Dec 5, 2018 | )