| Publication | Date of Publication | Type |
|---|
| A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement | 2024-03-26 | Paper |
| A Distributed Combinatorial Topology Approach to Arrow's Impossibility Theorem | 2024-03-26 | Paper |
| The solvability of consensus in iterated models extended with safe-consensus | 2023-10-30 | Paper |
| Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity | 2023-06-19 | Paper |
| Synchronous \(t\)-resilient consensus in arbitrary graphs | 2023-05-19 | Paper |
| On mixed connectivity certificates | 2023-05-08 | Paper |
| Decentralized Asynchronous Crash-resilient Runtime Verification | 2023-04-27 | Paper |
| Information Exchange in the Russian Cards Problem | 2023-04-21 | Paper |
| A distributed computing perspective of unconditionally secure information transmission in Russian cards problems | 2023-03-24 | Paper |
| k-Immediate Snapshot and x-Set Agreement: How Are They Related? | 2023-03-21 | Paper |
| Brief Announcement: Leader Election in the ADD Communication Model | 2023-03-21 | Paper |
| Wait-free solvability of equality negation tasks | 2023-02-03 | Paper |
| Communication Complexity of Wait-Free Computability in Dynamic Networks | 2022-09-01 | Paper |
| An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values | 2022-07-08 | Paper |
| Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement | 2022-06-08 | Paper |
| A distributed computing perspective of unconditionally secure information transmission in Russian cards problems | 2022-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3384879 | 2021-12-17 | Paper |
| A Simplicial Model for $KB4_n$: Epistemic Logic with Agents that May Die | 2021-08-23 | Paper |
| A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks | 2021-08-03 | Paper |
| A simplicial complex model for dynamic epistemic logic to study distributed task computability | 2021-06-03 | Paper |
| A topological perspective on distributed network algorithms | 2020-12-15 | Paper |
| Perfect failure detection with very few bits | 2020-12-15 | Paper |
| Condition-based consensus solvability: a hierarchy of conditions and efficient protocols | 2020-12-04 | Paper |
| The BG distributed simulation algorithm | 2020-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3305190 | 2020-08-06 | Paper |
| A dynamic epistemic logic analysis of the equality negation task | 2020-07-08 | Paper |
| A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring | 2020-03-06 | Paper |
| A topological perspective on distributed network algorithms | 2020-03-03 | Paper |
| Untangling Partial Agreement: Iterated x-consensus Simulations | 2020-01-14 | Paper |
| Making local algorithms wait-free: the case of ring coloring | 2019-11-22 | Paper |
| Perfect failure detection with very few bits | 2019-11-22 | Paper |
| The topology of look-compute-move robot wait-free algorithms with hard termination | 2019-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967153 | 2019-07-03 | Paper |
| Making local algorithms wait-free: the case of ring coloring | 2019-06-21 | Paper |
| Unifying Concurrent Objects and Distributed Tasks | 2019-02-25 | Paper |
| A characterization of \(t\)-resilient colorless task anonymous solvability | 2019-01-30 | Paper |
| Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract) | 2018-08-24 | Paper |
| Asynchronous Agreement and Its Relation with Error-Correcting Codes | 2018-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608668 | 2018-03-21 | Paper |
| Optimal clock synchronization under different delay assumptions | 2017-09-29 | Paper |
| Set consensus using arbitrary objects (preliminary version) | 2017-09-29 | Paper |
| Algebraic spans | 2017-09-29 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| From wait-free to arbitrary concurrent solo executions in colorless distributed computing | 2017-05-22 | Paper |
| Asynchronous Coordination Under Preferences and Constraints | 2016-12-01 | Paper |
| t-Resilient Immediate Snapshot Is Impossible | 2016-12-01 | Paper |
| Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract) | 2016-09-29 | Paper |
| A theory of clock synchronization (extended abstract) | 2016-09-01 | Paper |
| Stability of Multi-Valued Continuous Consensus11Preliminary Version, Some proofs are omitted from this version. | 2016-06-06 | Paper |
| An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems | 2016-06-06 | Paper |
| Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings | 2016-05-03 | Paper |
| Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects | 2016-04-25 | Paper |
| A hierarchy of conditions for consensus solvability | 2016-03-04 | Paper |
| The unified structure of consensus | 2016-03-02 | Paper |
| Unifying synchronous and asynchronous message-passing models | 2016-03-02 | Paper |
| Conditions on input vectors for consensus solvability in asynchronous distributed systems | 2015-11-12 | Paper |
| An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing | 2015-03-18 | Paper |
| An Introduction to the Topological Theory of Distributed Computing with Safe-consensus | 2015-03-18 | Paper |
| The combined power of conditions and failure detectors to solve asynchronous set agreement | 2015-03-10 | Paper |
| Irreducibility and additivity of set agreement-oriented failure detector classes | 2015-03-10 | Paper |
| Stability of long-lived consensus (extended abstract) | 2015-03-03 | Paper |
| The topology of shared-memory adversaries | 2015-03-02 | Paper |
| Conditions on input vectors for consensus solvability in asynchronous distributed systems | 2015-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5498755 | 2015-02-11 | Paper |
| An equivariance theorem with applications to renaming | 2015-01-19 | Paper |
| New combinatorial topology upper and lower bounds for renaming | 2014-12-12 | Paper |
| Brief announcement | 2014-12-05 | Paper |
| Simulations and reductions for colorless tasks | 2014-12-05 | Paper |
| Linear space bootstrap communication schemes | 2014-12-02 | Paper |
| The renaming problem in shared memory systems: an introduction | 2014-10-24 | Paper |
| Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems | 2014-08-07 | Paper |
| The Complexity Gap between Consensus and Safe-Consensus | 2014-08-07 | Paper |
| Computing in the Presence of Concurrent Solo Executions | 2014-03-31 | Paper |
| Locality and checkability in wait-free computing | 2014-03-25 | Paper |
| Failure detectors are schedulers | 2014-03-13 | Paper |
| New combinatorial topology bounds for renaming | 2014-02-17 | Paper |
| Power and limits of distributed computing shared memory models | 2014-01-13 | Paper |
| The topology of distributed adversaries | 2013-08-26 | Paper |
| The \(k\)-simultaneous consensus problem | 2013-06-28 | Paper |
| On the computability power and the robustness of set agreement-oriented failure detector classes | 2013-06-28 | Paper |
| Synchronous condition-based consensus | 2013-06-13 | Paper |
| An Equivariance Theorem with Applications to Renaming | 2012-06-29 | Paper |
| Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks | 2012-06-29 | Paper |
| Locality and Checkability in Wait-Free Computing | 2011-10-28 | Paper |
| Some problems in distributed computational geometry | 2011-10-10 | Paper |
| The impossibility of boosting distributed service resilience | 2011-07-08 | Paper |
| Cycle-pancyclism in multipartite tournaments. I | 2011-02-08 | Paper |
| Concurrent Computing and Shellable Complexes | 2010-09-10 | Paper |
| New combinatorial topology bounds for renaming: the lower bound | 2010-09-09 | Paper |
| An impossibility about failure detectors in the iterated immediate snapshot model | 2010-06-09 | Paper |
| Average long-lived binary consensus: quantifying the stabilizing role played by memory | 2010-04-06 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement | 2009-08-20 | Paper |
| Bit complexity of breaking and achieving symmetry in chains and rings | 2008-12-21 | Paper |
| The Committee Decision Problem | 2008-09-18 | Paper |
| Subconsensus Tasks: Renaming Is Weaker Than Set Agreement | 2008-09-09 | Paper |
| Stability of Multivalued Continuous Consensus | 2008-08-14 | Paper |
| The Iterated Restricted Immediate Snapshot Model | 2008-07-10 | Paper |
| Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory | 2008-07-10 | Paper |
| From \(\diamond \mathcal W\) to \(\omega\) : A simple bounded quiescent reliable broadcast-based transformation | 2007-02-19 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| The Synchronous Condition-Based Consensus Hierarchy | 2005-08-17 | Paper |
| Exact communication costs for consensus and leader in a tree | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437114 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437115 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436047 | 2003-11-23 | Paper |
| Stability of long-lived consensus. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413395 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413399 | 2003-07-17 | Paper |
| A classification of wait-free loop agreement tasks | 2003-05-14 | Paper |
| A simple proof of the uniform consensus synchronous lower bound. | 2003-01-21 | Paper |
| The Combinatorial Structure of Wait-Free Solvable Tasks | 2002-09-29 | Paper |
| A Layered Analysis of Consensus | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2703723 | 2001-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527026 | 2001-02-28 | Paper |
| Algebraic spans | 2000-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941899 | 2000-07-10 | Paper |
| Tentative and definite distributed computations: An optimistic approach to network synchronization | 2000-06-21 | Paper |
| A conjecture on cycle-pancyclism in tournaments | 2000-01-09 | Paper |
| On mixed connectivity certificates | 1999-01-12 | Paper |
| The use of a synchronizer yields the maximum computation rate in distributed networks | 1997-09-28 | Paper |
| Cycle-pancyclism in tournaments. III | 1997-08-18 | Paper |
| Cycle-pancyclism in tournaments. I | 1997-05-06 | Paper |
| Optimal Clock Synchronization under Different Delay Assumptions | 1996-08-18 | Paper |
| Cycle-pancyclism in tournaments. II | 1996-06-06 | Paper |
| Upper and lower bounds for stochastic marked graphs | 1996-04-16 | Paper |
| Unison, canon, and sluggish clocks in networks controlled by a synchronizer | 1995-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206383 | 1990-01-01 | Paper |
