yusuke1997/dblp-id-title huggingface dataset:
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
Condition-Based Protocols for Set Agreement Problems
Using Conditions to Expedite Consensus in Synchronous Distributed Systems
Implementing FIFO Queus and Stacks (Extended Abstract)
A Simple Population Protocol for Fast Robust Approximate Majority
Notes on Sorting and Counting Networks (Extended Abstract)
Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology
The Mailbox Problem
Are Byzantine Failures Really Different from Crash Failures?
Brief Announcement: Consensus and Efficient Passive Replication
Optimal Primary-Backup Protocols
Transactional Locking II
Euler Tour Lock-In Problem in the Rotor-Router Model
Optimal Amortized Distributed Consensus (Extended Abstract)
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing ( k -)Set Agreement
Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact)
Causal Memory
Local Terminations and Distributed Computability in Anonymous Networks
Brief Announcement: Bridging the Theory-Practice Gap in Multi-commodity Flow Routing
Graph Coloring, Palette Sparsification, and Beyond (Invited Talk)
Fault Tolerant Coloring of the Asynchronous Cycle
Brief Announcement: Decoupled and Consensus-Free Reconfiguration for Fault-Tolerant Storage
Brief Announcement: A Note on Hardness of Diameter Approximation
The Synchronous Condition-Based Consensus Hierarchy
Distributed Computing, 12th International Symposium, DISC '98, Andros, Greece, September 24-26, 1998, Proceedings
Contention-Sensitive Data Structures and Algorithms
Adaptive Software Transactional Memory
Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time
Communication Efficient Self-Stabilizing Leader Election
An Efficient Universal Construction for Message-Passing Systems
Nonuniform SINR+Voroni Diagrams Are Effectively Uniform
Efficient Distribution of Quantum Circuits
Modular Recoverable Mutual Exclusion Under System-Wide Failures
DISC 2011 Invited Lecture by Dahlia Malkhi: Going beyond Paxos
Brief Announcement: Revisiting Consensus Protocols through Wait-Free Parallelization
Computing in Totally Anonymous Asynchronous Shared Memory Systems
Brief Announcement: Concurrent Wait-Free Red-Black Trees
Stabilizing Replicated Search Trees
Distributed Protocols Against Mobile Eavesdroppers
Brief Announcement: Best-Possible Unpredictable Proof-Of-Stake
Brief Announcement: On the Correctness of Transaction Processing with External Dependency
A Uniform Self-Stabilizing Minimum Diameter Tree Algorithm (Extended Abstract)
Brief Announcement: Proximal Byzantine Agreement: Improved Accuracy for Fault-Tolerant Replicated Datastreams
Improved Weighted Additive Spanners
Levels of Authentication in Distributed Agreement
A Framework for the Analysis of Non-Deterministic Clock Synchronisation Algorithms
pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer
Dynamic Reconfiguration: Abstraction and Optimal Asynchronous Solution
Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles
It's on Me! The Benefit of Altruism in BAR Environments
How to Meet at a Node of Any Connected Graph
The Splay-List: A Distribution-Adaptive Concurrent Skip-List
Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks
Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks
Dense Subgraphs on Dynamic Networks
Scalable Flat-Combining Based Synchronous Queues
Brief Announcement: The Fault-Tolerant Cluster-Sending Problem
Directed Virtual Path Layouts in ATM Networks
The Complexity of Data Aggregation in Directed Networks
Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent
Low-latency Atomic Broadcast in the presence of contention
Agreement Among Unacquainted Byzantine Generals
Classification of Distributed Binary Labeling Problems
Ruminations on Domain-Based Reliable Broadcast
r3: Resilient Random Regular Graphs
A Framework for Agreement
Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors
Plausible Clocks with Bounded Inaccuracy
Colordag: An Incentive-Compatible Blockchain
Parsimonious Flooding in Geometric Random-Walks - (Extended Abstract)
Compact Routing Schemes in Undirected and Directed Graphs
Verification of the Randomized Consensus Algorithms of Aspnes and Herlihy: A Case Study
Relaxing Opacity in Pessimistic Transactional Memory
Theory and Practice in Distributed Systems (Abstract)
Data Failures
A Complete and Constant Time Wait-Free Implementation of CAS from LL/SC and Vice Versa
Analyzing the Performance of Lock-Free Data Structures: A Conflict-Based Model
Planar Quorums
Easy Consensus Algorithms for the Crash-Recovery Model
Improved Deterministic Distributed Construction of Spanners
Privatization-Safe Transactional Memories
A Distributed Ring Orientation Algorithm (Preliminary Version)
Primary Partition "Virtually-Synchronous Communication" harder than Consensus
Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection
Non-blocking Asynchronous Byzantine Quorum Systems
Interactive Compression for Multi-Party Protocol
Papillon: Greedy Routing in Rings
Brief Announcement: Byzantine Consensus Under Dynamic Participation with a Well-Behaved Majority
Compact Routing for Graphs Excluding a Fixed Minor
How to Solve Consensus in the Smallest Window of Synchrony
Deterministic and Energy-Optimal Wireless Synchronization
An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems
Meeting in a Polygon by Anonymous Oblivious Robots
Using Bounded Model Checking to Verify Consensus Algorithms
Time-Message Trade-Offs in Distributed Algorithms
Brief Announcement: Probabilistic Indistinguishability and The Quality of Validity in Byzantine Agreement
Brief Announcement: Compact Topology of Shared-Memory Adversaries
Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks
Communication Lower Bounds for Cryptographic Broadcast Protocols
Coterie Availability in Sites
Local Information in Influence Networks
Stable Memoryless Queuing under Contention
Non-Bayesian Learning in the Presence of Byzantine Agents
Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings
Brief Announcements / Back Matter
A Theoretical Foundation for Scheduling and Designing Heterogeneous Processors for Interactive Applications
Coupling and Self-stabilization.
Randomised Mutual Search for k>2 Agents
Multi-Shot Distributed Transaction Commit
On Approximate Distance Labels and Routing Schemes with Affine Stretch
No Double Discount: Condition-Based Simultaneity Yields Limited Gain
On Minimizing the Number of ADMs in a General Topology Optical Network
Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract)
Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms
On Set Consensus Numbers
Low-Congestion Shortcut and Graph Parameters
On the Use of Synchronizers for Asynchronous Communication Networks
Message Complexity of Population Protocols
Tight Space Bounds for ℓ-Exclusion
Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds
Waking Up Anonymous Ad Hoc Radio Networks
When 3 f +1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus
Transparent Support for Wait-Free Transactions
Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem
Brief Announcement: Performance Anomalies in Concurrent Data Structure Microbenchmarks
Dissecting Distributed Coordination
Brief Announcement: Auditable Register Emulations
Trustful Population Protocols
Send/Receive Patterns Versus Read/Write Patterns in Crash-Prone Asynchronous Distributed Systems
Low Complexity Network Synchronization
On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
Transformations of Self-Stabilizing Algorithms
Closed Schedulers: Constructions and Applications to Consensus Protocols
Brief Announcement: Distributed Approximations for the Semi-matching Problem
A Generalized Algorithm for Publish/Subscribe Overlay Design and Its Fast Implementation
Brief Announcement: Unifying Partial Synchrony
Inherent Limitations of Hybrid Transactional Memory
Fully Read/Write Fence-Free Work-Stealing with Multiplicity
Quantum Byzantine Agreement Against Full-Information Adversary
Three Notes on Distributed Property Testing
Space and Step Complexity Efficient Adaptive Collect
Strong Verifiable Secret Sharing (Extended Abstract)
On the Power of Graphical Reconfigurable Circuits
The Cost of Privatization
Buffer Size for Routing Limited-Rate Adversarial Traffic
Ad Hoc Membership for Scalable Applications
Dynamic Probabilistic Input Output Automata
Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence
Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs
Concise Version Vectors in WinFS
Parameterized Distributed Algorithms
A Distributed Algorithm for Computing and Updating the Process Number of a Forest
Lifetime Based Consistency Protocols for Distributed Objects
Brief Announcement: Phase Transitions of the k-Majority Dynamics in a Biased Communication Model
The Average Hop Count Measure for Virtual Path Layouts
Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping
An Optimal Implementation of Fetch-and-Increment
Fast Consensus for Voting on General Expander Graphs
Broadcast CONGEST Algorithms against Adversarial Edges
Automatic Classification of Eventual Failure Detectors
Hybrid Consensus: Efficient Consensus in the Permissionless Model
Beeping a Deterministic Time-Optimal Leader Election
Brief Announcement: Node Sampling Using Centrifugal Random Walks
Maximizing Remote Work in Flooding-Based Peer-to-Peer Systems
Two Strategies for Solving the Vertex Cover Problem on a Transputer Network
Distributed Online and Stochastic Queuing on a Multiple Access Channel
Fast Increment Registers
Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers
Maximum Metric Spanning Tree Made Byzantine Tolerant
Byzantine Approximate Agreement on Graphs
(Almost) All Objects Are Universal in Message Passing Systems
How to Detect a Failure and Regenerate the Token in the Log(N) Distributed Algorithm for Mutual Exclusion
Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings
Õptimal Dual Vertex Failure Connectivity Labels
Efficient and Robust Sharing of Memory in Message-Passing Systems (Extended Abstract)
Fast and Scalable Mutual Exclusion
Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony!
Deterministic Rendezvous in Trees with Little Memory
Extension-Based Proofs for Synchronous Message Passing
Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs
Sparser: A Paradigm for Running Distributed Algorithms
Leveraging Linial's Locality Limit
DUALITY: An Architecture Independent Design Model for Parallel Systems Based on Partial Orders Semantics
The Role of A-priori Information in Networks of Rational Agents
Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach
Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model
Locality and Checkability in Wait-Free Computing
Gorilla: Safe Permissionless Byzantine Consensus
Distributed Algorithms for Low Stretch Spanning Trees
Booting clock Synchronization in Partially Synchronous Systems
Optimal Consistent Network Updates in Polynomial Time
Stellar Consensus by Instantiation
Braess's Paradox in Wireless Networks: The Danger of Improved Technology
An Efficient Topology Update Protocol for Dynamic Networks
Failure Detection and Consensus in the Crash-Recovery Model
Byzantine Firing Squad Using a Faulty External Source
Brief Announcement: Scalable Agreement Protocols with Optimal Optimistic Efficiency
Byzantine Agreement Using Partial Authentication
An Effective Characterization of Computability in Anonymous Networks
Computing with Infinitely Many Processes
Deterministic Blind Radio Networks
Routing and Scheduling with Incomplete Information
Quorum-Based Algorithms for Group Mutual Exclusion
Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings
Distributed Protocols for Leader Election: A Game-Theoretic Perspective
Brief Announcement: Dynamic FTSS in Asynchronous Systems: The Case of Unison
Synchronous Condition-Based Consensus Adapting to Input-Vector Legality
Distributed Algorithms, 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings
On the Efficiency of Dynamic Transaction Scheduling in Blockchain Sharding
Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting
In Search for an Optimal Authenticated Byzantine Agreement
Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots
Optimistic Erasure-Coded Distributed Storage
Collective Consistency
Twenty-Two New Approximate Proof Labeling Schemes
Distributed Algorithms for Updating Shortest Paths (Extended Abstract)
Fast Two-Robot Disk Evacuation with Wireless Communication
A Modular Proof of Correctness for a Network Synchronizer (Research Summary)
Liveness and Latency of Byzantine State-Machine Replication
Brief Announcement: Optimal Dispersion Under Asynchrony
Time Optimal Asynchronous Self-stabilizing Spanning Tree
Beeping a Maximal Independent Set
Bounded Version Vectors
Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract)
Optimal Dispersal of Certificate Chains
Brief Announcement: Weighted Partial Message Matching for Implicit Multicast Systems
Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy
Near-Optimal Distributed DFS in Planar Graphs
A Simple Computability Theorem for Colorless Tasks in Submodels of the Iterated Immediate Snapshot
Local Verification of Global Proofs
Workflow Management - An Exercise in Distributed Computing
Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast
Exploiting Content Localities for Efficient Search in P2P Systems
Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and Consensus
31st International Symposium on Distributed Computing, DISC 2017, Vienna, Austria, October 16-20, 2017
Approximation Algorithms for Survivable Optical Networks
Tight Bounds on Early Local Decisions in Uniform Consensus
Brief Announcement: DAGs for the Masses
RMR-Efficient Randomized Abortable Mutual Exclusion - (Extended Abstract)
Kudzu: Fast and Simple High-Throughput BFT
Elastic Transactions
Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory
Holistic Verification of Blockchain Consensus
Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
Average and Randomized Complexity of Distributed Problems
A Distributed Maximal Scheduler for Strong Fairness
The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses
Brief Announcement: Single-Round Broadcast: Impossibility, Feasibility, and More
DISC 20th Anniversary: Invited Talk Time, Clocks, and the Ordering of My Ideas About Distributed Systems
Anomalies in the Wait-Free Hierarchy
Compact Routing in Power-Law Graphs
Load Balancing: An Exercise in Constrainted Convergence
Erasure Correction for Noisy Radio Networks
Optimal Early Stopping in Distributed Consensus (Extended Abstract)
A Wealth of Sub-Consensus Deterministic Objects
A Concurrent Time-Stamp Scheme which is Linear in Time and Space
Brief Announcement: On Reversible and Irreversible Conversions
Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs
Speed Faults in Computation by Chemical Reaction Networks
Brief Announcement: Distributed Exclusive and Perpetual Tree Searching
Optimal Wait-Free Clock Synchronisation Protocol on a Shared-Memory Multi-processor System
Approach of Agents with Restricted Fuel Tanks
Shmuel Zaks - The Mathematician, Computer Scientist and Personality
Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion
Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model
Adaptive Mutual Exclusion with Local Spinning
Breaking Through the Ω(n)-Space Barrier: Population Protocols Decide Double-Exponential Thresholds
Distributed Resource Allocation Algorithms (Extended Abstract)
The Canonical Amoebot Model: Algorithms and Concurrency Control
Asynchronous Group Membership with Oracles
Secure Distributed Storage and Retrieval
Long-Lived Counters with Polylogarithmic Amortized Step Complexity
Exclusive Perpetual Ring Exploration without Chirality
The RedBlue Adaptive Universal Constructions
Optimistic Replication for Internet Data Services
Fault-Tolerant Storage in a Dynamic Environment
Distributed Testing of Excluded Subgraphs
Efficient, Strongly Consistent Implementations of Shared Memory (Extended Abstract)
Self Stabilizing Distributed Queuing
Tight Bounds for MIS in Multichannel Radio Networks
Polynominal and Adaptive Long-Lived (2 k -1)-Renaming
Transaction Safe Nonblocking Data Structures
Low-Overhead Time-Triggered Group Membership
Hierarchical Consensus: Scalability Through Optimism and Weak Liveness
DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems
Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity
Radio Network Lower Bounds Made Easy
General Compact Labeling Schemes for Dynamic Trees
How to Construct an Atomic Variable (Extended Abstract)
New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms
Brief Announcement: Distributed SplayNets
The Role of Inhibition on Asynchronous Consistent-Cut Protocols
Brief Announcement: Design and Verification of a Logless Dynamic Reconfiguration Protocol in MongoDB Replication
Brief Announcement: Do VNet Embeddings Leak Information about ISP Topology?
Wakeup under Read/Write Atomicity
Brief Announcement: Distributed Quantum Interactive Proofs
Distributed Algorithms for Coloring Interval Graphs
Non-blocking Hashtables with Open Addressing
Self-Stabilizing MIS Computation in the Beeping Model
Brief Announcement: Efficient Utilization of Multiple Interfaces in Wireless Ad Hoc Networks
Selecting a Leader in a Network of Finite State Machines
Optimistic Atomic Broadcast
Conditionally Optimal Parallel Coloring of Forests
Team Formation and Applications
Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks
Virtual Ring Routing Trends
Fault-Tolerant Critical Section Management in Asynchronous Networks
Improved Bounds for Distributed Load Balancing
Brief Announcement: Grassroots Distributed Systems: Concept, Examples, Implementation and Applications
Leader Election Problem versus Pattern Formation Problem
Safe Permissionless Consensus
Robust Predicate and Function Computation in Continuous Chemical Reaction Networks
Consistency Models with Global Operation Sequencing and their Composition
Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory
Generic Multiversion STM
Packet Forwarding with a Locally Bursty Adversary
Bounds for Mutual Exclusion with only Processor Consistency
Maintaining a Dynamic Set of Processors in a Distributed System
Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors
List Defective Colorings: Distributed Algorithms and Applications
Probabilistic Opaque Quorum Systems
Stable Leader Election in Population Protocols Requires Linear Time
Low Communication Self-stabilization through Randomization
On the Average Performance of Synchronized Programs in Distributed Networks (Preliminary Version)
Brief Announcement: Concurrent Double-Ended Priority Queues
Asynchronous Epoch Management in Replicated Databases
Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts
On the Existence of Generic Broadcast Algorithms in Networks of Communicating Sequential Processes (Extended Abstract)
Smoothed Analysis of Information Spreading in Dynamic Networks
Brief Announcement: Polygraph: Accountable Byzantine Agreement
Adapting Local Sequential Algorithms to the Distributed Setting
Brief Announcement: On Decidability of 2-Process Affine Models
Toward a Formal Semantic Framework for Deterministic Parallel Programming
Anonymous Graph Exploration with Binoculars
Towards Fault-Tolerant and Secure Agentry
Using Message Semantics to Reduce Rollback in the Time Wrap Mechanism
Optimal Fair Computation
Optimal Resilient Ring Election Algorithms
Distributed Computing - 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings
Improved Distributed Approximations for Maximum Independent Set
Efficient Collaborative Tree Exploration with Breadth-First Depth-Next
At-Most-Once Semantics in Asynchronous Shared Memory
Deterministic Synchronous Self-Stabilizing BFS Construction with Constant Space Complexity
Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games
Blockchain Consensus Protocols in the Wild (Keynote Talk)
Group-Solvability
Distributed Model Checking on Graphs of Bounded Treedepth
Singularly Near Optimal Leader Election in Asynchronous Networks
Brief Announcement: ΔΩ: Specifying an Eventual Leader Service for Dynamic Systems
Membership Algorithms for Multicast Communication Groups
Validity in Network-Agnostic Byzantine Agreement
Quorum Subsumption for Heterogeneous Quorum Systems
Brief Announcement: Gathering Despite Defected View
Fast Plurality Consensus in Regular Expanders
Lower Bounds for Synchronous Networks and the Advantage of Local Information
Amnesiac Flooding: Easy to Break, Hard to Escape
Fragmented ARES: Dynamic Storage for Large Objects
k-Selection and Sorting in the SINR Model
Replacement - Handling Failures in a Replicated State Machine
Simple and Efficient Election Algorithms for Anonymous Networks
Vertical Atomic Broadcast and Passive Replication
Maintaining Digital Clocks In Step
Self-Stabilizing Ring Orientation
Distributed Computing, 17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003, Proceedings
Randomized Finite-State Distributed Algorithms as Markov Chains
The Level of Handshake Required for Establishing a Connection
Timing Games and Shared Memory
Precedence-Based Memory Models
Benign Failure Models for Shared Memory (Preliminary Version)
How Large Is Your Graph?
Matrix Signatures: From MACs to Digital Signatures in Distributed Systems
Improving Average Performance by Relaxing Distributed Data Structures
The Power of Abstraction - (Invited Lecture Abstract)
Distributed Resource Allocation in Stream Processing Systems
On the Limits of Information Spread by Memory-Less Agents
Optimal Computation in Leaderless and Multi-Leader Disconnected Anonymous Dynamic Networks
The Capacity of Smartphone Peer-To-Peer Networks
Transactions as the Foundation of a Memory Consistency Model
Distributed Download from an External Data Source in Byzantine Majority Settings
The Computational Structure of Progress Conditions
The Bancomat Problem: An Example of Resource Allocation in a Partitionable Asynchronous System
Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR
Spiking Neural Networks Through the Lens of Streaming Algorithms
Keeping Mobile Robot Swarms Connected
Load Balancing in a Network of Transputers
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
Brief Announcement: How to Trust Strangers - Composition of Byzantine Quorum Systems
Weakening Failure Detectors for k -Set Agreement Via the Partition Approach