Energy Initiative Energy Initiative
Office of the Provost
Duke University
 HOME > Provost > Energy Initiative    Search Help Login pdf version printable version 

Publications of Bruce Maggs    :chronological  combined  bibtex listing:

Journal articles or Book chapters PUBLISHED

  1. Akella, A; Pang, J; Maggs, B; Seshan, S; Shaikh, A, A comparison of overlay routing and multihoming route control, Computer Communication Review, vol. 34 no. 4 (December, 2004), pp. 93-106, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]  [abs]
  2. Cox, IJ; Hingorani, SL; Rao, SB; Maggs, BM, A Maximum Likelihood Stereo Algorithm, Computer Vision and Image Understanding, vol. 63 no. 3 (January, 1996), pp. 542-567, Elsevier BV [doi]  [abs]
  3. Akella, A; Maggs, B; Seshan, S; Shaikh, A; Sitaraman, R, A Measurement-Based Analysis of Multihoming, Computer Communication Review, vol. 33 no. 4 (January, 2003), pp. 353-364, ISSN 0146-4833 [doi]  [abs]
  4. 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 (January, 2004), pp. 322-335 [doi]  [abs]
  5. Maggs, BM; Goldberg, AV; Plotkin, SA, A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches, IEEE Transactions on Computers, vol. 43 no. 3 (January, 1994), pp. 321-326, Institute of Electrical and Electronics Engineers (IEEE) [doi]  [abs]
  6. 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 (December, 2005), pp. 56-69  [abs]
  7. Maggs, BM, A survey of congestion+dilation results for packet scheduling, 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings (January, 2006), pp. 1505-1510, IEEE [doi]  [abs]
  8. 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 (January, 2004), pp. 41-54 [doi]  [abs]
  9. Blelloch, GE; Leiserson, CE; Maggs, BM; Plaxton, CG; Smith, SJ; Zagha, M, An experimental analysis of parallel sorting algorithms, Theory of Computing Systems, vol. 31 no. 2 (January, 1998), pp. 135-167, Springer Nature, ISSN 1432-4350 [doi]  [abs]
  10. 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, vol. Part F129585 (June, 1993), pp. 632-641 [doi]  [abs]
  11. 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 (January, 2004), pp. 1-14 [doi]  [abs]
  12. Leiserson, CE; Maggs, BM, Communication-efficient parallel algorithms for distributed random-access machines, Algorithmica, vol. 3 no. 1 (March, 1988), pp. 53-77, ISSN 0178-4617 [doi]  [abs]
  13. Leiserson, CE; Maggs, BM, COMMUNICATION-EFFICIENT PARALLEL ALGORITHMS FOR DISTRIBUTED RANDOM-ACCESS MACHINES., Algorithmica (New York), vol. 38 no. 9 (January, 2003), pp. 53-77  [abs]
  14. Leiserson, CE; Maggs, BM, COMMUNICATION-EFFICIENT PARALLEL GRAPH ALGORITHMS., Proceedings of the International Conference on Parallel Processing (December, 1986), pp. 861-868  [abs]
  15. Maggs, BM, Critical look at three of parallel computing's maxims, Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN (January, 1996), pp. 1-7  [abs]
  16. Qureshi, A; Weber, R; Balakrishnan, H; Guttag, J; Maggs, B, Cutting the electric bill for internet-scale systems, Computer Communication Review, vol. 39 no. 4 (November, 2009), pp. 123-134, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]  [abs]
  17. Andreev, K; Maggs, BM; Meyerson, A; Sitaraman, RK, Designing overlay multicast networks for streaming, Annual ACM Symposium on Parallel Algorithms and Architectures (January, 2003), pp. 149-158 [doi]  [abs]
  18. Sripanidkulchai, K; Maggs, B; Zhang, H, Efficient content location using interest-based locality in peer-to-peer systems, Proceedings - IEEE INFOCOM, vol. 3 (December, 2003), pp. 2166-2176 [doi]  [abs]
  19. 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 (September, 1990), pp. 380-385  [abs]
  20. Poese, I; Frank, B; Smaragdakis, G; Uhlig, S; Feldmann, A; Maggs, B, Enabling content-aware traffic engineering, Computer Communication Review, vol. 42 no. 5 (October, 2012), pp. 22-28, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]  [abs]
  21. 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, vol. 32 no. 1 (January, 2002), pp. 80, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]
  22. 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, vol. 16 no. 2 (January, 2008), pp. 496, Institute of Electrical and Electronics Engineers (IEEE), ISSN 1063-6692 [doi]
  23. Leighton, T; Maggs, B, Expanders might be practical: Fast algorithms for routing around faults on multibutterflies, Annual Symposium on Foundations of Computer Science (Proceedings) (January, 1989), pp. 384-389 [doi]  [abs]
  24. 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 (December, 1997), pp. 284-293  [abs]
  25. Aiello, WA; Leighton, FT; Maggs, BM; Newman, M, Fast algorithms for bit-serial routing on a hypercube, Mathematical Systems Theory, vol. 24 no. 1 (December, 1991), pp. 253-271, Springer Nature, ISSN 0025-5661 [doi]  [abs]
  26. Aiello, B; Leighton, T; Maggs, B; Newman, M, Fast algorithms for bit-serial routing on a hypercube, Algorithms and Architectures (January, 1990), pp. 55-64 [doi]  [abs]
  27. Leighton, T; Maggs, B; Richa, AW, Fast algorithms for finding O(congestion + dilation) packet routing schedules, Combinatorica, vol. 19 no. 3 (January, 1999), pp. 375-401, Springer Nature [doi]  [abs]
  28. Leighton, FT; Maggs, BM, Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks, IEEE Transactions on Computers, vol. 41 no. 5 (January, 1992), pp. 578-587, Institute of Electrical and Electronics Engineers (IEEE) [doi]  [abs]
  29. Maggs, BM; Miller, GL; Parekh, O; Ravi, R; Woo, SLM, Finding effective support-tree preconditioned, Annual ACM Symposium on Parallelism in Algorithms and Architectures (December, 2005), pp. 176-185, ACM Press [doi]  [abs]
  30. Chan, THH; Chung, KM; Maggs, B; Shi, E, Foundations of Differentially Oblivious Algorithms, Journal of the ACM, vol. 69 no. 4 (August, 2022) [doi]  [abs]
  31. Dilley, J; Maggs, B; Parikh, J; Prokop, H; Sitaraman, R; Weihl, B, Globally distributed content delivery, IEEE Internet Computing, vol. 6 no. 5 (September, 2002), pp. 50-58, Institute of Electrical and Electronics Engineers (IEEE), ISSN 1089-7801 [doi]  [abs]
  32. Manjhi, A; Garrod, C; Maggs, BM; Mowry, TC; Tomasic, A, Holistic query transformations for dynamic web applications, Proceedings - International Conference on Data Engineering (July, 2009), pp. 1175-1178, IEEE, ISSN 1084-4627 [doi]  [abs]
  33. Maggs, BM; Vöcking, B, Improved routing and sorting on multibutterflies, Algorithmica (New York), vol. 28 no. 4 (December, 2000), pp. 438-464, Springer Nature [doi]  [abs]
  34. Maggs, BM; Voecking, B, Improved routing and sorting on multibutterflies, Conference Proceedings of the Annual ACM Symposium on Theory of Computing (January, 1997), pp. 517-530 [doi]  [abs]
  35. Manjhi, A; Gibbons, PB; Ailamaki, A; Garrod, C; Maggs, BM; Mowry, TC; Olston, C; Tomasic, A; Yu, H, Invalidation clues for database scalability services, Proceedings - International Conference on Data Engineering (September, 2007), pp. 316-325, IEEE, ISSN 1084-4627 [doi]  [abs]
  36. Fayazbakhsh, SK; Lin, Y; Tootoonchian, A; Ghodsi, A; Koponen, T; Maggs, B; Ng, KC; Sekar, V; Shenker, S, Less pain, most of the gain: Incrementally deployable ICN, Computer Communication Review, vol. 43 no. 4 (December, 2013), pp. 147-158, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]  [abs]
  37. Fayazbakhsh, SK; Lin, Y; Tootoonchian, A; Ghodsi, A; Koponen, T; Maggs, B; Ng, KC; Sekar, V; Shenker, S, 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, 2013), pp. 147-158, ACM Press [doi]  [abs]
  38. Feldmann, A; Maennel, O; Mao, ZM; Berger, A; Maggs, B, Locating Internet routing instabilities, Computer Communication Review, vol. 34 no. 4 (December, 2004), pp. 205-218, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]  [abs]
  39. Maggs, BM; Plotkin, SA, Minimum-cost spanning tree as a path-finding problem, Information Processing Letters, vol. 26 no. 6 (January, 1988), pp. 291-293, Elsevier BV, ISSN 0020-0190 [doi]  [abs]
  40. 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, vol. Part F129585 (June, 1993), pp. 561-572 [doi]  [abs]
  41. Bozkurt, IN; Huang, H; Maggs, B; Richa, A; Woo, M, Mutual Embeddings, Journal of Interconnection Networks, vol. 15 no. 1-2 (October, 2015), pp. 1550001-1550001, World Scientific Pub Co Pte Lt [doi]  [abs]
  42. Hubert Chan, TH; Gupta, A; Maggs, BM; Zhou, S, On hierarchical routing in doubling metrics, ACM Transactions on Algorithms, vol. 12 no. 4 (August, 2016), pp. 1-22, Association for Computing Machinery (ACM) [doi]  [abs]
  43. 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, vol. 27 no. 5 (October, 2019), pp. 2056-2070 [doi]  [abs]
  44. Cole, RJ; Maggs, BM; Sitaraman, RK, On the benefit of supporting virtual channels in wormhole routers, Journal of Computer and System Sciences, vol. 62 no. 1 (January, 2001), pp. 152-177, Elsevier BV, ISSN 0022-0000 [doi]  [abs]
  45. Cole, RJ; Maggs, BM; Sitaraman, RK, On the benefit of supporting virtual channels in wormhole routers, Annual ACM Symposium on Parallel Algorithms and Architectures (January, 1996), pp. 131-141 [doi]  [abs]
  46. Bornstein, CF; Litman, A; Maggs, BM; Sitaraman, RK; Yatzkar, T, On the bisection width and expansion of butterfly networks, Theory of Computing Systems, vol. 34 no. 6 (January, 2001), pp. 491-518, Springer Nature, ISSN 1432-4350 [doi]  [abs]
  47. 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, vol. 1998-March (January, 1998), pp. 144-150, IEEE Comput. Soc, ISSN 1063-7133 [doi]  [abs]
  48. 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 (December, 2007), pp. 215-220, ACM Press [doi]  [abs]
  49. Akella, A; Maggs, B; Seshan, S; Shaikh, A, On the performance benefits of multihoming route control, IEEE/ACM Transactions on Networking, vol. 16 no. 1 (February, 2008), pp. 91-104, Institute of Electrical and Electronics Engineers (IEEE), ISSN 1063-6692 [doi]  [abs]
  50. Arora, S; Leighton, FT; Maggs, BM, On-line algorithms for path selection in a nonblocking network, SIAM Journal on Computing, vol. 25 no. 3 (January, 1996), pp. 600-625, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  51. Arora, S; Leighton, T; Maggs, B, On-line algorithms for path selection in a nonblocking network (January, 1990), pp. 149-158 [doi]  [abs]
  52. Leighton, FT; Maggs, BM; Rao, SB, Packet routing and job-shop scheduling in O(congestion+dilation) steps, Combinatorica, vol. 14 no. 2 (June, 1994), pp. 167-186, Springer Nature, ISSN 0209-9683 [doi]  [abs]
  53. Blelloch, GE; Maggs, BM, Parallel Algorithms, ACM Computing Surveys, vol. 28 no. 1 (March, 1996), pp. 51-54, Association for Computing Machinery (ACM) [doi]
  54. Bornstein, C; Maggs, B; Miller, G; Ravi, R, Parallelizing elimination orders with linear fill, Annual Symposium on Foundations of Computer Science - Proceedings (December, 1997), pp. 274-283  [abs]
  55. Zhao, M; Aditya, P; Chen, A; Lin, Y; Haeberlen, A; Druschel, P; Maggs, B; Wishon, B; Ponec, M, Peer-assisted content distribution in Akamai netsession, Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC (December, 2013), pp. 31-42, ACM Press [doi]  [abs]
  56. 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 (December, 2007), pp. 289-300 [doi]  [abs]
  57. Parno, B; Wendlandt, D; Shi, E; Perrig, A; Maggs, B; Hu, YC, Portcullis: Protecting connection setup from denial-of-capability attacks, Computer Communication Review, vol. 37 no. 4 (October, 2007), pp. 289-300, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]  [abs]
  58. Fan, T; Higashi, R; Hinton, DE, Preface, Aquatic Toxicology, vol. 57 no. 1-2 (January, 2002), pp. 8 [doi]
  59. Birnbaumer, L; O'Malley, BW, Preface, Methods in Enzymology, vol. 109 no. C (January, 1985), pp. 17, Elsevier [doi]
  60. Gillman, D; Lin, Y; Maggs, B; Sitaraman, RK, Protecting Websites from Attack with Secure Delivery Networks, Computer, vol. 48 no. 4 (April, 2015), pp. 26-34, Institute of Electrical and Electronics Engineers (IEEE), ISSN 0018-9162 [doi]  [abs]
  61. Adler, M; Maggs, BM, Protocols for asymmetric communication channels, Journal of Computer and System Sciences, vol. 63 no. 4 (January, 2001), pp. 573-596, Elsevier BV, ISSN 0022-0000 [doi]  [abs]
  62. Adler, M; Maggs, BM, Protocols for asymmetric communication channels, Annual Symposium on Foundations of Computer Science - Proceedings (December, 1998), pp. 522-533  [abs]
  63. Cole, R; Maggs, BM; auf der Heide, FM; Mitzenmacher, M; Richa, AW; Schroder, K; Sitaraman, RK; Vocking, B, Randomized protocols for low-congestion circuit routing in multistage interconnection networks, Conference Proceedings of the Annual ACM Symposium on Theory of Computing (January, 1998), pp. 378-388 [doi]  [abs]
  64. Lejghton, FT; Maggs, BM; Ranade, AG; Rao, SB, Randomized routing and sorting on fixed-connection networks, Journal of Algorithms, vol. 17 no. 1 (January, 1994), pp. 157-205, Elsevier BV, ISSN 0196-6774 [doi]  [abs]
  65. Maggs, BM, Randomly wired multistage networks, Statistical Science, vol. 8 no. 1 (January, 1993), pp. 70-75, Institute of Mathematical Statistics [doi]  [abs]
  66. Maggs, BM; Schwabe, EJ, Real-time emulations of bounded-degree networks, Information Processing Letters, vol. 66 no. 5 (June, 1998), pp. 269-276, Elsevier BV [doi]
  67. Cole, RJ; Maggs, BM; Sitaraman, RK, Reconfiguring arrays with faults part I: Worst-case faults, SIAM Journal on Computing, vol. 26 no. 6 (January, 1997), pp. 1581-1611, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  68. Ganesh, A; Maggs, BM; Panigrahi, D, Robust algorithms for TSP and steiner tree, Leibniz International Proceedings in Informatics, LIPIcs, vol. 168 (June, 2020), ISBN 9783959771382 [doi]  [abs]
  69. Cole, R; Maggs, B; Sitaraman, R, Routing on butterfly networks with random faults, Annual Symposium on Foundations of Computer Science - Proceedings (December, 1995), pp. 558-570  [abs]
  70. Garrod, C; Manjhi, A; Ailamaki, A; Maggs, B; Mowry, T; Olston, C; Tomasic, A, Scalable query result caching for web applications, Proceedings of the VLDB Endowment, vol. 1 no. 1 (January, 2008), pp. 550-561, VLDB Endowment, ISSN 2150-8097 [doi]  [abs]
  71. Maggs, BM; Sitaraman, RK, Simple algorithms for routing on butterfly networks with bounded queues, SIAM Journal on Computing, vol. 28 no. 3 (January, 1999), pp. 984-1003, Society for Industrial & Applied Mathematics (SIAM), ISSN 0097-5397 [doi]  [abs]
  72. Maggs, BM; Sitaraman, RK, Simple algorithms for routing on butterfly networks with bounded queues, Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F129722 (July, 1992), pp. 150-161 [doi]  [abs]
  73. 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 (December, 2006), pp. 241-252, ACM Press, ISSN 0730-8078 [doi]  [abs]
  74. Andreev, K; Garrod, C; Golovin, D; Maggs, B; Meyerson, A, Simultaneous source location, ACM Transactions on Algorithms, vol. 6 no. 1 (December, 2009), pp. 1-17, Association for Computing Machinery (ACM), ISSN 1549-6325 [doi]  [abs]
  75. 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), vol. 3122 (January, 2004), pp. 13-26, ISSN 0302-9743 [doi]  [abs]
  76. Berthomé, P; Ferreira, A; Maggs, BM; Perennes, S; Plaxton, CG, Sorting-based selection algorithms for hypercubic networks, Algorithmica (New York), vol. 26 no. 2 (January, 2000), pp. 237-254, Springer Nature [doi]  [abs]
  77. 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 (January, 2003), pp. 374-383  [abs]
  78. Ciavaglia, L; Chemouil, P; Maggs, B, Techniques for smart and secure 5G softwarized networks, Annales des Telecommunications/Annals of Telecommunications, vol. 74 no. 9-10 (October, 2019), pp. 543-544 [doi]
  79. 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, vol. 34 no. 4 (December, 2004), pp. 107-120, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]  [abs]
  80. Ghosh, B; Leighton, FT; Maggs, BM; Muthukrishnan, S; Plaxton, CG; Rajaraman, R; Richa, AW; Tarjan, RE; Zuckerman, D, Tight analyses of two local load balancing algorithms, SIAM Journal on Computing, vol. 29 no. 1 (January, 1999), pp. 29-64, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  81. Bornstein, CF; Maggs, BM; Miller, GL, Tradeoffs between parallelism and fill in nested dissection, Annual ACM Symposium on Parallel Algorithms and Architectures (January, 1999), pp. 191-200 [doi]  [abs]
  82. Ganesh, A; Maggs, BM; Panigrahi, D, Universal Algorithms for Clustering Problems, ACM Transactions on Algorithms, vol. 19 no. 2 (March, 2023) [doi]  [abs]
  83. Leighton, T; Maggs, B; Rao, S, Universal packet routing algorithms, Annual Symposium on Foundations of Computer Science (Proceedings) (January, 1988), pp. 256-269 [doi]  [abs]
  84. Koch, RR; Leighton, FT; Maggs, BM; Rao, SB; Rosenberg, AL; Schwabe, EJ, Work-preserving emulations of fixed-connection networks, Journal of the ACM, vol. 44 no. 1 (January, 1997), pp. 104-147, Association for Computing Machinery (ACM) [doi]  [abs]
  85. Koch, R; Leighton, T; Maggs, B; Rao, S; Rosenberg, A, Work-preserving emulations of fixed-connection networks (January, 1989), pp. 227-240 [doi]  [abs]

