default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrederik Mallmann-Trenn
Person information
- affiliation: King's College London, Department of Informatics, London, UK
SPARQL queries 
🛈 Please note that only 62% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c37]Cristina Gava, Áron Vékássy, Matthew Cavorsi, Stephanie Gil, Frederik Mallmann-Trenn:
Community Consensus: Converging Locally Despite Adversaries and Heterogeneous Connectivity. ACC 2024: 4141-4148- [c36]Ran Gelles, Zvi Lotker, Frederik Mallmann-Trenn:
Sorting in One and Two Rounds Using t-Comparators. DISC 2024: 27:1-27:20 - [i34]Ran Gelles, Zvi Lotker, Frederik Mallmann-Trenn:
Sorting in One and Two Rounds using t-Comparators. CoRR abs/2405.12678 (2024) - [i33]Giordano Giambartolomei, Frederik Mallmann-Trenn, Raimundo Saona:
IID Prophet Inequality with Random Horizon: Going Beyond Increasing Hazard Rates. CoRR abs/2407.11752 (2024) - [i32]Hind AlMahmoud, Frederik Mallmann-Trenn:
Harmonizing vs Polarizing Platform Influence Functions. CoRR abs/2410.09225 (2024) - [i31]Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga:
Asynchronous 3-Majority Dynamics with Many Opinions. CoRR abs/2410.11172 (2024) - [i30]Emanuele Natale, Davide Ferré, Giordano Giambartolomei, Frédéric Giroire, Frederik Mallmann-Trenn:
On the Sparsity of the Strong Lottery Ticket Hypothesis. CoRR abs/2410.14754 (2024) - 2023
- [j8]Varun Kanade
, Frederik Mallmann-Trenn, Thomas Sauerwald:
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? ACM Trans. Algorithms 19(2): 18:1-18:46 (2023) - [c35]Matthew Cavorsi, Frederik Mallmann-Trenn, David Saldaña, Stephanie Gil:
Dynamic Crowd Vetting: Collaborative Detection of Malicious Robots in Dynamic Communication Networks. CDC 2023: 7546-7553 - [c34]Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik, Nicolas Rivera:
Distributed Averaging in Opinion Dynamics. PODC 2023: 211-221 - [c33]Nancy A. Lynch, Frederik Mallmann-Trenn:
Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks with Feedback. SIROCCO 2023: 46-86 - [i29]Matthew Cavorsi, Frederik Mallmann-Trenn, David Saldaña, Stephanie Gil:
Dynamic Crowd Vetting: Collaborative Detection of Malicious Robots in Dynamic Communication Networks. CoRR abs/2304.00551 (2023) - [i28]Giordano Giambartolomei, Frederik Mallmann-Trenn, Raimundo Saona:
Prophet Inequalities: Separating Random Order from Order Selection. CoRR abs/2304.04024 (2023) - [i27]Nancy A. Lynch, Frederik Mallmann-Trenn:
Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks With Feedback. CoRR abs/2304.09540 (2023) - [i26]Cristina Gava, Áron Vékássy, Matthew Cavorsi, Stephanie Gil, Frederik Mallmann-Trenn:
Community Consensus: Converging Locally despite Adversaries and Heterogeneous Connectivity. CoRR abs/2310.08488 (2023) - 2022
- [j7]Frederik Mallmann-Trenn, Matthew Cavorsi, Stephanie Gil:
Crowd Vetting: Rejecting Adversaries via Collaboration With Application to Multirobot Flocking. IEEE Trans. Robotics 38(1): 5-24 (2022) - [c32]Piotr Indyk, Frederik Mallmann-Trenn, Slobodan Mitrovic, Ronitt Rubinfeld:
Online Page Migration with ML Advice. AISTATS 2022: 1655-1670 - [c31]Vincent Cohen-Addad, Frederik Mallmann-Trenn, David Saulpic:
Community Recovery in the Degree-Heterogeneous Stochastic Block Model. COLT 2022: 1662-1692 - [c30]Vincent Cohen-Addad, Frederik Mallmann-Trenn, David Saulpic:
A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees. PODC 2022: 356-365 - [c29]Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik:
On early extinction and the effect of travelling in the SIR model. UAI 2022: 159-169 - [i25]Limor Gultchin, Vincent Cohen-Addad, Sophie Giffard-Roisin, Varun Kanade, Frederik Mallmann-Trenn:
Beyond Impossibility: Balancing Sufficiency, Separation and Accuracy. CoRR abs/2205.12327 (2022) - [i24]Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Nicolás Rivera, Tomasz Radzik:
Distributed Averaging in Population Protocols. CoRR abs/2211.17125 (2022) - 2021
- [j6]Nancy A. Lynch, Frederik Mallmann-Trenn:
Learning hierarchically-structured concepts. Neural Networks 143: 798-817 (2021) - [c28]Nan Kang, Frederik Mallmann-Trenn, Nicolás Rivera:
Diversity, Fairness, and Sustainability in Population Protocols. PODC 2021: 67-76 - [i23]Nan Kang, Frederik Mallmann-Trenn, Nicolás Rivera:
Diversity, Fairness, and Sustainability in Population Protocols. CoRR abs/2105.09926 (2021) - 2020
- [c27]Julia T. Ebert, Melvin Gauci, Frederik Mallmann-Trenn, Radhika Nagpal:
Bayes Bots: Collective Bayesian Decision-Making in Decentralized Robot Swarms. ICRA 2020: 7186-7192 - [c26]Benoît Groz, Frederik Mallmann-Trenn, Claire Mathieu, Victor Verdugo:
Skyline Computation with Noisy Comparisons. IWOCA 2020: 289-303 - [c25]Bertie Ancona, Ayesha Bajwa, Nancy A. Lynch, Frederik Mallmann-Trenn:
How to Color a French Flag - Biologically Inspired Algorithms for Scale-Invariant Patterning. LATIN 2020: 413-424 - [c24]Vincent Cohen-Addad, Adrian Kosowski, Frederik Mallmann-Trenn, David Saulpic:
On the Power of Louvain in the Stochastic Block Model. NeurIPS 2020 - [c23]Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu:
Instance-Optimality in the Noisy Value-and Comparison-Model. SODA 2020: 2124-2143 - [c22]Anna R. Dornhaus, Nancy A. Lynch, Frederik Mallmann-Trenn, Dominik Pajak, Tsvetomira Radeva:
Self-Stabilizing Task Allocation In Spite of Noise. SPAA 2020: 201-211 - [i22]George Giakkoupis, Frederik Mallmann-Trenn, Hayk Saribekyan:
How to Spread a Rumor: Call Your Neighbors or Take a Walk? CoRR abs/2006.02368 (2020) - [i21]Piotr Indyk, Frederik Mallmann-Trenn, Slobodan Mitrovic, Ronitt Rubinfeld:
Online Page Migration with ML Advice. CoRR abs/2006.05028 (2020) - [i20]Frederik Mallmann-Trenn, Matthew Cavorsi, Stephanie Gil:
Crowd Vetting: Rejecting Adversaries via Collaboration-with Application to Multi-Robot Flocking. CoRR abs/2012.06291 (2020)
2010 – 2019
- 2019
- [j5]Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu:
Hierarchical Clustering: Objective Functions and Algorithms. J. ACM 66(4): 26:1-26:42 (2019) - [j4]Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski:
Improved Analysis of Deterministic Load-Balancing Schemes. ACM Trans. Algorithms 15(1): 10:1-10:22 (2019) - [c21]Frederik Mallmann-Trenn, Yannic Maus, Dominik Pajak:
Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol. ICALP 2019: 148:1-148:16 - [c20]George Giakkoupis, Frederik Mallmann-Trenn, Hayk Saribekyan:
How to Spread a Rumor: Call Your Neighbors or Take a Walk? PODC 2019: 24-33 - [c19]Bertie Ancona, Ayesha Bajwa, Nancy A. Lynch, Frederik Mallmann-Trenn:
How to Color a French Flag - Biologically Inspired Algorithms for Scale-Invariant Patterning. SIROCCO 2019: 327-331 - [c18]Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald:
On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract. SODA 2019: 956-965 - [i19]Frederik Mallmann-Trenn, Yannic Maus, Dominik Pajak:
Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol. CoRR abs/1904.10984 (2019) - [i18]Alberto Ancona, Ayesha Bajwa, Nancy A. Lynch, Frederik Mallmann-Trenn:
How to Color a French Flag-Biologically Inspired Algorithms for Scale-Invariant Patterning. CoRR abs/1905.00342 (2019) - [i17]Nancy A. Lynch, Frederik Mallmann-Trenn:
Learning Hierarchically Structured Concepts. CoRR abs/1909.04559 (2019) - 2018
- [j3]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Chris Wastell:
Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins. Algorithmica 80(12): 3673-3703 (2018) - [j2]Petra Berenbrink, Tom Friedetzky, Frederik Mallmann-Trenn, Sepehr Meshkinfamfard, Chris Wastell:
Threshold load balancing with weighted tasks. J. Parallel Distributed Comput. 113: 218-226 (2018) - [c17]Frederik Mallmann-Trenn, Cameron Musco, Christopher Musco:
Eigenvector Computation and Community Detection in Asynchronous Gossip Models. ICALP 2018: 159:1-159:14 - [c16]Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn:
Clustering Redemption-Beyond the Impossibility of Kleinberg's Axioms. NeurIPS 2018: 8526-8535 - [c15]Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu:
Hierarchical Clustering: Objective Functions and Algorithms. SODA 2018: 378-397 - [i16]Frederik Mallmann-Trenn, Cameron Musco, Christopher Musco:
Eigenvector Computation and Community Detection in Asynchronous Gossip Models. CoRR abs/1804.08548 (2018) - [i15]Anna R. Dornhaus, Nancy A. Lynch, Frederik Mallmann-Trenn, Dominik Pajak, Tsvetomira Radeva:
Self-Stabilizing Task Allocation In Spite of Noise. CoRR abs/1805.03691 (2018) - [i14]Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu:
Instance-Optimality in the Noisy Value-and Comparison-Model - Accept, Accept, Strong Accept: Which Papers get in? CoRR abs/1806.08182 (2018) - 2017
- [b1]Frederik Mallmann-Trenn:
Probabilistic analysis of distributed processes with focus on consensus. (Analyse probabiliste de processus distribués axés sur les processus de consensus). PSL Research University, Paris, France, 2017 - [c14]Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn:
Hierarchical Clustering Beyond the Worst-Case. NIPS 2017: 6201-6209 - [c13]Varun Kanade, Frederik Mallmann-Trenn, Victor Verdugo:
Brief Announcement: How Large is your Graph? PODC 2017: 195-197 - [c12]Petra Berenbrink, Andrea Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale:
Ignore or Comply?: On Breaking Symmetry in Consensus. PODC 2017: 335-344 - [c11]Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, Horst Trinker:
Brief Announcement: Rapid Asynchronous Plurality Consensus. PODC 2017: 363-365 - [c10]Varun Kanade, Frederik Mallmann-Trenn, Victor Verdugo:
How Large Is Your Graph?. DISC 2017: 34:1-34:16 - [i13]Varun Kanade, Frederik Mallmann-Trenn, Victor Verdugo:
How large is your graph? CoRR abs/1702.03959 (2017) - [i12]Petra Berenbrink, Andrea Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale:
Ignore or Comply? On Breaking Symmetry in Consensus. CoRR abs/1702.04921 (2017) - [i11]Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu:
Hierarchical Clustering: Objective Functions and Algorithms. CoRR abs/1704.02147 (2017) - [i10]Frederik Mallmann-Trenn, Claire Mathieu, Victor Verdugo:
Skyline Computation with Noisy Comparisons. CoRR abs/1710.02058 (2017) - 2016
- [c9]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Chris Wastell:
Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing. ESA 2016: 10:1-10:18 - [c8]Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec, Frederik Mallmann-Trenn:
Bounds on the Voter Model in Dynamic Networks. ICALP 2016: 146:1-146:15 - [c7]Dominik Kaaser, Frederik Mallmann-Trenn, Emanuele Natale:
On the Voting Time of the Deterministic Majority Process. MFCS 2016: 55:1-55:15 - [c6]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Christopher Wastell:
Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract]. PODC 2016: 83-92 - [c5]Varun Kanade, Reut Levi, Zvi Lotker, Frederik Mallmann-Trenn, Claire Mathieu:
Distance in the Forest Fire Model How far are you from Eve? SODA 2016: 1602-1620 - [i9]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Chris Wastell:
Plurality Consensus via Shuffling: Lessons Learned from Load Balancing. CoRR abs/1602.01342 (2016) - [i8]Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, Horst Trinker:
Efficient k-Party Voting with Two Choices. CoRR abs/1602.04667 (2016) - [i7]Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec, Frederik Mallmann-Trenn:
Bounds on the Voter Model in Dynamic Networks. CoRR abs/1603.01895 (2016) - [i6]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Chris Wastell:
Self-stabilizing Balls & Bins in Batches. CoRR abs/1603.02188 (2016) - [i5]Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald:
On coalescence time in graphs-When is coalescing as fast as meeting? CoRR abs/1611.02460 (2016) - 2015
- [c4]Petra Berenbrink, Tom Friedetzky, Frederik Mallmann-Trenn, Sepehr Meshkinfamfard, Chris Wastell:
Threshold Load Balancing with Weighted Tasks. IPDPS 2015: 550-558 - [c3]Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski:
Improved Analysis of Deterministic Load-Balancing Schemes. PODC 2015: 301-310 - [i4]Dominik Kaaser, Frederik Mallmann-Trenn, Emanuele Natale:
On the Voting Time of the Deterministic Majority Process. CoRR abs/1508.03519 (2015) - 2014
- [j1]Petra Berenbrink, Bruce Krayenhoff, Frederik Mallmann-Trenn:
Estimating the number of connected components in sublinear time. Inf. Process. Lett. 114(11): 639-642 (2014) - [c2]Petra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, Erfan Sadeqi Azer:
Palindrome Recognition In The Streaming Model. STACS 2014: 149-161 - [i3]Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski:
Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy. CoRR abs/1404.4344 (2014) - 2013
- [i2]Petra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, Erfan Sadeqi Azer:
Palindrome Recognition In The Streaming Model. CoRR abs/1308.3466 (2013) - 2012
- [c1]Peter Kling, Andreas Cord-Landwehr, Frederik Mallmann-Trenn:
Slow Down and Sleep for Profit in Online Deadline Scheduling. MedAlg 2012: 234-247 - [i1]Peter Kling, Andreas Cord-Landwehr, Frederik Mallmann-Trenn:
Slow Down & Sleep for Profit in Online Deadline Scheduling. CoRR abs/1209.2848 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 00:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
