| Publication | Date of Publication | Type |
|---|
| Stochastic coordination in heterogeneous load balancing systems | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083442 | 2023-12-08 | Paper |
| Stochastic coordination in heterogeneous load balancing systems | 2023-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874248 | 2023-02-07 | Paper |
| Off-line reasoning for on-line efficiency: knowledge bases | 2022-09-23 | Paper |
| Unbeatable consensus | 2022-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5015395 | 2021-12-07 | Paper |
| Optimistically tuning synchronous Byzantine consensus: another win for null messages | 2021-11-08 | Paper |
| Probably Approximately Knowing | 2021-03-15 | Paper |
| Brief Announcement: On Using Null Messages in a Byzantine Setting | 2021-03-15 | Paper |
| Using counterfactuals in knowledge-based programming | 2020-12-04 | Paper |
| Knowledge-based programs | 2020-12-02 | Paper |
| Silence | 2020-11-11 | Paper |
| Known Unknowns: Time Bounds and Knowledge of Ignorance | 2020-07-24 | Paper |
| Silence | 2019-09-19 | Paper |
| Mutual exclusion as a matter of priority | 2018-11-29 | Paper |
| On Using Time Without Clocks via Zigzag Causality | 2017-10-11 | Paper |
| Knowledge-oriented programming | 2017-09-29 | Paper |
| Knowledge, timed precedence and clocks (preliminary report) | 2017-09-29 | Paper |
| Knowledge-based programs | 2017-09-29 | Paper |
| Unbeatable Set Consensus via Topological and Combinatorial Reasoning | 2017-09-29 | Paper |
| Characterizing solution concepts in terms of common knowledge of rationality | 2017-08-15 | Paper |
| The unified structure of consensus | 2016-03-02 | Paper |
| Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority | 2016-01-08 | Paper |
| Coordinated consensus in dynamic networks | 2015-09-11 | Paper |
| Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions | 2015-09-11 | Paper |
| Fully polynomial Byzantine agreement in t + 1 rounds | 2015-05-07 | Paper |
| Agent-Time Epistemics and Coordination | 2015-01-06 | Paper |
| Beyond Lamport's Happened-before | 2014-09-12 | Paper |
| A Procedural Characterization of Solution Concepts in Games | 2014-03-24 | Paper |
| Causing communication closure: safe program composition with reliable non-FIFO channels | 2013-06-28 | Paper |
| Continuous consensus via common knowledge | 2013-06-20 | Paper |
| An Optimal Self-Stabilizing Firing Squad | 2012-08-10 | Paper |
| On interactive knowledge with bounded communication | 2012-07-17 | Paper |
| No double discount: condition-based simultaneity yields limited gain | 2012-05-24 | Paper |
| A Refinement Theory that Supports Reasoning about Knowledge and Time for Synchronous Agents | 2011-05-06 | Paper |
| Beyond Lamport’s Happened-Before: On the Role of Time Bounds in Synchronous Systems | 2010-09-10 | Paper |
| Continuous consensus with ambiguous failures | 2010-08-11 | Paper |
| Single-bit messages are insufficient for data link over duplicating channels | 2010-04-19 | Paper |
| Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle | 2009-11-19 | Paper |
| Continuous Consensus with Failures and Recoveries | 2008-11-20 | Paper |
| No Double Discount: Condition-Based Simultaneity Yields Limited Gain | 2008-11-20 | Paper |
| A New Proof of the GHS Minimum Spanning Tree Algorithm | 2008-09-09 | Paper |
| Continuous Consensus with Ambiguous Failures | 2008-03-06 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
| Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
| Computer Vision - ECCV 2004 | 2005-12-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4661971 | 2005-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766624 | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766650 | 2002-06-17 | Paper |
| A Characterization of Eventual Byzantine Agreement | 2002-04-23 | Paper |
| A Layered Analysis of Consensus | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508297 | 2000-10-03 | Paper |
| Common knowledge revisited | 1999-06-24 | Paper |
| Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds | 1998-05-10 | Paper |
| Applications of a logic of knowledge to motion planning under uncertainty | 1998-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845472 | 1995-09-11 | Paper |
| Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time | 1994-09-08 | Paper |
| Belief as defeasible knowledge | 1994-05-26 | Paper |
| A guide to completeness and complexity for modal logics of knowledge and belief | 1992-09-27 | Paper |
| Knowledge and common knowledge in a Byzantine environment: Crash failures | 1990-01-01 | Paper |
| Knowledge and common knowledge in a distributed environment | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3198912 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750428 | 1989-01-01 | Paper |
| Programming simultaneous actions using common knowledge | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5203717 | 1988-01-01 | Paper |
| Cheating husbands and other stories: A case study of knowledge, action, and communication | 1986-01-01 | Paper |
| Taken by surprise: the paradox of the surprise test revisited | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3703315 | 1985-01-01 | Paper |
| On the Encoding of Relations by Graphs | 1984-01-01 | Paper |
