Entity usage

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 25 results in range #1 to #25.

Randomized mutual exclusion algorithms revisited: Label: en
Proving probabilistic correctness statements: Label: en
Fast randomized algorithms for distributed edge coloring: Label: en
A tradeoff between safety and liveness for randomized coordinated attack protocols: Label: en
Progress measures and stack assertions for fair termination: Label: en
From sequential layers to distributed processes: Label: en
The possibility and the complexity of achieving fault-tolerant coordination: Label: en
The impact of time on the session problem: Label: en
Leader election in complete networks: Label: en
Fast network decomposition: Label: en
Improving fast mutual exclusion: Label: en
The weakest failure detector for solving consensus: Label: en
Robust, distributed references and acyclic garbage collection: Label: en
Performance issues in non-blocking synchronization on shared-memory multiprocessors: Label: en
Observing self-stabilization: Label: en
On the complexity of global computation in the presence of link failures: Label: en
Performing work efficiently in the presence of faults: Label: en
Tolerating linear number of faults in networks of bounded degree: Label: en
Optimal multi-writer multi-reader atomic register: Label: en
Concurrent counting: Label: en
Computing with faulty shared memory: Label: en
The slide mechanism with applications in dynamic networks: Label: en
Requirements for deadlock-free, adaptive packet routing: Label: en
Connection-based communication in dynamic networks: Label: en
Distributed priority algorithms under one-bit-delay constraint: Label: en