Pages that link to "Item:Q1822970"
From MaRDI portal
The following pages link to Complexity of distributed commit protocols (Q1822970):
Displaying 8 items.
- Design of transaction commitment protocols (Q751232) (← links)
- A theorem on atomicity in distributed algorithms (Q913499) (← links)
- An optimal distributed algorithm for recognizing mesh-connected networks (Q1314373) (← links)
- A distributed critical section protocol for general topology (Q1898195) (← links)
- Multi-shot distributed transaction commit (Q1981633) (← links)
- The Complexity of Distributed Concurrency Control (Q3678697) (← links)
- (Q5090904) (← links)
- Continuation Complexity: A Callback Hell for Distributed Systems (Q5858633) (← links)