Gary Hoppenworth

27 papers A* 9A 1Journal 15Unranked 2
YearRankTypeTitle / Venue / Authors
2026 A* conf
Better Bounds for Semi-Streaming Single-Source Shortest Paths.
SODA
Sepehr Assadi, Gary Hoppenworth, Janani Sundaresan
2025 J jnl
Better Bounds for Semi-Streaming Single-Source Shortest Paths.
CoRR
Sepehr Assadi, Gary Hoppenworth, Janani Sundaresan
2025 A* conf
Covering Approximate Shortest Paths with DAGs.
STOC
Sepehr Assadi, Gary Hoppenworth, Nicole Wein
2025 J jnl
Covering Approximate Shortest Paths with DAGs.
CoRR
Sepehr Assadi, Gary Hoppenworth, Nicole Wein
2025 J jnl
Multiplicative Spanners in Minor-Free Graphs.
CoRR
Greg Bodwin, Gary Hoppenworth, Zihan Tan
2025 A* conf
Near-Optimal Fault-Tolerant Strong Connectivity Preservers.
FOCS
Gary Hoppenworth, Thatchaphol Saranurak, Benyu Wang
2025 J jnl
Near-Optimal Fault-Tolerant Strong Connectivity Preservers.
CoRR
Gary Hoppenworth, Thatchaphol Saranurak, Benyu Wang
2025 A* conf
New Separations and Reductions for Directed Hopsets and Preservers.
SODA
Gary Hoppenworth, Yinzhan Xu, Zixuan Xu
2025 J jnl
Reviving Thorup's Shortcut Conjecture.
CoRR
Aaron Bernstein, Henry L. Fleischmann, Maximilian Probst Gutenberg, Bernhard Haeupler, Gary Hoppenworth, Yonggang Jiang, George Z. Li, Seth Pettie, Thatchaphol Saranurak, Leon Schiller
2024 A* conf
Additive Spanner Lower Bounds with Optimal Inner Graph Structure.
ICALP
Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu
2024 J jnl
Additive Spanner Lower Bounds with Optimal Inner Graph Structure.
CoRR
Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu
2024 J jnl
New Separations and Reductions for Directed Preservers and Hopsets.
CoRR
Gary Hoppenworth, Yinzhan Xu, Zixuan Xu
2024 — conf
Simple Linear-Size Additive Emulators.
SOSA
Gary Hoppenworth
2024 A* conf
The Discrepancy of Shortest Paths.
ICALP
Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang
2024 J jnl
The Discrepancy of Shortest Paths.
CoRR
Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang
2023 A* conf
Bridge Girth: A Unifying Notion in Network Design.
FOCS
Greg Bodwin, Gary Hoppenworth, Ohad Trabelsi
2023 A* conf
Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier.
FOCS
Greg Bodwin, Gary Hoppenworth
2023 J jnl
Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier.
CoRR
Greg Bodwin, Gary Hoppenworth
2023 J jnl
Simple Linear-Size Additive Emulators.
CoRR
Gary Hoppenworth
2022 J jnl
Bridge Girth: A Unifying Notion in Network Design.
CoRR
Greg Bodwin, Gary Hoppenworth, Ohad Trabelsi
2022 A* conf
New Additive Spanner Lower Bounds by an Unlayered Obstacle Product.
FOCS
Greg Bodwin, Gary Hoppenworth
2022 J jnl
New Additive Spanner Lower Bounds by an Unlayered Obstacle Product.
CoRR
Greg Bodwin, Gary Hoppenworth
2021 — conf
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism.
SOSA
Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan
2020 J jnl
More Time-Space Tradeoffs for Finding a Shortest Unique Substring.
Algorithms
Hideo Bannai, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi, Luís M. S. Russo
2020 J jnl
Quantifying Membership Inference Vulnerability via Generalization Gap and Other Model Metrics.
CoRR
Jason W. Bentley, Daniel Gibney, Gary Hoppenworth, Sumit Kumar Jha
2020 J jnl
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism.
CoRR
Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan
2020 A conf
The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance.
ESA
Gary Hoppenworth, Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan