Follow
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
Journal of the ACM (JACM) 66 (4), 1-42, 2019
2042019
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
482019
Hierarchical clustering beyond the worst-case
V Cohen-Addad, V Kanade, F Mallmann-Trenn
Advances in Neural Information Processing Systems 30, 2017
442017
Bounds on the voter model in dynamic networks
P Berenbrink, G Giakkoupis, AM Kermarrec, F Mallmann-Trenn
arXiv preprint arXiv:1603.01895, 2016
382016
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
312017
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
252018
Estimating the number of connected components in sublinear time
P Berenbrink, B Krayenhoff, F Mallmann-Trenn
Information Processing Letters 114 (11), 639-642, 2014
222014
Bayes bots: collective Bayesian decision-making in decentralized robot swarms
JT Ebert, M Gauci, F Mallmann-Trenn, R Nagpal
2020 IEEE International Conference on Robotics and Automation (ICRA), 7186-7192, 2020
212020
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
162016
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
152013
Online page migration with ML advice
P Indyk, F Mallmann-Trenn, S Mitrovic, R Rubinfeld
International Conference on Artificial Intelligence and Statistics, 1655-1670, 2022
142022
How to spread a rumor: Call your neighbors or take a walk?
G Giakkoupis, F Mallmann-Trenn, H Saribekyan
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
132019
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
112017
On the voting time of the deterministic majority process
D Kaaser, F Mallmann-Trenn, E Natale
arXiv preprint arXiv:1508.03519, 2015
102015
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
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
Crowd vetting: Rejecting adversaries via collaboration with application to multirobot flocking
F Mallmann-Trenn, M Cavorsi, S Gil
IEEE Transactions on Robotics 38 (1), 5-24, 2021
82021
On the power of louvain in the stochastic block model
V Cohen-Addad, A Kosowski, F Mallmann-Trenn, D Saulpic
Advances in Neural Information Processing Systems 33, 4055-4066, 2020
82020
Self-Stabilizing Balls and Bins in Batches
P Berenbrink, T Friedetzky, P Kling, F Mallmann-Trenn, L Nagel, ...
Algorithmica 80 (12), 3673-3703, 2018
82018
The system can't perform the operation now. Try again later.
Articles 1–20