Pages that link to "Item:Q5197660"

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

Displaying 50 items.

• Nesting-Safe Recoverable Linearizability (Q5197661) (← links)
• Recoverable Mutual Exclusion Under System-Wide Failures (Q5197662) (← links)
• Deterministic Abortable Mutual Exclusion with Sublogarithmic Adaptive RMR Complexity (Q5197664) (← links)
• Separating Lock-Freedom from Wait-Freedom (Q5197665) (← links)
• Passing Messages while Sharing Memory (Q5197667) (← links)
• Revisionist Simulations (Q5197668) (← links)
• On the Classification of Deterministic Objects via Set Agreement Power (Q5197669) (← links)
• Leveraging Indirect Signaling for Topology Inference and Fast Broadcast (Q5197670) (← links)
• The Energy Complexity of Broadcast (Q5197671) (← links)
• Deterministic Digital Clustering of Wireless Ad Hoc Networks (Q5197672) (← links)
• Round- and Message-Optimal Distributed Graph Algorithms (Q5197673) (← links)
• Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover (Q5197674) (← links)
• Distributed Spanner Approximation (Q5197675) (← links)
• Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs (Q5197676) (← links)
• Brief Announcement (Q5197677) (← links)
• Brief Announcement (Q5197678) (← links)
• The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory (Q5197680) (← links)
• Optimal Gossip Algorithms for Exact and Approximate Quantile Computations (Q5197682) (← links)
• On Local Distributed Sampling and Counting (Q5197683) (← links)
• A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds (Q5197684) (← links)
• Near-Optimal Distributed Routing with Low Memory (Q5197685) (← links)
• Fair Leader Election for Rational Agents in Asynchronous Rings and Networks (Q5197687) (← links)
• Leader Election in Well-Connected Graphs (Q5197688) (← links)
• Brief Announcement (Q5197689) (← links)
• Atomic Cross-Chain Swaps (Q5197690) (← links)
• Interactive Distributed Proofs (Q5197691) (← links)
• Brief Announcement (Q5197692) (← links)
• Silence (Q5197693) (← links)
• Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited (Q5197694) (← links)
• Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics (Q5197695) (← links)
• Sublinear Message Bounds for Randomized Agreement (Q5197696) (← links)
• Tight Bounds for Asymptotic and Approximate Consensus (Q5197697) (← links)
• Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks (Q5197698) (← links)
• Property Testing of Planarity in the CONGEST model (Q5197699) (← links)
• Congested Clique Algorithms for the Minimum Cut Problem (Q5197700) (← links)
• Locking Timestamps versus Locking Objects (Q5197702) (← links)
• Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms (Q5197703) (← links)
• An Asynchronous Computability Theorem for Fair Adversaries (Q5197704) (← links)
• Population Stability (Q5197705) (← links)
• Brief Announcement (Q5197706) (← links)
• Distributed Coloring in Sparse Graphs with Fewer Colors (Q5197707) (← links)
• Improved Distributed Delta-Coloring (Q5197708) (← links)
• Locally-Iterative Distributed (Δ+ 1) (Q5197709) (← links)
• Lower Bounds for Searching Robots, some Faulty (Q5197710) (← links)
• Distributed Uniformity Testing (Q5197711) (← links)
• Minor Excluded Network Families Admit Fast Distributed Algorithms (Q5197712) (← links)
• Brief Announcement (Q5197713) (← links)
• Brief Announcement (Q5197714) (← links)
• Brief Announcement (Q5197716) (← links)
• A Brief Tutorial on Distributed and Concurrent Machine Learning (Q5197717) (← links)