Articles with public access mandates - Marvin KünnemannLearn more
Available somewhere: 12
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
Mandates: US National Science Foundation
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
Mandates: European Commission
Quasirandom rumor spreading: An experimental analysis
B Doerr, T Friedrich, M Künnemann, T Sauerwald
Journal of Experimental Algorithmics (JEA) 16, 3.3, 2011
Mandates: German Research Foundation
Impossibility Results for Grammar-Compressed Linear Algebra
A Abboud, A Backurs, K Bringmann, M Künnemann
Advances in Neural Information Processing Systems 33, 2020
Mandates: US National Science Foundation, European Commission
Discrete Fréchet distance under translation: Conditional hardness and an improved algorithm
K Bringmann, M Künnemann, A Nusser
ACM Transactions on Algorithms (TALG) 17 (3), 1-42, 2021
Mandates: European Commission
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
Mandates: German Research Foundation
The fine-grained complexity of multi-dimensional ordering properties
H An, M Gurumukhani, R Impagliazzo, M Jaber, M Künnemann, ...
Algorithmica 84 (11), 3156-3191, 2022
Mandates: US National Science Foundation
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
Mandates: German Research Foundation
The time complexity of fully sparse matrix multiplication
A Abboud, K Bringmann, N Fischer, M Künnemann
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
Mandates: European Commission
Secretary markets with local information
N Chen, M Hoefer, M Künnemann, C Lin, P Miao
Distributed Computing 32 (5), 361-378, 2019
Mandates: German Research Foundation
Dependent randomized rounding: the bipartite case
B Doerr, M Künnemann, M Wahlström
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and …, 2011
Mandates: German Research Foundation
The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties
N Fischer, M Künnemann, M Redzic
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
Mandates: European Commission
Publication and funding information is determined automatically by a computer program