Pages that link to "Item:Q5177217"
From MaRDI portal
The following pages link to Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Q5177217):
Displayed 35 items.
- A topological characterization of weakness (Q5177218) (← links)
- Proof labeling schemes (Q5177219) (← links)
- Efficient dependency tracking for relevant events in shared-memory systems (Q5177220) (← links)
- Policy-hiding access control in open environment (Q5177221) (← links)
- Distance estimation and object location via rings of neighbors (Q5177222) (← links)
- Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding (Q5177223) (← links)
- On the locality of bounded growth (Q5177224) (← links)
- Skip-webs (Q5177225) (← links)
- Efficient lookup on unstructured topologies (Q5177227) (← links)
- Quorum placement in networks to minimize access delays (Q5177229) (← links)
- The price of selfish behavior in bilateral network formation (Q5177231) (← links)
- Facility location (Q5177232) (← links)
- Primal-dual based distributed algorithms for vertex cover with semi-hard capacities (Q5177233) (← links)
- Faster communication in known topology radio networks (Q5177234) (← links)
- On reliable broadcast in a radio network (Q5177235) (← links)
- Maximal independent sets in radio networks (Q5177236) (← links)
- On selection problem in radio networks (Q5177237) (← links)
- Fast fault-tolerant agreement algorithms (Q5177239) (← links)
- The combined power of conditions and failure detectors to solve asynchronous set agreement (Q5177240) (← links)
- The weakest failure detector to solve nonuniform consensus (Q5177241) (← links)
- Consensus and collision detectors in wireless Ad Hoc networks (Q5177242) (← links)
- Routing complexity of faulty networks (Q5177243) (← links)
- Feedback control for router congestion resolution (Q5177244) (← links)
- Competitive weighted throughput analysis of greedy protocols on DAGs (Q5177245) (← links)
- Efficient multi-word locking using randomization (Q5177246) (← links)
- Toward a theory of transactional contention managers (Q5177247) (← links)
- Stochastic analysis of distributed deadlock scheduling (Q5177248) (← links)
- Adaptive routing with stale information (Q5177249) (← links)
- A network pricing game for selfish traffic (Q5177250) (← links)
- Correctness of a gossip based membership protocol (Q5177252) (← links)
- A scheme for load balancing in heterogenous distributed hash tables (Q5177253) (← links)
- On the establishment of distinct identities in overlay networks (Q5177254) (← links)
- Simultaneous broadcast revisited (Q5177255) (← links)
- Feasibility and complexity of broadcasting with random transmission failures (Q5177256) (← links)
- Reliable broadcast in unknown fixed-identity networks (Q5177257) (← links)