Marvin Künnemann
Marvin Künnemann
Postdoc at Max Planck Institute for Informatics, Saarbrücken, Germany
Bestätigte E-Mail-Adresse bei mpi-inf.mpg.de - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
1782015
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
492015
On the fine-grained complexity of one-dimensional dynamic programming
M Künnemann, R Paturi, S Schneider
arXiv preprint arXiv:1703.00941, 2017
342017
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
302018
Quasirandom rumor spreading: An experimental analysis
B Doerr, T Friedrich, M Künnemann, T Sauerwald
Journal of Experimental Algorithmics (JEA) 16, 3.3, 2011
252011
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
202017
Subquadratic algorithms for succinct stable matching
M Künnemann, D Moeller, R Paturi, S Schneider
CoRR, abs/1510.06452, 2015
19*2015
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
182017
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
132014
How the (1+ λ) evolutionary algorithm optimizes linear functions
B Doerr, M Künnemann
Proceedings of the 15th annual conference on Genetic and evolutionary …, 2013
132013
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
122015
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
122013
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
92019
Randomized rounding for routing and covering problems: experiments and improvements
B Doerr, M Künnemann, M Wahlström
International Symposium on Experimental Algorithms, 190-201, 2010
92010
Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds
K Bringmann, M Künnemann
International Symposium on Algorithms and Computation, 517-528, 2015
72015
Secretary markets with local information
N Chen, M Hoefer, M Künnemann, C Lin, P Miao
International Colloquium on Automata, Languages, and Programming, 552-563, 2015
72015
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
62019
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
62019
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
L Duraj, M Künnemann, A Polak
Algorithmica, 1-25, 2018
52018
A quantization framework for smoothed analysis of Euclidean optimization problems
R Curticapean, M Künnemann
Algorithmica 73 (3), 483-510, 2015
42015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20