research
∙
07/11/2023
Comparing the Update Expressivity of Communication Patterns and Action Models
Any kind of dynamics in dynamic epistemic logic can be represented as an...
share
research
∙
01/31/2023
Topological Characterization of Task Solvability in General Models of Computation
The famous asynchronous computability theorem (ACT) relates the existenc...
research
∙
01/06/2023
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability
This paper studies the problem of asynchronous wait-free runtime verific...
research
∙
07/02/2022
Communication Pattern Logic: Epistemic and Topological Views
We propose communication pattern logic. A communication pattern describe...
research
∙
05/12/2022
Modular Baskets Queue
A modular version of the baskets queue of Hoffman, Shalev and Shavit is ...
research
∙
06/22/2021
Communication Pattern Models: An Extension of Action Models for Dynamic-Network Distributed Systems
Halpern and Moses were the first to recognize, in 1984, the importance o...
research
∙
11/20/2020
Locally Solvable Tasks and the Limitations of Valency Arguments
An elegant strategy for proving impossibility results in distributed com...
research
∙
08/10/2020
Fully Read/Write Fence-Free Work-Stealing with Multiplicity
Work-stealing is a popular technique to implement dynamic load balancing...
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
∙
03/05/2020
K set-agreement bounds in round-based models through combinatorial topology
Round-based models are the main message-passing models; combinatorial to...
research
∙
09/12/2019
Tasks in Modular Proofs of Concurrent Algorithms
Proving correctness of distributed or concurrent algorithms is a mind-ch...
research
∙
07/08/2019
A Topological Perspective on Distributed Network Algorithms
More than two decades ago, combinatorial topology was shown to be useful...
research
∙
03/08/2018