Gary Hoppenworth

According to our database, Gary Hoppenworth authored at least 17 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Reviving Thorup's Shortcut Conjecture.

Aaron Bernstein, Henry L. Fleischmann, Maximilian Probst Gutenberg, Bernhard Haeupler, Gary Hoppenworth, Yonggang Jiang, George Z. Li, Seth Pettie, Thatchaphol Saranurak, Leon Schiller

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Better Bounds for Semi-Streaming Single-Source Shortest Paths.

Sepehr Assadi, Gary Hoppenworth, Janani Sundaresan

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Multiplicative Spanners in Minor-Free Graphs.

Greg Bodwin, Gary Hoppenworth, Zihan Tan

CoRR, April, 2025

Covering Approximate Shortest Paths with DAGs.

Sepehr Assadi, Gary Hoppenworth, Nicole Wein

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

New Separations and Reductions for Directed Hopsets and Preservers.

Gary Hoppenworth, Yinzhan Xu, Zixuan Xu

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Near-Optimal Fault-Tolerant Strong Connectivity Preservers.

Gary Hoppenworth, Thatchaphol Saranurak, Benyu Wang

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024

New Separations and Reductions for Directed Preservers and Hopsets.

Gary Hoppenworth, Yinzhan Xu, Zixuan Xu

CoRR, 2024

Simple Linear-Size Additive Emulators.

Gary Hoppenworth

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Additive Spanner Lower Bounds with Optimal Inner Graph Structure.

Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

The Discrepancy of Shortest Paths.

Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Bridge Girth: A Unifying Notion in Network Design.

Greg Bodwin, Gary Hoppenworth, Ohad Trabelsi

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier.

Greg Bodwin, Gary Hoppenworth

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

New Additive Spanner Lower Bounds by an Unlayered Obstacle Product.

Greg Bodwin, Gary Hoppenworth

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism.

Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

2020

Quantifying Membership Inference Vulnerability via Generalization Gap and Other Model Metrics.

Jason W. Bentley, Daniel Gibney, Gary Hoppenworth, Sumit Kumar Jha

CoRR, 2020

More Time-Space Tradeoffs for Finding a Shortest Unique Substring.

Hideo Bannai, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi, Luís M. S. Russo

Algorithms, 2020

The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance.

Gary Hoppenworth, Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan

Proceedings of the 28th Annual European Symposium on Algorithms, 2020