research
∙
08/08/2023
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks
The paper compares two generic techniques for deriving lower bounds and ...
share
research
∙
03/27/2023
Semi-simplicial Set Models for Distributed Knowledge
In recent years, a new class of models for multi-agent epistemic logic h...
research
∙
06/10/2022
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement
We study two fundamental problems of distributed computing, consensus an...
research
∙
09/03/2021
Continuous Tasks and the Chromatic Simplicial Approximation Theorem
The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy ...
research
∙
08/23/2021
A Simplicial Model for KB4_n: Epistemic Logic with Agents that May Die
The standard semantics of multi-agent epistemic logic S5 is based on Kri...
research
∙
05/06/2021
Leader Election in Arbitrarily Connected Networks with Process Crashes and Weak Channel Reliability
A channel from a process p to a process q satisfies the ADD property if ...
research
∙
11/20/2020
Locally Solvable Tasks and the Limitations of Valency Arguments
An elegant strategy for proving impossibility results in distributed com...
research
∙
09/30/2020
t-Resilient k-Immediate Snapshot and its Relation with Agreement Problems
An immediate snapshot object is a high level communication object, built...
research
∙
09/28/2020
A Distributed Computing Perspective of Unconditionally Secure Information Transmission in Russian Cards Problems
The problem of A privately transmitting information to B by a public ann...
research
∙
05/11/2020
What Can Be Done with Consensus Number One: Relaxed Queues and Stacks
Sequentially specified linearizable concurrent data structures must be r...
research
∙
02/20/2020
Knowledge and simplicial complexes
Simplicial complexes are a versatile and convenient paradigm on which to...
research
∙
09/07/2019
A dynamic epistemic logic analysis of the equality negation task
In this paper we study the solvability of the equality negation task in ...
research
∙
07/08/2019
A Topological Perspective on Distributed Network Algorithms
More than two decades ago, combinatorial topology was shown to be useful...
research
∙
12/14/2018
Mastering Concurrent Computing Through Sequential Thinking: A Half-century Evolution
Concurrency, the art of doing many things at the same time is slowly bec...
research
∙
09/10/2018
A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability
The usual epistemic model S5n for a multi-agent system is based on a Kri...
research
∙
12/12/2017
A characterization of colorless anonymous t-resilient task computability
A task is a distributed problem for n processes, in which each process s...
research
∙
04/25/2017
Models of fault-tolerant distributed computation via dynamic epistemic logic
The computability power of a distributed computing model is determined b...
research
∙
03/31/2017