Bruce MacDowell Maggs

Research

My research focuses on distributed systems, including content delivery networks, computer networks, and computer and network security.

Refereed Conference and Workshop Papers
  • Foundations of Differentially Oblivious Algorithms
    T.-H. H. Chan, K.-M. Chung, B. M. Maggs, and E. Shi
    [To appear in]Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)January2019
  • Gearing up for the 21st century space race
    D. Bhattacherjee, W. Aqeel, I. N. Bozkurt, A. Aquirre, B. Chandrasekaran, P. B. Godfrey, G. Laughlin, B. Maggs, and A. Singla
    [To appear in]ACM Workshop on Hot Topics in Networks (HotNets)November2018
  • Is the Web Ready for OCSP Must-Staple?
    T. Chung, J. Lok, B. Chandrasekaran, D. Choffnes, D. Levin, B. M. Maggs, A. Mislove, J. Rula, N. Sullivan, and C. Wilson
    Proceedings of the ACM Internet Measurement Conference 2018 (IMC) October2018
  • Redesigning CDN-Broker Interactions for Improved Content Delivery
    Winner of Best Paper Award
    M. K. Mukerjee, I. N. Bozkurt, D. Ray, B. M. Maggs, S. Seshan, and H. Zhang
    Proceedings of the 13th ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) December2017
  • Understanding the role of registrars in the DNSSEC deployment
    Finalist for Best Paper Award
    T. Chung, R. v. Rijswijk-Deij, B. Chandrasekaran, D. Choffnes, D. Levin, B. M. Maggs, A. Mislove, and C. Wilson
    Proceedings of the ACM Internet Measurement Conference 2017 (IMC) October2017
  • Symmetric interdiction for matching problems
    S. Haney, B. Maggs, B. Maiti, D. Panigrahi, R. Rajaraman, and R. Sundaram
    Proceedings of the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) August2017
  • A Longitudinal, end-to-end view of the DNSSEC ecosystem
    Distinguished Paper Award
    T. Chung, R. v. Rijswijk-Deij, B. Chandrasekaran, D. Choffnes, D. Levin, B. M. Maggs, A. Mislove, and C. Wilson
    Proceedings of the 26th USENIX Security Symposium (USENIX Security) August2017
  • CRLite: a scalable system for pushing all TLS revocations to all browsers
    2017 IEEE Cybersecurity Innovation Award
    J. Larisch, D. Choffnes, D. Levin, B. M. Maggs, A. Mislove, and C. Wilson
    Proceedings of the 38th IEEE Symposium on Security and Privacy (Oakland) May2017
  • Why is the Internet so slow?!
    Best Dataset Award
    I. Bozkurt, B. Chandrasekaran, A. Aguirre, P. Godfrey, G. Laughlin, B. Maggs, and A. Singla
    Proceedings of the Passive and Active Measurement Conference 2017 (PAM) March2017
  • Measuring and Applying Invalid SSL Certificates: The Silent Majority
    T. Chung, Y. Liu, D. Choffnes, D. Levin, B. Maggs, A. Mislove, and C. Wilson
    Proceedings of the ACM Internet Measurement Conference 2016 (IMC) November2016
  • Measurement and Analysis of Private Key Sharing in the HTTPS Ecosystem
    F. Cangialosi, T. Chung, D. Choffnes, D. Levin, B. Maggs, A. Mislove, and C. Wilson
    Proceedings of the 23rd ACM Conference on Computer and Communications Security (CCS) October2016
  • The Impact of Brokers on the Future of Content Delivery
    M. K. Mukerjee, I. N. Bozkurt, B. Maggs, S. Seshan, and H. Zhang
    ACM Workshop on Hot Topics in Networks (HotNets) October2016
  • Reducing Latency Through Page-aware Management of Web Objects by Content Delivery Networks
    S. P. Narayanan, Y. S. Nam, A. Sivakumar, B. Chandrasekaran, B. Maggs, and S. Rao
    Proceedings of the ACM SIGMETRICS/IFIP Performance Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) June2016
  • An End-to-End Measurement of Certificate Revocation in the Web's PKI
    Y. Liu, W. Tome, L. Zhang, D. Choffnes, D. Levin, B. Maggs, A. Mislove, A. Schulman, and C. Wilson
    Proceedings of the ACM Internet Measurement Conference 2015 (IMC) October2015
  • Back-office Web traffic on the Internet
    E. Pujol, P. Richter, B. Chandrasekaran, G. Smaragdakis, A. Feldmann, B. M. Maggs, and K. C. Ng
    Proceedings of the ACM Internet Measurment Conference 2014 (IMC) November2014
  • The Internet at the speed of light
    A. Singla, B. Chandrasekaran, B. Godfrey, B. M. Maggs
    Proceedings of the Thirteenth ACM Workshop on Hot Topics in Networks (HotNets) October2014
  • Peer-assisted content distribution in Akamai NetSession
    M. Zhao, P. Aditya, A. Chen, Y. Lin, A. Haeberlen, P. Druschel, B. M. Maggs, B. Wishon, and M. Ponec
    Proceedings of the Internet Measurement Conference 2013 (IMC) October2013
  • Less pain, most of the gain: incrementally deployable ICN
    S. K. Fayazbakhsh, Y. Lin, A. Tootoonchian, A. Ghodsi, T. Koponen, B. M. Maggs, K. C. Ng, V. Sekar, and S. Shenker
    Proceedings of the ACM SIGCOMM 2013 Conference (SIGCOMM) August2013
  • Reliable client accounting for P2P-infrastructure hybrids
    P. Aditya, M. Zhao, Y. Lin, A. Haeberlen, P. Druschel, B. M. Maggs, and B. Wishon
    Proceedings of the 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI) April2012
  • Cutting the electrical bill for Internet-scale systems
    A. Qureshi, R. Weber, H. Balakrishnan, J. Guttag, and B. M. Maggs
    Proceedings of the ACM SIGCOMM 2009 Conference (SIGCOMM) August2009
  • Holistic query transformations for dynamic Web applications
    A. Manji, C. Garrod, B. M. Maggs, T. C. Mowry, and A. Tomasic
    Proceedings of the 2009 IEEE 25th International Conference on Data Engineering (ICDE) April2009
  • Holistic application analysis for update-independence
    C. Garrod, A. Manji, B. Maggs, T. Mowry, and A. Tomasic
    Proceedings of the Second IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb 2008), pp. 1–6 October2008
  • Scalable query result caching for Web applications
    C. Garrod, A. Manji, A. Ailamaki, B. Maggs, T. Mowry, C. Olson, and A. Tomasic
    Proceedings of the 34th International Conference on Very Large Databases (VLDB) August2008
  • On the impact of route monitor selection
    Y. Zhang, Z. Zhang, Z. M. Mao, Y. C. Hu, and B. M. Maggs
    Proceedings of the Internet Measurement Conference 2007 (IMC) October2007
  • Portcullis: Protecting connection setup from denial-of-capability attacks
    B. Parno, D. Wendlandt, E. Shi, A. Perrig, B. Maggs, and Y.-C. Hu
    Proceedings of the ACM SIGCOMM 2007 Conference (SIGCOMM) August2007
  • R-BGP: Staying connected in a connected world
    N. Kushman, S. Kandula, D. Katabi, and B. M. Maggs
    Proceedings of the 4th USENIX Symposium on Networked Systems Design & Implementation (NSDI) April2007
  • Invalidation clues for database scalability services
    A. Manjhi, P. B. Gibbons, A. Ailamaki, B. M. Maggs, T. C. Mowry, C. Olston, A. Tomasic, and H. Yu
    Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering (ICDE) April2007
  • Quorum placement in networks: Minimizing network congestion
    D. Golovin, A. Gupta, B. Maggs, F. Oprea, and M. Reiter
    Proceedings of the 18th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC) July2006
  • Simultaneous scalability and security for data-intensive Web applications
    A. Manjhi, A. Ailamaki, B. M. Maggs, T. C. Mowry, C. Olston, and A. Tomasic
    Proceedings of ACM SIGMOD 2006 (SIGMOD) June2006
  • Finding effective support-tree preconditioners
    B. M. Maggs, G. L. Miller, O. Parekh, R. Ravi, and S. L. M. Woo
    Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA) July2005
  • Quorum placement in networks to minimize access delays
    A. Gupta, B. Maggs, F. Oprea, and M. Reiter
    Proceedings of the 17th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC) July2005
  • A Scalability service for dynamic Web applications
    C. Olston, A. Manjhi, C. Garrod, A. Ailamaki, B. M. Maggs, and T. C. Mowry
    Proceedings of the 2nd Biennial Conference on Innovative Data Systems Research (CIDR) January2005
  • On Hierarchical Routing in Doubling Metrics
    H. T-H. Chan, A. Gupta, B. M. Maggs, and S. Zhou
    Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) January2005
  • A Methodology for Estimating Interdomain Web Traffic Demand
    A. Feldmann, N. Kammenhuber, O. Maennel, B. Maggs, R. De Prisco, and R. Sundaram
    Proceedings of the Internet Measurement Conference 2004 (IMC) October2004
  • An Analysis of Live Streaming Workloads on the Internet
    K. Sripanidkulchai, B. Maggs, and H. Zhang
    Proceedings of the Internet Measurement Conference 2004 (IMC) October2004
  • Availability, Usage, and Deployment Characteristics of the Domain Name System
    J. Pang, J. Hendricks, A. Akella, R. De Prisco, B. Maggs, and S. Seshan
    Proceedings of the Internet Measurement Conference 2004 (IMC) October2004
  • Simultaneous Source Location
    K. Andreev, C. Garrod, B. Maggs, and A. Meyerson
    Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) August2004
  • Locating Internet Routing Instabilities
    A. Feldmann, O. Maennel, Z. Morley Mao, A. Berger, and B. Maggs
    Proceedings of the ACM SIGCOMM 2004 Conference (SIGCOMM) August2004
  • A Comparison of Overlay Routing and Multihoming Route Control
    A. Akella, J. Pang, A. Shaikh, B. Maggs, and S. Seshan
    Proceedings of the ACM SIGCOMM 2004 Conference (SIGCOMM) August2004
  • The Feasibility of Supporting Large-Scale Live Streaming Applications with Dynamic Application End-Points
    K. Sripanidkulchai, A. Ganjam, B. Maggs, and H. Zhang
    Proceedings of the ACM SIGCOMM 2004 Conference (SIGCOMM) August2004
  • A Measurement-Based Analysis of Multihoming
    A. Akella, B. Maggs, S. Seshan, A. Shaikh, and R. Sitaraman
    Proceedings of the ACM SIGCOMM 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM) August2003
    Appeared as —
    On the Performance Benefits of Multihoming Route Control
    A. Akella, B. Maggs, S. Seshan, A. Shaikh, and R. Sitaraman
    IEEE/ACM Transactions on Networking, Vol. 16, No. 1, pp. 91–104 February2008
  • Designing Overlay Multicast Networks for Streaming
    K. Andreev, B. M. Maggs, A. Meyerson, and R. Sitaraman
    ACM Symposium on Parallel Algorithms and Architectures (SPAA) June2003
  • Efficient content location using interest-based locality in peer-to-peer systems
    K. Sripanidkulchai, B. Maggs, and H. Zhang
    Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'03) April2003
  • Space-efficient finger search on degree-balanced search trees
    G. E. Blelloch, B. M. Maggs, and S. L. M. Woo
    Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 374–383 January2003
  • Tradeoffs between parallelism and fill in nested dissection
    C. F. Bornstein, B. M. Maggs, and G. L. Miller
    Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 191–200 June1999
  • Protocols for Asymmetric Communication Channels
    M. Adler and B. M. Maggs
    Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS), pp. 522–533 October1998
    Appeared as —
    Protocols for Asymmetric Communication Channels
    M. Adler and B. M. Maggs
    Journal of Computer and Systems Sciences, Vol. 63, No. 4, pp. 573–596 December2001
  • On Balls and Bins with Deletions
    R. Cole, A. Frieze, B. M. Maggs, M. Mitzenmacher, A. W. Richa, R. K. Sitaraman, and E. Upfal
    Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), pp. 145–158 October1998
  • Randomized protocols for low-congestion circuit routing in multistage interconnection networks
    R. Cole, B. M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A. W. Richa, K. Schroeder, R. K. Sitaraman, and B. Voecking
    Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC), pp. 378–388 May1998
  • On the bisection width and expansion of butterfly networks
    C. F. Bornstein, A. Litman, B. M. Maggs, R. K. Sitaraman, and T. Yatzkar
    Proceedings of the 12th International Parallel Processing Symposium (IPPS), pp. 144–150 March1998
    Appeared as —
    On the bisection width and expansion of butterfly networks
    C. F. Bornstein, A. Litman, B. M. Maggs, R. K. Sitaraman, and T. Yatzkar
    Theory of Computing Systems, Vol. 34, No. 6, pp. 491–518 November2001
  • Parallel Gaussian elimination with linear work and fill
    C. Bornstein, B. Maggs, G. Miller, and R. Ravi
    Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 274–283 October1997
  • Exploiting locality for data management in systems of limited bandwidth
    B. M. Maggs, F. Meyer auf der Heide, B. Voecking, and M. Westermann
    Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 284–293 October1997
  • Improved routing and sorting on multibutterflies
    B. M. Maggs and B. Voecking
    Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC), pp. 517–530 May1997
    Appeared as —
    Improved routing and sorting on multibutterflies
    B. M. Maggs and B. Voecking
    Algorithmica, Vol. 28, No. 4, 2000, pp. 438–464 December2000
  • On the benefit of supporting virtual channels in wormhole routers
    R. J. Cole, B. M. Maggs, and R. K. Sitaraman
    Proceedings of the 8th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 131–141 June1996
    Appeared as —
    On the benefit of supporting virtual channels in wormhole routers
    R. J. Cole, B. M. Maggs, and R. K. Sitaraman
    Journal of Computer and System Sciences, Vol. 62, No. 1, pp. 152–177 February2001
  • Routing on butterfly networks with random faults
    R. Cole, B. Maggs, and R. Sitaraman
    Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS), pp. 558–570 October1995
  • Tight analyses of two local load balancing algorithms
    B. Ghosh, F. T. Leighton, B. M. Maggs, S. Muthukrishnan, C. G. Plaxton, R. Rajaraman, A. W. Richa, R. E. Tarjan, and D. Zuckerman
    Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC), pp. 548–558 May1995
  • Fast algorithms for finding O(congestion+dilation) packet routing schedules
    T. Leighton and B. Maggs
    Proceedings of the 28th Hawaii International Conference on System Sciences (HICSS), Volume 2, pp. 555–563 January1995
    Appeared as —
    Fast algorithms for finding O(congestion+dilation) packet routing schedules (with minor corrections)
    F. T. Leighton, B. M. Maggs and A. W. Richa
    Combinatorica, Vol. 19, No. 3, pp. 375–401 1999
  • An algorithm for finding predecessors in integer sets
    B. Maggs and M. Rauch
    Proceedings of the 3rd Workshop on Algorithms and Data Structures (WADS), Vol. 709 of Lecture Notes in Computer Science, Spring-Verlag, pp. 483–493 August1993
  • Multi-scale emulation: A technique for reconfiguring arrays with faults
    R. Cole, B. Maggs, and R. Sitaraman
    Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (STOC), pp. 561–572 May1993
    Appeared as —
    Reconfiguring arrays with faults part I: worst-case faults
    R. J. Cole, B. M. Maggs, and R. K. Sitaraman
    SIAM Journal on Computing, Vol. 26, No. 6, pp. 1581–1611 December1997
  • Approximate load balancing on dynamic and asynchronous networks
    W. Aiello, B. Awerbuch, B. Maggs, and S. Rao
    Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (STOC), pp. 632–641 May1993
  • Sorting-based selection algorithms for hypercubic networks
    P. Berthome, A. Ferreira, B. M. Maggs, S. Perennes, and C. G. Plaxton
    Proceedings of the 7th International Parallel Processing Symposium (IPPS), pp. 89–95 April1993
    Appeared as —
    Sorting-based selection algorithms for hypercubic networks
    P. Berthome, A. Ferreira, B. M. Maggs, S. Perennes, and C. G. Plaxton
    Algorithmica, Vol. 26, No. 2, pp. 237–254 2000
  • On the fault tolerance of some popular bounded-degree networks
    T. Leighton, B. Maggs, and R. Sitaraman
    Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 542–552 October1992
    Appeared as —
    A Formal Study on the Fault Tolerance of Parallel and Distributed Systems
    C. V. Papadopoulos
    IEEE Conference on Architectures and Algorithms for Parallel Processing (ICAAAPP) April1995
  • Stereo without disparity gradient smoothing: a Bayesian sensor fusion solution
    I. J. Cox, S. L. Hingorani, B. M. Maggs, S. B. Rao
    D. Hogg and R. Boyle, ed., Proceedings of the British Machine Vision Conference, Springer-Verlag, pp. 337-346 September1992
  • Simple algorithms for routing on butterfly networks with bounded queues
    B. M. Maggs and R. K. Sitaraman
    Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC), pp. 150–161 May1992
  • A comparison of sorting algorithms for the Connection Machine CM-2
    G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. Smith, and M. Zagha
    Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 3–16 July1991
    Appeared as —
    An experimental analysis of parallel sorting algorithms
    G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. Smith, and M. Zagha
    Theory of Computing Systems, Vol. 31, No. 2, pp. 135–167 March/April1998
  • Empirical evaluation of randomly-wired multistage networks
    D. Lisinski, T. Leighton, and B. Maggs
    Proceedings of the 1990 International Conference on Computer Design (ICCD), pp. 380–385 September1990
  • Fast algorithms for bit-serial routing on a hypercube
    B. Aiello, T. Leighton, B. Maggs and M. Newman
    Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 55–64 July1990
    Appeared as —
    Fast algorithms for bit-serial routing on a hypercube
    B. Aiello, T. Leighton, B. Maggs and M. Newman
    Mathematical Systems Theory, Vol. 24 1991
  • On-line algorithms for path selection in a nonblocking network
    S. Arora, F. T. Leighton and B. M. Maggs
    Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC), pp. 149–158 May1990
    Appeared as —
    On-line algorithms for path selection in a nonblocking network
    S. Arora, F. T. Leighton and B. M. Maggs
    SIAM Journal on Computing, Vol. 25, No. 3, pp. 600–625 June1996
  • Expanders might be practical: fast algorithms for routing around faults on multibutterflies
    T. Leighton and B. Maggs
    Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS), pp. 384–389 October1989
    Appeared as —
    Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks
    T. Leighton and B. Maggs
    IEEE Transactions on Computers, Vol. 41, No. 5 May1992
  • Work-preserving emulations of fixed-connection networks
    R. Koch, T. Leighton, B. Maggs, S. Rao, and A. Rosenberg
    Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), pp. 227–240 May1989
    Appeared as —
    Work-preserving emulations of fixed-connection networks
    R. R. Koch, F. T. Leighton, B. M. Maggs, S. B. Rao, A. L. Rosenberg, and E. J. Schwabe
    Journal of the ACM, Vol. 44, No. 1, pp. 104–147 January1997
  • Universal packet routing algorithms
    T. Leighton, B. Maggs, and S. Rao
    Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS), pp. 256–271 October1988
    Appeared as —
    Packet routing and job-shop scheduling in O(congestion+dilation) steps
    T. Leighton, B. Maggs, and S. Rao
    Combinatorica, Vol. 14, No. 2 1994
    Appeared as —
    Randomized routing and sorting on fixed-connection networks
    F. T. Leighton, B. M. Maggs, S. B. Rao, and A. G. Ranade
    Journal of Algorithms, Vol. 17, No. 1 July1994
  • Communication-efficient parallel graph algorithms
    Daniel L. Slotnick Award for Most Original Paper
    C. E. Leiserson and B. M. Maggs
    Proceedings of the 1986 International Conference on Parallel Processing (ICPP), pp. 861–868 August1986
    Appeared as —
    Communication-efficient parallel graph algorithms for distributed random-access machines
    C. E. Leiserson and B. M. Maggs
    Algorithmica, Vol. 3 1988
