Entity usage

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

1. Asynchronous group key exchange with failures: Label: en
2. The weakest failure detectors to solve certain fundamental problems in distributed computing: Label: en
3. Communication-efficient leader election and consensus with limited link synchrony: Label: en
4. Gradient clock synchronization: Label: en
5. Geometrically aware communication in random wireless networks: Label: en
6. What cannot be computed locally!: Label: en
7. Computation in networks of passively mobile finite-state sensors: Label: en
8. A note on efficient aggregate queries in sensor networks: Label: en
9. Broadcast in radio networks tolerating byzantine adversarial behavior: Label: en
10. A better wake-up in radio networks: Label: en
11. Competitive on-line paging strategies for mobile users under delay constraints: Label: en
12. Signed quorum systems: Label: en
13. How fast can a distributed atomic read be?: Label: en
14. Byzantine disk paxos: Label: en
15. On the design of distributed protocols from differential equations: Label: en
16. Efficient top-K query calculation in distributed networks: Label: en
17. Balanced binary trees for ID management and load balance in distributed hash tables: Label: en
18. Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs: Label: en
19. Analyzing Kleinberg's (and other) small-world Models: Label: en
20. Eclecticism shrinks even small worlds: Label: en
21. Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models: Label: en
22. When graph theory helps self-stabilization: Label: en
23. Compact routing on euclidian metrics: Label: en
24. Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game: Label: en
25. Choosing a random peer: Label: en
26. Load balancing and locality in range-queriable data structures: Label: en
27. On spectrum sharing games: Label: en
28. On the expected payment of mechanisms for task allocation: Label: en
29. Specification faithfulness in networks with rational nodes: Label: en
30. On the inherent weakness of conditional synchronization primitives: Label: en
31. Efficient synchronous snapshots: Label: en
32. Lower bounds for adaptive collect and related objects: Label: en
33. Selfish caching in distributed systems: Label: en
34. Mechanism design for policy routing: Label: en
35. Completely fair SFE and coalition-safe cheap talk: Label: en