Pages that link to "Item:Q5854054"

The following pages link to Proceedings of the 39th Symposium on Principles of Distributed Computing (Q5854054):

Displaying 50 items.

• On Distributed Listing of Cliques (Q5854055) (← links)
• Distributed Construction of Light Networks (Q5854056) (← links)
• Efficient and Simple Algorithms for Fault-Tolerant Spanners (Q5854057) (← links)
• Distributed Approximation on Power Graphs (Q5854058) (← links)
• Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST (Q5854059) (← links)
• An Adaptive Approach to Recoverable Mutual Exclusion (Q5855199) (← links)
• Upper and Lower Bounds on the Space Complexity of Detectable Objects (Q5855201) (← links)
• Extending the Wait-free Hierarchy to Multi-Threaded Systems (Q5855202) (← links)
• Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity (Q5855203) (← links)
• From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems (Q5855204) (← links)
• Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement (Q5855205) (← links)
• Brief Announcement: Why Extension-Based Proofs Fail (Q5855206) (← links)
• Brief Announcement: The Only Undoable CRDTs are Counters (Q5855207) (← links)
• Exponentially Faster Shortest Paths in the Congested Clique (Q5855208) (← links)
• Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants (Q5855209) (← links)
• Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets (Q5855210) (← links)
• Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems (Q5855211) (← links)
• Sleeping is Efficient: MIS in <i>O</i> (1)-rounds Node-averaged Awake Complexity (Q5855212) (← links)
• Computing Shortest Paths and Diameter in the Hybrid Network Model (Q5855213) (← links)
• Massively Parallel Algorithms for Minimum Cut (Q5855214) (← links)
• Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited (Q5855216) (← links)
• Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience (Q5855217) (← links)
• Asynchronous Byzantine Approximate Consensus in Directed Networks (Q5855218) (← links)
• On the Subject of Non-Equivocation: Defining Non-Equivocation in Synchronous Agreement Systems (Q5855220) (← links)
• Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time (Q5855221) (← links)
• Brief Announcement: On the Significance of Consecutive Ballots in Paxos (Q5855225) (← links)
• Brief Announcement: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP (Q5855227) (← links)
• Brief Announcement: Byzantine Agreement with Unknown Participants and Failures (Q5855228) (← links)
• Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives (Q5855229) (← links)
• An<i>O</i>(log^3/2<i>n</i>) Parallel Time Population Protocol for Majority with<i>O</i>(log<i>n</i>) States (Q5855232) (← links)
• Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic Registers (Q5855234) (← links)
• Self-Stabilizing Leader Election in Regular Graphs (Q5855235) (← links)
• Brief Announcement: Optimal Time and Space Leader Election in Population Protocols (Q5855236) (← links)
• Brief Announcement: Intermediate Value Linearizability: A Quantitative Correctness Criterion (Q5855237) (← links)
• Brief Announcement: On Implementing Software Transactional Memory in the C++ Memory Model (Q5855238) (← links)
• Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics (Q5855239) (← links)
• Brief Announcement: Hazard Pointer Protection of Structures with Immutable Links (Q5855240) (← links)
• Distance-2 Coloring in the CONGEST Model (Q5855241) (← links)
• Efficient Deterministic Distributed Coloring with Small Bandwidth (Q5855242) (← links)
• Want to Gather? No Need to Chatter! (Q5855243) (← links)
• Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks (Q5855244) (← links)
• The Energy Complexity of BFS in Radio Networks (Q5855245) (← links)
• Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set (Q5855246) (← links)
• Brief Announcement: Resource Competitive Broadcast against Adaptive Adversary in Multi-channel Radio Networks (Q5855247) (← links)
• Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta (Q5855248) (← links)
• How much does randomness help with locally checkable problems? (Q5855249) (← links)
• Simple, Deterministic, Constant-Round Coloring in the Congested Clique (Q5855250) (← links)
• Compact Distributed Certification of Planar Graphs (Q5855251) (← links)
• Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma (Q5855252) (← links)
• Multiple Source Replacement Path Problem (Q5855254) (← links)