Bruce M. Maggs

Orcid: 0000-0002-5692-7062

Affiliations:
  • Duke University, Durham, NC, USA


According to our database1, Bruce M. Maggs authored at least 137 papers between 1986 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 2018, "For contributions to the development of content distribution networks and the theory of computer networks".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Curator: Efficient Indexing for Multi-Tenant Vector Databases.
CoRR, 2024

2023
Universal Algorithms for Clustering Problems.
ACM Trans. Algorithms, April, 2023

Robust Algorithms for TSP and Steiner Tree.
ACM Trans. Algorithms, April, 2023

DChannel: Accelerating Mobile Applications With Parallel High-bandwidth and Low-latency Channels.
Proceedings of the 20th USENIX Symposium on Networked Systems Design and Implementation, 2023

No Root Store Left Behind.
Proceedings of the 22nd ACM Workshop on Hot Topics in Networks, 2023

2022
Foundations of Differentially Oblivious Algorithms.
J. ACM, 2022

Zero Botnets: An Observe-Pursue-Counter Approach.
CoRR, 2022

cISP: A Speed-of-Light Internet Service Provider.
Proceedings of the 19th USENIX Symposium on Networked Systems Design and Implementation, 2022

Hammurabi: A Framework for Pluggable, Logic-Based X.509 Certificate Validation Policies.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Universal Algorithms for Clustering.
CoRR, 2021

Accelerating Mobile Applications With Parallel High-bandwidth and Low-latency Channels.
Proceedings of the HotMobile '21: The 22nd International Workshop on Mobile Computing Systems and Applications, 2021

AnyOpt: predicting and optimizing IP Anycast performance.
Proceedings of the ACM SIGCOMM 2021 Conference, Virtual Event, USA, August 23-27, 2021., 2021

Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Puncturable Pseudorandom Sets and Private Information Retrieval with Polylogarithmic Bandwidth and Sublinear Time.
IACR Cryptol. ePrint Arch., 2020

A Bird's Eye View of the World's Fastest Networks.
Proceedings of the IMC '20: ACM Internet Measurement Conference, 2020

On Landing and Internal Web Pages: The Strange Case of Jekyll and Hyde in Web Performance Measurement.
Proceedings of the IMC '20: ACM Internet Measurement Conference, 2020

2019
On Mapping the Interconnections in Today's Internet.
IEEE/ACM Trans. Netw., 2019

Techniques for smart and secure 5G softwarized networks.
Ann. des Télécommunications, 2019

RPKI is Coming of Age: A Longitudinal Study of RPKI Deployment and Invalid Route Origins.
Proceedings of the Internet Measurement Conference, 2019

Retracting Graphs to Cycles.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Dissecting Latency in the Internet's Fiber Infrastructure.
CoRR, 2018

cISP: A Speed-of-Light Internet Service Provider.
CoRR, 2018

Is the Web Ready for OCSP Must-Staple?
Proceedings of the Internet Measurement Conference 2018, 2018

Gearing up for the 21st century space race.
Proceedings of the 17th ACM Workshop on Hot Topics in Networks, 2018

2017
An End-to-End View of DNSSEC Ecosystem Management.
login Usenix Mag., 2017

Network Function Virtualization in Software Defined Infrastructures (Dagstuhl Seminar 17032).
Dagstuhl Reports, 2017

A Longitudinal, End-to-End View of the DNSSEC Ecosystem.
Proceedings of the 26th USENIX Security Symposium, 2017

CRLite: A Scalable System for Pushing All TLS Revocations to All Browsers.
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

Why Is the Internet so Slow?!
Proceedings of the Passive and Active Measurement - 18th International Conference, 2017

Understanding the role of registrars in DNSSEC deployment.
Proceedings of the 2017 Internet Measurement Conference, 2017

Redesigning CDN-Broker Interactions for Improved Content Delivery.
Proceedings of the 13th International Conference on emerging Networking EXperiments and Technologies, 2017

Symmetric Interdiction for Matching Problems.
Proceedings of the Approximation, 2017

2016
On Hierarchical Routing in Doubling Metrics.
ACM Trans. Algorithms, 2016

Reducing Latency Through Page-aware Management of Web Objects by Content Delivery Networks.
Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, 2016

Measuring and Applying Invalid SSL Certificates: The Silent Majority.
Proceedings of the 2016 ACM on Internet Measurement Conference, 2016

The Impact of Brokers on the Future of Content Delivery.
Proceedings of the 15th ACM Workshop on Hot Topics in Networks, 2016

