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

Lower bounds for local approximation: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Byzantine broadcast in point-to-point networks using local linear coding: Label: en
On the price of equivocation in byzantine agreement: Label: en
On the (limited) power of non-equivocation: Label: en
Competitive and fair throughput for co-existing networks under adversarial interference: Label: en
Dynamic packet scheduling in wireless networks: Label: en
A simple approach for adapting continuous load balancing processes to discrete settings: Label: en
A closer look at fault tolerance: Label: en
Simulations and reductions for colorless tasks: Label: en
Asynchronous failure detectors: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Leader election in shared spectrum radio networks: Label: en
Distributed connectivity of wireless networks: Label: en
Aggregation in dynamic networks: Label: en
Weak models of distributed computing, with connections to modal logic: Label: en
Distributed maximal matching: Label: en
Distributed public key schemes secure against continual leakage: Label: en
Making evildoers pay: Label: en
Distributed selfish load balancing with weights and speeds: Label: en
Generalized lattice agreement: Label: en
Universal constructions that ensure disjoint-access parallelism and wait-freedom: Label: en
Wait-freedom with advice: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Brief announcement: Label: en
Collaborative search on the plane without communication: Label: en
The communication complexity of distributed task allocation: Label: en
The cost of fault tolerance in multi-party communication complexity: Label: en
Coalescing random walks and voting on graphs: Label: en
Random walks which prefer unvisited edges.: Label: en
On the time and space complexity of randomized test-and-set: Label: en
On the liveness of transactional memory: Label: en