Petra Berenbrink

Felix Biermeier

Christopher Hahn

CoRR, 2024

2023

Inference of a rumor's source in the independent cascade model.

[BibT_eX]

[DOI]

Proceedings of the Uncertainty in Artificial Intelligence, 2023

Distributed Averaging in Opinion Dynamics.

[BibT_eX]

[DOI]

Nicolas Rivera

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Dynamic Averaging Load Balancing on Arbitrary Graphs.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Distributed Averaging in Population Protocols.

[BibT_eX]

[DOI]

Nicolás Rivera

CoRR, 2022

On early extinction and the effect of travelling in the SIR model.

[BibT_eX]

[DOI]

Proceedings of the Uncertainty in Artificial Intelligence, 2022

Fast Consensus via the Unconstrained Undecided State Dynamics.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Loosely-Stabilizing Phase Clocks and The Adaptive Majority Problem.

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions.

[BibT_eX]

[DOI]

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

On the Hierarchy of Distributed Majority Protocols.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

On the Optimality of the Greedy Garbage Collection Strategy for SSDs.

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE International Conference on Distributed Computing Systems, 2022

Asynchronous Opinion Dynamics in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Introduction to the Special Issue for SPAA 2019.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2021

Time-space trade-offs in population protocols for the majority problem.

[BibT_eX]

[DOI]

Distributed Comput., 2021

Self-Stabilizing Phase Clocks and the Adaptive Majority Problem.

[BibT_eX]

[DOI]

CoRR, 2021

Infinite Balanced Allocation via Finite Capacities.

[BibT_eX]

[DOI]

Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

2020

Optimal time and space leader election in population protocols.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Brief Announcement: Optimal Time and Space Leader Election in Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Simulating Population Protocols in Sub-Constant Time per Interaction.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

On Counting the Population Size.

[BibT_eX]

[DOI]

Dominik Kaaser

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Tight & Simple Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

2018

Simple Load Balancing.

[BibT_eX]

[DOI]

CoRR, 2018

A population protocol for exact majority with O(\log<sup>5/3</sup>n) stabilization time and asymptotically optimal number of states.

[BibT_eX]

[DOI]

CoRR, 2018

Majority & Stabilization in Population Protocols.

[BibT_eX]

[DOI]

CoRR, 2018

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

[BibT_eX]

[DOI]

Lars Nagel

Algorithmica, 2018

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Simple and Efficient Leader Election.

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Ignore or Comply?: On Breaking Symmetry in Consensus.

[BibT_eX]

[DOI]

Emanuele Natale

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Tight Load Balancing Via Randomized Local Search.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016

Plurality Consensus via Shuffling: Lessons Learned from Load Balancing.

[BibT_eX]

[DOI]

CoRR, 2016

Self-stabilizing Balls & Bins in Batches.

[BibT_eX]

[DOI]

Lars Nagel

CoRR, 2016

Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract].

[BibT_eX]

[DOI]

Lars Nagel

Christopher Wastell

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Bounds on the Voter Model in Dynamic Networks.

[BibT_eX]

[DOI]

Anne-Marie Kermarrec

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Improved Analysis of Deterministic Load-Balancing Schemes.

[BibT_eX]

[DOI]

Ralf Klasing

Adrian Kosowski

Przemyslaw Uznanski

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Threshold Load Balancing with Weighted Tasks.

[BibT_eX]

[DOI]

Sepehr Meshkinfamfard

Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Randomized Renaming in Shared Memory Systems.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Discrete Load Balancing in Heterogeneous Networks with a Focus on Second-Order Diffusion.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

2014

Estimating the number of connected components in sublinear time.

[BibT_eX]

[DOI]

Bruce Krayenhoff

Inf. Process. Lett., 2014

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

[BibT_eX]

[DOI]

Ralf Klasing

Adrian Kosowski

Przemyslaw Uznanski

CoRR, 2014

Palindrome Recognition In The Streaming Model.

[BibT_eX]

[DOI]

Funda Ergün

Erfan Sadeqi Azer

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

2013

Balls-into-bins with nearly optimal load distribution.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Parallel rotor walks on finite graphs and applications in discrete load balancing.

[BibT_eX]

[DOI]

Hoda Akbari

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Distributing Storage in Cloud Environments.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

2012

Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear time.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

A simple approach for adapting continuous load balancing processes to discrete settings.

[BibT_eX]

[DOI]

Hoda Akbari

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Distributed selfish load balancing with weights and speeds.

[BibT_eX]

[DOI]

Clemens P. J. Adolphs

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Improved Bounds for Discrete Diffusive Load Balancing.

[BibT_eX]

[DOI]

Clemens P. J. Adolphs

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

Multiple-Choice Balanced Allocation in (Almost) Parallel.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

Distributed Selfish Load Balancing on Networks.

[BibT_eX]

[DOI]

