Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Want to Gather? No Need to Chatter!: Label: en
Efficient Deterministic Distributed Coloring with Small Bandwidth: Label: en
Distance-2 Coloring in the CONGEST Model: Label: en
Brief Announcement: Hazard Pointer Protection of Structures with Immutable Links: Label: en
Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics: Label: en
Brief Announcement: On Implementing Software Transactional Memory in the C++ Memory Model: Label: en
Brief Announcement: Intermediate Value Linearizability: A Quantitative Correctness Criterion: Label: en
Brief Announcement: Optimal Time and Space Leader Election in Population Protocols: Label: en
Self-Stabilizing Leader Election in Regular Graphs: Label: en
Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic Registers: Label: en
AnO(log^3/2n) Parallel Time Population Protocol for Majority withO(logn) States: Label: en
Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives: Label: en
Brief Announcement: Byzantine Agreement with Unknown Participants and Failures: Label: en
Brief Announcement: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP: Label: en
Brief Announcement: On the Significance of Consecutive Ballots in Paxos: Label: en
Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time: Label: en
On the Subject of Non-Equivocation: Defining Non-Equivocation in Synchronous Agreement Systems: Label: en
Asynchronous Byzantine Approximate Consensus in Directed Networks: Label: en
Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience: Label: en
Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited: Label: en
Massively Parallel Algorithms for Minimum Cut: Label: en
Computing Shortest Paths and Diameter in the Hybrid Network Model: Label: en
Sleeping is Efficient: MIS in O (1)-rounds Node-averaged Awake Complexity: Label: en
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems: Label: en
Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets: Label: en
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants: Label: en
Exponentially Faster Shortest Paths in the Congested Clique: Label: en
Brief Announcement: The Only Undoable CRDTs are Counters: Label: en
Brief Announcement: Why Extension-Based Proofs Fail: Label: en
Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement: Label: en
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems: Label: en
Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity: Label: en
Extending the Wait-free Hierarchy to Multi-Threaded Systems: Label: en
Upper and Lower Bounds on the Space Complexity of Detectable Objects: Label: en
An Adaptive Approach to Recoverable Mutual Exclusion: Label: en
Single-Source Shortest Paths in the CONGEST Model with Improved Bound: Label: en
Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning: Label: en
Brief Announcement: Noisy Beeping Networks: Label: en
Distributed Computation and Reconfiguration in Actively Dynamic Networks: Label: en
DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead: Label: en
Perigee: Efficient Peer-to-Peer Network Design for Blockchains: Label: en
Noisy Beeps: Label: en
Can Uncoordinated Beeps tell Stories?: Label: en
Brief Announcement: On Using Null Messages in a Byzantine Setting: Label: en
K-set agreement bounds in round-based models through combinatorial topology: Label: en
Positive Aging Admits Fast Asynchronous Plurality Consensus: Label: en
Probably Approximately Knowing: Label: en
Fault-Tolerance in Distributed Optimization: The Case of Redundancy: Label: en
Genuinely Distributed Byzantine Machine Learning: Label: en
Brief Announcement: Round eliminator: a tool for automatic speedup simulation: Label: en