Threshold graphs and synchronization protocols
From MaRDI portal
Publication:6567697
DOI10.1007/3-540-61576-8_97zbMATH Open1543.68132MaRDI QIDQ6567697
Rossella Petreschi, Andrea Sterbini
Publication date: 5 July 2024
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Degree sequences of matrogenic graphs
- Variants of the software solution to mutual exclusion
- Arbitration without common modifiable variables
- Myths about the mutual exclusion problem
- Matroidal graphs
- Threshold graphs and related topics
- Intransitive indifference with unequal indifference intervals
- On an extension of Dijkstra's semaphore primitives
- PARALLEL RECOGNITION ALGORITHMS FOR GRAPHS WITH RESTRICTED NEIGHBOURHOODS
- The Complexity of the Partial Order Dimension Problem
- Minimal Threshold Separators and Memory Requirements for Synchronization
- Sufficient Conditions for Graphs to Have Threshold Number 2
- A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
- ON PVchunk OPERATIONS AND MATROGENIC GRAPHS
- Self-stabilizing systems in spite of distributed control
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- Time, clocks, and the ordering of events in a distributed system
- A new solution of Dijkstra's concurrent programming problem
- A Characterization of Comparability Graphs and of Interval Graphs
This page was built for publication: Threshold graphs and synchronization protocols
