( en | de | ru )

 

Disambiguation of "Künnemann, Marvin"

Author of the publication

copydeleteadd this publication to your clipboard
Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping.

, and . FOCS, page 79-97. IEEE Computer Society, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hildegard Künnemann

Rolf Künnemann

Ulf Künnemann

Martin Künnemann

Tamara Künnemann

 

Other publications of authors with the same name

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds., , , and . CoRR, (2023)A tight (non-combinatorial) conditional lower bound for Klee's Measure Problem in 3D.. FOCS, page 555-566. IEEE, (2022)Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs., , , , and . SoCG, volume 224 of LIPIcs, page 21:1-21:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max., , and . STOC, page 943-954. ACM, (2019)The Time Complexity of Fully Sparse Matrix Multiplication., , , and . SODA, page 4670-4703. SIAM, (2024)Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union., and . SODA, page 3181-3201. SIAM, (2022)Tight(er) bounds for similarity measures, smoothed approximation and broadcasting.. Saarland University, Germany, (2016)Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations., and . IEEE Congress on Evolutionary Computation, page 424-431. IEEE, (2013)Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem., and . ICALP, volume 55 of LIPIcs, page 150:1-150:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties., , and . CCC, volume 137 of LIPIcs, page 31:1-31:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)