New combinatorial topology upper and lower bounds for renaming. - Armando Castañeda; Sergio Rajsbaum (PODC, 2008)

A review of PODC 2008. - Armando Castañeda (SIGACT News, 2008)

New combinatorial topology bounds for renaming: the lower bound. - Armando Castañeda; Sergio Rajsbaum (Distributed Comput., 2010)

An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing. - Armando Castañeda; Sergio Rajsbaum (GETCO, 2010)

An Equivariance Theorem with Applications to Renaming (Preliminary Version) - Armando Castañeda; Maurice Herlihy; Sergio Rajsbaum (CoRR, 2011)

The renaming problem in shared memory systems: An introduction. - Armando Castañeda; Sergio Rajsbaum; Michel Raynal (Comput. Sci. Rev., 2011)

Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks. - Armando Castañeda; Damien Imbs; Sergio Rajsbaum; Michel Raynal (LATIN, 2012)

When and How Process Groups Can Be Used to Reduce the Renaming Space. - Armando Castañeda; Michel Raynal; Julien Stainer (OPODIS, 2012)

Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement. - Armando Castañeda; Sergio Rajsbaum; Michel Raynal (PODC, 2012)

New combinatorial topology bounds for renaming: The upper bound. - Armando Castañeda; Sergio Rajsbaum (J. ACM, 2012)

Agreement via Symmetry Breaking: On the Structure of Weak Subconsensus Tasks. - Armando Castañeda; Sergio Rajsbaum; Michel Raynal (IPDPS, 2013)

On the Consensus Number of Non-adaptive Perfect Renaming. - Armando Castañeda; Michel Raynal (NETYS, 2013)

Upper bound on the complexity of solving hard renaming. - Hagit Attiya; Armando Castañeda; Maurice Herlihy; Ami Paz (PODC, 2013)

Brief announcement: pareto optimal solutions to consensus and set consensus. - Armando Castañeda; Yannai A. Gonczarowski; Yoram Moses (PODC, 2013)

Good, Better, Best! - Unbeatable Protocols for Consensus and Set Consensus. - Armando Castañeda; Yannai A. Gonczarowski; Yoram Moses (CoRR, 2013)

A non-topological proof for the impossibility of k-set agreement. - Hagit Attiya; Armando Castañeda (Theor. Comput. Sci., 2013)

An Equivariance Theorem with Applications to Renaming. - Armando Castañeda; Maurice Herlihy; Sergio Rajsbaum (Algorithmica, 2014)

Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract). - Armando Castañeda; Sergio Rajsbaum; Michel Raynal (DISC, 2015)

Specifying Concurrent Problems: Beyond Linearizability. - Armando Castañeda; Michel Raynal; Sergio Rajsbaum (CoRR, 2015)

Two Convergence Problems for Robots on Graphs. - Armando Castañeda; Sergio Rajsbaum; Matthieu Roy (LADC, 2016)

Brief Announcement: Asynchronous Coordination with Constraints and Preferences. - Armando Castañeda; Pierre Fraigniaud; Eli Gafni; Sergio Rajsbaum; Matthieu Roy (PODC, 2016)

Unbeatable Set Consensus via Topological and Combinatorial Reasoning. - Armando Castañeda; Yannai A. Gonczarowski; Yoram Moses (PODC, 2016)

Asynchronous Coordination Under Preferences and Constraints. - Armando Castañeda; Pierre Fraigniaud; Eli Gafni; Sergio Rajsbaum; Matthieu Roy (SIROCCO, 2016)

Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects. - Armando Castañeda; Damien Imbs; Sergio Rajsbaum; Michel Raynal (SIAM J. Comput., 2016)

Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times. - Sergio Rajsbaum; Armando Castañeda; David Flores-Peñaloza; Manuel Alcantara (IPDPS, 2017)

Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour. - Armando Castañeda; Yoram Moses; Michel Raynal; Matthieu Roy (NETYS, 2017)

Long-Lived Tasks. - Armando Castañeda; Sergio Rajsbaum; Michel Raynal (NETYS, 2017)

Separating Lock-Freedom from Wait-Freedom. - Hagit Attiya; Armando Castañeda; Danny Hendler; Matthieu Perrin (PODC, 2018)

Self-healing Routing and Other Problems in Compact Memory. - Armando Castañeda; Jonas Lefèvre; Amitabh Trehan (CoRR, 2018)

Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability. - Armando Castañeda; Sergio Rajsbaum; Michel Raynal (J. ACM, 2018)

Convergence and covering on graphs for wait-free robots. - Armando Castañeda; Sergio Rajsbaum; Matthieu Roy (J. Braz. Comput. Soc., 2018)

Nontrivial and universal helping for wait-free queues and stacks. - Hagit Attiya; Armando Castañeda; Danny Hendler (J. Parallel Distributed Comput., 2018)

Compact routing messages in self-healing trees. - Armando Castañeda; Danny Dolev; Amitabh Trehan (Theor. Comput. Sci., 2018)

Synchronous t-Resilient Consensus in Arbitrary Graphs. - Armando Castañeda; Pierre Fraigniaud; Ami Paz; Sergio Rajsbaum; Matthieu Roy; Corentin Travers (SSS, 2019)

The topology of look-compute-move robot wait-free algorithms with hard termination. - Manuel Alcantara; Armando Castañeda; David Flores-Peñaloza; Sergio Rajsbaum (Distributed Comput., 2019)

