A knowledge-based analysis of global function computation
From MaRDI portal
Publication:660991
Recommendations
- A Knowledge-Based Analysis of Global Function Computation
- On knowledge and communication complexity in distributed systems
- Knowledge and common knowledge in a distributed environment
- On the complexity of global computation in the presence of link failures: the general case
- scientific article; zbMATH DE number 4026814
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1512613 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A characterization of eventual Byzantine agreement
- A little knowledge goes a long way
- A refinement theory that supports reasoning about knowledge and time for synchronous agents
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
- An improved algorithm for decentralized extrema-finding in circular configurations of processes
- Computing in totally anonymous asynchronous shared memory systems
- Computing on an anonymous ring
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Knowledge-based programs
- Knowledge-oriented programming
- Logic for Programming, Artificial Intelligence, and Reasoning
- Modeling belief in dynamic systems. I: Foundations
- Naming and Identity in Epistemic Logics Part I: The Propositional Case
- Naming and identity in epistemic logic. II: A first-order logic for naming
- On a routing problem
- Programming simultaneous actions using common knowledge
Cited in
(2)
This page was built for publication: A knowledge-based analysis of global function computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q660991)