Entity usage

Showing below up to 33 results in range #1 to #33.

1. Transactional contention management as a non-clairvoyant scheduling problem: Label: en
2. Synchronizing without locks is inherently expensive: Label: en
3. Stably computable predicates are semilinear: Label: en
4. Lower bound for scalable Byzantine Agreement: Label: en
5. An Ω ( n log n ) lower bound on the cost of mutual exclusion: Label: en
6. Possibility and complexity of probabilistic reliable communication in directed networks: Label: en
7. Reliable broadcast in radio networks: Label: en
8. How fast can a very robust read be?: Label: en
9. An O (1) RMRs leader election algorithm: Label: en
10. Single-scanner multi-writer snapshot implementations are fast!: Label: en
11. Common2 extended to stacks and unbounded concurrency: Label: en
12. Local approximation schemes for topology control: Label: en
13. Optimal-stretch name-independent compact routing in doubling metrics: Label: en
14. Object location using path separators: Label: en
15. Oracle size: Label: en
16. Timeliness, failure-detectors, and consensus performance: Label: en
17. Optimally efficient multi-valued byzantine agreement: Label: en
18. Irreducibility and additivity of set agreement-oriented failure detector classes: Label: en
19. Self-stabilizing byzantine agreement: Label: en
20. On the topologies formed by selfish peers: Label: en
21. Peer counting and sampling in overlay networks: Label: en
22. Computing separable functions via gossip: Label: en
23. Veracity radius: Label: en
24. Adversarial queuing on the multiple-access channel: Label: en
25. Sketching asynchronous streams over a sliding window: Label: en
26. Grouped distributed queues: Label: en
27. EquiCast: Label: en
28. Distributed computing meets game theory: Label: en
29. Routing without regret: Label: en
30. When selfish meets evil: Label: en
31. Distributed verification of minimum spanning trees: Label: en
32. Quorum placement in networks: Label: en
33. On the complexity of distributed graph coloring: Label: en