A Framework for Understanding Distributed (Deadlock Detection) Algorithms
Summary: Framework defines complexity levels for distributed decision algorithms, modeling algorithm state as a database with views and transaction atomicity to simplify specification and correctness obligations. Applied to distributed deadlock detection to systematically prove correctness of existing algorithms and synthesize new hybrids combining their best features. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Henry F. Korth
- 2. Ravi Krishnamurthy
- 3. Anil Nigam
- 4. John T. Robinson
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,524 | Replication and Consistency: Being Lazy Helps Sometimes | 1997 | PODS | 5.4601032e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next