The following pages link to Time-Lapse Snapshots (Q4268845):
Displayed 14 items.
- The time complexity of updating snapshot memories (Q293175) (← links)
- The space complexity of unbounded timestamps (Q352241) (← links)
- The complexity of updating snapshot objects (Q663413) (← links)
- Bounded time-stamps (Q1261108) (← links)
- Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers (Q3095338) (← links)
- Of Concurrent Data Structures and Iterations (Q3464481) (← links)
- Linear-time snapshot implementations in unbalanced systems (Q4850334) (← links)
- How a rainbow coloring function can simulate wait-free handshaking (Q5096913) (← links)
- Atomic snapshots using lattice agreement (Q5136986) (← links)
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study (Q5137903) (← links)
- Randomized protocols for asynchronous consensus (Q5138489) (← links)
- Towards a practical snapshot algorithm (Q5958615) (← links)
- Self-stabilizing \(\ell\)-exclusion (Q5958773) (← links)
- Efficient Bounded Timestamping from Standard Synchronization Primitives (Q6202232) (← links)