Armando Castañeda | DeepAI

AI Chat

Featured Co-authors

Michel Raynal
26 publications
Hans van Ditmarsch
24 publications
Pierre Fraigniaud
21 publications
Ami Paz
21 publications
Sergio Rajsbaum
18 publications
Hagit Attiya
18 publications
Thomas Nowak
11 publications
David A. Rosenblueth
6 publications
Adam Shimi
4 publications
Aurélie Hurault
4 publications
Philippe Quéinnec
4 publications

∙ 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...

0 Armando Castañeda, et al. ∙

∙ 01/31/2023

Topological Characterization of Task Solvability in General Models of Computation

The famous asynchronous computability theorem (ACT) relates the existenc...

0 Hagit Attiya, et al. ∙

∙ 01/06/2023

Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability

This paper studies the problem of asynchronous wait-free runtime verific...

0 Armando Castañeda, et al. ∙

∙ 07/02/2022

Communication Pattern Logic: Epistemic and Topological Views

We propose communication pattern logic. A communication pattern describe...

0 Armando Castañeda, et al. ∙

∙ 05/12/2022

Modular Baskets Queue

A modular version of the baskets queue of Hoffman, Shalev and Shavit is ...

0 Armando Castañeda, et al. ∙

∙ 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...

0 Diego A. Velázquez, et al. ∙

∙ 11/20/2020

Locally Solvable Tasks and the Limitations of Valency Arguments

An elegant strategy for proving impossibility results in distributed com...

0 Hagit Attiya, et al. ∙

∙ 08/10/2020

Fully Read/Write Fence-Free Work-Stealing with Multiplicity

Work-stealing is a popular technique to implement dynamic load balancing...

0 Armando Castañeda, et al. ∙

∙ 05/11/2020

What Can Be Done with Consensus Number One: Relaxed Queues and Stacks

Sequentially specified linearizable concurrent data structures must be r...

0 Armando Castañeda, et al. ∙

∙ 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...

0 Adam Shimi, et al. ∙

∙ 09/12/2019

Tasks in Modular Proofs of Concurrent Algorithms

Proving correctness of distributed or concurrent algorithms is a mind-ch...

0 Armando Castañeda, et al. ∙

∙ 07/08/2019

A Topological Perspective on Distributed Network Algorithms

More than two decades ago, combinatorial topology was shown to be useful...

0 Armando Castañeda, et al. ∙

∙ 03/08/2018

Self-healing Routing and Other Problems in Compact Memory

This paper looks at the question of designing distributed algorithms for...

0 Armando Castañeda, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world