Energy Initiative Energy Initiative
Office of the Provost
Duke University

 HOME > Provost > Energy Initiative    Search Help Login pdf version printable version 

Publications of Bruce M. Maggs    :chronological  alphabetical  combined  bibtex listing:

Journal articles or Book chapters PUBLISHED

  1. Chan, T-HH; 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]
  2. 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]
  3. BOZKURT, ILKERNADI; HUANG, HAI; MAGGS, BRUCE; RICHA, A; WOO, MAVERICK, Mutual Embeddings, Journal of Interconnection Networks, vol. 15 no. 01n02 (March, 2015), pp. 1550001-1550001, World Scientific Pub Co Pte Lt [doi]
  4. Fayazbakhsh, SK; Lin, Y; Tootoonchian, A; Ghodsi, A; Koponen, T; Maggs, B; Ng, KC; Sekar, V; Shenker, S, Less pain, most of the gain, Acm Sigcomm Computer Communication Review, vol. 43 no. 4 (August, 2013), pp. 147-158, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]  [abs]
  5. 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 2013 Conference on Internet Measurement Conference Imc '13 (2013), pp. 31-42, ACM Press [doi]  [abs]
  6. Fayazbakhsh, SK; Lin, Y; Tootoonchian, A; Ghodsi, A; Koponen, T; Maggs, B; Ng, KC; Sekar, V; Shenker, S, Less pain, most of the gain, Proceedings of the Acm Sigcomm 2013 Conference on Sigcomm Sigcomm '13 (2013), pp. 147-158, ACM Press [doi]  [abs]
  7. Poese, I; Poese, B; Smaragdakis, G; Uhlig, S; Feldmann, A; Maggs, B, Enabling content-aware traffic engineering, Acm Sigcomm Computer Communication Review, vol. 42 no. 5 (September, 2012), pp. 21-21, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]  [abs]
  8. 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]
  9. Qureshi, A; Weber, R; Balakrishnan, H; Guttag, J; Maggs, B, Cutting the electric bill for internet-scale systems, Acm Sigcomm Computer Communication Review, vol. 39 no. 4 (August, 2009), pp. 123-123, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]  [abs]
  10. Manjhi, A; Garrod, C; Maggs, BM; Mowry, TC; Tomasic, A, Holistic Query Transformations for Dynamic Web Applications, Proceedings International Conference on Data Engineering (March, 2009), pp. 1175-1178, IEEE, ISSN 1084-4627 [doi]  [abs]
  11. 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 (August, 2008), pp. 550-561, VLDB Endowment, ISSN 2150-8097 [doi]  [abs]
  12. Akella, A; Maggs, B; Seshan, S; Shaikh, A; Sitaraman, RK, Corrections to "On the Performance Benefits of Multihoming Route Control", Ieee/Acm Transactions on Networking, vol. 16 no. 2 (April, 2008), pp. 496-496, Institute of Electrical and Electronics Engineers (IEEE), ISSN 1063-6692 [doi]
  13. 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]
  14. 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]
  15. Parno, B; Wendlandt, D; Shi, E; Perrig, A; Maggs, B; Hu, Y-C, Portcullis, Acm Sigcomm Computer Communication Review, vol. 37 no. 4 (October, 2007), pp. 289-289, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]  [abs]
  16. Manjhi, A; Gibbons, PB; Ailamaki, A; Garrod, C; Maggs, BM; Mowry, TC; Olston, C; Tomasic, A; Yu, H, Invalidation Clues for Database Scalability Services, 2007 Ieee 23rd International Conference on Data Engineering (April, 2007), pp. 316-325, IEEE, ISSN 1084-4627 [doi]  [abs]
  17. Zhang, Y; Zhang, Z; Mao, ZM; Hu, C; MacDowell Maggs, B, On the impact of route monitor selection, Proceedings of the 7th Acm Sigcomm Conference on Internet Measurement Imc '07 (2007), pp. 215-220, ACM Press [doi]  [abs]
  18. 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  [abs]
  19. Maggs, B, A Survey of Congestion+Dilation Results for Packet Scheduling, 2006 40th Annual Conference on Information Sciences and Systems (March, 2006), pp. 1505-1510, IEEE [doi]  [abs]
  20. Manjhi, A; Ailamaki, A; Maggs, BM; Mowry, TC; Olston, C; Tomasic, A, Simultaneous scalability and security for data-intensive web applications, Proceedings of the 2006 Acm Sigmod International Conference on Management of Data Sigmod '06 (2006), pp. 241-252, ACM Press, ISSN 0730-8078 [doi]  [abs]
  21. 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 (December, 2005), pp. 87-96  [abs]
  22. 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]
  23. Maggs, BM; Miller, GL; Parekh, O; Ravi, R; Woo, SLM, Finding effective support-tree preconditioners, Proceedings of the 17th Annual Acm Symposium on Parallelism in Algorithms and Architectures Spaa'05 (2005), pp. 176-185, ACM Press [doi]  [abs]
  24. Feldmann, A; Kammenhuber, N; Maennel, O; Maggs, B; Prisco, RD; Sundaram, R, A methodology for estimating interdomain Web traffic demand, Proceedings of the 2004 Acm Sigcomm Internet Measurement Conference, Imc 2004 (December, 2004), pp. 322-335  [abs]
  25. Pang, J; Prisco, RD; 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 (December, 2004), pp. 1-14  [abs]
  26. 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 (December, 2004), pp. 41-54  [abs]
  27. Meyerson, A, Simultaneous source location, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3122 (December, 2004), pp. 13-26, ISSN 0302-9743  [abs]
  28. Akella, A; Pang, J; Maggs, B; Seshan, S; Shaikh, A, A comparison of overlay routing and multihoming route control, Acm Sigcomm Computer Communication Review, vol. 34 no. 4 (October, 2004), pp. 93-93, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]  [abs]
  29. Feldmann, A; Maennel, O; Mao, ZM; Berger, A; Maggs, B, Locating internet routing instabilities, Acm Sigcomm Computer Communication Review, vol. 34 no. 4 (October, 2004), pp. 205-205, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]  [abs]
  30. Sripanidkulchai, K; Ganjam, A; Maggs, B; Zhang, H, The feasibility of supporting large-scale live streaming applications with dynamic application end-points, Acm Sigcomm Computer Communication Review, vol. 34 no. 4 (October, 2004), pp. 107-107, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]  [abs]
  31. Sitaraman, R, A Measurement-Based Analysis of Multihoming, Acm Sigcomm Computer Communication Review, vol. 33 no. 4 (October, 2003), pp. 353-364, ISSN 0146-4833  [abs]
  32. Sripanidkulchai, K; Maggs, B; Zhang, H, Efficient content location using interest-based locality in peer-to-peer systems, Proceedings Ieee Infocom, vol. 3 (September, 2003), pp. 2166-2176  [abs]
  33. Andreev, K; Maggs, BM; Meyerson, A; Sitaraman, RK, Designing overlay multicast networks for streaming, Annual Acm Symposium on Parallel Algorithms and Architectures (July, 2003), pp. 149-158  [abs]
  34. 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]
  35. 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]
  36. Sripanidkulchai, K; Maggs, B; Zhang, H, Enabling efficient content location and retrieval in peer-to-peer systems by exploiting locality in interests, Acm Sigcomm Computer Communication Review, vol. 32 no. 1 (January, 2002), pp. 80-80, Association for Computing Machinery (ACM), ISSN 0146-4833 [doi]
  37. Adler, M; Maggs, BM, Protocols for Asymmetric Communication Channels, Journal of Computer and System Sciences, vol. 63 no. 4 (December, 2001), pp. 573-596, Elsevier BV, ISSN 0022-0000 [doi]  [abs]
  38. 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 (December, 2001), pp. 491-518, Springer Nature, ISSN 1432-4350 [doi]  [abs]
  39. 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 (February, 2001), pp. 152-177, Elsevier BV, ISSN 0022-0000 [doi]  [abs]
  40. Maggs, BM; Vöcking, B, Improved Routing and Sorting on Multibutterflies, Algorithmica, vol. 28 no. 4 (December, 2000), pp. 438-437, Springer Nature [doi]  [abs]
  41. BerthomĂ©, P; Ferreira, A; Maggs, BM; Perennes, S; Plaxton, CG, Sorting-Based Selection Algorithms for Hypercubic Networks, Algorithmica, vol. 26 no. 2 (February, 2000), pp. 237-254, Springer Nature [doi]  [abs]
  42. Leighton, T; Maggs, B; Richa, AXAW, Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules, Combinatorica, vol. 19 no. 3 (March, 1999), pp. 375-401, Springer Nature [doi]  [abs]
  43. 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]
  44. Bornstein, CF; Maggs, BM; Miller, GL, Tradeoffs between parallelism and fill in nested dissection, Annual ACM Symposium on Parallel Algorithms and Architectures (1999), pp. 191-200  [abs]
  45. 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]
  46. Blelloch, GE; E. Leiserson, B. M. Maggs, C, An Experimental Analysis of Parallel Sorting Algorithms, Theory of Computing Systems, vol. 31 no. 2 (March, 1998), pp. 135-167, 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. Maggs, BM; Sitaraman, RK, Simple Algorithms for Routing on Butterfly Networks with Bounded Queues, Siam Journal on Computing, vol. 28 no. 3 (January, 1998), pp. 984-1003, Society for Industrial & Applied Mathematics (SIAM), ISSN 0097-5397 [doi]  [abs]
  49. Cole, R; Maggs, BM; Heide, FMAD; 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 (1998), pp. 378-388  [abs]
  50. Adler, M; Maggs, BM, Protocols for asymmetric communication channels, Annual Symposium on Foundations of Computer Science - Proceedings (1998), pp. 522-533  [abs]
  51. Cole, RJ; Maggs, BM; Sitaraman, RK, Reconfiguring Arrays with Faults Part I: Worst-Case Faults, Siam Journal on Computing, vol. 26 no. 6 (December, 1997), pp. 1581-1611, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  52. 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]
  53. 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]
  54. Maggs, BM; Voecking, B, Improved routing and sorting on multibutterflies, Conference Proceedings of the Annual ACM Symposium on Theory of Computing (1997), pp. 517-530  [abs]
  55. Maggs, BM; Heide, FMAD; Westermann, M; Voecking, B, Exploiting locality for data management in systems of limited bandwidth, Annual Symposium on Foundations of Computer Science - Proceedings (1997), pp. 284-293  [abs]
  56. Arora, S; Leighton, FT; Maggs, BM, On-Line Algorithms for Path Selection in a Nonblocking Network, Siam Journal on Computing, vol. 25 no. 3 (June, 1996), pp. 600-625, Society for Industrial & Applied Mathematics (SIAM) [doi]  [abs]
  57. Cox, IJ; Hingorani, SL; Rao, SB; Maggs, BM, A Maximum Likelihood Stereo Algorithm, Computer Vision and Image Understanding, vol. 63 no. 3 (May, 1996), pp. 542-567, Elsevier BV [doi]  [abs]
  58. Blelloch, GE; Maggs, BM, Parallel algorithms, Acm Computing Surveys, vol. 28 no. 1 (March, 1996), pp. 51-54, Association for Computing Machinery (ACM) [doi]
  59. 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), pp. 1-7  [abs]
  60. 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), pp. 131-141  [abs]
  61. Cole, R; Maggs, B; Sitaraman, R, Routing on butterfly networks with random faults, Annual Symposium on Foundations of Computer Science - Proceedings (1995), pp. 558-570  [abs]
  62. Leighton, FT; Maggs, BM; Ranade, AG; Rao, SB, Randomized Routing and Sorting on Fixed-Connection Networks, Journal of Algorithms, vol. 17 no. 1 (July, 1994), pp. 157-205, Elsevier BV, ISSN 0196-6774 [doi]  [abs]
  63. Leighton, FT; Maggs, BM; Rao, SB, Packet routing and job-shop scheduling inO(congestion+dilation) steps, Combinatorica, vol. 14 no. 2 (June, 1994), pp. 167-186, Springer Nature, ISSN 0209-9683 [doi]  [abs]
  64. Goldberg, AV; Maggs, BM; Plotkin, SA, A parallel algorithm for reconfiguring a multibutterfly network with faulty switches, Ieee Transactions on Computers, vol. 43 no. 3 (March, 1994), pp. 321-326, Institute of Electrical and Electronics Engineers (IEEE) [doi]  [abs]
  65. Maggs, BM, Randomly Wired Multistage Networks, Statistical Science, vol. 8 no. 1 (February, 1993), pp. 70-75, Institute of Mathematical Statistics [doi]
  66. Aiello, W; Awerbuch, B; Maggs, B; Rao, S, Approximate load balancing on dynamic and asynchronous networks, Conference Proceedings of the Annual ACM Symposium on Theory of Computing (1993), pp. 632-641  [abs]
  67. Cole, R; Maggs, B; Sitaraman, R, Multi-scale self-simulation: A technique for reconfiguring arrays with faults, Conference Proceedings of the Annual ACM Symposium on Theory of Computing (1993), pp. 561-572  [abs]
  68. 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 (May, 1992), pp. 578-587, Institute of Electrical and Electronics Engineers (IEEE) [doi]  [abs]
  69. Maggs, BM; Sitaraman, RK, Simple algorithms for routing on butterfly networks with bounded queues, Conference Proceedings of the Annual ACM Symposium on Theory of Computing (1992), pp. 150-161  [abs]
  70. 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]
  71. Aiello, B; Leighton, T; Maggs, B; Newman, M, Fast algorithms for bit-serial routing on a hypercube, Algorithms and Architectures (1990), pp. 55-64  [abs]
  72. Arora, S; Leighton, T; Maggs, B, On-line algorithms for path selection in a nonblocking network (1990), pp. 149-158  [abs]
  73. 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), pp. 380-385  [abs]
  74. Koch, R; Leighton, T; Maggs, B; Rao, S; Rosenberg, A, Work-preserving emulations of fixed-connection networks (1989), pp. 227-240  [abs]
  75. 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), pp. 384-389  [abs]
  76. Leiserson, CE; Maggs, BM, Communication-efficient parallel algorithms for distributed random-access machines, Algorithmica, vol. 3 no. 1-4 (November, 1988), pp. 53-77, Springer Nature, ISSN 0178-4617 [doi]  [abs]
  77. 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]
  78. 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]
  79. Leighton, T; Maggs, B; Rao, S, Universal packet routing algorithms, Annual Symposium on Foundations of Computer Science (Proceedings) (1988), pp. 256-269  [abs]
  80. Leiserson, CE; Maggs, BM, COMMUNICATION-EFFICIENT PARALLEL ALGORITHMS FOR DISTRIBUTED RANDOM-ACCESS MACHINES., Algorithmica (New York), vol. 38 no. 9 (1987), pp. 53-77  [abs]
  81. Leiserson, CE; Maggs, BM, COMMUNICATION-EFFICIENT PARALLEL GRAPH ALGORITHMS., Proceedings of the International Conference on Parallel Processing (1986), pp. 861-868  [abs]
  82. Birnbaumer, L; O'Malley, BW, Preface, Methods in Enzymology, vol. 57 no. 1-2 (1985), pp. xvii-xvii, Elsevier [doi]

