Entity usage
From MaRDI portal
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 41 results in range #1 to #41.
- Dual Failure Resilient BFS Structure: Label: en
- Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems: Label: en
- Minimal Synchrony for Byzantine Consensus: Label: en
- Fault-Tolerant Consensus in Directed Graphs: Label: en
- Towards Optimal Synchronous Counting: Label: en
- The Cost of Synchronizing Multiple-Access Channels: Label: en
- Distributed Resource Discovery in Sub-Logarithmic Time: Label: en
- On the Push&Pull Protocol for Rumour Spreading: Label: en
- Computing Weak Consistency in Polynomial Time: Label: en
- Limitations of Highly-Available Eventually-Consistent Data Stores: Label: en
- The Weakest Failure Detector for Eventual Consistency: Label: en
- How To Elect a Leader Faster than a Tournament: Label: en
- On Information Complexity in the Broadcast Model: Label: en
- Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks: Label: en
- Distributed Convex Thresholding: Label: en
- Randomized Proof-Labeling Schemes: Label: en
- Improved Analysis of Deterministic Load-Balancing Schemes: Label: en
- Adaptively Secure Computation with Partial Erasures: Label: en
- How Fair is Your Protocol?: Label: en
- On the Space Complexity of Set Agreement: Label: en
- Lock-Free Algorithms under Stochastic Schedulers: Label: en
- Safety-Liveness Exclusion in Distributed Computing: Label: en
- Impossibility Results for Distributed Transactional Memory: Label: en
- On the Time and Space Complexity of ABA Prevention and Detection: Label: en
- The Price of being Adaptive: Label: en
- Trading Fences with RMRs and Separating Memory Models: Label: en
- Brief Announcement: Label: en
- Fast Partial Distance Estimation and Applications: Label: en
- A Local Broadcast Layer for the SINR Network Model: Label: en
- Efficient Communication in Cognitive Radio Networks: Label: en
- A (Truly) Local Broadcast Layer for Unreliable Radio Networks: Label: en
- Fast Distributed Almost Stable Matchings: Label: en
- Toward Optimal Bounds in the Congested Clique: Label: en
- Near-Optimal Distributed Maximum Flow: Label: en
- Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication: Label: en
- Distributed House-Hunting in Ant Colonies: Label: en
- Fast and Exact Majority in Population Protocols: Label: en
- Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata: Label: en
- New Routing Techniques and their Applications: Label: en
- Scheduling Loop-free Network Updates: Label: en
- Near-Optimal Scheduling of Distributed Algorithms: Label: en