Bruce Maggs | Academic Influence

Bruce Maggs's AcademicInfluence.com Rankings

Bruce Maggs

Computer Science

#5122

World Rank

#5412

Historical Rank

Database

#7774

World Rank

#8085

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Bruce Maggs's Degrees

Bachelors Mathematics Stanford University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Bruce Maggs Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Bruce MacDowell Maggs is an American computer scientist and professor at Duke University whose research interests include computer networks, distributed systems, and computer security. He was a founding employee and served as vice president for Research and Development for Akamai Technologies. He is currently the Director of Engineering at Emerald Innovations, Inc.

(See a Problem?)

Bruce Maggs's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Cutting the electric bill for internet-scale systems (2009) (882)
Globally Distributed Content Delivery (2002) (717)
Efficient content location using interest-based locality in peer-to-peer systems (2003) (644)
A Maximum Likelihood Stereo Algorithm (1996) (564)
A comparison of sorting algorithms for the connection machine CM-2 (1991) (392)
Less pain, most of the gain: incrementally deployable ICN (2013) (371)
An analysis of live streaming workloads on the internet (2004) (329)
Packet routing and job-shop scheduling inO(congestion+dilation) steps (1994) (306)
Locating internet routing instabilities (2004) (300)
The feasibility of supporting large-scale live streaming applications with dynamic application end-points (2004) (289)
A measurement-based analysis of multihoming (2003) (256)
Portcullis: protecting connection setup from denial-of-capability attacks (2007) (236)
Algorithmic Nuggets in Content Delivery (2015) (212)
R-BGP: Staying Connected in a Connected World (2007) (196)
A comparison of overlay routing and multihoming route control (2004) (183)
Universal packet routing algorithms (1988) (179)
Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules (1995) (162)
Pushing CDN-ISP collaboration to the limit (2013) (156)
On-line algorithms for path selection in a nonblocking network (1990) (145)
The Internet at the Speed of Light (2014) (144)
Randomized Routing and Sorting on Fixed-Connection Networks (1994) (143)
On hierarchical routing in doubling metrics (2005) (137)
An End-to-End Measurement of Certificate Revocation in the Web's PKI (2015) (127)
Models of parallel computation: a survey and synthesis (1995) (122)
Work-preserving emulations of fixed-connection networks (1989) (105)
Expanders might be practical: fast algorithms for routing around faults on multibutterflies (1989) (104)
Exploiting locality for data management in systems of limited bandwidth (1997) (101)
Peer-assisted content distribution in Akamai netsession (2013) (101)
Tight analyses of two local load balancing algorithms (1995) (97)
On the fault tolerance of some popular bounded-degree networks (1992) (90)
A Longitudinal, End-to-End View of the DNSSEC Ecosystem (2017) (88)
Enabling content-aware traffic engineering (2012) (86)
Approximate load balancing on dynamic and asynchronous networks (1993) (78)
Availability, usage, and deployment characteristics of the domain name system (2004) (75)
Designing overlay multicast networks for streaming (2003) (73)
Measurement and Analysis of Private Key Sharing in the HTTPS Ecosystem (2016) (72)
On the Performance Benefits of Multihoming Route Control (2008) (66)
CRLite: A Scalable System for Pushing All TLS Revocations to All Browsers (2017) (65)
A methodology for estimating interdomain web traffic demand (2004) (63)
Measuring and Applying Invalid SSL Certificates: The Silent Majority (2016) (61)
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks (1992) (61)
Scalable query result caching for web applications (2008) (61)
Gearing up for the 21st century space race (2018) (60)
Fast algorithms for bit-serial routing on a hypercube (1990) (59)
Stereo Without Disparity Gradient Smoothing: A Bayesian Sensor Fusion Solution (1992) (57)
On Balls and Bins with Deletions (1998) (51)
Randomized protocols for low-congestion circuit routing in multistage interconnection networks (1998) (47)
Posit: a lightweight approach for IP geolocation (2012) (47)
Protecting Websites from Attack with Secure Delivery Networks (2015) (46)
On the impact of route monitor selection (2007) (46)
Minimum-Cost Spanning Tree as a Path-Finding Problem (1988) (46)
Understanding the role of registrars in DNSSEC deployment (2017) (46)
Foundations of Differentially Oblivious Algorithms (2019) (45)
A Scalability Service for Dynamic Web Applications (2005) (45)
Why Is the Internet so Slow?! (2017) (43)
RPKI is Coming of Age: A Longitudinal Study of RPKI Deployment and Invalid Route Origins (2019) (41)
Simple algorithms for routing on butterfly networks with bounded queues (1992) (41)
Protocols for asymmetric communication channels (1998) (37)
Collaboration Opportunities for Content Delivery and Network Infrastructures (2011) (34)
Back-Office Web Traffic on The Internet (2014) (33)
Is the Web Ready for OCSP Must-Staple? (2018) (32)
Communication-efficient parallel algorithms for distributed random-access machines (1988) (31)
Reliable Client Accounting for P2P-Infrastructure Hybrids (2012) (30)
Enabling efficient content location and retrieval in peer-to-peer systems by exploiting locality in interests (2002) (29)
On Landing and Internal Web Pages: The Strange Case of Jekyll and Hyde in Web Performance Measurement (2020) (28)
Global internet content delivery (2001) (28)
Competitive Analysis of Call Admission Algorithms that Allow Delay. (1995) (28)
On the benefit of supporting virtual channels in wormhole routers (1996) (28)
Finding effective support-tree preconditioners (2005) (26)
Space-efficient finger search on degree-balanced search trees (2003) (26)
On the Bisection Width and Expansion of Butterfly Networks (1998) (25)
Communication-Efficient Parallel Graph Algorithms (1986) (24)
Simultaneous source location (2009) (23)
Holistic Query Transformations for Dynamic Web Applications (2009) (23)
Multi-scale self-simulation: a technique for reconfiguring arrays with faults (1993) (23)
Reducing Latency Through Page-aware Management of Web Objects by Content Delivery Networks (2016) (23)
The Impact of Brokers on the Future of Content Delivery (2016) (23)
Parallel algorithms (1996) (22)
Quorum placement in networks to minimize access delays (2005) (22)
Reconfiguring Arrays with Faults Part I: Worst-Case Faults (1997) (22)
Simultaneous scalability and security for data-intensive web applications (2006) (21)
Routing on butterfly networks with random faults (1995) (21)
Redesigning CDN-Broker Interactions for Improved Content Delivery (2017) (20)
Work-preserving emulations of fixed-connection networks (1997) (19)
Solving Symmetric Diagonally-Dominant Systems by Preconditioning (2003) (19)
Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) (1989) (17)
Sorting Algorithms (1998) (17)
Improved Routing and Sorting on Multibutterflies (1997) (16)
Universal Packet Routing Algorithms (Extended Abstract) (1988) (15)
Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time (2021) (15)
Reliable Client Accounting for Hybrid Content-Distribution Networks (2012) (15)
Sorting-Based Selection Algorithms for Hypercubic Networks (1993) (15)
On Mapping the Interconnections in Today’s Internet (2019) (15)
A Universal Approach to Data Center Network Design (2015) (15)
Invalidation Clues for Database Scalability Services (2007) (14)
Empirical evaluation of randomly-wire multistage networks (1990) (14)
Algorithms for Constructing Overlay Networks For Live Streaming (2011) (14)
Empirical Evaluation of Randomly-Wired Multistage Networks (Extended Abstract) (1990) (14)
Quorum placement in networks: minimizing network congestion (2006) (13)
Measuring an ip network in situ (2005) (12)
The hidden cost of low bandwidth communication (1994) (11)
Alidade: IP Geolocation without Active Probing (2015) (10)
Posit: an adaptive framework for lightweight IP geolocation (2011) (10)
Zero Botnets: An Observe-Pursue-Counter Approach (2022) (9)
A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches (1994) (9)
Real-Time Emulations of Bounded-Degree Networks (1998) (8)
Randomly Wired Multistage Networks (1993) (7)
Dissecting Latency in the Internet's Fiber Infrastructure (2018) (7)
Scalable Consistency Management for Web Database Caches (2006) (7)
Tradeoffs between parallelism and fill in nested dissection (1999) (6)
Locality in parallel computation (1989) (6)
A critical look at three of parallel computing's maxims (1996) (6)
Globally distributed content delivery - Internet Computing, IEEE (2001) (6)
AnyOpt: predicting and optimizing IP Anycast performance (2021) (6)
Parallelizing elimination orders with linear fill (1997) (5)
Towards a Speed of Light Internet (2015) (5)
cISP: A Speed-of-Light Internet Service Provider (2018) (5)
Increasing the scalability of dynamic web applications (2008) (5)
Adaptive Packet Routing for Bursty Adversarial Traffic (1998) (4)
Routing, disjoint paths, and classification (2006) (4)
A measurement-driven approach to designing peer-to-peer systems (2005) (4)
Holistic Application Analysis for Update-Independence (2008) (3)
A Bird's Eye View of the World's Fastest Networks (2020) (3)
Reconfiguring arrays with faults .1. Worst-case faults (1997) (3)
Puncturable Pseudorandom Sets and Private Information Retrieval with Polylogarithmic Bandwidth and Sublinear Time (2020) (3)
The Role of Randomness in the Design of Interconnection Networks (1992) (2)
Routing and Job-shop Scheduling in O(congestion (1996) (2)
Untangling Header Bidding Lore (2020) (2)
Measuring the Rapid Growth of HSTS and HPKP Deployments (2017) (2)
A Survey of Congestion+Dilation Results for Packet Scheduling (2006) (2)
Parallel Gaussian Elimination with Linear Work and Fill (1997) (2)
An End-to-End View of DNSSEC Ecosystem Management (2017) (2)
Accelerating Mobile Applications With Parallel High-bandwidth and Low-latency Channels (2021) (1)
On Landing and Internal Web Pages (2020) (1)
Mapping the Whole Internet with Passive Measurements (2012) (1)
Mapping the Whole Internet (2014) (1)
Proceedings of the Second ACM/IEEE Symposium on Edge Computing (2017) (1)
Network Function Virtualization in Software Defined Infrastructures (Dagstuhl Seminar 17032) (2017) (1)
TIGHT ANALYSES OF TWO LOCAL LOAD BALANCING (1999) (1)
Globally distribued content delivery (2002) (1)
Universal Algorithms for Clustering Problems (2021) (1)
8th USENIX Symposium on Networked Systems Design and Implementation (NSDI '11) (2010) (1)
An Algorithm for Finding Predecessors in Integer Sets (1993) (1)
Editorial (2011) (1)
Routing and Communication in Interconnection Networks (2002) (1)
Heterogeneous decomposition of degree-balanced search trees and its applications (2009) (1)
Robust Algorithms for TSP and Steiner Tree (2020) (0)
Mutual Embeddings (2015) (0)
TR-2005-003 Finding Effective Support-Tree Preconditioners (2007) (0)
Session details: Mobile (2015) (0)
O(congestion + Dilation) Steps (1994) (0)
Redeeming Nested Dissection: Parallelism Implies Fill (1999) (0)
Parallel Gaussian Elimination with Linear Work andFillClaudson (1997) (0)
Approximation algorithms for network design and graph partitioning problems (2005) (0)
Assertion-Carrying Certificates (2020) (0)
The Border Gateway Protocol (BGP) (2020) (0)
Session details: ... using which information (2014) (0)
Topic 06: Complexity Theory and Algorithms (2001) (0)
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002 (2002) (0)
Reliable Client Accounting for P 2 P-Infrastructure Hybrids Paarijaat Aditya (2015) (0)
Empirical Evaluation of Randomly-wired Multistage Networks in Particular, given 2 N-input Butterries G 1 and G 2 (2007) (0)
Do we need more web performance research? (2005) (0)
Space-E(cid:14)cient Finger Search on Degree-Balanced Search Trees (cid:3) (0)
Protocols for Asymetric Communication Channels (1997) (0)
Editors' Foreword (1993) (0)
Proceedings of the 21st International Conference on Intelligence in Next Generation Networks (2018) (0)
Symmetric Interdiction for Matching Problems (2017) (0)
Note on Bounded Degree Spanners for Doubling Metrics (2007) (0)
Report from the Field: A CDN's Role in Repelling Attacks against Banking Industry Web Sites (2016) (0)
Internet Geo-Location (2017) (0)
Corrections to "on the performance benefits of multihoming route control" (2008) (0)
Universal Algorithms for Clustering (2021) (0)
Techniques for smart and secure 5G softwarized networks (2019) (0)
Hammurabi: A Framework for Pluggable, Logic-Based X.509 Certificate Validation Policies (2022) (0)
A universal approach to data center network design (2014) (0)
Communication-efficient parallel graph algorithms. Technical report (1986) (0)
Bitonic Sorting Network (2011) (0)
Session details: Data centers: network resilience (2012) (0)
A Methodology for Estimating Inter-{AS} Traffic (2003) (0)
Beyond Parallel Random-Access Machines (1989) (0)
Retracting Graphs to Cycles (2019) (0)
Past and future directions in networking research (2020) (0)
On Hierarchical Routing in Doubling Metrics (CMU-PDL-04-106) (2004) (0)
Session details: Data centers (2010) (0)

This paper list is powered by the following services:

Other Resources About Bruce Maggs

en.wikipedia.org

What Schools Are Affiliated With Bruce Maggs?

Bruce Maggs is affiliated with the following schools: