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