Refereed Journal Publications
  • On Hierarchical Routing in Doubling Metrics
    H. T-H. Chan, A. Gupta, B. M. Maggs, and S. Zhou
    ACM Transactions on Algorithms (TALG), Vol. 12, No. 4 August2016
    Originally appeared as —
    On Hierarchical Routing in Doubling Metrics
    H. T-H. Chan, A. Gupta, B. M. Maggs, S. Zhou
    Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) January2005
  • Mutual Embeddings
    I. N. Bozkurt, H. Huang, B. Maggs, A. Richa, and M. Woo
    Journal of Interconnection Networks, Vol. 15, No. 1-2 March-June2015
  • Pushing CDN-ISP collaboration to the limit
    B. Frank, I. Poese, Y. Lin, G. Smaragdakis, A. Feldmann, B. M. Maggs, J. Rake, S. Uhlig, and R. Weber
    ACM SIGCOMM Computer Communication Review, Vol. 43, No. 3, pp. 34-44 July2013
  • Enabling content-aware traffic engineering
    I. Poese, B. Frank, G. Smaragdakis, S. Uhlig, A. Feldmann, and B. Maggs
    ACM SIGCOMM Computer Communication Review, Vol. 42, No. 5 October2012
  • Posit: a lightweight approach for IP geolocation
    B. Eriksson, P. Barford, B. Maggs, and R. Nowak
    SIGMETRICS Performance Evaluation Review, Vol. 40, No. 2, pp. 2–11 September2012
  • Simultaneous Source Location
    K. Andreev, C. Garrod, B. Maggs, and A. Meyerson
    ACM Transactions on Algorithms, Vol. 6, No. 1 December2009
    Originally appeared as —
    Simultaneous Source Location
    K. Andreev, C. Garrod, B. Maggs, and A. Meyerson
    Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) August2004
  • On the Performance Benefits of Multihoming Route Control
    A. Akella, B. Maggs, S. Seshan, A. Shaikh, and R. Sitaraman
    IEEE/ACM Transactions on Networking, Vol. 16, No. 1, pp. 91–104 February2008
    Originally appeared as —
    A Measurement-Based Analysis of Multihoming
    Proceedings of the ACM SIGCOMM 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM) August2003
  • Globally distributed content delivery
    J. Dilley, B. Maggs, J. Parikh, H. Prokop, R. Sitaraman, and B. Weihl
    IEEE Internet Computing, pp. 50–58 September/October2002
  • Protocols for Asymmetric Communication Channels
    M. Adler and B. M. Maggs
    Journal of Computer and Systems Sciences, Vol. 63, No. 4, pp. 573–596 December2001
    Originally appeared as —
    Protocols for Asymmetric Communication Channels
    Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS), pp. 522–533 October1998
  • On the bisection width and expansion of butterfly networks
    C. F. Bornstein, A. Litman, B. M. Maggs, R. K. Sitaraman, and T. Yatzkar
    Theory of Computing Systems, Vol. 34, No. 6, pp. 491–518 November2001
    Originally appeared as —
    On the bisection width and expansion of butterfly networks
    Proceedings of the 12th International Parallel Processing Symposium (IPPS), pp. 144–150 March1998
  • On the benefit of supporting virtual channels in wormhole routers
    R. J. Cole, B. M. Maggs, and R. K. Sitaraman
    Journal of Computer and System Sciences, Vol. 62, No. 1, pp. 152–177 February2001
    Originally appeared as —
    On the benefit of supporting virtual channels in wormhole routers
    Proceedings of the 8th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 131–141 June1996
  • Improved routing and sorting on multibutterflies
    B. M. Maggs and B. Voecking
    Algorithmica, Vol. 28, No. 4, 2000, pp. 438–464 2000
    Originally appeared as —
    Improved routing and sorting on multibutterflies
    Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC), pp. 517–530 May1997
  • Sorting-based selection algorithms for hypercubic networks
    P. Berthome, A. Ferreira, B. M. Maggs, S. Perennes, and C. G. Plaxton
    Algorithmica, Vol. 26, No. 2, pp. 237–254 2000
    Originally appeared as —
    Sorting-based selection algorithms for hypercubic networks
    Proceedings of the 7th International Parallel Processing Symposium (IPPS), pp. 89–95 April1993
  • Fast algorithms for finding O(congestion+dilation) packet routing schedules
    F. T. Leighton, B. M. Maggs and A. W. Richa
    Combinatorica, Vol. 19, No. 3, pp. 375–401 1999
    Originally appeared as —
    Fast algorithms for finding O(congestion+dilation) packet routing schedules
    T. Leighton and B. Maggs
    Proceedings of the 28th Hawaii International Conference on System Sciences (HICSS), Volume 2, pp. 555–563 January1995
  • Simple algorithms for routing on butterfly networks with bounded queues
    B. M. Maggs and R. K. Sitaraman
    SIAM Journal on Computing, Vol. 28, No. 3, pp. 984–1003 June1999
    Originally appeared as —
    Simple algorithms for routing on butterfly networks with bounded queues
    Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC), pp. 150–161 May1992
  • Tight analyses of two local load balancing algorithms
    B. Ghosh, F. T. Leighton, B. M. Maggs, S. Muthukrishnan, C. G. Plaxton, R. Rajaraman, A. W. Richa, R. E. Tarjan, and D. Zuckerman
    SIAM Journal on Computing, Vol. 29, No. 1, pp. 29–64 February1999
    Originally appeared as —
    Tight analyses of two local load balancing algorithms
    Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC), pp. 548–558 May1995
  • On the fault tolerance of some popular bounded-degree networks
    F. T. Leighton, B. M. Maggs, and R. K. Sitaraman
    SIAM Journal on Computing, Vol. 27, No. 5, pp. 1303–1333 October1998
    Originally appeared as —
    On the fault tolerance of some popular bounded-degree networks
    T. Leighton, B. Maggs, and R. Sitaraman
    Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 542–552 October1992
  • An experimental analysis of parallel sorting algorithms
    G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. Smith, and M. Zagha
    Theory of Computing Systems, Vol. 31, No. 2, pp. 135–167 March/April1998
    Originally appeared as —
    A comparison of sorting algorithms for the Connection Machine CM-2
    G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. Smith, and M. Zagha
    Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 3–16 July1991
  • Reconfiguring arrays with faults part I: worst-case faults
    R. J. Cole, B. M. Maggs, and R. K. Sitaraman
    SIAM Journal on Computing, Vol. 26, No. 6, pp. 1581–1611 December1997
    Originally appeared as —
    Multi-scale emulation: A technique for reconfiguring arrays with faults
    R. Cole, B. Maggs, and R. Sitaraman
    Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (STOC), pp. 561–572 May1993
  • Work-preserving emulations of fixed-connection networks
    R. R. Koch, F. T. Leighton, B. M. Maggs, S. B. Rao, A. L. Rosenberg, and E. J. Schwabe
    Journal of the ACM, Vol. 44, No. 1, pp. 104–147 January1997
    Originally appeared as —
    Work-preserving emulations of fixed-connection networks
    R. Koch, T. Leighton, B. Maggs, S. Rao, and A. Rosenberg
    Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), pp. 227–240 May1989
  • On-line algorithms for path selection in a nonblocking network
    S. Arora, F. T. Leighton and B. M. Maggs
    SIAM Journal on Computing, Vol. 25, No. 3, pp. 600–625 June1996
    Originally appeared as —
    On-line algorithms for path selection in a nonblocking network
    S. Arora, F. T. Leighton and B. M. Maggs
    Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC), pp. 149–158 May1990
  • A maximum likelihood stereo algorithm
    I. J. Cox, S. L. Hingorani, B. M. Maggs, S. B. Rao
    Computer Vision and Image Understanding, Vol. 63, No. 3, pp. 542–567 May1996
    Originally appeared as —
    Stereo without disparity gradient smoothing: a Bayesian sensor fusion solution
    I. J. Cox, S. L. Hingorani, B. M. Maggs, S. B. Rao
    D. Hogg and R. Boyle, ed., Proceedings of the British Machine Vision Conference, Springer-Verlag, pp. 337-346 September1992
  • Randomized routing and sorting on fixed-connection networks
    F. T. Leighton, B. M. Maggs, S. B. Rao, and A. G. Ranade
    Journal of Algorithms, Vol. 17, No. 1 July1994
    Originally appeared as —
    Universal packet routing algorithms
    T. Leighton, B. Maggs, and S. Rao
    Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS), pp. 256–271 October1988
  • Packet routing and job-shop scheduling in O(congestion+dilation) steps
    F. T. Leighton, B. M. Maggs, and S. B. Rao
    Combinatorica, Vol. 14, No. 2 1994
    Originally appeared as —
    Universal packet routing algorithms
    T. Leighton, B. Maggs, and S. Rao
    Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS), pp. 256–271 October1988
  • A parallel algorithm for reconfiguring a multibutterfly network with faulty switches
    A. V. Goldberg, B. M. Maggs, and S. A. Plotkin
    IEEE Transactions on Computers, Vol. 43, No. 3 March1994
  • Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks
    F. T. Leighton and B. M. Maggs
    IEEE Transactions on Computers, Vol. 41, No. 5 May1992
    Originally appeared as —
    Expanders might be practical: fast algorithms for routing around faults on multibutterflies
    T. Leighton and B. Maggs
    Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS), pp. 384–389 October1989
  • Fast algorithms for bit-serial routing on a hypercube
    W. A. Aiello, F. T. Leighton, B. M. Maggs, and M. Newman
    Mathematical Systems Theory, Vol. 24 1991
    Originally appeared as —
    Fast algorithms for bit-serial routing on a hypercube
    B. Aiello, T. Leighton, B. Maggs and M. Newman
    Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 55–64 July1990
  • Communication-efficient parallel algorithms for distributed random-access machines
    C. E. Leiserson and B. M. Maggs
    Algorithmica, Vol. 3 1988
    Originally appeared as —
    Communication-efficient parallel graph algorithms
    C. E. Leiserson and B. M. Maggs
    Proceedings of the 1986 International Conference on Parallel Processing (ICPP), pp. 861–868 August1986
  • Minimum-cost spanning tree as a path-finding problem
    B. M. Maggs and S. A. Plotkin
    Information Processing Letters, Vol. 26, No. 6 January1988
