The congenial talking philosophers problem in computer networks
From MaRDI portal
Publication:5138378
Recommendations
- The dance party problem and its application to collective communication in computer networks
- An optimal distributed solution to the dining philosphers problem
- IEEE 802.11s and the Philosophers’ problem
- A distributed self-stabilizing solution to the dining philosophers problem
- Communication constraints in the average consensus problem
- Networks with Condorcet solutions
- Semantics of finite and infinite networks of concurrent communicating agents
- scientific article; zbMATH DE number 3848612
Cites work
- A distributed k-mutual exclusion algorithm using k-coterie
- A quorum based \(k\)-mutual exclusion by weighted \(k\)-quorum systems
- A simple local-spin group mutual exclusion algorithm
- A taxonomy of distributed mutual exclusion
- Asynchronous group mutual exclusion
- Communicating sequential processes
- Distributed algorithms for multiple entries to a critical section with priority
- How to assign votes in a distributed system
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 4082934 (Why is no real title available?)
- Local-Spin Group Mutual Exclusion Algorithms
- Time, clocks, and the ordering of events in a distributed system
Cited in
(3)
This page was built for publication: The congenial talking philosophers problem in computer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138378)
