Pages that link to "Item:Q5368934"
From MaRDI portal
The following pages link to Proceedings of the ACM Symposium on Principles of Distributed Computing (Q5368934):
Displaying 50 items.
- Self-organized segregation on the grid (Q1753249) (← links)
- Towards efficient verification of population protocols (Q2058386) (← links)
- A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities (Q5133968) (← links)
- Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks (Q5368935) (← links)
- The Space Requirement of Local Forwarding on Acyclic Networks (Q5368936) (← links)
- Communication Primitives in Cognitive Radio Networks (Q5368937) (← links)
- Broadcasting in Noisy Radio Networks (Q5368938) (← links)
- Gossip in a Smartphone Peer-to-Peer Network (Q5368939) (← links)
- Analyzing Contention and Backoff in Asynchronous Shared Memory (Q5368940) (← links)
- A Layered Architecture for Erasure-Coded Consistent Distributed Storage (Q5368941) (← links)
- Seeing is Believing (Q5368944) (← links)
- Space Complexity of Fault-Tolerant Register Emulations (Q5368945) (← links)
- Brief Announcement (Q5368946) (← links)
- Brief Announcement (Q5368947) (← links)
- Brief Announcement (Q5368948) (← links)
- LCL Problems on Grids (Q5368949) (← links)
- On the Multiparty Communication Complexity of Testing Triangle-Freeness (Q5368951) (← links)
- What Can be Sampled Locally? (Q5368952) (← links)
- Distributed MST and Routing in Almost Mixing Time (Q5368953) (← links)
- Distributed MIS via All-to-All Communication (Q5368954) (← links)
- Brief Announcement (Q5368956) (← links)
- Distributed Approximation of Maximum Independent Set and Maximum Matching (Q5368958) (← links)
- Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity (Q5368959) (← links)
- Optimal Distance Labeling Schemes for Trees (Q5368961) (← links)
- Brief Announcement (Q5368962) (← links)
- Brief Announcement (Q5368963) (← links)
- Brief Announcement (Q5368964) (← links)
- Brief Announcement (Q5368965) (← links)
- Recoverable Mutual Exclusion in Sub-logarithmic Time (Q5368966) (← links)
- Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model (Q5368967) (← links)
- Transactional Lock Elision Meets Combining (Q5368968) (← links)
- On Using Time Without Clocks via Zigzag Causality (Q5368970) (← links)
- Brief Announcement (Q5368971) (← links)
- Brief Announcement (Q5368972) (← links)
- Brief Announcement (Q5368974) (← links)
- Effectiveness of Delaying Timestamp Computation (Q5368975) (← links)
- Symmetry Breaking with Noisy Processes (Q5368976) (← links)
- The Power of Choice in Priority Scheduling (Q5368977) (← links)
- A Template for Implementing Fast Lock-free Trees Using HTM (Q5368978) (← links)
- FruitChains (Q5368979) (← links)
- Coordination Without Prior Agreement (Q5368980) (← links)
- Ignore or Comply? (Q5368981) (← links)
- Life Beyond Set Agreement (Q5368982) (← links)
- Brief Announcement (Q5368984) (← links)
- Brief Announcement (Q5368985) (← links)
- Brief Announcement (Q5368988) (← links)
- Greedy Routing and the Algorithmic Small-World Phenomenon (Q5368989) (← links)
- Triangle Finding and Listing in CONGEST Networks (Q5368990) (← links)
- Asynchronous Shared Channel (Q5368991) (← links)
- Brief Announcement (Q5368993) (← links)
