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. 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, ISSN 0018-9162 [doi]
  2. BOZKURT, IN; HUANG, H; MAGGS, B; RICHA, A; WOO, M, Mutual Embeddings, Journal of Interconnection Networks, vol. 15 no. 01n02 (March, 2015), pp. 1550001-1550001 [doi]
  3. 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 [doi]  [abs]
  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: Incrementally deployable ICN, ACM SIGCOMM Computer Communication Review, vol. 43 no. 4 (December, 2013), pp. 147-158, ISSN 0146-4833 [doi]  [abs]
  5. 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 (2013), pp. 147-158 [doi]  [abs]
  6. Poese, I; Frank, B; Smaragdakis, G; Uhlig, S; Feldmann, A; Maggs, B, Enabling content-aware traffic engineering, ACM SIGCOMM Computer Communication Review, vol. 42 no. 5 (2012), pp. 22-28, ISSN 0146-4833 [doi]  [abs]
  7. Manjhi, A; Garrod, C; Maggs, BM; Mowry, TC; Tomasic, A, Holistic query transformations for dynamic web applications, Proceedings / International Conference on Data Engineering. International Conference on Data Engineering (2009), pp. 1175-1178, ISSN 1084-4627 [doi]  [abs]
  8. 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 (2009), pp. 123-134, ISSN 0146-4833 [doi]  [abs]
  9. Andreev, K; Garrod, C; Golovin, D; Maggs, B; Meyerson, A, Simultaneous source location, ACM Transactions on Algorithms, vol. 6 no. 1 (2009), ISSN 1549-6325 [doi]  [abs]
  10. 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 International Conference on Very Large Data Bases, vol. 1 no. 1 (2008), pp. 550-561, ISSN 2150-8097  [abs]
  11. Akella, A; Maggs, B; Seshan, S; Shaikh, A, On the performance benefits of multihoming route control, IEEE/ACM Transactions on Networking (ACM), vol. 16 no. 1 (2008), pp. 91-104, ISSN 1063-6692 [doi]  [abs]
  12. 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 (ACM), vol. 16 no. 2 (2008), pp. 496-, ISSN 1063-6692 [doi]
  13. Parno, B; Wendlandt, D; Shi, E; Perrig, A; Maggs, B; Hu, Y-C, Portcullis: Protecting connection setup from denial-of-capability attacks, ACM SIGCOMM Computer Communication Review, vol. 37 no. 4 (2007), pp. 289-300, ISSN 0146-4833 [doi]  [abs]
  14. 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. International Conference on Data Engineering (2007), pp. 316-325, ISSN 1084-4627 [doi]  [abs]
  15. Parno, B; Wendlandt, D; Shi, E; Perrig, A; Maggs, B; Hu, Y-C, Portcullis: Protecting connection setup from denial-of-capability attacks, ACM SIGCOMM 2007: Conference on Computer Communications (2007), pp. 289-300 [doi]  [abs]
  16. 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), pp. 215-220 [doi]  [abs]
  17. Maggs, BM, A survey of congestion+dilation results for packet scheduling, 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings (2007), pp. 1505-1510 [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 (2006), pp. 16-25  [abs]
  19. Manjhi, A; Ailamaki, A; Maggs, BM; Mowry, TC; Olston, C; Tomasic, A, Simultaneous scalability and security for data-intensive web applications, Proceedings / ACM-SIGMOD International Conference on Management of Data. ACM-Sigmod International Conference on Management of Data (2006), pp. 241-252, ISSN 0730-8078 [doi]  [abs]
  20. Chan, HT-H; Gupta, A; Maggs, BM; Zhou, S, On hierarchical routing in doubling metrics, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2005), pp. 762-771  [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 (2005), pp. 87-96  [abs]
  22. 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), pp. 56-69  [abs]
  23. 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), pp. 176-185 [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 (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 (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 (2004), pp. 41-54  [abs]
  27. 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 (2004), pp. 93-106, ISSN 0146-4833 [doi]  [abs]
  28. Feldmann, A; Maennel, O; Mao, ZM; Berger, A; Maggs, B, Locating Internet routing instabilities, ACM SIGCOMM Computer Communication Review, vol. 34 no. 4 (2004), pp. 205-218, ISSN 0146-4833 [doi]  [abs]
  29. 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 (2004), pp. 107-120, ISSN 0146-4833 [doi]  [abs]
  30. Andreev, K; Garrod, C; Maggs, B; Meyerson, A, Simultaneous source location, Lecture notes in computer science, vol. 3122 (2004), pp. 13-26, ISSN 0302-9743  [abs]
  31. Andreev, K; Maggs, BM; Meyerson, A; Sitaraman, RK, Designing overlay multicast networks for streaming, Annual ACM Symposium on Parallel Algorithms and Architectures (2003), pp. 149-158  [abs]
  32. 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), pp. 374-383  [abs]
  33. Sripanidkulchai, K; Maggs, B; Zhang, H, Efficient content location using interest-based locality in peer-to-peer systems, Proceedings - IEEE INFOCOM, vol. 3 (2003), pp. 2166-2176  [abs]
  34. Akella, A; Maggs, B; Seshan, S; Shaikh, A; Sitaraman, R, A Measurement-Based Analysis of Multihoming, ACM SIGCOMM Computer Communication Review, vol. 33 no. 4 (2003), pp. 353-364, ISSN 0146-4833  [abs]
  35. 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 (2002), pp. 80-, ISSN 0146-4833 [doi]
  36. Maggs, B, Preface, Annual ACM Symposium on Parallel Algorithms and Architectures, vol. 57 no. 1-2 (2002), pp. iii [doi]
  37. Dilley, J; Maggs, B; Parikh, J; Prokop, H; Sitaraman, R; Weihl, B, Globally distributed content delivery, IEEE Internet Computing, vol. 6 no. 5 (2002), pp. 50-58, ISSN 1089-7801 [doi]  [abs]
  38. 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 (2001), pp. 152-177, ISSN 0022-0000 [doi]  [abs]
  39. Adler, M; Maggs, BM, Protocols for asymmetric communication channels, Journal of Computer and System Sciences, vol. 63 no. 4 (2001), pp. 573-596, ISSN 0022-0000 [doi]  [abs]
  40. 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 (2001), pp. 491-518, ISSN 1432-4350  [abs]
  41. BerthomĂ©, P; Ferreira, A; Maggs, BM; Perennes, S; Plaxton, CG, Sorting-based selection algorithms for hypercubic networks, Algorithmica (New York), vol. 26 no. 2 (2000), pp. 237-254  [abs]
  42. Maggs, BM; Vöcking, B, Improved routing and sorting on multibutterflies, Algorithmica (New York), vol. 28 no. 4 (2000), pp. 438-464 [doi]  [abs]
  43. Leighton, T; Maggs, B; Richa, AW, Fast algorithms for finding O(congestion + dilation) packet routing schedules, Combinatorica, vol. 19 no. 3 (1999), pp. 375-401  [abs]
  44. Maggs, BM; Sitaraman, RK, Simple algorithms for routing on butterfly networks with bounded queues, SIAM Journal on Computing, vol. 28 no. 3 (1999), pp. 984-1003, ISSN 0097-5397  [abs]
  45. 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]
  46. 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 (1999), pp. 29-64  [abs]
  47. 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]
  48. Bornstein, C; Litman, A; Maggs, BM; Sitaraman, RK; Yatzkar, T, On the bisection width and expansion of butterfly networks, Proceedings of the International Parallel Processing Symposium, IPPS (1998), pp. 144-150, ISSN 1063-7133 [doi]  [abs]
  49. 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 (1998), pp. 135-167, ISSN 1432-4350  [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. Maggs, BM; Schwabe, EJ, Real-time emulations of bounded-degree networks, Information Processing Letters, vol. 66 no. 5 (1998), pp. 269-276
  52. 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 (1997), pp. 104-147  [abs]
  53. 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]
  54. Cole, RJ; Maggs, BM; Sitaraman, RK, Reconfiguring arrays with faults part I: Worst-case faults, SIAM Journal on Computing, vol. 26 no. 6 (1997), pp. 1581-1611  [abs]
  55. Bornstein, C; Maggs, B; Miller, G; Ravi, R, Parallelizing elimination orders with linear fill, Annual Symposium on Foundations of Computer Science - Proceedings (1997), pp. 274-283  [abs]
  56. 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]
  57. Blelloch, GE; Maggs, BM, Parallel algorithms, ACM Computing Surveys, vol. 28 no. 1 (1996), pp. 50-54
  58. 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]
  59. 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]
  60. Arora, S; Leighton, FT; Maggs, BM, On-line algorithms for path selection in a nonblocking network, SIAM Journal on Computing, vol. 25 no. 3 (1996), pp. 600-625  [abs]
  61. Cox, IJ; Hingorani, SL; Rao, SB; Maggs, BM, A Maximum Likelihood Stereo Algorithm, Computer Vision and Image Understanding, vol. 63 no. 3 (1996), pp. 542-567 [doi]  [abs]
  62. 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]
  63. Goldberg, AV; Maggs, BM; Poltkin, SA, Parallel algorithm for reconfiguring a multibutterfly network with faulty switches, IEEE Transactions on Computers, vol. 43 no. 3 (1994), pp. 321-326 [doi]  [abs]
  64. Leighton, FT; Maggs, BM; Rao, SB, Packet routing and job-shop scheduling in O(congestion+dilation) steps, Combinatorica, vol. 14 no. 2 (1994), pp. 167-186, ISSN 0209-9683 [doi]  [abs]
  65. Leighton, FT; Maggs, BM; Ranade, AG; Rao, SB, Randomized Routing and Sorting on Fixed-Connection Networks, Journal of Algorithms, vol. 17 no. 1 (1994), pp. 157-205, ISSN 0196-6774 [doi]  [abs]
  66. Maggs, BM, Randomly Wired Multistage Networks, Statistical science : a review journal of the Institute of Mathematical Statistics, vol. 8 no. 1 (February, 1993), pp. 70-75 [doi]
  67. 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]
  68. 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]
  69. 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 (1992), pp. 578-587 [doi]  [abs]
  70. 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]
  71. Aiello, WA; Leighton, FT; Maggs, BM; Newman, M, Fast algorithms for bit-serial routing on a hypercube, Mathematical Systems Theory, vol. 24 no. 1 (1991), pp. 253-271, ISSN 0025-5661 [doi]  [abs]
  72. 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]
  73. Arora, S; Leighton, T; Maggs, B, On-line algorithms for path selection in a nonblocking network (1990), pp. 149-158  [abs]
  74. 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]
  75. Koch, R; Leighton, T; Maggs, B; Rao, S; Rosenberg, A, Work-preserving emulations of fixed-connection networks (1989), pp. 227-240  [abs]
  76. 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]
  77. Leighton, T; Maggs, B; Rao, S, Universal packet routing algorithms, Annual Symposium on Foundations of Computer Science (Proceedings) (1988), pp. 256-269  [abs]
  78. Leiserson, CE; Maggs, BM, Communication-efficient parallel algorithms for distributed random-access machines, Algorithmica, vol. 3 no. 1 (1988), pp. 53-77, ISSN 0178-4617 [doi]  [abs]
  79. Maggs, BM; Plotkin, SA, Minimum-cost spanning tree as a path-finding problem, Information Processing Letters, vol. 26 no. 6 (1988), pp. 291-293, ISSN 0020-0190  [abs]
  80. Leiserson, CE; Maggs, BM, Communication-efficient parallel algorithms for distributed random-access machines, Algorithmica, vol. 3 no. 1-4 (1988), pp. 53-77, ISSN 0178-4617 [doi]  [abs]
  81. 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]
  82. Leiserson, CE; Maggs, BM, COMMUNICATION-EFFICIENT PARALLEL GRAPH ALGORITHMS., Proceedings of the International Conference on Parallel Processing (1986), pp. 861-868  [abs]

