Threshold graphs and synchronization protocols
From MaRDI portal
Publication:6567697
Recommendations
Cites Work
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- scientific article; zbMATH DE number 4082934 (Why is no real title available?)
- scientific article; zbMATH DE number 3561379 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3613062 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1263242 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
- A new solution of Dijkstra's concurrent programming problem
- Arbitration without common modifiable variables
- Degree sequences of matrogenic graphs
- Intransitive indifference with unequal indifference intervals
- Matroidal graphs
- Minimal Threshold Separators and Memory Requirements for Synchronization
- Myths about the mutual exclusion problem
- ON PVchunk OPERATIONS AND MATROGENIC GRAPHS
- On an extension of Dijkstra's semaphore primitives
- PARALLEL RECOGNITION ALGORITHMS FOR GRAPHS WITH RESTRICTED NEIGHBOURHOODS
- Self-stabilizing systems in spite of distributed control
- Sufficient Conditions for Graphs to Have Threshold Number 2
- The Complexity of the Partial Order Dimension Problem
- Threshold graphs and related topics
- Time, clocks, and the ordering of events in a distributed system
- Variants of the software solution to mutual exclusion
This page was built for publication: Threshold graphs and synchronization protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567697)