Pages that link to "Item:Q5361908"

The following pages link to Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Q5361908):

Displaying 50 items.

• Space-time tradeoffs for distributed verification (Q1742756) (← links)
• A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds (Q5361909) (← links)
• The Greedy Spanner is Existentially Optimal (Q5361910) (← links)
• MST in Log-Star Rounds of Congested Clique (Q5361911) (← links)
• Distributed Algorithms for Planar Networks I (Q5361912) (← links)
• Brief Announcement (Q5361913) (← links)
• Brief Announcement (Q5361914) (← links)
• Brief Announcement (Q5361915) (← links)
• Brief Announcement (Q5361916) (← links)
• Analysing Snapshot Isolation (Q5361917) (← links)
• Recoverable Mutual Exclusion (Q5361918) (← links)
• A Randomized Concurrent Algorithm for Disjoint Set Union (Q5361919) (← links)
• Self-stabilizing Balls & Bins in Batches (Q5361921) (← links)
• Brief Announcement (Q5361922) (← links)
• Deterministic Objects (Q5361923) (← links)
• Unbeatable Set Consensus via Topological and Combinatorial Reasoning (Q5361924) (← links)
• A Polylogarithmic Gossip Algorithm for Plurality Consensus (Q5361925) (← links)
• Noisy Rumor Spreading and Plurality Consensus (Q5361926) (← links)
• Rational Consensus (Q5361928) (← links)
• Brief Announcement (Q5361929) (← links)
• Contention Resolution on a Fading Channel (Q5361930) (← links)
• Reliable Communication over Highly Connected Noisy Networks (Q5361931) (← links)
• Contention Resolution on Multiple Channels with Collision Detection (Q5361932) (← links)
• How Asynchrony Affects Rumor Spreading Time (Q5361933) (← links)
• Brief Announcement (Q5361934) (← links)
• Brief Announcement (Q5361935) (← links)
• Brief Announcement (Q5361936) (← links)
• Brief Announcement (Q5361937) (← links)
• Distributed Strong Diameter Network Decomposition (Q5361938) (← links)
• Optimal Dynamic Distributed MIS (Q5361939) (← links)
• A Local Constant Factor MDS Approximation for Bounded Genus Graphs (Q5361940) (← links)
• On Efficient Distributed Construction of Near Optimal Routing Schemes (Q5361941) (← links)
• Brief Announcement (Q5361942) (← links)
• Space Bounds for Reliable Storage (Q5361943) (← links)
• Specification and Complexity of Collaborative Text Editing (Q5361944) (← links)
• Optimal Mobile Byzantine Fault Tolerant Distributed Storage (Q5361945) (← links)
• A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems (Q5361946) (← links)
• A Complexity-Based Hierarchy for Multiprocessor Synchronization (Q5361947) (← links)
• Brief Announcement (Q5361948) (← links)
• Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation (Q5361949) (← links)
• On the Complexity of Reader-Writer Locks (Q5361950) (← links)
• An Algorithm for Replicated Objects with Efficient Reads (Q5361951) (← links)
• Are Shared Objects Composable under an Oblivious Adversary? (Q5361952) (← links)
• Brief Announcement (Q5361954) (← links)
• Brief Announcement (Q5361955) (← links)
• Brief Announcement (Q5361956) (← links)
• A Faster Distributed Radio Broadcast Primitive (Q5361958) (← links)
• Broadcast Extensions with Optimal Communication and Round Complexity (Q5361959) (← links)
• Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems (Q5361960) (← links)
• How Proofs are Prepared at Camelot (Q5361961) (← links)