Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 21 results in range #1 to #21.
- Fast deflection routing for packets and worms: Label: en
- An Ω(D log(N/D)) lower bound for broadcast in radio networks: Label: en
- Bounded round number: Label: en
- Immediate atomic snapshots and fast renaming: Label: en
- Atomic snapshots in O(n log n) operations: Label: en
- A perspective on AN2: Label: en
- Knowledge-oriented programming: Label: en
- A lower bound on wait-free counting: Label: en
- On the space complexity of randomized synchronization: Label: en
- Implementing hybrid consistency with high-level synchronization operations: Label: en
- Efficient detection of corrupted pages in a replicated file: Label: en
- Distributed fingerprints and secure information dispersal: Label: en
- Unifying self-stabilization and fault-tolerance: Label: en
- Adaptive solutions to the mutual exclusion problem: Label: en
- Fast, scalable synchronization with minimal hardware support: Label: en
- A completeness theorem for a class of synchronization objects: Label: en
- On the robustness of Herlihy's hierarchy: Label: en
- Resource bounds and combinations of consensus objects: Label: en
- Designing algorithms for distributed systems with partially synchronized clocks: Label: en
- Optimal clock synchronization under different delay assumptions: Label: en
- Wait-free clock synchronization: Label: en
