Pages that link to "Item:Q5711542"
From MaRDI portal
The following pages link to SOFSEM 2005: Theory and Practice of Computer Science (Q5711542):
Displaying 9 items.
- On the time complexity of minimum and maximum global snapshot problems (Q293343) (← links)
- Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method (Q455960) (← links)
- The complexity of updating snapshot objects (Q663413) (← links)
- Help when needed, but no more: efficient read/write partial snapshot (Q663424) (← links)
- On distributed snapshots (Q1107971) (← links)
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP (Q1822234) (← links)
- Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects (Q2232592) (← links)
- On the memory overhead of distributed snapshots (Q4262691) (← links)
- Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity (Q5501949) (← links)