Marvin Künnemann
Marvin Künnemann
Postdoc at Max Planck Institute for Informatics, Saarbrücken, Germany
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
Quadratic conditional lower bounds for string problems and dynamic time warping
K Bringmann, M Künnemann
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 79-97, 2015
On the fine-grained complexity of one-dimensional dynamic programming
M Künnemann, R Paturi, S Schneider
arXiv preprint arXiv:1703.00941, 2017
Multivariate fine-grained complexity of longest common subsequence
K Bringmann, M Künnemann
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
Optimizing linear functions with the (1+ λ) evolutionary algorithm—different asymptotic runtimes for different instances
B Doerr, M Künnemann
Theoretical Computer Science 561, 3-23, 2015
Fine-grained complexity of analyzing compressed data: Quantifying improvements over decompress-and-solve
A Abboud, A Backurs, K Bringmann, M Künnemann
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
Improved Approximation for Fréchet Distance on -Packed Curves Matching Conditional Lower Bounds
K Bringmann, M Künnemann
International Journal of Computational Geometry & Applications 27 (01n02 …, 2017
Walking the Dog Fast in Practice: Algorithm Engineering of the Fr\'echet Distance
K Bringmann, M Künnemann, A Nusser
arXiv preprint arXiv:1901.01504, 2019
Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max
K Bringmann, M Künnemann, K Węgrzycki
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Quasirandom rumor spreading: An experimental analysis
B Doerr, T Friedrich, M Künnemann, T Sauerwald
Journal of Experimental Algorithmics (JEA) 16, 3.3, 2011
Subquadratic algorithms for succinct stable matching
M Künnemann, D Moeller, R Paturi, S Schneider
CoRR, abs/1510.06452, 2015
A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^ k-Forall-Quantified First-Order Graph Properties
K Bringmann, N Fischer, M Künnemann
34th Computational Complexity Conference (CCC 2019), 2019
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability
K Bringmann, M Künnemann, A Nusser
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Tight analysis of randomized rumor spreading in complete graphs
B Doerr, M Künnemann
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and …, 2014
Towards understanding the smoothed approximation ratio of the 2-opt heuristic
M Künnemann, B Manthey
International Colloquium on Automata, Languages, and Programming, 859-871, 2015
How the (1+ λ) evolutionary algorithm optimizes linear functions
B Doerr, M Künnemann
Proceedings of the 15th annual conference on Genetic and evolutionary …, 2013
Royal road functions and the (1+ λ) evolutionary algorithm: Almost no speed-up from larger offspring populations
B Doerr, M Künnemann
2013 IEEE Congress on Evolutionary Computation, 424-431, 2013
Tight conditional lower bounds for longest common increasing subsequence
L Duraj, M Künnemann, A Polak
Algorithmica 81 (10), 3968-3992, 2019
Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts
K Bringmann, M Künnemann, P Wellnitz
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress
M Künnemann
arXiv preprint arXiv:1806.09189, 2018
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs
K Bringmann, S Kisfaludi-Bak, M Künnemann, A Nusser, Z Parsaeian
arXiv preprint arXiv:2203.03663, 2022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20