Gary Hoppenworth

According to our database, Gary Hoppenworth authored at least 9 papers between 2020 and 2024.

Collaborative distances:

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

2024

The Discrepancy of Shortest Paths.

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

CoRR, 2024

Simple Linear-Size Additive Emulators.

Gary Hoppenworth

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 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