yusuke1997/dblp-id-title huggingface dataset:
Brief Announcement: Foraging in Particle Systems via Self-Induced Phase Changes
Communication Requirements for Linearizable Registers
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm
Brief Announcement: Shape Formation by Programmable Particles
Resilient Consensus for Infinitely Many Processes
The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement
Objects Shared by Byzantine Processes
The Quickest Path Problem in Distributed Computing Systems
What Can Be Implemented Anonymously?
Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract)
On the Complexity of Distributed Greedy Coloring
Top-Down Considerations on Distributed Computing
Consensus and Mutual Exclusion in a Multiple Access Channel
Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks
Strong Linearizability Without Compare&Swap: The Case of Bags
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
Models of Smoothing in Dynamic Networks
Brief Announcement: Communication Patterns for Optimal Resilience
Observing Locally Self-stabilization in a Probabilistic Way
Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility Results
Wait-Free Synchronization in Quantum-Based Multiprogrammed Systems
A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics
Realization of PRAMs: Processor Design
Wake up and Join Me! an Energy-Efficient Algorithm for Maximal Matching in Radio Networks
Fast Agreement in Networks with Byzantine Nodes
Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks
Faster Distributed Shortest Path Approximations via Shortcuts
Byzantine Resilient Distributed Computing on External Data
Local-Spin Group Mutual Exclusion Algorithms
Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders
Good-Case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case
Leakage-Resilient Coin Tossing
Brief Announcement Zab: A Practical Totally Ordered Broadcast Protocol
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS
Multi-writer Consistency Conditions for Shared Memory Objects
The Synchronization Power (Consensus Number) of Access-Control Objects: the Case of AllowList and DenyList
Cost of Concurrency in Hybrid Transactional Memory
Oblivious Collaboration
Efficient Byzantine Agreement Secure Against General Adversaries
Implementing Fault-Tolerant Services Using State Machines: Beyond Replication
Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures
Space-Optimal Naming in Population Protocols
Time and Space Lower Bounds for Implementations Using k -CAS
Locally Restricted Proof Labeling Schemes
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model
Efficient CONGEST Algorithms for the Lovász Local Lemma
Overcoming the Majority Barrier in Large-Scale Systems
Stepwise Development of a Distributed Load Balancing Algorithms
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and Its Applications
Broadcast CONGEST Algorithms Against Eavesdroppers
Breaching the Wall of Impossibility Results on Disjoint-Access Parallel TM
Distributed Data Summarization in Well-Connected Networks
Improved Compact Routing Scheme for Chordal Graphs
Brief Announcement: Fast Travellers: Infrastructure-Independent Deadlock Resolution in Resource-restricted Distributed Systems
On Composition and Implementation of Sequential Consistency
Online Balanced Repartitioning
An Efficient Reliable Ring Protocol
How Much Memory Is Needed for Leader Election
Revising the Weakest Failure Detector for Uniform Reliable Broadcast
In Memory of Anna Pogosyants
Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams
Brief Announcement: Quasi-Linearizability: Relaxed Consistency for Improved Concurrency
On Conspiracies and Hyperfairness in Distributed Computing
Contention Resolution Without Collision Detection: Constant Throughput And Logarithmic Energy
Brief Announcement: Ordered Reliable Broadcast and Fast Ordered Byzantine Consensus for Cryptocurrency
CBTree: A Practical Concurrent Self-Adjusting Search Tree
Space and Time Bounded Multiversion Garbage Collection
Autonomous Vehicles: From Individual Navigation to Challenges of Distributed Swarms (Invited Talk)
Fast Asynchronous Consensus with Optimal Resilience
Message Reduction in the LOCAL Model Is a Free Lunch
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
Local Computation of Nearly Additive Spanners
Brief Announcement: Leaderless Byzantine Paxos
On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract)
Brief Announcement: Concurrent Aggregate Queries
A Simple DFS-Based Algorithm for Linear Interval Routing
Byzantine Clients Rendered Harmless
The Strong At-Most-Once Problem
Energy and Time Efficient Broadcasting in Known Topology Radio Networks
Brief Announcement: Eventual Leader Election in the Infinite Arrival Message-Passing System Model
Fast and Scalable Rendezvousing
Distributed 3/2-Approximation of the Diameter
Self-Stabilizing Clock Synchronization in Probabilistic Networks
How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks
On Randomized Broadcasting in Power Law Networks
Output Stability Versus Time Till Output
Obstruction-Free Step Complexity: Lock-Free DCAS as an Example
Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures
An Algorithm with Optimal Failure Locality for the Dining Philosophers Problem
On the Round Complexity of Randomized Byzantine Agreement
Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP
What Agreement Problems Owe Michel
Convex Consensus with Asynchronous Fallback
Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks
An Efficient Communication Abstraction for Dense Wireless Networks
A Practical Multi-word Compare-and-Swap Operation
Software Fault Tolerance of Concurrent Programs Using Controlled Re-execution
Efficient k-Shot Broadcasting in Radio Networks
Detecting Cliques in CONGEST Networks
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks
Locally Checkable Labelings with Small Messages
Prudent Opportunistic Cognitive Radio Access Protocols
Parallel Finger Search Structures
Brief Announcement: Weaker Assumptions for Asymmetric Trust
Weak Consistency and Pessimistic Replica Control
CAFÉ: Scalable Task Pools with Adjustable Fairness and Contention
Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
Brief Announcement: A Contention-Friendly, Non-blocking Skip List
The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures
Revisiting the Paxos Algorithm
Failure Detection Lower Bounds on Registers and Consensus
Exploring Gafni's Reduction Land: From Omega k to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement
Near-Optimal Distributed Computation of Small Vertex Cuts
Local Labeling and Resource Allocation Using Preprocessing
The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
Brief Announcement: On Simple Back-Off in Unreliable Radio Networks
Pseudo Read-Modify-Write Operations: Bounded Wait-Free Implementations (Extended Abstract)
On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model
Deploying Wireless Networks with Beeps
From Partial to Global Asynchronous Reliable Broadcast
A Distributed Spanning Tree Algorithm
Byzantine and Multi-writer K-Quorums
Brief Announcement: Synchronization in Anonymous Networks Under Arbitrary Dynamics
Brief Announcement: On Connectivity in the Broadcast Congested Clique
The Space Complexity of Unbounded Timestamps
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication
Restricted Stack Implementations
Asynchronous Computability Theorems for t-Resilient Systems
Constructing Disjoint Paths for Secure Communication
Optimal Computation of Global Sensitive Functions in Fast Networks
Lattice Agreement in Message Passing Systems
Some Lower Bounds in Dynamic Networks with Oblivious Adversaries
Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle
Incremental, Distributed Orphan Detection and Actor Garbage Collection Using Graph Partitioning and Euler Cycles
Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS
Dynamic Memory ABP Work-Stealing
Brief Announcement: Integrating Temporal Information to Spatial Information in a Neural Circuit
An Improved Multiple Identification Algorithm for Synchronous Broadcasting Networks
The Impact of Topology on Byzantine Containment in Stabilization
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets
"Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract)
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols
Brief Announcement: The Expressive Power of Uniform Population Protocols with Logarithmic Space
Distributed Algorithms, 8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29 - October 1, 1994, Proceedings
Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks
Tight Bounds for k -Set Agreement with Limited-Scope Failure Detectors
Distributed Weighted Matching
Elastic Configuration Maintenance via a Parsimonious Speculating Snapshot Solution
Brief Announcement: Distributed Maximum Flow in Planar Graphs
DISC at Its 20th Anniversary (Stockholm, 2006)
Single Bridge Formation in Self-Organizing Particle Systems
Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots
Making Sense of Relativistic Distributed Systems
From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
A Distributed Deadlock Avoidance Technique
Brief Announcement: Accountability and Reconfiguration - Self-Healing Lattice Agreement
Update Consistency in Partitionable Systems
Sub-logarithmic Test-and-Set against a Weak Adversary
On Streaming and Communication Complexity of the Set Cover Problem
Secure Distributed Computing: Theory and Practice
On the Existence of Weakest Failure Detectors for Mutual Exclusion and k -Exclusion
Misleading Stars: What Cannot Be Measured in the Internet?
Almost-Tight Distributed Minimum Cut Algorithms
On the Number of Authenticated Rounds in Byzantine Agreement
The Adaptive Priority Queue with Elimination and Combining
Secure Anonymous Broadcast
Distributed Admission Control Algorithms for Real-Time Communication
An Efficient Communication Strategy for Ad-hoc Mobile Networks
Brief Announcement: Decentralized Network Bandwidth Prediction
Distributed Computing - 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013. Proceedings
Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency
Sing a Song of Simplex
Early-Stopping Distributed Bidding and Applications (Preliminary Version)
Brief Announcement: Rapid Mixing of Local Dynamics on Graphs
Distributed Algorithms, 3rd International Workshop, Nice, France, September 26-28, 1989, Proceedings
Local Queuing Under Contention
Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited
Reliable Broadcast in Synchronous and Asynchronous Environments (Preliminary Version)
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Tolerating Transient and Permanent Failures (Extended Abstract)
Game Theoretical Framework for Analyzing Blockchains Robustness
Asynchronous Verifiable Information Dispersal
Byzantine Consensus with Local Multicast Channels
Optimal Communication Complexity of Authenticated Byzantine Agreement
Replicated File Management in Large-Scale Distributed Systems
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem
Evacuating Robots via Unknown Exit in a Disk
A Subjective Visit to Selected Topics in Distributed Computing
Brief Announcement: Agent-Based Leader Election, MST, and Beyond
Common Knowledge and Consistent Simultaneous Coordination
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
The Dynamics of Probabilistic Population Protocols
Brief Announcement: Towards a Complexity Theory for the Congested Clique
Brief Announcement: Sharing Memory in a Self-stabilizing Manner
Frequency Hopping against a Powerful Adversary
Approximate Agreement with Mixed Mode Faults: Algorithm and Lower Bound
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programsthat Use Concurrent Objects
"Gamma-Accurate" Failure Detectors
A New Algorithm to Implement Causal Ordering
Brief Announcement: Asymmetric Mutual Exclusion for RDMA
On the Uncontended Complexity of Consensus
A Stabilizing Repair Timer
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
Scalable Replication in Database Clusters
Computing with Reads and Writes in the Absence of Step Contention
Improved Extension Protocols for Byzantine Broadcast and Agreement
The Compactness of Interval Routing for Almost All Graphs
Transactional Interference-Less Balanced Tree
The Complexity Landscape of Distributed Locally Checkable Problems on Trees
The 2009 Edsger W. Dijkstra Prize in Distributed Computing
Applying a Path-Compression technique to Obtain an Efficient Distributed Mutual Exclusion Algorithm
Sense of Direction in Distributed Computing
Fast Reconfiguration for Programmable Matter
Brief Announcement: Efficient Model Checking of Fault-Tolerant Distributed Protocols Using Symmetry Reduction
Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions
Space-optimum Conflict-free Construction of 1-Writer 1-Reader Multivalued Atomic Variable
On the Locality of Consistency Conditions
Randomized Rumor Spreading in Poorly Connected Small-World Networks
Virtual Precedence in Asynchronous Systems: Cencept and Applications
Distributed Large Independent Sets in One Round on Bounded-Independence Graphs
The Power of Scheduling-Aware Synchronization
Fast Multidimensional Asymptotic and Approximate Consensus
Traffic-Light Scheduling on the Grid (Extended Abstract)
Brief Announcement: Congested Clique Counting for Local Gibbs Distributions
Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract)
Weight Reduction in Distributed Protocols: New Algorithms and Analysis
Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes
Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space
A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem
Brief Announcement: Game Theoretical Framework for Analyzing Blockchains Robustness
Brief Announcement: Recoverable and Detectable Self-Implementations of Swap
Brief Announcement: Reaching Approximate Consensus When Everyone May Crash
Bounded-Contention Coding for Wireless Networks in the High SNR Regime
Near-Constant-Time Distributed Algorithms on a Congested Clique
A Pragmatic Implementation of Non-blocking Linked-Lists
Fault-Tolerant ANTS
Bosco: One-Step Byzantine Asynchronous Consensus
Designing Distributed Algorithms by Means of Formal Sequentially Phased Reasoning (Extended Abstract)
The 2010 Edsger W. Dijkstra Prize in Distributed Computing
Content-Oblivious Leader Election on Rings
Brief Announcement: Decentralized, Connectivity-Preserving, and Cost-Effective Structured Overlay Maintenance
39th International Symposium on Distributed Computing, DISC 2025, Berlin, Germany, October 27-31, 2025
Brief Announcement: Optimal Uniform Circle Formation by Asynchronous Luminous Robots
Improved Deterministic Connectivity in Massively Parallel Computation
A Limit to the Power of Multiple Nucleation in Self-assembly
Brief Announcement: Reconfigurable Heterogeneous Quorum Systems
Brief Announcement: Let It TEE: Asynchronous Byzantine Atomic Broadcast with n ≥ 2f+1
Null Messages, Information and Coordination
Improved Hardness of Approximation of Diameter in the CONGEST Model
Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Task Allocation in Ant Colonies
Distributed Delta-Coloring Under Bandwidth Limitations
Distributed Computing, 16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings
Brief Announcement: Distinct Gathering Under Round Robin
Byzantine Fireflies
Brief Announcement: A Randomized Algorithm for Label Assignment in Dynamic Networks
How to Gather Asynchronous Oblivious Robots on Anonymous Rings
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers
Optimal Broadcast with Partial Knowledge (Extended Abstract)
Towards Automatic Lock Removal for Scalable Synchronization
Possibility and Impossibility Results in a Shared Memory Environment
Certification of Compact Low-Stretch Routing Schemes
Coordination Through Stochastic Channels
Distributed Algorithms, 10th International Workshop, WDAG '96, Bologna, Italy, October 9-11, 1996, Proceedings
Spread of Information and Diseases via Random Walks in Sparse Graphs
Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being Talkative
Brief Announcement: Implementing Byzantine Tolerant Distributed Ledger Objects
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond
Scalable Quantum Consensus for Crash Failures
Quick Atomic Broadcast (Extended Abstract)
On Implementing SWMR Registers from SWSR Registers in Systems with Byzantine Failures
Certified Universal Gathering in \mathbb R ^2 for Oblivious Mobile Robots
Stable Leader Election
Data Transmission in Processor Networks
Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions
A Constructive Approach for Proving Data Structures' Linearizability
Lower Bounds for k-Set Agreement in Fault-Prone Networks
Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations
A Time Complexity Bound for Adaptive Mutual Exclusion
An Almost Tight RMR Lower Bound for Abortable Test-And-Set
Reliable Broadcast with Respect to Topology Knowledge
Reliably Executing Tasks in the Presence of Malicious Processors
Java: Memory Consistency and Process Coordination
Efficient Classification of Locally Checkable Problems in Regular Trees
Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies
37th International Symposium on Distributed Computing, DISC 2023, L'Aquila, Italy, October 10-12, 2023
Stateless Termination Detection
Brief Announcement: Acceleration by Contention for Shared Memory Mutual Exclusion Algorithms
Long Live Continuous Consensus
Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion
Upper Bounds for Boundless Tagging with Bounded Objects
Wait-free Test-and-Set (Extended Abstract)
Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks
Every Bit Counts in Consensus
Frugal Byzantine Computing
Distributed Algorithms for Tree Pattern Matching
Constructing Efficient Election Algorithms from Efficient Traversal Algorithms
Brief Announcement: Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks
Self-Testing/Correcting Protocols (Extended Abstract)
A Denial-of-Service Resistant DHT
Lower Bounds for Oblivious Single-Packet End-to-End Communication
Managing the Cyber Risk in a Decoupled World: Does This Bring Potential Opportunities in Computer Science? (Invited Talk)
Position Discovery for a System of Bouncing Robots
Boolean Routing
Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability
Recommenders: from the Lab to the Wild (Keynote Talk)
Functional Dependencies of Variables in Wait-Free Programs (Extended Abstract)
Routing with Improved Communication-Space Trade-Off
Distributed Set Cover Approximation: Primal-Dual with Optimal Locality
Brief Announcement: Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings
Uniform Deterministic Self-Stabilizing Ring-Orientation on Odd-Length Rings
A Time-Randomness Tradeoff for Communication Complexity
Crash Resilient Communication in Dynamic Networks (Preliminary Version)
Gossiping in a Multi-channel Radio Network
The Disagreement Power of an Adversary
Reachability and Shortest Paths in the Broadcast CONGEST Model
Efficient Counting with Optimal Resilience
Local Fail-safe Network Reset Procedure
On Correctness of Data Structures under Reads-Write Concurrency
Abuse-Free Multi-party Contract Signing
A Dynamic Primary Configuration Group Communication Service
Deriving a Scalable Algorithm for Mutual Exclusion
A New Rewrite Method for Convergence of Self-Stabilizing Systems
Broadcast in the Ad Hoc SINR Model
Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers
Space-Stretch Tradeoff in Routing Revisited
Physical Expander in Virtual Tree Overlay
ATM Layouts with Bounded Hop Count and Congestion
Coping with Contention (Extended Abstract)
Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions
One-Step Consensus Solvability
Brief Announcement: Simple Majority Consensus in Networks with Unreliable Communication
Efficient Wait-Free Implementation of a Concurrent Priority Queue
Computing Lightweight Spanners Locally
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
Agreement in Partitioned Dynamic Networks
Ruling Sets in Random Order and Adversarial Streams
Extending Hardware Transactional Memory Capacity via Rollback-Only Transactions and Suspend/Resume
Fast, Long-Lived Renaming (Extended Abstract)
Compact Routing for Flat Networks
Fault-Tolerant Distributed Algorithms for Election in Complete Networks
Distributed Computing, 14th International Conference, DISC 2000, Toledo, Spain, October 4-6, 2000, Proceedings
Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories
A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory
Efficient Multi-Word Compare and Swap
Plausible Clocks: Constant Size Logical Clocks for Distributed Systems
The Weakest Failure Detectors to Boost Obstruction-Freedom
Logical Analysis of Distributed Systems: The Importance of Being Constructive (Invited Talk)
Efficient Signature-Free Validated Agreement
Time-Efficient Broadcasting in Radio Networks
Proving Non-opacity
Scheduling in Synchronous Networks and the Greedy Algorithm (Extended Abstract)
Distributed Algorithms, 7th International Workshop, WDAG '93, Lausanne, Switzerland, September 27-29, 1993, Proceedings
Scalable Byzantine Reliable Broadcast
Distributed Computing, 13th International Symposium, Bratislava, Slovak Republic, September 27-29, 1999, Proceedings
Constant-Space Localized Byzantine Consensus
Brief Announcement: Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks
Locally Optimal Load Balancing
Distributed Construction of Lightweight Spanners for Unit Ball Graphs
Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems
Randomized Consensus in Expected O(n²log n) Operations
Fast Deterministic Rendezvous in Labeled Lines
Distributed Approximations for Packing in Unit-Disk Graphs
Communication Heuristics in Distributed Combinatorial Search Algorithms
Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary
Allocate-On-Use Space Complexity of Shared-Memory Algorithms
Message Terminate Algorithms for Anonymous Rings of Unknown Size
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks
Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models
Fully Local Succinct Distributed Arguments
Perpetual Exploration in Anonymous Synchronous Networks with a Byzantine Black Hole