Skip to main content

Bruce Maggs

Pelham Wilder Distinguished Professor of Computer Science
Computer Science
Box 90129, Durham, NC 27708-0129
LSRC D324, Durham, NC 27708

Overview


Director of Engineering, Emerald Innovations

Research focuses on distributed systems, including content delivery networks, computer networks, and computer and network security.

Current Appointments & Affiliations


Pelham Wilder Distinguished Professor of Computer Science · 2011 - Present Computer Science, Trinity College of Arts & Sciences
Professor of Computer Science · 2010 - Present Computer Science, Trinity College of Arts & Sciences
Professor in the Department of Electrical and Computer Engineering · 2023 - Present Electrical and Computer Engineering, Pratt School of Engineering
Associate of the Duke Initiative for Science & Society · 2017 - Present Duke Science & Society, University Initiatives & Academic Support Units
Core Faculty in Innovation & Entrepreneurship · 2018 - Present Duke Innovation & Entrepreneurship, University Initiatives & Academic Support Units

In the News


Published April 13, 2022
Web Surfing That Feels Instantaneous, Even Though It’s Not
Published December 5, 2018
Bruce Maggs Elected Fellow of Association for Computing Machinery

View All News

Recent Publications


No Root Store Left Behind

Conference HotNets 2023 - Proceedings of the 22nd ACM Workshop on Hot Topics in Networks · November 28, 2023 When a root certificate authority (CA) in the Web PKI misbehaves, primary root-store operators such as Mozilla and Google respond by distrusting that CA. However, full distrust is often too broad, so root stores often implement partial distrust of roots, s ... Full text Cite

Robust Algorithms for TSP and Steiner Tree

Conference ACM Transactions on Algorithms · March 9, 2023 Robust optimization is a widely studied area in operations research, where the algorithm takes as input a range of values and outputs a single solution that performs well for the entire range. Specifically, a robust algorithm aims to minimize regret, defin ... Full text Cite

Universal Algorithms for Clustering Problems

Journal Article ACM Transactions on Algorithms · March 9, 2023 This article presents universal algorithms for clustering problems, including the widely studied k-median, k-means, and k-center objectives. The input is a metric space containing all potential client locations. The algorithm must select k cluster centers ... Full text Cite
View All Publications

Recent Grants


AI Institute: Athena: AI-Driven Next-generation Networks at the Edge

ResearchSenior Investigator · Awarded by National Science Foundation · 2021 - 2026

CNS Core:Small: Optimizing IP Anycast Performance at Scale

ResearchCo-Principal Investigator · Awarded by National Science Foundation · 2022 - 2025

NeTS: Medium: Collaborative Research: The Internet at the Speed of Light

ResearchPrincipal Investigator · Awarded by National Science Foundation · 2018 - 2023

View All Grants

Education, Training & Certifications


Massachusetts Institute of Technology · 1989 Ph.D.

External Links


Bruce Maggs Website