Peer-curated academic archive from Max Planck Institute for Informatics, comprising 2 recorded lectures in Algorithms & Theoretical CS.
Self-contained research seminars, public lectures, and invited colloquia.
Examine the conditional hardness results concerning the Fréchet distance under translation, shedding light on the inherent computational limits of similarity metrics in geometric algorithms.
Explore an advanced analysis of computational complexity, examining a fine-grained analogue of Schaefer's Theorem to delineate the boundaries of polynomial-time solvability.
Professors, researchers, and invited lecturers recorded at Max Planck Institute for Informatics.
Browse, filter, and sort every lecture from Max Planck Institute for Informatics.
