The following pages link to Bruce M. Maggs (Q202181):
Displaying 38 items.
- Communication-efficient parallel algorithms for distributed random-access machines (Q1104096) (← links)
- Real-time emulations of bounded-degree networks (Q1128816) (← links)
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps (Q1330796) (← links)
- (Q1586140) (redirect page) (← links)
- Improved routing and sorting on multibutterflies (Q1586141) (← links)
- Protocols for asymmetric communication channels (Q1604209) (← links)
- (Q1964593) (redirect page) (← links)
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules (Q1964594) (← links)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
- On hierarchical routing in doubling metrics (Q2921739) (← links)
- Simultaneous source location (Q2930292) (← links)
- Fast algorithms for bit-serial routing on a hypercube (Q3357513) (← links)
- (Q4035174) (← links)
- On the Fault Tolerance of Some Popular Bounded-Degree Networks (Q4210098) (← links)
- Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (Q4229419) (← links)
- (Q4230379) (← links)
- (Q4252740) (← links)
- Randomized Routing and Sorting on Fixed-Connection Networks (Q4304064) (← links)
- Work-preserving emulations of fixed-connection networks (Q4371700) (← links)
- Reconfiguring Arrays with Faults Part I: Worst-Case Faults (Q4376192) (← links)
- (Q4471320) (← links)
- (Q4527019) (← links)
- (Q4542556) (← links)
- (Q4813134) (← links)
- On-Line Algorithms for Path Selection in a Nonblocking Network (Q4887019) (← links)
- On Hierarchical Routing in Doubling Metrics (Q4962632) (← links)
- Symmetric interdiction for matching problems (Q5002612) (← links)
- An algorithm for finding predecessors in integer sets (Q5060139) (← links)
- Retracting Graphs to Cycles (Q5091228) (← links)
- Quorum placement in networks to minimize access delays (Q5177229) (← links)
- Quorum placement in networks (Q5177260) (← links)
- Foundations of Differentially Oblivious Algorithms (Q5236339) (← links)
- Multi-scale self-simulation (Q5248526) (← links)
- Approximate load balancing on dynamic and asynchronous networks (Q5248534) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313024) (← links)
- Foundations of Differentially Oblivious Algorithms (Q5889788) (← links)
- On the benefit of supporting virtual channels in wormhole routers (Q5943124) (← links)
- Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)
