Pages that link to "Item:Q1090104"
From MaRDI portal
The following pages link to On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes (Q1090104):
Displaying 20 items.
- Contextual equivalences in configuration structures and reversibility (Q347363) (← links)
- Enabling synchronous and asynchronous communications in CSP for SOC (Q530849) (← links)
- Distributed disassembly of mosaics (Q685519) (← links)
- Theory of interaction (Q896903) (← links)
- Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms (Q911262) (← links)
- Symmetry breaking in distributed networks (Q918187) (← links)
- Election and rendezvous with incomparable labels (Q930904) (← links)
- A contribution to the theory of program testing (Q1060837) (← links)
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP (Q1822234) (← links)
- What is a ``good'' encoding of guarded choice? (Q1854329) (← links)
- On the structural simplicity of machines and languages (Q1924785) (← links)
- Tutorial on separation results in process calculi via leader election problems (Q2464946) (← links)
- CCS with priority guards (Q2474050) (← links)
- Symmetric electoral systems for ambient calculi (Q2475806) (← links)
- Leader election in rings of ambient processes (Q2491642) (← links)
- The Expressive Power of Monotonic Parallel Composition (Q2802500) (← links)
- On Synchronous and Asynchronous Interaction in Distributed Systems (Q3599113) (← links)
- An expressiveness study of priority in process calculi (Q3655761) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Symmetric and Asymmetric Asynchronous Interaction (Q5166614) (← links)
