Gary Hoppenworth
I am a third-year PhD student at the University of Michigan. I am fortunate to be advised by Greg Bodwin. I am interested in combinatorics and graph algorithms and data structures.My email address is
garytho[at]umich[dot]edu
|
Gary HoppenworthI am a third-year PhD student at the University of Michigan. I am fortunate to be advised by Greg Bodwin. I am interested in combinatorics and graph algorithms and data structures.My email address is garytho[at]umich[dot]edu |
Publications |
||
|
Additive Spanner Lower Bounds with Optimal Inner Graph Structure Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu ICALP 2024 [coming soon to arXiv] |
||
|
The Discrepancy of Shortest Paths Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang ICALP 2024 [arXiv] |
||
|
Simple Linear-Size Additive Emulators Gary Hoppenworth SOSA 2024 [arXiv] |
||
|
Folklore Sampling is Optimal for Exact Hopsets Greg Bodwin and Gary Hoppenworth FOCS 2023, Invited to HALG 2024 [arXiv] |
||
|
Bridge Girth: A Unifying Notion in Network Design Greg Bodwin, Gary Hoppenworth, Ohad Trabelsi FOCS 2023 [arXiv] |
||
|
New Additive Spanner Lower Bounds by an Unlayered Obstacle Product Greg Bodwin and Gary Hoppenworth FOCS 2022 [arXiv] |
||
|
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan SOSA 2021 [arXiv] |
||
|
The Fine-Grained Complexity of Median and Center String Problems under Edit Distance Jason W. Bentley, Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan ESA 2020 [arXiv] |
||