Measurement and Analysis of Private Key Sharing in the HTTPS Ecosystem.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Mutual Embeddings.
J. Interconnect. Networks, 2015

Towards a Speed of Light Internet.
CoRR, 2015

Protecting Websites from Attack with Secure Delivery Networks.
Computer, 2015

Algorithmic Nuggets in Content Delivery.
Comput. Commun. Rev., 2015

An End-to-End Measurement of Certificate Revocation in the Web's PKI.
Proceedings of the 2015 ACM Internet Measurement Conference, 2015

A Universal Approach to Data Center Network Design.
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

2014
A universal approach to data center network design.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Back-Office Web Traffic on The Internet.
Proceedings of the 2014 Internet Measurement Conference, 2014

The Internet at the Speed of Light.
Proceedings of the 13th ACM Workshop on Hot Topics in Networks, 2014

2013
Pushing CDN-ISP collaboration to the limit.
Comput. Commun. Rev., 2013

Less pain, most of the gain: incrementally deployable ICN.
Proceedings of the ACM SIGCOMM 2013 Conference, 2013

Peer-assisted content distribution in Akamai netsession.
Proceedings of the 2013 Internet Measurement Conference, 2013

2012
Posit: a lightweight approach for IP geolocation.
SIGMETRICS Perform. Evaluation Rev., 2012

Enabling content-aware traffic engineering.
Comput. Commun. Rev., 2012

Reliable Client Accounting for P2P-Infrastructure Hybrids.
Proceedings of the 9th USENIX Symposium on Networked Systems Design and Implementation, 2012

2011
Editorial.
J. Interconnect. Networks, 2011

Algorithms for Constructing Overlay Networks For Live Streaming
CoRR, 2011

2009
Simultaneous source location.
ACM Trans. Algorithms, 2009

Cutting the electric bill for internet-scale systems.
Proceedings of the ACM SIGCOMM 2009 Conference on Applications, 2009

Holistic Query Transformations for Dynamic Web Applications.
Proceedings of the 25th International Conference on Data Engineering, 2009

2008
Corrections to "on the performance benefits of multihoming route control".
IEEE/ACM Trans. Netw., 2008

On the performance benefits of multihoming route control.
IEEE/ACM Trans. Netw., 2008

Scalable query result caching for web applications.
Proc. VLDB Endow., 2008

2007
Portcullis: protecting connection setup from denial-of-capability attacks.
Proceedings of the ACM SIGCOMM 2007 Conference on Applications, 2007

R-BGP: Staying Connected in a Connected World.
Proceedings of the 4th Symposium on Networked Systems Design and Implementation (NSDI 2007), 2007

On the impact of route monitor selection.
Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, 2007

Invalidation Clues for Database Scalability Services.
Proceedings of the 23rd International Conference on Data Engineering, 2007

2006
Simultaneous scalability and security for data-intensive web applications.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2006

Quorum placement in networks: minimizing network congestion.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

A Survey of Congestion+Dilation Results for Packet Scheduling.
Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

2005
Do we need more web performance research?
Proceedings of the 14th international conference on World Wide Web, 2005

Finding effective support-tree preconditioners.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Quorum placement in networks to minimize access delays.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

A Scalability Service for Dynamic Web Applications.
Proceedings of the Second Biennial Conference on Innovative Data Systems Research, 2005

2004
The feasibility of supporting large-scale live streaming applications with dynamic application end-points.
Proceedings of the ACM SIGCOMM 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 30, 2004

Locating internet routing instabilities.
Proceedings of the ACM SIGCOMM 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 30, 2004

A comparison of overlay routing and multihoming route control.
Proceedings of the ACM SIGCOMM 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 30, 2004

An analysis of live streaming workloads on the internet.
Proceedings of the 4th ACM SIGCOMM Internet Measurement Conference, 2004

Availability, usage, and deployment characteristics of the domain name system.
Proceedings of the 4th ACM SIGCOMM Internet Measurement Conference, 2004

A methodology for estimating interdomain web traffic demand.
Proceedings of the 4th ACM SIGCOMM Internet Measurement Conference, 2004

Simultaneous Source Location.
Proceedings of the Approximation, 2004

2003
Designing overlay multicast networks for streaming.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Space-efficient finger search on degree-balanced search trees.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

A measurement-based analysis of multihoming.
Proceedings of the ACM SIGCOMM 2003 Conference on Applications, 2003

Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

2002
Globally Distributed Content Delivery.
IEEE Internet Comput., 2002

Enabling efficient content location and retrieval in peer-to-peer systems by exploiting locality in interests.
Comput. Commun. Rev., 2002

Routing and Communication in Interconnection Networks.
Proceedings of the Euro-Par 2002, 2002

2001
On the Benefit of Supporting Virtual Channels in Wormhole Routers.
J. Comput. Syst. Sci., 2001

Protocols for Asymmetric Communication Channels.
J. Comput. Syst. Sci., 2001

Topic 06: Complexity Theory and Algorithms.
Proceedings of the Euro-Par 2001: Parallel Processing, 2001

Global Internet Content Delivery.
Proceedings of the First IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2001), 2001

2000
Improved Routing and Sorting on Multibutterflies.
Algorithmica, 2000

Sorting-Based Selection Algorithms for Hypercubic Networks.
Algorithmica, 2000

1999
Simple Algorithms for Routing on Butterfly Networks with Bounded Queues.
SIAM J. Comput., 1999

Tight Analyses of Two Local Load Balancing Algorithms.
SIAM J. Comput., 1999

Editors' Foreword.
Theory Comput. Syst., 1999

Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules.
Comb., 1999

Tradeoffs Between Parallelism and Fill in Nested Dissection.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

Redeeming Nested Dissection: Parallelism Implies Fill.
Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999

Parallel Algorithms.
Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998
On the Fault Tolerance of Some Popular Bounded-Degree Networks.
SIAM J. Comput., 1998

Sorting Algorithms.
Theory Comput. Syst., 1998

Real-Time Emulations of Bounded-Degree Networks.
Inf. Process. Lett., 1998

Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

On Balls and Bins with Deletions.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

On the Bisection Width and Expansion of Butterfly Networks.
Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998

1997
Reconfiguring Arrays with Faults Part I: Worst-Case Faults.
SIAM J. Comput., 1997

Work-preserving emulations of fixed-connection networks.
J. ACM, 1997

Exploiting Locality for Data Management in Systems of Limited Bandwidth.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Parallelizing Elimination Orders with Linear Fill.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Parallel Algorithms.
Proceedings of the Computer Science and Engineering Handbook, 1997

1996
On-Line Algorithms for Path Selection in a Nonblocking Network.
SIAM J. Comput., 1996

A Maximum Likelihood Stereo Algorithm.
Comput. Vis. Image Underst., 1996

Parallel Algorithms.
ACM Comput. Surv., 1996

A Comparison of Sorting Algorithms for the Connection Machine CM-2.
Commun. ACM, 1996

A Critical Look at Three of Parallel Computing's Maxims.
Proceedings of the 1996 International Symposium on Parallel Architectures, 1996

1995
Models of parallel computation: a survey and synthesis.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

Fast algorithms for finding O(congestion+dilation) packet routing schedules.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

Routing on Butterfly Networks with Random Faults.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches.
IEEE Trans. Computers, 1994

Randomized Routing and Sorting on Fixed-Connection Networks.
J. Algorithms, 1994

Packet Routing and Job-Shop Scheduling in <i>O</i>(Congestion + Dilation) Steps.
Comb., 1994

1993
An Algorithm for Finding Predecessors in Integer Sets.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Multi-scale self-simulation: a technique for reconfiguring arrays with faults.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Approximate load balancing on dynamic and asynchronous networks.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Sorting-Based Selection Algorithms for Hypercube Networks.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

1992
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks.
IEEE Trans. Computers, 1992

Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

The Role of Randomness in the Design of Interconnection Networks.
Proceedings of the Algorithms, Software, Architecture, 1992

Stereo Without Disparity Gradient Smoothing: A Bayesian Sensor Fusion Solution.
Proceedings of the British Machine Vision Conference, 1992

1991
Fast Algorithms for Bit-Serial Routing on a Hypercube.
Math. Syst. Theory, 1991

1990
On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Empirical evaluation of randomly-wire multistage networks.
Proceedings of the 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1990

1989
Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
Minimum-Cost Spanning Tree as a Path-Finding Problem.
Inf. Process. Lett., 1988

Communication-Efficient Parallel Algorithms for Distributed Random-Access Machines.
Algorithmica, 1988

Universal Packet Routing Algorithms (Extended Abstract)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1986
Communication-Efficient Parallel Graph Algorithms.
Proceedings of the International Conference on Parallel Processing, 1986


  Loading...