| Publication | Date of Publication | Type |
|---|
| Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model | 2024-03-26 | Paper |
| Why Extension-Based Proofs Fail | 2023-08-10 | Paper |
| Consensus with max registers | 2023-02-03 | Paper |
| Allocate-On-Use Space Complexity of Shared-Memory Algorithms | 2022-07-21 | Paper |
| Communication-efficient randomized consensus | 2022-02-15 | Paper |
| Clocked population protocols | 2021-07-06 | Paper |
| Brief Announcement: Why Extension-Based Proofs Fail | 2021-03-15 | Paper |
| Randomized protocols for asynchronous consensus | 2020-12-04 | Paper |
| Why extension-based proofs fail | 2020-01-30 | Paper |
| Dynamic Task Allocation in Asynchronous Shared Memory | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633853 | 2019-05-06 | Paper |
| Erratum | 2019-02-25 | Paper |
| Skip graphs | 2018-11-05 | Paper |
| Depth of a random binary search tree with concurrent insertions | 2018-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174936 | 2018-07-18 | Paper |
| Time-Space Trade-offs in Population Protocols | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608038 | 2018-03-15 | Paper |
| Brief Announcement | 2017-10-11 | Paper |
| Clocked Population Protocols | 2017-10-11 | Paper |
| Concurrent Use of Write-Once Memory | 2016-12-01 | Paper |
| Lower Bounds for Restricted-Use Objects | 2016-06-16 | Paper |
| Spreading alerts quietly and the subgroup escape problem | 2016-01-11 | Paper |
| Spreading rumors rapidly despite an adversary | 2015-09-11 | Paper |
| Optimal-time adaptive strong renaming, with applications to counting | 2015-09-11 | Paper |
| Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity | 2015-08-14 | Paper |
| Load balancing and locality in range-queriable data structures | 2015-08-03 | Paper |
| Computation in networks of passively mobile finite-state sensors | 2015-08-03 | Paper |
| On-line load balancing with applications to machine scheduling and virtual circuit routing | 2015-05-07 | Paper |
| Faster randomized consensus with an oblivious adversary | 2015-03-25 | Paper |
| Stably computable predicates are semilinear | 2015-03-10 | Paper |
| Fast deterministic consensus in a noisy environment | 2015-03-03 | Paper |
| Randomized loose renaming in o (log log n ) time | 2015-03-02 | Paper |
| A modular approach to shared-memory consensus, with applications to the probabilistic-write model | 2015-03-02 | Paper |
| Network construction with subgraph connectivity constraints | 2015-02-16 | Paper |
| Tight bounds for adopt-commit objects | 2015-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934668 | 2014-12-18 | Paper |
| Randomized consensus in expected O(n log n) individual work | 2014-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2933851 | 2014-12-08 | Paper |
| Faster than optimal snapshots (for a while) | 2014-12-05 | Paper |
| Faster randomized consensus with an oblivious adversary | 2014-12-05 | Paper |
| Learning a circuit by injecting values | 2014-11-25 | Paper |
| Approximate shared-memory counting despite a strong adversary | 2014-11-18 | Paper |
| Tight Bounds for Asynchronous Renaming | 2014-09-12 | Paper |
| The Complexity of Renaming | 2014-07-30 | Paper |
| Fault-tolerant routing in peer-to-peer systems | 2014-07-25 | Paper |
| Max registers, counters, and monotone circuits | 2014-07-23 | Paper |
| Polylogarithmic concurrent data structures from monotone circuits | 2014-02-17 | Paper |
| Effective storage capacity of labeled graphs | 2014-02-11 | Paper |
| Mutation systems | 2013-10-22 | Paper |
| A simple population protocol for fast robust approximate majority | 2013-07-04 | Paper |
| Fast computation by population protocols with a leader | 2013-06-28 | Paper |
| The expansion and mixing time of skip graphs with applications | 2013-06-28 | Paper |
| The computational power of population protocols | 2013-06-20 | Paper |
| Computation in networks of passively mobile finite-state sensors | 2013-06-13 | Paper |
| Relationships between broadcast and shared memory in reliable anonymous distributed systems | 2013-06-07 | Paper |
| A modular approach to shared-memory consensus, with applications to the probabilistic-write model | 2013-02-04 | Paper |
| On the Learnability of Shuffle Ideals | 2012-10-16 | Paper |
| Randomized load balancing by joining and splitting bins | 2012-07-20 | Paper |
| Low-contention data structures | 2012-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2880953 | 2012-04-17 | Paper |
| Combining shared-coin algorithms | 2012-03-07 | Paper |
| Sub-logarithmic Test-and-Set against a Weak Adversary | 2011-10-28 | Paper |
| Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers | 2011-10-28 | Paper |
| Mutation Systems | 2011-06-03 | Paper |
| Inferring Social Networks from Outbreaks | 2010-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579426 | 2010-08-06 | Paper |
| Wait-free consensus with infinite arrivals | 2010-08-05 | Paper |
| Optimally learning social networks with activations and suppressions | 2010-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396596 | 2009-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396623 | 2009-09-19 | Paper |
| Learning large-alphabet and analog circuits with value injection queries | 2009-03-31 | Paper |
| Learning a circuit by injecting values | 2009-01-09 | Paper |
| Optimally Learning Social Networks with Activations and Suppressions | 2008-10-14 | Paper |
| Fast Computation by Population Protocols with a Leader | 2008-09-09 | Paper |
| A Simple Population Protocol for Fast Robust Approximate Majority | 2008-09-02 | Paper |
| Spreading Alerts Quietly and the Subgroup Escape Problem | 2008-03-18 | Paper |
| Towards a theory of data entanglement | 2008-01-07 | Paper |
| Learning Large-Alphabet and Analog Circuits with Value Injection Queries | 2008-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3365739 | 2006-01-23 | Paper |
| Algorithmic Aspects of Wireless Sensor Networks | 2005-08-25 | Paper |
| Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems | 2005-08-17 | Paper |
| Compositional competitiveness for distributed algorithms | 2005-02-22 | Paper |
| Lower bounds for distributed coin-flipping and randomized consensus | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474109 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471321 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4459826 | 2004-05-18 | Paper |
| Fast deterministic consensus in a noisy environment | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768376 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527023 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228476 | 1999-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230335 | 1999-04-22 | Paper |
| Fairness in Scheduling | 1999-01-17 | Paper |
| Spreading Rumors Rapidly Despite an Adversary | 1998-08-30 | Paper |
| On-line routing of virtual circuits with applications to load balancing and machine scheduling | 1998-02-17 | Paper |
| Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor | 1997-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886081 | 1996-07-28 | Paper |
| Counting networks | 1995-02-20 | Paper |
| The expressive power of voting polynomials | 1994-08-11 | Paper |
| Time- and Space-Efficient Randomized Consensus | 1993-06-29 | Paper |
| Fast randomized consensus using shared memory | 1990-01-01 | Paper |
