Pages that link to "Item:Q5501477"
From MaRDI portal
The following pages link to Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Q5501477):
Displaying 35 items.
- Completely fair SFE and coalition-safe cheap talk (Q5501478) (← links)
- Mechanism design for policy routing (Q5501479) (← links)
- Selfish caching in distributed systems (Q5501481) (← links)
- Lower bounds for adaptive collect and related objects (Q5501483) (← links)
- Efficient synchronous snapshots (Q5501484) (← links)
- On the inherent weakness of conditional synchronization primitives (Q5501485) (← links)
- Specification faithfulness in networks with rational nodes (Q5501487) (← links)
- On the expected payment of mechanisms for task allocation (Q5501488) (← links)
- On spectrum sharing games (Q5501489) (← links)
- Load balancing and locality in range-queriable data structures (Q5501490) (← links)
- Choosing a random peer (Q5501491) (← links)
- Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game (Q5501492) (← links)
- Compact routing on euclidian metrics (Q5501493) (← links)
- When graph theory helps self-stabilization (Q5501494) (← links)
- Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models (Q5501495) (← links)
- Eclecticism shrinks even small worlds (Q5501496) (← links)
- Analyzing Kleinberg's (and other) small-world Models (Q5501497) (← links)
- Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs (Q5501498) (← links)
- Balanced binary trees for ID management and load balance in distributed hash tables (Q5501499) (← links)
- Efficient top-K query calculation in distributed networks (Q5501500) (← links)
- On the design of distributed protocols from differential equations (Q5501501) (← links)
- Byzantine disk paxos (Q5501502) (← links)
- How fast can a distributed atomic read be? (Q5501503) (← links)
- Signed quorum systems (Q5501504) (← links)
- Competitive on-line paging strategies for mobile users under delay constraints (Q5501505) (← links)
- A better wake-up in radio networks (Q5501506) (← links)
- Broadcast in radio networks tolerating byzantine adversarial behavior (Q5501507) (← links)
- A note on efficient aggregate queries in sensor networks (Q5501508) (← links)
- Computation in networks of passively mobile finite-state sensors (Q5501509) (← links)
- What cannot be computed locally! (Q5501510) (← links)
- Geometrically aware communication in random wireless networks (Q5501511) (← links)
- Gradient clock synchronization (Q5501512) (← links)
- Communication-efficient leader election and consensus with limited link synchrony (Q5501513) (← links)
- The weakest failure detectors to solve certain fundamental problems in distributed computing (Q5501514) (← links)
- Asynchronous group key exchange with failures (Q5501515) (← links)