Survey Papers
  • Algorithmic Nuggets in Content Delivery
    B. M. Maggs and Ramesh K. Sitaraman
    ACM SIGCOMM Computer Communication Review, Vol. 45, No. 3, pp. 52–66 July2015
  • Protecting websites from attack with secure delivery networks
    D. Gillman, Y. Lin, B. Maggs, and R. K. Sitaraman
    IEEE Computer, Vol. 48, No. 4 April2015
  • A survey of congestion+dilation results for packet scheduling
    B. M. Maggs
    Proceedings of the 40th Conference on Information Science and Systems (CISS) March2006
  • Real-time emulations of bounded-degree networks
    B. M. Maggs and E. J. Schwabe
    Information Processing Letters, Vol. 6, No. 5 June1998
  • Parallel algorithms
    G. E. Blelloch and B. M. Maggs
    M. J. Atallah, ed., Handbook of Algorithms and Theory of Computation, CRC Press 1998
  • Parallel algorithms
    G. E. Blelloch and B. M. Maggs
    A. B. Tucker, Jr., ed., The Computer Science and Engineering Handbook, CRC Press 1997
    Appeared as —
    Parallel algorithms (revised version of the chapter)
    G. E. Blelloch and B. M. Maggs
    M. J. Atallah, ed., Handbook of Algorithms and Theory of Computation, CRC Press 1998
  • Parallel algorithms
    G. E. Blelloch and B. M. Maggs
    ACM Computing Surveys, Vol. 28, No. 1, pp. 51–54 March1996
  • Models of parallel computation: a survey and synthesis
    B. M. Maggs, L. R. Matheson, and R. E. Tarjan
    Proceedings of the 28th Hawaii International Conference on System Sciences (HICSS), Vol. 2, pp. 61–70 January1995
  • Randomly wired multistage networks
    B. M. Maggs
    Statistical Science, Vol. 8, No. 1, pp. 70-75 February1993