Papers Published

  1. Bhattacherjee, D; Aqeel, W; Laughlin, G; Maggs, BM; Singla, A, A Bird's Eye View of the World's Fastest Networks, Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC (October, 2020), pp. 521-527, ISBN 9781450381383 [doi]  [abs]
  2. Bielloch, GE; Leiserson, CE; Maggs, BM; Plaxton, CG; Smith, SJ; Zagha, M, A comparison of sorting algorithms for the connection machine CM-2, Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1991 (June, 1991), pp. 3-16, ISBN 9780897914383 [doi]  [abs]
  3. Chung, T; Van Rijswijk-Deij, R; Chandrasekaran, B; Choffnes, D; Levin, D; Maggs, BM; Mislove, A; Wilson, C, A longitudinal, end-to-end view of the DnSSec ecosystem, Proceedings of the 26th USENIX Security Symposium (January, 2017), pp. 1307-1322, ISBN 9781931971409  [abs]
  4. Akella, A; Benson, T; Chandrasekaran, B; Huang, C; Maggs, B; Maltz, D, A universal approach to data center network design, ACM International Conference Proceeding Series, vol. 04-07-January-2015 (January, 2015), ACM Press, ISBN 9781450329286 [doi]  [abs]
  5. Maggs, BM; Sitaraman, RK, Algorithmic nuggets in content delivery, Computer Communication Review, vol. 45 no. 3 (July, 2015), pp. 52-66, Association for Computing Machinery (ACM) [doi]  [abs]
  6. Maggs, B; Rauch, M, An algorithm for finding predecessors in integer sets, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 709 LNCS (January, 1993), pp. 483-493, ISBN 9783540571551 [doi]  [abs]
  7. Liu, Y; Tome, W; Zhang, L; Choffnes, D; Levin, D; Maggs, B; Mislove, A; Schulman, A; Wilson, C, An end-to-end measurement of certificate revocation in the Web's PKI, Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC, vol. 2015-October (October, 2015), pp. 183-196, ACM Press, ISBN 9781450338486 [doi]  [abs]
  8. Zhang, X; Sen, T; Zhang, Z; April, T; Chandrasekaran, B; Choffnes, D; Maggs, BM; Shen, H; Sitaraman, RK; Yang, X, AnyOpt: Predicting and optimizing IP Anycast performance, SIGCOMM 2021 - Proceedings of the ACM SIGCOMM 2021 Conference (August, 2021), pp. 447-462, ISBN 9781450383837 [doi]  [abs]
  9. Pujol, E; Richter, P; Chandrasekaran, B; Smaragdakis, G; Feldmann, A; Maggs, B; Ng, KC, Back-office web traffic on the internet, Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC (November, 2014), pp. 257-270, ACM Press, ISBN 9781450332132 [doi]  [abs]
  10. Larisch, J; Choffnes, D; Levin, D; Maggs, BM; Mislove, A; Wilson, C, CRLite: A Scalable System for Pushing All TLS Revocations to All Browsers, Proceedings - IEEE Symposium on Security and Privacy (June, 2017), pp. 539-556, IEEE, ISBN 9781509055326 [doi]  [abs]
  11. Leighton, T; Maggs, B, Fast algorithms for finding O(congestion+dilation) packet routing schedules, Proceedings of the Annual Hawaii International Conference on System Sciences, vol. 2 (January, 1995), pp. 555-563, ISBN 0818669306 [doi]  [abs]
  12. Chan, THH; Chung, KM; Maggs, BM; Shi, E, Foundations of differentially oblivious algorithms, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (January, 2019), pp. 2448-2467 [doi]  [abs]
  13. Bhattacherjee, D; Aqeel, W; Bozkurt, IN; Aguirre, A; Chandrasekaran, B; Godfrey, PB; Laughlin, G; Maggs, B; Singla, A, Gearing up for the 21 st century space race, HotNets 2018 - Proceedings of the 2018 ACM Workshop on Hot Topics in Networks (November, 2018), pp. 113-119, ACM Press, ISBN 9781450361200 [doi]  [abs]
  14. Larisch, J; Aqeel, W; Lum, M; Goldschlag, Y; Kannan, L; Torshizi, K; Wang, Y; Chung, T; Levin, D; Maggs, BM; Mislove, A; Parno, B; Wilson, C, Hammurabi: A Framework for Pluggable, Logic-Based X.509 Certificate Validation Policies, Proceedings of the ACM Conference on Computer and Communications Security (November, 2022), pp. 1857-1870, ISBN 9781450394505 [doi]  [abs]
  15. Chung, T; Choffnes, D; Mislove, A; Lok, J; Levin, D; Rula, J; Wilson, C; Chandrasekaran, B; Maggs, BM; Sullivan, N, Is the web ready for OCSP must-staple?, Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC (October, 2018), pp. 105-118, ISBN 9781450356190 [doi]  [abs]
  16. Cangialosi, F; Chung, T; Choffnes, D; Levin, D; Maggs, BM; Mislove, A; Wilson, C, Measurement and analysis of private key sharing in the HTTPS ecosystem, Proceedings of the ACM Conference on Computer and Communications Security, vol. 24-28-October-2016 (October, 2016), pp. 628-640, ACM Press, ISBN 9781450341394 [doi]  [abs]
  17. Chung, T; Liu, Y; Choffnes, D; Levin, D; Maggs, BM; Mislove, A; Wilson, C, Measuring and applying invalid SSL Certificates: The silent majority, Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC, vol. 14-16-November-2016 (November, 2016), pp. 527-541, ACM Press, ISBN 9781450345262 [doi]  [abs]
  18. Chemouil, P; Maggs, B; Ciavaglia, L; Tafazolli, R, Message from the chairs, 21st Conference on Innovation in Clouds, Internet and Networks, ICIN 2018 (June, 2018), pp. 1, ISBN 9781538634585 [doi]
  19. Chiang, M; Maggs, B, Message from the program chairs, 2017 2nd ACM/IEEE Symposium on Edge Computing, SEC 2017 (October, 2017), ISBN 9781450350877 [doi]
  20. Wu, JS; Hsu, DF; Lai, F; Maggs, B; Chang, JF; Horiguchi, S; Hsu, CC, Messagfer om the organizers, 3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997 (January, 1997), pp. xi
  21. Maggs, BM; Matheson, LR; Tarjan, RE, Models of parallel computation: A survey and synthesis, Proceedings of the Annual Hawaii International Conference on System Sciences, vol. 2 (January, 1995), pp. 61-70, ISBN 0818669306 [doi]  [abs]
  22. Larisch, J; Aqeel, W; Chung, T; Kohler, E; Levin, D; Maggs, BM; Parno, B; Wilson, C, No Root Store Left Behind, HotNets 2023 - Proceedings of the 22nd ACM Workshop on Hot Topics in Networks (November, 2023), pp. 295-301, ISBN 9798400704154 [doi]  [abs]
  23. Cole, R; Frieze, A; Maggs, BM; Mitzenmacher, M; Richa, AW; Sitaraman, R; Upfal, E, On balls and bins with deletions, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1518 (January, 1998), pp. 145-158, Springer Berlin Heidelberg, ISBN 9783540651420 [doi]  [abs]
  24. Leighton, T; Maggs, B; Sitaraman, R, On the fault tolerance of some popular bounded-degree networks, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 1992-October (January, 1992), pp. 542-552, ISBN 0818629002 [doi]  [abs]
  25. Shi, E; Aqeel, W; Chandrasekaran, B; Maggs, B, Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12828 LNCS (January, 2021), pp. 641-669, ISBN 9783030842581 [doi]  [abs]
  26. Gupta, A; Maggs, BM; Oprea, F; Reiter, MK, Quorum placement in networks to minimize access delays, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, vol. 24 (January, 2005), pp. 87-96, ISBN 9781581139945 [doi]  [abs]
  27. Golovin, D; Gupta, A; Maggs, BM; Oprea, F; Reiter, MK, Quorum placement in networks: Minimizing network congestion, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, vol. 2006 (September, 2006), pp. 16-25, ISBN 9781595933843  [abs]
  28. Kushman, N; Kandula, S; Katabi, D; Maggs, BM, R-BGP: Staying connected in a connected world, 4th Symposium on Networked Systems Design and Implementation, NSDI 2007 (January, 2007), pp. 341-354  [abs]
  29. Mukerjee, MK; Bozkurt, IN; Ray, D; Maggs, BM; Seshan, S; Zhang, H, Redesigning cdn-broker interactions for improved content delivery, CoNEXT 2017 - Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies (November, 2017), pp. 68-80, ACM Press, ISBN 9781450354226 [doi]  [abs]
  30. 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, Performance Evaluation Review, vol. 44 no. 1 (June, 2016), pp. 89-100, ACM Press, ISBN 9781450342667 [doi]  [abs]
  31. Aditya, P; Zhao, M; Lin, Y; Haeberlen, A; Druschel, P; Maggs, B; Wishon, B, Reliable client accounting for P2P-infrastructure hybrids, Proceedings of NSDI 2012: 9th USENIX Symposium on Networked Systems Design and Implementation (January, 2012), pp. 99-112  [abs]
  32. Ganesh, A; Maggs, BM; Panigrahi, D, Robust Algorithms for TSP and Steiner Tree, ACM Transactions on Algorithms, vol. 19 no. 2 (March, 2023) [doi]  [abs]
  33. Flammini, M; Maggs, B; Sibeyn, J; Vöcking, B, Routing and communication in interconnection networks, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2400 (January, 2002), pp. 735-735, ISBN 3540440496
  34. Chung, T; Chandrasekaran, B; Maggs, BM; Aben, E; Choffnes, D; Mislove, A; Bruijnzeels, T; Levin, D; Van Rijswijk-Deij, R; Rula, J; Sullivan, N, RPKI is coming of age: A longitudinal study of RPKI deployment and invalid route origins, Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC (October, 2019), pp. 406-419, ISBN 9781450369480 [doi]  [abs]
  35. Berthome, P; Ferreira, A; Maggs, BM; Perennes, S; Plaxton, CG, Sorting-based selection algorithms for hypercubic networks, Proceedings of 7th International Parallel Processing Symposium, IPPS 1993 (January, 1993), pp. 89-95, ISBN 9780818634420 [doi]  [abs]
  36. Haney, S; Maggs, B; Maiti, B; Panigrahi, D; Rajaraman, R; Sundaram, R, Symmetric interdiction for matching problems, Leibniz International Proceedings in Informatics, LIPIcs, vol. 81 (August, 2017), ISBN 9783959770446 [doi]  [abs]
  37. Singla, A; Chandrasekaran, B; Brighten Godfrey, P; Maggs, B, The internet at the speed of light, Proceedings of the 13th ACM Workshop on Hot Topics in Networks, HotNets 2014 (October, 2014), ACM Press, ISBN 9781450332569 [doi]  [abs]
  38. Leighton, T; Maggs, B, The role of randomness in the design of interconnection networks, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 678 LNCS (January, 1993), pp. 131-145, ISBN 9783540567318 [doi]  [abs]
  39. Bilardi, G; Feldmann, R; Herley, K; Maggs, B, Topic 06, complexity theory and algorithms, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2150 (January, 2001), pp. 332, ISBN 9783540424956
  40. Chung, T; Levin, D; Van Rijswijk-Deij, R; Maggs, BM; Wilson, C; Choffnes, D; Mislove, A, Understanding the role of registrars in DNSSEC deployment, Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC, vol. Part F131937 (November, 2017), pp. 369-383, ACM Press, ISBN 9781450351188 [doi]  [abs]
  41. Aqeel, W; Bhattacherjee, D; Chandrasekaran, B; Godfrey, PB; Laughlin, G; Maggs, B; Singla, A, Untangling Header Bidding Lore: Some Myths, Some Truths, and Some Hope, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12048 LNCS (January, 2020), pp. 280-297, ISBN 9783030440800 [doi]  [abs]
  42. Bozkurt, IN; Aguirre, A; Chandrasekaran, B; Godfrey, PB; Laughlin, G; Maggs, B; Singla, A, Why is the internet so slow?!, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10176 LNCS (January, 2017), pp. 173-187, Springer International Publishing, ISBN 9783319543277 [doi]  [abs]
Duke University * Faculty * Staff * Reload * Login