Frederik Mallmann-Trenn
Title
Cited by
Cited by
Year
Hierarchical clustering: Objective functions and algorithms
V Cohen-Addad, V Kanade, F Mallmann-Trenn, C Mathieu
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
512018
On coalescence time in graphs: When is coalescing as fast as meeting?
V Kanade, F Mallmann-Trenn, T Sauerwald
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
302019
Hierarchical clustering: Objective functions and algorithms
V Cohen-Addad, V Kanade, F Mallmann-Trenn, C Mathieu
Journal of the ACM (JACM) 66 (4), 1-42, 2019
292019
Bounds on the voter model in dynamic networks
P Berenbrink, G Giakkoupis, AM Kermarrec, F Mallmann-Trenn
arXiv preprint arXiv:1603.01895, 2016
242016
Hierarchical clustering beyond the worst-case
V Cohen-Addad, V Kanade, F Mallmann-Trenn
Advances in Neural Information Processing Systems, 6201-6209, 2017
232017
Ignore or comply? On breaking symmetry in consensus
P Berenbrink, A Clementi, R Elsässer, P Kling, F Mallmann-Trenn, ...
Proceedings of the ACM Symposium on Principles of Distributed Computing, 335-344, 2017
202017
Improved analysis of deterministic load-balancing schemes
P Berenbrink, R Klasing, A Kosowski, F Mallmann-Trenn, P Uznański
ACM Transactions on Algorithms (TALG) 15 (1), 1-22, 2018
172018
Estimating the number of connected components in sublinear time
P Berenbrink, B Krayenhoff, F Mallmann-Trenn
Information Processing Letters 114 (11), 639-642, 2014
172014
Efficient k-party voting with two choices
R Elsässer, T Friedetzky, D Kaaser, F Mallmann-Trenn, H Trinker
ArXiv e-prints, 2016
152016
Palindrome recognition in the streaming model
P Berenbrink, F Ergün, F Mallmann-Trenn, ES Azer
arXiv preprint arXiv:1308.3466, 2013
122013
Self-stabilizing balls & bins in batches: The power of leaky bins
P Berenbrink, T Friedetzky, P Kling, F Mallmann-Trenn, L Nagel, ...
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
92016
Plurality consensus via shuffling: Lessons learned from load balancing
P Berenbrink, T Friedetzky, P Kling, F Mallmann-Trenn, C Wastell
arXiv preprint arXiv:1602.01342, 2016
92016
On the voting time of the deterministic majority process
D Kaaser, F Mallmann-Trenn, E Natale
arXiv preprint arXiv:1508.03519, 2015
82015
Threshold load balancing with weighted tasks
P Berenbrink, T Friedetzky, F Mallmann-Trenn, S Meshkinfamfard, ...
Journal of Parallel and Distributed Computing 113, 218-226, 2018
72018
Brief announcement: rapid asynchronous plurality consensus
R Elsässer, T Friedetzky, D Kaaser, F Mallmann-Trenn, H Trinker
Proceedings of the ACM Symposium on Principles of Distributed Computing, 363-365, 2017
72017
Plurality consensus in arbitrary graphs: lessons learned from load balancing.
P Berenbrink, T Friedetzky, P Kling, F Mallmann-Trenn, C Wastell
Schloss Dagstuhl, Leibniz-Zentrum für Informatik 57 (10.4230/LIPIcs. ESA …, 2016
72016
How large is your graph?
V Kanade, F Mallmann-Trenn, V Verdugo
arXiv preprint arXiv:1702.03959, 2017
62017
Rapid asynchronous plurality consensus
R Elsässer, T Friedetzky, D Kaaser, F Mallmann-Trenn, H Trinker
arXiv preprint arXiv:1602.04667, 2016
62016
Distance in the Forest Fire Model How far are you from Eve?
V Kanade, R Levi, Z Lotker, F Mallmann-Trenn, C Mathieu
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
62016
Self-Stabilizing Balls and Bins in Batches
P Berenbrink, T Friedetzky, P Kling, F Mallmann-Trenn, L Nagel, ...
Algorithmica 80 (12), 3673-3703, 2018
52018
The system can't perform the operation now. Try again later.
Articles 1–20