2026 Bruce M. Maggs: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	60	3234	3140	1572	1514	184	14574

Research.com Recognitions

2018 - ACM Fellow For contributions to the development of content distribution networks and the theory of computer networks

Overview

Bruce M. Maggs is affiliated with Duke University in the United States and has a research focus primarily within the field of Computer Science. Their work spans several subfields including Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Management Science and Operations Research, as well as Sociology and Political Science.

Their main topics of research include:

Complexity and Algorithms in Graphs
Facility Location and Emergency Management
Vehicle Routing Optimization Methods
Risk and Portfolio Optimization
Cryptography and Data Security
Internet Traffic Analysis and Secure E-voting
Security and Verification in Computing

Bruce M. Maggs has contributed to multiple publication venues, with frequent appearances in the following:

arXiv (Cornell University)
ACM Transactions on Algorithms
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
Journal of the ACM

Some of their recent papers include:

"Zero Botnets: An Observe-Pursue-Counter Approach" (2022), published in arXiv (Cornell University)
"Hammurabi" (2022), published in Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
"Foundations of Differentially Oblivious Algorithms" (2022), published in Journal of the ACM
"Universal Algorithms for Clustering Problems" (2022), published in ACM Transactions on Algorithms
"Robust Algorithms for TSP and Steiner Tree" (2022), published in ACM Transactions on Algorithms

The scientist has collaborated regularly with several co-authors, including:

Debmalya Panigrahi
Arun Ganesh
Waqar Aqeel
Elaine Shi
B. Chandrasekaran

Bruce M. Maggs was recognized as an ACM Fellow in 2018 for contributions related to the development of content distribution networks and the theory of computer networks.

Best Publications

Cutting the electric bill for internet-scale systems

Asfandyar Qureshi;Rick Weber;Hari Balakrishnan;John Guttag

1116
Citations
Efficient content location using interest-based locality in peer-to-peer systems

K. Sripanidkulchai;B. Maggs;H. Zhang

895
Citations
Globally distributed content delivery

J. Dilley;B. Maggs;J. Parikh;H. Prokop

841
Citations
A Maximum Likelihood Stereo Algorithm

Ingemar J. Cox;Sunita L. Hingorani;Satish B. Rao;Bruce M. Maggs

789
Citations
Less pain, most of the gain: incrementally deployable ICN

Seyed Kaveh Fayazbakhsh;Yin Lin;Amin Tootoonchian;Ali Ghodsi

600
Citations
A comparison of sorting algorithms for the connection machine CM-2

Guy E. Blelloch;Charles E. Leiserson;Bruce M. Maggs;C. Greg Plaxton

487
Citations
An analysis of live streaming workloads on the internet

Kunwadee Sripanidkulchai;Bruce Maggs;Hui Zhang

429
Citations
Internet content delivery service with third party cache interface support

Daniel M. Lewin;Bruce Maggs;John Josef Kloninger

408
Citations
Packet routing and job-shop scheduling in O (congestion+dilation) steps

Frank Thomson Leighton;Bruce M. Maggs;Satish Rao

404
Citations
The feasibility of supporting large-scale live streaming applications with dynamic application end-points

Kunwadee Sripanidkulchai;Aditya Ganjam;Bruce Maggs;Hui Zhang

379
Citations
Locating internet routing instabilities

Anja Feldmann;Olaf Maennel;Z. Morley Mao;Arthur Berger

359
Citations
A measurement-based analysis of multihoming

Aditya Akella;Bruce Maggs;Srinivasan Seshan;Anees Shaikh

352
Citations
Portcullis: protecting connection setup from denial-of-capability attacks

Bryan Parno;Dan Wendlandt;Elaine Shi;Adrian Perrig

288
Citations
Algorithmic Nuggets in Content Delivery

Bruce M. Maggs;Ramesh K. Sitaraman

266
Citations
R-BGP: staying connected In a connected world

Nate Kushman;Srikanth Kandula;Dina Katabi;Bruce M. Maggs

250
Citations
A comparison of overlay routing and multihoming route control

Aditya Akella;Jeffrey Pang;Bruce Maggs;Srinivasan Seshan

235
Citations
Pushing CDN-ISP collaboration to the limit

Benjamin Frank;Ingmar Poese;Yin Lin;Georgios Smaragdakis

219
Citations
Universal packet routing algorithms

T. Leighton;B. Maggs;S. Rao

217
Citations
Global load balancing across mirrored data centers

F. Thomson Leighton;Daniel M. Lewin;Ravi Sundaram;Rizwan S. Dhanidina

209
Citations
Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules

Tom Leighton;Bruce Maggs;Andréa W. Richa

198
Citations
A Comparison of Sorting Algorithms for the Connection Machine CM-2.

Guy E. Blelloch;Charles E. Leiserson;Bruce M. Maggs;C. Greg Plaxton

9
Citations

Frequent Co-Authors

Ramesh K. Sitaraman University of Massachusetts Amherst

Satish Rao University of California, Berkeley

Alan Mislove Northeastern University

Christo Wilson Northeastern University

Srinivasan Seshan Carnegie Mellon University

David Choffnes Northeastern University

Aditya Akella The University of Texas at Austin

Anja Feldmann Max Planck Society

Gary L. Miller Carnegie Mellon University

Ravi Sundaram Northeastern University

External Links

Wikipedia of Bruce M. Maggs Personal website of Bruce M. Maggs Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a variety of flexible study options and professional careers. Students considering their academic journey may want to select a program in college that aligns closely with both their personal interests and future job market trends. For those aiming to continue their education without a significant time commitment, there are many easy masters programs available online, enabling learners to advance their credentials efficiently.

Affordability is also a top concern for many students. If you are looking to earn a doctorate without breaking the bank, explore the cheapest doctorate degree options available online. Additionally, those who wish to complete their doctoral studies faster may consider 2 year ed d programs online, helping to accelerate entry into leadership roles in academia or industry. These flexible pathways make advanced education and career advancement more accessible than ever.