Papers Published

  1. 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]
  2. Bhattacherjee, D; Aqeel, W; Bozkurt, IN; Aguirre, A; Chandrasekaran, B; Godfrey, PB; Laughlin, G; Maggs, B; Singla, A, Gearing up for the 21st century space race, Proceedings of the 17th Acm Workshop on Hot Topics in Networks Hotnets '18 (2018), ACM Press, ISBN 9781450361200 [doi]
  3. 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]
  4. Larisch, J; Choffnes, D; Levin, D; Maggs, BM; Mislove, A; Wilson, C, CRLite: A Scalable System for Pushing All TLS Revocations to All Browsers, 2017 Ieee Symposium on Security and Privacy (Sp) (May, 2017), pp. 539-556, IEEE, ISBN 9781509055326 [doi]  [abs]
  5. 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 (2017), pp. 173-187, Springer International Publishing, ISBN 9783319543277 [doi]  [abs]
  6. Chung, T; van Rijswijk-Deij, R; Choffnes, D; Levin, D; Maggs, BM; Mislove, A; Wilson, C, Understanding the role of registrars in DNSSEC deployment, Proceedings of the 2017 Internet Measurement Conference on Imc '17, vol. Part F131937 (2017), pp. 369-383, ACM Press, ISBN 9781450351188 [doi]  [abs]
  7. Mukerjee, MK; Bozkurt, IN; Ray, D; Maggs, BM; Seshan, S; Zhang, H, Redesigning CDN-Broker Interactions for Improved Content Delivery, Proceedings of the 13th International Conference on Emerging Networking Experiments and Technologies Conext '17 (2017), pp. 68-80, ACM Press, ISBN 9781450354226 [doi]  [abs]
  8. 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, Proceedings of the 2016 Acm Sigmetrics International Conference on Measurement and Modeling of Computer Science Sigmetrics '16 (2016), pp. 89-100, ACM Press, ISBN 9781450342667 [doi]  [abs]
  9. 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 2016 Acm Sigsac Conference on Computer and Communications Security Ccs'16, vol. 24-28-October-2016 (2016), pp. 628-640, ACM Press, ISBN 9781450341394 [doi]  [abs]
  10. Chung, T; Liu, Y; Choffnes, D; Levin, D; Maggs, BM; Mislove, A; Wilson, C, Measuring and Applying Invalid SSL Certificates, Proceedings of the 2016 Acm on Internet Measurement Conference Imc '16, vol. 14-16-November-2016 (2016), pp. 527-541, ACM Press, ISBN 9781450345262 [doi]  [abs]
  11. Maggs, BM; Sitaraman, RK, Algorithmic Nuggets in Content Delivery, Acm Sigcomm Computer Communication Review, vol. 45 no. 3 (July, 2015), pp. 52-66, Association for Computing Machinery (ACM) [doi]
  12. Akella, A; Benson, T; Chandrasekaran, B; Huang, C; Maggs, B; Maltz, D, A Universal Approach to Data Center Network Design, Proceedings of the 2015 International Conference on Distributed Computing and Networking Icdcn '15, vol. 04-07-January-2015 (2015), ACM Press, ISBN 9781450329286 [doi]  [abs]
  13. 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 2015 Acm Conference on Internet Measurement Conference Imc '15, vol. 2015-October (2015), pp. 183-196, ACM Press, ISBN 9781450338486 [doi]  [abs]
  14. Singla, A; Chandrasekaran, B; Godfrey, PB; Maggs, B, The Internet at the Speed of Light, Proceedings of the 13th Acm Workshop on Hot Topics in Networks Hotnets Xiii (2014), ACM Press, ISBN 9781450332569 [doi]  [abs]
  15. Pujol, E; Richter, P; Chandrasekaran, B; Smaragdakis, G; Feldmann, A; Maggs, BM; Ng, K-C, Back-Office Web Traffic on The Internet, Proceedings of the 2014 Conference on Internet Measurement Conference Imc '14 (2014), pp. 257-270, ACM Press, ISBN 9781450332132 [doi]  [abs]
  16. Flammini, M; Maggs, B; Sibeyn, BMJ; Vocking, 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
  17. 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 3540424954
  18. 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 (1998), pp. 145-158, Springer Berlin Heidelberg, ISBN 9783540651420 [doi]  [abs]
  19. 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  [abs]
  20. 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  [abs]
  21. 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 0897914384  [abs]

Duke University * Faculty * Staff * Reload * Login