Papers Published

  1. 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, ISBN 9781450354226 [doi]  [abs]
  2. 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, ISBN 9781450351188 [doi]  [abs]
  3. Haney, S; Maggs, B; Maiti, B; Panigrahi, D; Rajaraman, R; Sundaram, R, Symmetric interdiction for matching problems, 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, IEEE Symposium on Security and Privacy (June, 2017), pp. 539-556, 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, vol. 10176 LNCS (January, 2017), pp. 173-187, ISBN 9783319543277 [doi]  [abs]
  6. 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, ISBN 9781450345262 [doi]  [abs]
  7. 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, ISBN 9781450341394 [doi]  [abs]
  8. Narayanan, SP; Nam, YS; Sivakumar, A; Chandrasekaran, B; Maggs, B; Rao, S, Reducing latency through page-aware management of web objects by content delivery networks, SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science (June, 2016), pp. 89-100, ISBN 9781450342667 [doi]  [abs]
  9. 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, ISBN 9781450338486 [doi]  [abs]
  10. Maggs, BM; Sitaraman, RK, Algorithmic Nuggets in Content Delivery, ACM SIGCOMM Computer Communication Review, vol. 45 no. 3 (July, 2015), pp. 52-66 [doi]
  11. 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), ISBN 9781450329286 [doi]  [abs]
  12. 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 (January, 2014), ISBN 9781450332569 [doi]  [abs]
  13. 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 (January, 2014), pp. 257-270, ISBN 9781450332132 [doi]  [abs]
  14. Flammini, M; Maggs, B; Sibeyn, BMJ; Vocking, B, Routing and communication in interconnection networks, Lecture notes in computer science, vol. 2400 (2002), pp. 735-735, ISBN 3-540-44049-6
  15. Bilardi, G; Feldmann, R; Herley, K; Maggs, B, Topic 06, complexity theory and algorithms, Lecture notes in computer science, vol. 2150 (January, 2001), pp. 332, ISBN 3540424954
  16. 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, vol. 1518 (January, 1998), pp. 145-158, ISBN 354065142X [doi]  [abs]
  17. Maggs, B; Rauch, M, An algorithm for finding predecessors in integer sets, Lecture notes in computer science, vol. 709 LNCS (January, 1993), pp. 483-493, ISBN 9783540571551  [abs]
  18. Leighton, T; Maggs, B, The role of randomness in the design of interconnection networks, Lecture notes in computer science, vol. 678 LNCS (January, 1993), pp. 131-145, ISBN 9783540567318  [abs]

Duke University * Faculty * Staff * Reload * Login