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

Dynamic and self-stabilizing distributed matching: Label: en
Non-blocking steal-half work queues: Label: en
f -arrays: Label: en
Two-handed emulation: Label: en
Evaluating the running time of a communication round over the internet: Label: en
Analysis of the evolution of peer-to-peer systems: Label: en
Fault-tolerant routing in peer-to-peer systems: Label: en
Sequential composition of protocols without simultaneous termination: Label: en
On perfectly secure communication over arbitrary networks: Label: en
Viceroy: Label: en
A BGP-based mechanism for lowest-cost routing: Label: en
General perfectly periodic scheduling: Label: en
Searching for a black hole in arbitrary networks: Label: en
Optimal plans for aggregation: Label: en
Nearly optimal FIFO buffer management for DiffServ: Label: en
Detectable byzantine agreement secure against faulty majorities: Label: en
Building secure file systems out of byzantine storage: Label: en
Minimal replication cost for availability: Label: en
The inherent price of indulgence: Label: en
Active disk paxos with infinitely many processes: Label: en
Lexicographically optimal smoothing for broadband traffic multiplexing: Label: en
GS ³: Label: en
Efficient algorithms for leader election in radio networks: Label: en
Establishing wireless conference calls under delay constraints: Label: en
Non-blocking timeout in scalable queue-based spin locks: Label: en
Safe memory reclamation for dynamic lock-free objects using atomic reads and writes: Label: en
Space-optimal multi-writer snapshot objects are slow: Label: en
Nonatomic mutual exclusion with local spinning: Label: en