| Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism∗ D Gibney, G Hoppenworth, S V. Thankachan Symposium on Simplicity in Algorithms (SOSA), 232-242, 2021 | 21 | 2021 |
| Quantifying membership inference vulnerability via generalization gap and other model metrics JW Bentley, D Gibney, G Hoppenworth, SK Jha arXiv preprint arXiv:2009.05669, 2020 | 17 | 2020 |
| The fine-grained complexity of median and center string problems under edit distance G Hoppenworth, JW Bentley, D Gibney, S V Thankachan 28th Annual European Symposium on Algorithms, ESA 2020, 2020 | 13 | 2020 |
| Bridge girth: A unifying notion in network design G Bodwin, G Hoppenworth, O Trabelsi 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 7 | 2023 |
| New additive spanner lower bounds by an unlayered obstacle product G Bodwin, G Hoppenworth 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 7 | 2022 |
| Folklore sampling is optimal for exact hopsets: Confirming the√ n barrier G Bodwin, G Hoppenworth 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 4 | 2023 |
| The discrepancy of shortest paths G Bodwin, C Deng, J Gao, G Hoppenworth, J Upadhyay, C Wang arXiv preprint arXiv:2401.15781, 2024 | 3 | 2024 |
| More time-space tradeoffs for finding a shortest unique substring H Bannai, T Gagie, G Hoppenworth, SJ Puglisi, LMS Russo Algorithms 13 (9), 234, 2020 | 3 | 2020 |
| Simple Linear-Size Additive Emulators G Hoppenworth 2024 Symposium on Simplicity in Algorithms (SOSA), 1-8, 2024 | 1 | 2024 |
| Additive Spanner Lower Bounds with Optimal Inner Graph Structure G Bodwin, G Hoppenworth, VV Williams, N Wein, Z Xu arXiv preprint arXiv:2404.18337, 2024 | | 2024 |
