- R-BGP: Staying Connected In a Connected World Nate Kushman Srikanth Kandula Dina Katabi Bruce M. Maggs
- WorkPreserving Emulations of FixedConnection Richard R. Koch 1 F. T. Leighton 2;3 Bruce M. Maggs 4
- On the Benefit of Supporting Virtual Channels in Wormhole Routers
- A Comparison of Sorting Algorithms for the Connection Machine CM2
- Parallelizing Elimination Orders with Linear Fill Claudson Bornstein 1 Bruce Maggs 2 Gary Miller 3 R. Ravi 4
- John Dilley, Bruce Maggs, Jay Parikh, Harald Prokop,
- Randomized Routing and Sorting on FixedConnection Networks
- SIMPLE ALGORITHMS FOR ROUTING ON BUTTERFLY NETWORKS WITH BOUNDED QUEUES
- RECONFIGURING ARRAYS WITH FAULTS PART I: WORST-CASE RICHARD J. COLE, BRUCE M. MAGGS, AND RAMESH K. SITARAMAN
- Improved Routing and Sorting on Multibutterflies Bruce M. Maggs 1
- DOI: 10.1007/s004530010049 Algorithmica (2000) 28: 438464
- Finding Effective SupportTree Preconditioners # Bruce M. Maggs
- An Analysis of Live Streaming Workloads on the Internet Kunwadee Sripanidkulchai, Bruce Maggs,
- ONLINE ALGORITHMS FOR PATH SELECTION IN A NONBLOCKING NETWORK #
- Designing Overlay Multicast Networks For Streaming Konstantin Andreev # Bruce M. Maggs + Adam Meyerson # Ramesh K. Sitaraman
- Tradeoffs Between Parallelism and Fill in Nested Dissection Claudson F. Bornstein 1
- On the Fault Tolerance of Some Popular BoundedDegree Networks
- SortingBased Selection Algorithms for Hypercubic Networks
- RandomlyWired Multistage Networks Bruce M. Maggs
- Online Algorithms for Path Selection in a Nonblocking Network
- Randomized Routing and Sorting on FixedConnection Networks
- Portcullis: Protecting Connection Setup from Denial-of-Capability Attacks
- Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps
- A Comparison of Overlay Routing and Multihoming Route Control
- Exploiting Locality for Data Management in Systems of Limited Bandwidth
- On Hierarchical Routing in Doubling Metrics Hubert T-H. Chan
- Designing Overlay Multicast Networks For Streaming Konstantin Andreev
- On the Bisection Width and Expansion of Butter y Claudson F. Bornstein 1
- SIAM J. COMPUT. c # 1999 Society for Industrial and Applied Mathematics
- Fast Algorithms for Routing Around Faults in Multibutterflies and RandomlyWired Splitter
- SIAM J. COMPUT. c 1999 Society for Industrial and Applied Mathematics Vol. 29, No. 1, pp. 2964
- Invalidation Clues for Database Scalability Services Amit Manjhi
- DOI: 10.1007/s004539910011 Algorithmica (2000) 26: 237254
- Routing on Butterfly Networks with Random Faults Richard Cole 1
- Simple Algorithms for Routing on Butterfly Networks with Bounded Queues
- WorkPreserving Emulations of FixedConnection Richard R. Koch 1 F. T. Leighton 2;3 Bruce M. Maggs 4
- Guy E. Blelloch and Bruce M. Maggs Carnegie Mellon University
- Fast Algorithms for BitSerial Routing on a Hypercube
- Randomized Protocols for LowCongestion Circuit Routing in Multistage Interconnection Networks
- MinimumCost Spanning Tree PathFinding Problem
- CommunicationEfficient Parallel Algorithms for Distributed RandomAccess Machines
- A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches
- Holistic Query Transformations for Dynamic Web Applications Amit Manjhi
- Quorum Placement in Networks: Minimizing Network Congestion
- Finding Effective Support-Tree Preconditioners Bruce M. Maggs
- ON-LINE ALGORITHMS FOR PATH SELECTION IN A NONBLOCKING NETWORK
- COMBINATORICA Bolyai Society Springer-Verlag
- Work-Preserving Emulations of Fixed-Connection RICHARD R. KOCH
- A Methodology for Estimating Interdomain Web Traffic Demand
- Journal of Computer and Systems Sciences 62, 152 177 (2001) On the Benefit of Supporting Virtual Channels
- Beyond Parallel RandomAccess Machines Bruce Maggs
- The Hidden Cost of Low Bandwidth Communication Guy E. Blelloch Bruce M. Maggs Gary L. Miller
- Packet Routing and JobShop Scheduling in O(Congestion + Dilation) Steps
- Simultaneous Source Location Konstantin Andreev1
- Simultaneous Scalability and Security for Data-Intensive Web Applications
- Theory Comput. Systems 31, 135167 (1998) 1998 Springer-Verlag
- 0022-0000/01 $35.00 2001 Elsevier Science (USA)
- A Critical Look at Three of Parallel Computing's Maxims Bruce M. Maggs
- The Feasibility of Supporting Large-Scale Live Streaming Applications with Dynamic Application End-Points
- Randomized Routing and Sorting on Fixed-Connection Networks
- Locating Internet Routing Instabilities Anja Feldmann Olaf Maennel Z. Morley Mao
- ON THE FAULT TOLERANCE OF SOME POPULAR BOUNDEDDEGREE NETWORKS #
- Parallel Algorithms Guy E. Blelloch and Bruce M. Maggs
- Approximate Load Balancing on Dynamic and Asynchronous Networks William Aiello
- COMBINATORICA Bolyai Society --SpringerVerlag
- An Experimental Analysis of Parallel Sorting Algorithms Guy E. Blelloch
- SIMPLE ALGORITHMS FOR ROUTING ON BUTTERFLY NETWORKS WITH BOUNDED QUEUES #
- RealTime Emulations of BoundedDegree Networks Bruce M. Maggs
- Protocols for Asymmetric Communication Channels Micah Adler 1
- Efficient Content Location Using InterestBased Locality in PeertoPeer Systems
- SortingBased Selection Algorithms for Hypercubic Networks
- Scalable Query Result Caching for Web Applications Charles Garrod
- DOI: 10.1007/s00224-001-1026-2 Theory Comput. Systems 34, 491518 (2001)
- On Balls and Bins with Deletions Richard Cole \Lambda Alan Frieze y Bruce M. Maggs z Michael Mitzenmacher x
- Models of Parallel Computation: A Survey and Synthesis
- Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems
- Competitive Analysis of Call Admission Algorithms that Allow Delay
- Empirical Evaluation of RandomlyWired Multistage Networks (Extended Abstract)
- SpaceE#cient Finger Search on DegreeBalanced Search Trees # Guy E. Blelloch Bruce M. Maggs Shan Leung Maverick Woo
- On the Benefit of Supporting Virtual Channels in Wormhole Routers
- ON THE FAULT TOLERANCE OF SOME POPULAR BOUNDED-DEGREE NETWORKS
