Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Tim Ophelders
On the Complexity of Optimal Homotopies
SETH Says: Weak Fréchet Distance Is Faster, but Only if It Is Continuous and in One Dimension
Related publications
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
The Complexity of Optimal Mechanism Design
The Optimal Complexity of Legal Rules
SSRN Electronic Journal
Fix-Finite Homotopies
Pacific Journal of Mathematics
Mathematics
The Hammock Localization Preserves Homotopies
Homology, Homotopy and Applications
Mathematics
Covering Smooth Homotopies of Orbit Spaces
Bulletin of the American Mathematical Society
Distributed Agreement With Optimal Communication Complexity
Set Reconciliation With Nearly Optimal Communication Complexity
Patch Complexity, Finite Pixel Correlations and Optimal Denoising
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
