Frederik Mallmann-Trenn

Orcid: 0000-0003-0363-8547

Affiliations:
  • King's College London, UK


According to our database1, Frederik Mallmann-Trenn authored at least 53 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?
ACM Trans. Algorithms, April, 2023

Community Consensus: Converging Locally despite Adversaries and Heterogeneous Connectivity.
CoRR, 2023

Prophet Inequalities: Separating Random Order from Order Selection.
CoRR, 2023

Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks with Feedback.
Proceedings of the Structural Information and Communication Complexity, 2023

Distributed Averaging in Opinion Dynamics.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Dynamic Crowd Vetting: Collaborative Detection of Malicious Robots in Dynamic Communication Networks.
Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2022
Crowd Vetting: Rejecting Adversaries via Collaboration With Application to Multirobot Flocking.
IEEE Trans. Robotics, 2022

Distributed Averaging in Population Protocols.
CoRR, 2022

Beyond Impossibility: Balancing Sufficiency, Separation and Accuracy.
CoRR, 2022

On early extinction and the effect of travelling in the SIR model.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Community Recovery in the Degree-Heterogeneous Stochastic Block Model.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Online Page Migration with ML Advice.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Learning hierarchically-structured concepts.
Neural Networks, 2021

Diversity, Fairness, and Sustainability in Population Protocols.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020
Crowd Vetting: Rejecting Adversaries via Collaboration-with Application to Multi-Robot Flocking.
CoRR, 2020

Self-Stabilizing Task Allocation In Spite of Noise.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Instance-Optimality in the Noisy Value-and Comparison-Model.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

On the Power of Louvain in the Stochastic Block Model.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Skyline Computation with Noisy Comparisons.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Bayes Bots: Collective Bayesian Decision-Making in Decentralized Robot Swarms.
Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020

2019
Improved Analysis of Deterministic Load-Balancing Schemes.
ACM Trans. Algorithms, 2019

Hierarchical Clustering: Objective Functions and Algorithms.
J. ACM, 2019

How to Color a French Flag-Biologically Inspired Algorithms for Scale-Invariant Patterning.
CoRR, 2019

On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

How to Color a French Flag - Biologically Inspired Algorithms for Scale-Invariant Patterning.
Proceedings of the Structural Information and Communication Complexity, 2019

How to Spread a Rumor: Call Your Neighbors or Take a Walk?
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Threshold load balancing with weighted tasks.
J. Parallel Distributed Comput., 2018

Instance-Optimality in the Noisy Value-and Comparison-Model - Accept, Accept, Strong Accept: Which Papers get in?
CoRR, 2018

Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins.
Algorithmica, 2018

Clustering Redemption-Beyond the Impossibility of Kleinberg's Axioms.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Eigenvector Computation and Community Detection in Asynchronous Gossip Models.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Probabilistic analysis of distributed processes with focus on consensus. (Analyse probabiliste de processus distribués axés sur les processus de consensus).
PhD thesis, 2017

Skyline Computation with Noisy Comparisons.
CoRR, 2017

How Large Is Your Graph?.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Brief Announcement: How Large is your Graph?
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Brief Announcement: Rapid Asynchronous Plurality Consensus.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Ignore or Comply?: On Breaking Symmetry in Consensus.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Hierarchical Clustering Beyond the Worst-Case.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016
Efficient k-Party Voting with Two Choices.
CoRR, 2016

Plurality Consensus via Shuffling: Lessons Learned from Load Balancing.
CoRR, 2016

Self-stabilizing Balls & Bins in Batches.
CoRR, 2016

Distance in the Forest Fire Model How far are you from Eve?
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract].
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

On the Voting Time of the Deterministic Majority Process.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Bounds on the Voter Model in Dynamic Networks.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2014
Estimating the number of connected components in sublinear time.
Inf. Process. Lett., 2014

Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy.
CoRR, 2014

Palindrome Recognition In The Streaming Model.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

2012
Slow Down & Sleep for Profit in Online Deadline Scheduling
CoRR, 2012

Slow Down and Sleep for Profit in Online Deadline Scheduling.
Proceedings of the Design and Analysis of Algorithms, 2012


  Loading...