Pages that link to "Item:Q1143167"
From MaRDI portal
The following pages link to On describing the behavior and implementation of distributed systems (Q1143167):
Displayed 15 items.
- On the complexity of computation in the presence of link failures: The case of a ring (Q808251) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Electing a leader in a ring with link failures (Q1075046) (← links)
- A lower bound for the time to assure interactive consistency (Q1168726) (← links)
- Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory (Q1203715) (← links)
- Modelling knowledge and action in distributed systems (Q1262142) (← links)
- Rapid convergence of a local load balancing algorithm for asynchronous rings (Q1292435) (← links)
- Global serializability of concurrent programs (Q1318722) (← links)
- Faster asynchronous systems. (Q1401952) (← links)
- The origins of structural operational semantics (Q1878710) (← links)
- On the message complexity of distributed problems (Q3345763) (← links)
- Some perspectives on PODC (Q5138485) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Action systems in incremental and aspect-oriented modeling (Q5138491) (← links)
- Fast asynchronous systems in dense time (Q5940928) (← links)