Martin Hoefer

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Randomized Diffusion for Indivisible Loads.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Faster Coupon Collecting via Replication with Applications in Gossiping.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010

Balls into bins with related random choices.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Speeding Up Random Walks with Neighborhood Exploration.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Randomised Broadcasting: Memory vs. Randomness.

[BibT_eX]

[DOI]

Robert Elsässer

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Chains-into-Bins Processes.

[BibT_eX]

[DOI]

Tugkan Batu

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Balls into non-uniform bins.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Efficient Information Exchange in the Random Phone-Call Model.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Communication Complexity of Quasirandom Rumor Spreading.

[BibT_eX]

[DOI]

Robert Elsässer

Proceedings of the Algorithms, 2010

2009

A sublinear-time approximation scheme for bin packing.

[BibT_eX]

[DOI]

Tugkan Batu

Christian Sohler

Theor. Comput. Sci., 2009

Concurrent imitation dynamics in congestion games.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

The Weighted Coupon Collector's Problem and Applications.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

On the Stability of Dynamic Diffusion Load Balancing.

[BibT_eX]

[DOI]

Russell A. Martin

Algorithmica, 2008

Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems.

[BibT_eX]

[DOI]

Robert Elsässer

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007

Not All Scale-Free Networks Are Born Equal: The Role of the Seed Graph in PPI Network Evolution.

[BibT_eX]

[DOI]

Fereydoun Hormozdiari

Natasa Przulj

PLoS Comput. Biol., 2007

Energy efficient randomised communication in unknown AdHoc networks.

[BibT_eX]

[DOI]

Zengjian Hu

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation.

[BibT_eX]

[DOI]

Oliver Schulte

Proceedings of the Algorithms, 2007

Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

2006

The degree distribution of the generalized duplication model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Utilitarian resource assignment.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Energy Efficient Randomized Communication in Unknown AdHoc Networks

[BibT_eX]

[DOI]

Zengjian Hu

CoRR, 2006

Distributed selfish load balancing.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Not All Scale Free Networks Are Born Equal: The Role of the Seed Graph in PPI Network Emulation.

[BibT_eX]

[DOI]

Fereydoun Hormozdiari

Natasa Przulj

Proceedings of the Systems Biology and Computational Proteomics, 2006

A new analytical method for parallel, diffusion-type load balancing.

[BibT_eX]

[DOI]

Zengjian Hu

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005

(quasi) Spanners for Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2005

On Weighted Balls-into-Bins Games.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

Improved Duplication Models for Proteome Network Evolution.

[BibT_eX]

[DOI]

Proceedings of the Systems Biology and Regulatory Genomics, 2005

Dynamic Diffusion Load Balancing.

[BibT_eX]

[DOI]

Russell A. Martin

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Finding Frequent Patterns in a String in Sublinear Time.

[BibT_eX]

[DOI]

Funda Ergün

Proceedings of the Algorithms, 2005

2004

Identifying Uniformly Mutated Segments within Repeats.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2004

2003

A proportionate fair scheduling rule with good worst-case performance.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002

Statistical Identification of Uniformly Mutated Segments within Repeats.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001

SIMLAB-A Simulation Environment for Storage Area Networks.

[BibT_eX]

[DOI]

André Brinkmann

Proceedings of the Ninth Euromicro Workshop on Parallel and Distributed Processing, 2001

The Natural Work-Stealing Algorithm is Stable.

[BibT_eX]

[DOI]

Leslie Ann Goldberg

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Simple Routing Strategies for Adversarial Systems.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Randomized allocation of independent tasks.

[BibT_eX]

[DOI]

PhD thesis, 2000

Balanced allocations: the heavily loaded case.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Infinite parallel job allocation (extended abstract).

[BibT_eX]

[DOI]

Artur Czumaj

Nikita D. Vvedenskaya

Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

Distributed Path Selection for Storage Networks.

[BibT_eX]

André Brinkmann

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

1999

Simple Competitive Request Scheduling Strategies.

[BibT_eX]

[DOI]

Marco Riedel

Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

Randomized and Adversarial Load Balancing.

[BibT_eX]

[DOI]

Angelika Steger

Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Parallel Continuous Randomized Load Balancing (Extended Abstract).

[BibT_eX]

[DOI]

Ernst W. Mayr

Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

Analyzing an Infinite Parallel Job Allocation Process.

[BibT_eX]

[DOI]

Micah Adler

Klaus Schröder

Proceedings of the Algorithms, 1998

1997

A Simple Distributed Scheduling Policy for Parallel Interactive Continuous Media Servers.

[BibT_eX]

[DOI]

Valentin Rottmann

Reinhard Lüling

Parallel Comput., 1997

Allocating Weighted Jobs in Parallel.

[BibT_eX]

[DOI]

Friedhelm Meyer auf der Heide

Klaus Schröder

Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

Online Scheduling of Continuous Media Streams.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996

Fault-Tolerant Shared Memory Simulations.

[BibT_eX]

[DOI]