Pages that link to "Item:Q2933771"
From MaRDI portal
The following pages link to Proceedings of the 2012 ACM symposium on Principles of distributed computing (Q2933771):
Displayed 50 items.
- On the liveness of transactional memory (Q2933772) (← links)
- On the time and space complexity of randomized test-and-set (Q2933773) (← links)
- Random walks which prefer unvisited edges. (Q2933774) (← links)
- Coalescing random walks and voting on graphs (Q2933775) (← links)
- The cost of fault tolerance in multi-party communication complexity (Q2933776) (← links)
- The communication complexity of distributed task allocation (Q2933777) (← links)
- Collaborative search on the plane without communication (Q2933778) (← links)
- Generalized lattice agreement (Q2933788) (← links)
- Distributed selfish load balancing with weights and speeds (Q2933790) (← links)
- Making evildoers pay (Q2933791) (← links)
- Distributed public key schemes secure against continual leakage (Q2933792) (← links)
- Distributed maximal matching (Q2933793) (← links)
- Lower bounds for local approximation (Q2933794) (← links)
- Aggregation in dynamic networks (Q2933795) (← links)
- Distributed connectivity of wireless networks (Q2933796) (← links)
- Leader election in shared spectrum radio networks (Q2933797) (← links)
- Asynchronous failure detectors (Q2933801) (← links)
- Simulations and reductions for colorless tasks (Q2933802) (← links)
- Dynamic packet scheduling in wireless networks (Q2933803) (← links)
- Competitive and fair throughput for co-existing networks under adversarial interference (Q2933804) (← links)
- On the (limited) power of non-equivocation (Q2933805) (← links)
- On the price of equivocation in byzantine agreement (Q2933806) (← links)
- Byzantine broadcast in point-to-point networks using local linear coding (Q2933807) (← links)
- Distributed algorithms for scheduling on line and tree networks (Q2933811) (← links)
- Optimal distributed all pairs shortest paths and applications (Q2933812) (← links)
- Iterative approximate byzantine consensus in arbitrary directed graphs (Q2933813) (← links)
- Faster than optimal snapshots (for a while) (Q2933814) (← links)
- Strongly linearizable implementations (Q2933816) (← links)
- Faster randomized consensus with an oblivious adversary (Q5891965) (← links)
- Information spreading in dynamic graphs (Q5891966) (← links)
- Brief announcement (Q5891967) (← links)
- Brief announcement (Q5891968) (← links)
- Brief announcement (Q5891969) (← links)
- Brief announcement (Q5891970) (← links)
- Brief announcement (Q5891971) (← links)
- Brief announcement (Q5891972) (← links)
- Brief announcement (Q5891973) (← links)
- Brief announcement (Q5891974) (← links)
- Brief announcement (Q5891975) (← links)
- Wait-freedom with advice (Q5891976) (← links)
- Universal constructions that ensure disjoint-access parallelism and wait-freedom (Q5891977) (← links)
- Weak models of distributed computing, with connections to modal logic (Q5891978) (← links)
- Brief announcement (Q5891979) (← links)
- Brief announcement (Q5891980) (← links)
- Brief announcement (Q5891981) (← links)
- Brief announcement (Q5891982) (← links)
- Brief announcement (Q5891983) (← links)
- Brief announcement (Q5891984) (← links)
- Brief announcement (Q5891985) (← links)
- Brief announcement (Q5891986) (← links)