Making Local Algorithms Wait-Free: the Case of Ring Coloring. - Armando Castañeda; Carole Delporte-Gallet; Hugues Fauconnier; Sergio Rajsbaum; Michel Raynal (Theory Comput. Syst., 2019)

Bounds on the Step and Namespace Complexity of Renaming. - Hagit Attiya; Armando Castañeda; Maurice Herlihy; Ami Paz (SIAM J. Comput., 2019)

Fully Compact Routing in Low Memory Self-Healing Trees. - Armando Castañeda; Jonas Lefèvre; Amitabh Trehan (ICDCN, 2020)

Relaxed Queues and Stacks from Read/Write Operations. - Armando Castañeda; Sergio Rajsbaum; Michel Raynal (OPODIS, 2020)

K-set agreement bounds in round-based models through combinatorial topology. - Adam Shimi; Armando Castañeda (PODC, 2020)

What Can Be Done with Consensus Number One: Relaxed Queues and Stacks. - Armando Castañeda; Sergio Rajsbaum; Michel Raynal (CoRR, 2020)

Fully Read/Write Fence-Free Work-Stealing with Multiplicity. - Armando Castañeda; Miguel Piña (DISC, 2021)

Communication Pattern Models: An Extension of Action Models for Dynamic-Network Distributed Systems. - Diego A. Velázquez; Armando Castañeda; David A. Rosenblueth (TARK, 2021)

A topological perspective on distributed network algorithms. - Armando Castañeda; Pierre Fraigniaud; Ami Paz; Sergio Rajsbaum; Matthieu Roy; Corentin Travers (Theor. Comput. Sci., 2021)

A Snapshot-Based Introduction to the Linearizability Hierarchy. - Armando Castañeda; Sergio Rajsbaum; Michel Raynal (NETYS, 2022)

Modular Baskets Queue. - Armando Castañeda; Miguel Piña (CoRR, 2022)

Unbeatable consensus. - Armando Castañeda; Yannai A. Gonczarowski; Yoram Moses (Distributed Comput., 2022)

Separating lock-freedom from wait-freedom at every level of the consensus hierarchy. - Hagit Attiya; Armando Castañeda; Danny Hendler; Matthieu Perrin (J. Parallel Distributed Comput., 2022)

Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. - Armando Castañeda; Gilde Valeria Rodríguez (PODC, 2023)

Topological Characterization of Task Solvability in General Models of Computation. - Hagit Attiya; Armando Castañeda; Thomas Nowak (DISC, 2023)

A Linearizability-based Hierarchy for Concurrent Specifications. - Armando Castañeda; Sergio Rajsbaum; Michel Raynal (Commun. ACM, 2023)

Comparing the Update Expressivity of Communication Patterns and Action Models. - Armando Castañeda; Hans van Ditmarsch; David A. Rosenblueth; Diego A. Velázquez (TARK, 2023)

Epistemic and Topological Reasoning in Distributed Systems (Dagstuhl Seminar 23272). - Armando Castañeda; Hans van Ditmarsch; Roman Kuznets; Yoram Moses; Ulrich Schmid 001 (Dagstuhl Reports, 2023)

Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity. - Armando Castañeda; Sergio Rajsbaum; Michel Raynal (Distributed Comput., 2023)

Synchronous t-resilient consensus in arbitrary graphs. - Armando Castañeda; Pierre Fraigniaud; Ami Paz; Sergio Rajsbaum; Matthieu Roy; Corentin Travers (Inf. Comput., 2023)

Tasks in modular proofs of concurrent algorithms. - Armando Castañeda; Aurélie Hurault; Philippe Quéinnec; Matthieu Roy (Inf. Comput., 2023)

Locally solvable tasks and the limitations of valency arguments. - Hagit Attiya; Armando Castañeda; Sergio Rajsbaum (J. Parallel Distributed Comput., 2023)

Communication Pattern Logic: Epistemic and Topological Views. - Armando Castañeda; Hans van Ditmarsch; David A. Rosenblueth; Diego A. Velázquez (J. Philos. Log., 2023)

Strong Linearizability using Primitives with Consensus Number 2. - Hagit Attiya; Armando Castañeda; Constantin Enea (PODC, 2024)

Towards Efficient Runtime Verified Linearizable Algorithms. - Gilde Valeria Rodríguez; Armando Castañeda (RV, 2024)

What Cannot Be Implemented on Weak Memory? - Armando Castañeda; Gregory V. Chockler; Brijesh Dongol; Ori Lahav 001 (DISC, 2024)

Pattern Models: A Dynamic Epistemic Logic For Distributed Systems. - Armando Castañeda; Hans van Ditmarsch; David A. Rosenblueth; Diego A. Velázquez (Comput. J., 2024)

Read/write fence-free work-stealing with multiplicity. - Armando Castañeda; Miguel Piña (J. Parallel Distributed Comput., 2024)

Recent Advances on Principles of Concurrent Data Structures. - Armando Castañeda; Sergio Rajsbaum (Commun. ACM, 2024)

Asynchronous Fault-Tolerant Language Decidability for Runtime Verification of Distributed Systems. - Armando Castañeda; Gilde Valeria Rodríguez (PODC, 2025)

The Power of Strong Linearizability: the Difficulty of Consistent Refereeing. - Hagit Attiya; Armando Castañeda; Constantin Enea (CoRR, 2025)

Preserving hyperproperties of programs using primitives with consensus number 2. - Hagit Attiya; Armando Castañeda; Constantin Enea (Acta Informatica, 2025)