Gary Hoppenworth

According to our database1, Gary Hoppenworth authored at least 10 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Simple Linear-Size Additive Emulators.
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Additive Spanner Lower Bounds with Optimal Inner Graph Structure.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

The Discrepancy of Shortest Paths.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Bridge Girth: A Unifying Notion in Network Design.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
New Additive Spanner Lower Bounds by an Unlayered Obstacle Product.
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.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

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

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

The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020


  Loading...