Position Papers
  • A Universal approach to data center network design
    A. Akella, T. Benson, B. Chandrasekaran, C. Huang, B. M. Maggs, D. Maltz
    Proceedings of the 16th International Conference on Distributed Computing and Networking (ICDCN) January2015
  • A critical look at three of parallel computing's maxims
    B. M. Maggs
    Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN ’96), pp. 1–7 June1996
  • The hidden cost of low bandwidth communication
    G. E. Blelloch, B. M. Maggs, and G. L. Miller
    U. Vishkin, ed., Developing a Computer Science Agenda for High-Performance Computing, ACM press, pp. 22–25 1994
  • Beyond parallel random-access machines
    B. M. Maggs
    J. L. C. Sanz, ed., Opportunities and Constraints of Parallel Computing, Springer-Verlag, pp. 83-84 1989
Technical Reports
  • Alidade: IP Geolocation without Active Probing
    B. Chandrasekaran, M. Bai, M. Schoenfield, A. Berger, N. Caruso, G. Economou, S. Gilliss, B. M. Maggs, K. Moses, D. Duff, KC. Ng, E. G. Sirer, R. Weber, B. Wong
    Technical Report CS-TR-2015.001, Department of Computer Science, Duke University, Durham, NC 27708 January2015
  • Competitive analysis of call admission algorithms that allow delay
    A. Feldmann, B. M. Maggs, J. Sgall, D. D. Sleator, and A. Tomkins
    Technical Report CMU-CS-95-102, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213 January1995