1. Alexandru Baltag, Lawrence S. Moss & Slawomir Solecki (1998): The logic of public announcements, common knowledge, and private suspicions. In: Proceedings of the 7th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 1998), pp. 43–56. Available at
  2. Adam Bjorndahl & Will Nalls (2021): Endogenizing Epistemic Actions. Studia Logica, doi:10.1007/s11225-020-09937-8.
  3. Elizabeth Borowsky & Eli Gafni (1993): Generalized FLP impossibility result for t-resilient asynchronous computations. In: Proceedings of the Twenty-Fifth ACM Symposium on Theory of Computing (STOC 1993), pp. 91–100, doi:10.1145/167088.167119.
  4. Elizabeth Borowsky & Eli Gafni (1993): Immediate atomic snapshots and fast renaming (extended abstract). In: Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 41–51, doi:10.1145/164051.164056.
  5. Elizabeth Borowsky & Eli Gafni (1997): A simple algorithmically reasoned characterization of wait-free computation (extended abstract). In: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing (PODC 1997). ACM, pp. 189–198, doi:10.1145/259380.259439.
  6. Armando Castañeda, Yannai A. Gonczarowski & Yoram Moses (2014): Unbeatable Consensus. In: Fabian Kuhn: Distributed Computing. Springer Berlin Heidelberg, pp. 91106, doi:10.1007/978-3-662-45174-8_7.
  7. Bernadette Charron-Bost & André Schiper (2009): The Heard-Of Model: Computing in Distributed Systems with Benign Faults. Distributed Comput. 22(1), pp. 49–71, doi:10.1007/s00446-009-0084-6.
  8. Hans van Ditmarsch, Wiebe van der Hoek & Barteld Kooi (2008): Dynamic Epistemic Logic. Springer, doi:10.1007/978-1-4020-5839-4.
  9. Ronald Fagin, Joseph Y. Halpern, Yoram Moses & Moshe Y. Vardi (1995): Reasoning about Knowledge. MIT Press, doi:10.7551/mitpress/5803.001.0001.
  10. Eric Goubault, Jérémy Ledent & Sergio Rajsbaum (2018): A simplicial complex model for dynamic epistemic logic to study distributed task computability. In: Proceedings of the Ninth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2018), pp. 73–87, doi:10.4204/EPTCS.277.6.
  11. Joseph Y. Halpern & Yoram Moses (1984): Knowledge and common knowledge in a distributed environment. In: Proceedings of the Third ACM Symposium on Principles of Distributed Computing (PODC 1984), pp. 50–61, doi:10.1145/79147.79161.
  12. Maurice Herlihy, Dmitry Kozlov & Sergio Rajsbaum (2014): Distributed Computing Through Combinatorial Topology. Morgan-Kaufmann, doi:10.1016/C2011-0-07032-1.
  13. Maurice Herlihy & Nir Shavit (1993): The asynchronous computability theorem for t-resilient tasks. In: Proceedings of the Twenty-Fifth ACM Symposium on Theory of Computing (STOC 1993), pp. 111–120, doi:10.1145/167088.167125.
  14. Fabian Kuhn & Rotem Oshman (2011): Dynamic networks: models and algorithms. SIGACT News 42(1), pp. 82–96, doi:10.1145/1959045.1959064.
  15. Yoram Moses (2016): Relating Knowledge and Coordinated Action: The Knowledge of Preconditions Principle. Electronic Proceedings in Theoretical Computer Science 215, pp. 231245, doi:10.4204/eptcs.215.17.
  16. Thomas Nowak, Ulrich Schmid & Kyrill Winkler (2019): Topological Characterization of Consensus under General Message Adversaries. In: Peter Robinson & Faith Ellen: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC 2019). ACM, pp. 218–227, doi:10.1145/3293611.3331624.
  17. Daniel Pfleger & Ulrich Schmid (2018): On knowledge and communication complexity in distributed systems. In: International Colloquium on Structural Information and Communication Complexity (SIROCCO 2018). Springer, pp. 312–330, doi:10.1007/978-3-030-01325-7_27.
  18. Michael Zacks & Fotios Zaharoglou (1993): Wait-free k-set agreement is impossible: the topology of public knowledge. In: Proceedings of the Twenty-Fifth ACM Symposium on Theory of Computing (STOC 1993), pp. 101–110, doi:10.1145/167088.167122.

Comments and questions to:
For website issues: