Pages that link to "Item:Q3929050"
From MaRDI portal
The following pages link to A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems (Q3929050):
Displayed 11 items.
- Deadlock-freedom (and safety) of transactions in a distributed database (Q579973) (← links)
- On the power of safe locking (Q909495) (← links)
- Is distributed locking harder? (Q1061510) (← links)
- Partitioning and separating sets of orthogonal polygons (Q1097030) (← links)
- Generalized halfspaces in restricted-orientation convexity (Q1266488) (← links)
- Fundamentals of restricted-orientation convexity (Q1373390) (← links)
- Visibility in semi-convex spaces (Q1375948) (← links)
- A decompositin theorem for convexity spaces (Q1826114) (← links)
- PLANAR STRONG VISIBILITY (Q4818579) (← links)
- The geometry of conservative programs (Q4961721) (← links)
- Cut-off theorems for the \textit{PV}-model (Q6108429) (← links)