2012
90Enabling content-aware traffic engineering. Ingmar Poese, Benjamin Poese, Georgios Smaragdakis, Steve Uhlig, Anja Feldmann, Bruce M. Maggs. Computer Communication Review (42): 21-28 (2012). Web SearchBibTeXDownload
89Posit: a lightweight approach for IP geolocation. Brian Eriksson, Paul Barford, Bruce M. Maggs, Robert Nowak. SIGMETRICS Performance Evaluation Review (40): 2-11 (2012). Web SearchBibTeXDownload
2011
88Algorithms for Constructing Overlay Networks For Live Streaming. Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Jevan Saks, Ramesh K. Sitaraman. CoRR (abs/1109.4114) (2011). Web SearchBibTeXDownload
2009
87Simultaneous source location. Konstantin Andreev, Charles Garrod, Daniel Golovin, Bruce M. Maggs, Adam Meyerson. ACM Transactions on Algorithms (6) (2009). Web SearchBibTeXDownload
86Holistic Query Transformations for Dynamic Web Applications. Amit Manjhi, Charles Garrod, Bruce M. Maggs, Todd C. Mowry, Anthony Tomasic. ICDE 2009, 1175-1178. Web SearchBibTeXDownload
2008
85On the performance benefits of multihoming route control. Aditya Akella, Bruce M. Maggs, Srinivasan Seshan, Anees Shaikh. IEEE/ACM Trans. Netw. (16): 91-104 (2008). Web SearchBibTeXDownload
84Corrections to "on the performance benefits of multihoming route control". Aditya Akella, Bruce M. Maggs, Srinivasan Seshan, Anees Shaikh, Ramesh K. Sitaraman. IEEE/ACM Trans. Netw. (16): 496 (2008). Web SearchBibTeXDownload
83Scalable query result caching for web applications. Charles Garrod, Amit Manjhi, Anastasia Ailamaki, Bruce M. Maggs, Todd C. Mowry, Christopher Olston, Anthony Tomasic. PVLDB (1): 550-561 (2008). Cited by 3Web SearchBibTeXDownload
2007
82Invalidation Clues for Database Scalability Services. Amit Manjhi, Phillip B. Gibbons, Anastassia Ailamaki, Charles Garrod, Bruce M. Maggs, Todd C. Mowry, Christopher Olston, Anthony Tomasic, Haifeng Yu. ICDE 2007, 316-325. Cited by 7Web SearchBibTeXDownload
81On the impact of route monitor selection. Ying Zhang, Zheng Zhang, Zhuoqing Morley Mao, Y. Charlie Hu, Bruce M. Maggs. Internet Measurement Comference 2007, 215-220. Web SearchBibTeXDownload
80R-BGP: Staying Connected in a Connected World. Nate Kushman, Srikanth Kandula, Dina Katabi, Bruce M. Maggs. NSDI 2007. Web SearchBibTeXDownload
79Portcullis: protecting connection setup from denial-of-capability attacks. Bryan Parno, Dan Wendlandt, Elaine Shi, Adrian Perrig, Bruce M. Maggs, Yih-Chun Hu. SIGCOMM 2007, 289-300. Web SearchBibTeXDownload
2006
78Quorum placement in networks: minimizing network congestion. Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter. PODC 2006, 16-25. Web SearchBibTeXDownload
77Simultaneous scalability and security for data-intensive web applications. Amit Manjhi, Anastassia Ailamaki, Bruce M. Maggs, Todd C. Mowry, Christopher Olston, Anthony Tomasic. SIGMOD Conference 2006, 241-252. Cited by 11Web SearchBibTeXDownload
2005
76A Scalability Service for Dynamic Web Applications. Christopher Olston, Amit Manjhi, Charles Garrod, Anastassia Ailamaki, Bruce M. Maggs, Todd C. Mowry. CIDR 2005, 56-69. Cited by 30Web SearchBibTeXDownload
75Quorum placement in networks to minimize access delays. Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter. PODC 2005, 87-96. Web SearchBibTeXDownload
74On hierarchical routing in doubling metrics. Hubert T.-H. Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou. SODA 2005, 762-771. Web SearchBibTeXDownload
73Finding effective support-tree preconditioners. Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo. SPAA 2005, 176-185. Web SearchBibTeXDownload
72Do we need more web performance research?. Michael Rabinovich, Giovanni Pacifici, Michele Colajanni, Krithi Ramamritham, Bruce M. Maggs. WWW (Special interest tracks and posters) 2005, 794. Web SearchBibTeXDownload
2004
71Simultaneous Source Location. Konstantin Andreev, Charles Garrod, Bruce M. Maggs, Adam Meyerson. APPROX-RANDOM 2004, 13-26. Web SearchBibTeXDownload
70A methodology for estimating interdomain web traffic demand. Anja Feldmann, Nils Kammenhuber, Olaf Maennel, Bruce M. Maggs, Roberto De Prisco, Ravi Sundaram. Internet Measurement Conference 2004, 322-335. Web SearchBibTeXDownload
69Availability, usage, and deployment characteristics of the domain name system. Jeffrey Pang, James Hendricks, Aditya Akella, Roberto De Prisco, Bruce M. Maggs, Srinivasan Seshan. Internet Measurement Conference 2004, 1-14. Web SearchBibTeXDownload
68An analysis of live streaming workloads on the internet. Kunwadee Sripanidkulchai, Bruce M. Maggs, Hui Zhang. Internet Measurement Conference 2004, 41-54. Web SearchBibTeXDownload
67Locating internet routing instabilities. Anja Feldmann, Olaf Maennel, Zhuoqing Morley Mao, Arthur W. Berger, Bruce M. Maggs. SIGCOMM 2004, 205-218. Web SearchBibTeXDownload
66A comparison of overlay routing and multihoming route control. Aditya Akella, Jeffrey Pang, Bruce M. Maggs, Srinivasan Seshan, Anees Shaikh. SIGCOMM 2004, 93-106. Web SearchBibTeXDownload
65The feasibility of supporting large-scale live streaming applications with dynamic application end-points. Kunwadee Sripanidkulchai, Aditya Ganjam, Bruce M. Maggs, Hui Zhang. SIGCOMM 2004, 107-120. Web SearchBibTeXDownload
2003
64Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems. Kunwadee Sripanidkulchai, Bruce M. Maggs, Hui Zhang. INFOCOM 2003. Web SearchBibTeXDownload
63A measurement-based analysis of multihoming. Aditya Akella, Bruce M. Maggs, Srinivasan Seshan, Anees Shaikh, Ramesh K. Sitaraman. SIGCOMM 2003, 353-364. Web SearchBibTeXDownload
62Space-efficient finger search on degree-balanced search trees. Guy E. Blelloch, Bruce M. Maggs, Shan Leung Maverick Woo. SODA 2003, 374-383. Web SearchBibTeXDownload
61Designing overlay multicast networks for streaming. Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Ramesh K. Sitaraman. SPAA 2003, 149-158. Web SearchBibTeXDownload
2002
60Enabling efficient content location and retrieval in peer-to-peer systems by exploiting locality in interests. Kunwadee Sripanidkulchai, Bruce M. Maggs, Hui Zhang. Computer Communication Review (32): 80 (2002). Web SearchBibTeXDownload
59Routing and Communication in Interconnection Networks. Michele Flammini, Bruce M. Maggs, Jop F. Sibeyn, Berthold Vöcking. Euro-Par 2002, 735. Web SearchBibTeXDownload
58Globally Distributed Content Delivery. John Dilley, Bruce M. Maggs, Jay Parikh, Harald Prokop, Ramesh K. Sitaraman, William E. Weihl. IEEE Internet Computing (6): 50-58 (2002). Web SearchBibTeXDownload
2001
57Global Internet Content Delivery. Bruce M. Maggs. CCGRID 2001, 12. Web SearchBibTeXDownload
56Topic 06: Complexity Theory and Algorithms. Gianfranco Bilardi, Rainer Feldmann, Kieran T. Herley, Bruce M. Maggs. Euro-Par 2001, 332. Web SearchBibTeXDownload
55Protocols for Asymmetric Communication Channels. Micah Adler, Bruce M. Maggs. J. Comput. Syst. Sci. (63): 573-596 (2001). Web SearchBibTeXDownload
54On the Benefit of Supporting Virtual Channels in Wormhole Routers. Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman. J. Comput. Syst. Sci. (62): 152-177 (2001). Web SearchBibTeXDownload
2000
53Improved Routing and Sorting on Multibutterflies. Bruce M. Maggs, Berthold Vöcking. Algorithmica (28): 438-437 (2000). Web SearchBibTeXDownload
52Sorting-Based Selection Algorithms for Hypercubic Networks. Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton. Algorithmica (26): 237-254 (2000). Web SearchBibTeXDownload
1999
51Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules. Frank Thomson Leighton, Bruce M. Maggs, Andréa W. Richa. Combinatorica (19): 375-401 (1999). Web SearchBibTeXDownload
50Redeeming Nested Dissection: Parallelism Implies Fill. Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi. PPSC 1999. Web SearchBibTeX
49Tight Analyses of Two Local Load Balancing Algorithms. Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman. SIAM J. Comput. (29): 29-64 (1999). Web SearchBibTeXDownload
48Simple Algorithms for Routing on Butterfly Networks with Bounded Queues. Bruce M. Maggs, Ramesh K. Sitaraman. SIAM J. Comput. (28): 984-1003 (1999). Web SearchBibTeXDownload
47Tradeoffs Between Parallelism and Fill in Nested Dissection. Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller. SPAA 1999, 191-200. Web SearchBibTeXDownload
46Editors' Foreword. Danny Z. Chen, Bruce M. Maggs. Theory Comput. Syst. (32): 211 (1999). Web SearchBibTeXDownload
1998
45Protocols for Asymmetric Communication Channels. Micah Adler, Bruce M. Maggs. FOCS 1998, 522-533. Web SearchBibTeXDownload
44Real-Time Emulations of Bounded-Degree Networks. Bruce M. Maggs, Eric J. Schwabe. Inf. Process. Lett. (66): 269-276 (1998). Web SearchBibTeXDownload
43On the Bisection Width and Expansion of Butterfly Networks. Claudson F. Bornstein, Ami Litman, Bruce M. Maggs, Ramesh K. Sitaraman, Tal Yatzkar. IPPS/SPDP 1998, 144-150. Web SearchBibTeXDownload
42On Balls and Bins with Deletions. Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal. RANDOM 1998, 145-158. Web SearchBibTeXDownload
41On the Fault Tolerance of Some Popular Bounded-Degree Networks. Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman. SIAM J. Comput. (27): 1303-1333 (1998). Web SearchBibTeXDownload
40Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, Berthold Vöcking. STOC 1998, 378-388. Web SearchBibTeXDownload
39Sorting Algorithms. Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha. Theory Comput. Syst. (31): 135-167 (1998). Web SearchBibTeX
1997
38Exploiting Locality for Data Management in Systems of Limited Bandwidth. Bruce M. Maggs, Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann. FOCS 1997, 284-293. Web SearchBibTeXDownload
37Parallelizing Elimination Orders with Linear Fill. Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi. FOCS 1997, 274-283. Web SearchBibTeXDownload
36Work-preserving emulations of fixed-connection networks. Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg, Eric J. Schwabe. J. ACM (44): 104-147 (1997). Web SearchBibTeXDownload
35Reconfiguring Arrays with Faults Part I: Worst-Case Faults. Richard J. Cole, Bruce M. Maggs, Ramesh K. Sitaraman. SIAM J. Comput. (26): 1581-1611 (1997). Web SearchBibTeXDownload
34Improved Routing and Sorting on Multibutterflies. Bruce M. Maggs, Berthold Vöcking. STOC 1997, 517-530. Web SearchBibTeXDownload
33Parallel Algorithms. Guy E. Blelloch, Bruce M. Maggs. The Computer Science and Engineering Handbook 1997, 277-315. Web SearchBibTeX
1996
32Parallel Algorithms. Guy E. Blelloch, Bruce M. Maggs. ACM Comput. Surv. (28): 51-54 (1996). Web SearchBibTeXDownload
31A Comparison of Sorting Algorithms for the Connection Machine CM-2. Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha. Commun. ACM (39): 273-297 (1996). Web SearchBibTeX
30A Maximum Likelihood Stereo Algorithm. Ingemar J. Cox, Sunita L. Hingorani, Satish Rao, Bruce M. Maggs. Computer Vision and Image Understanding (63): 542-567 (1996). Web SearchBibTeXDownload
29A Critical Look at Three of Parallel Computing's Maxims. Bruce M. Maggs. ISPAN 1996, 1-7. Web SearchBibTeXDownload
28On-Line Algorithms for Path Selection in a Nonblocking Network. Sanjeev Arora, Frank Thomson Leighton, Bruce M. Maggs. SIAM J. Comput. (25): 600-625 (1996). Web SearchBibTeXDownload
27On the Benefit of Supporting Virtual Channels in Wormhole Routers. Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman. SPAA 1996, 131-141. Web SearchBibTeX
1995
26Routing on Butterfly Networks with Random Faults. Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman. FOCS 1995, 558-570. Web SearchBibTeXDownload
25Fast algorithms for finding O(congestion+dilation) packet routing schedules. Frank Thomson Leighton, Bruce M. Maggs. HICSS (2) 1995, 555-563. Web SearchBibTeXDownload
24Models of parallel computation: a survey and synthesis. Bruce M. Maggs, Lesley R. Matheson, Robert Endre Tarjan. HICSS (2) 1995, 61. Web SearchBibTeXDownload
23Tight analyses of two local load balancing algorithms. Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman. STOC 1995, 548-558. Cited by 74Web SearchBibTeXDownload
1994
22Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps. Frank Thomson Leighton, Bruce M. Maggs, Satish Rao. Combinatorica (14): 167-186 (1994). Web SearchBibTeXDownload
21A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches. Andrew V. Goldberg, Bruce M. Maggs, Serge A. Plotkin. IEEE Trans. Computers (43): 321-326 (1994). Web SearchBibTeXDownload
20Randomized Routing and Sorting on Fixed-Connection Networks. Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish Rao. J. Algorithms (17): 157-205 (1994). Web SearchBibTeXDownload
1993
19Sorting-Based Selection Algorithms for Hypercube Networks. Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton. IPPS 1993, 89-95. Web SearchBibTeX
18Multi-scale self-simulation: a technique for reconfiguring arrays with faults. Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman. STOC 1993, 561-572. Web SearchBibTeXDownload
17Approximate load balancing on dynamic and asynchronous networks. William Aiello, Baruch Awerbuch, Bruce M. Maggs, Satish Rao. STOC 1993, 632-641. Web SearchBibTeXDownload
16An Algorithm for Finding Predecessors in Integer Sets. Bruce M. Maggs, Monika Rauch. WADS 1993, 483-493. Cited by 1Web SearchBibTeXDownload
1992
15Stereo Without Disparity Gradient Smoothing: A Bayesian Sensor Fusion Solution. Ingemar J. Cox, Sunita L. Hingorani, Bruce M. Maggs, Satish Rao. BMVC 1992, 1-10. Web SearchBibTeXDownload
14On the Fault Tolerance of Some Popular Bounded-Degree Networks. Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman. FOCS 1992, 542-552. Web SearchBibTeXDownload
13Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks. Frank Thomson Leighton, Bruce M. Maggs. IEEE Trans. Computers (41): 578-587 (1992). Web SearchBibTeXDownload
12The Role of Randomness in the Design of Interconnection Networks. Frank Thomson Leighton, Bruce M. Maggs. IFIP Congress (1) 1992, 291-305. Web SearchBibTeX
11Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (Extended Abstract). Bruce M. Maggs, Ramesh K. Sitaraman. STOC 1992, 150-161. Web SearchBibTeXDownload
1991
10Fast Algorithms for Bit-Serial Routing on a Hypercube. William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman. Mathematical Systems Theory (24): 253-271 (1991). Web SearchBibTeXDownload
9A Comparison of Sorting Algorithms for the Connection Machine CM-2. Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha. SPAA 1991, 3-16. Web SearchBibTeXDownload
1990
8Fast Algorithms for Bit-Serial Routing on a Hypercube. William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman. SPAA 1990, 55-64. Web SearchBibTeXDownload
7On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract). Sanjeev Arora, Frank Thomson Leighton, Bruce M. Maggs. STOC 1990, 149-158. Web SearchBibTeXDownload
1989
6Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies. Frank Thomson Leighton, Bruce M. Maggs. FOCS 1989, 384-389. Web SearchBibTeXDownload
5Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract). Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg. STOC 1989, 227-240. Web SearchBibTeXDownload
1988
4Communication-Efficient Parallel Algorithms for Distributed Random-Access Machines. Charles E. Leiserson, Bruce M. Maggs. Algorithmica (3): 53-77 (1988). Web SearchBibTeXDownload
3Universal Packet Routing Algorithms (Extended Abstract). Frank Thomson Leighton, Bruce M. Maggs, Satish Rao. FOCS 1988, 256-269. Web SearchBibTeXDownload
2Minimum-Cost Spanning Tree as a Path-Finding Problem. Bruce M. Maggs, Serge A. Plotkin. Inf. Process. Lett. (26): 291-293 (1988). Web SearchBibTeXDownload
1986
1Communication-Efficient Parallel Graph Algorithms. Charles E. Leiserson, Bruce M. Maggs. ICPP 1986, 861-868. Web SearchBibTeX
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research