Armando Castañeda

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 59

Top Topics

Distributed Systems

Dynamic Epistemic Logic

Top Venues

J. Parallel Distributed Comput.

Publications

Armando Castañeda, Gregory V. Chockler, Brijesh Dongol, Ori Lahav
What Cannot Be Implemented on Weak Memory? CoRR (2024)
Armando Castañeda, Miguel Piña
Read/write fence-free work-stealing with multiplicity. J. Parallel Distributed Comput. 186 (2024)
Hagit Attiya, Armando Castañeda, Constantin Enea
Strong Linearizability using Primitives with Consensus Number 2. PODC (2024)
Armando Castañeda, Sergio Rajsbaum
Recent Advances on Principles of Concurrent Data Structures. Commun. ACM 67 (8) (2024)
Armando Castañeda, Hans van Ditmarsch, David A. Rosenblueth, Diego A. Velázquez
Pattern Models: A Dynamic Epistemic Logic For Distributed Systems. Comput. J. 67 (7) (2024)
Hagit Attiya, Armando Castañeda, Constantin Enea
Strong Linearizability using Primitives with Consensus Number 2. CoRR (2024)
Armando Castañeda, Gilde Valeria Rodríguez
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. CoRR (2023)
Hagit Attiya, Armando Castañeda, Sergio Rajsbaum
Locally solvable tasks and the limitations of valency arguments. J. Parallel Distributed Comput. 176 (2023)
Armando Castañeda, Hans van Ditmarsch, Roman Kuznets, Yoram Moses, Ulrich Schmid
Epistemic and Topological Reasoning in Distributed Systems (Dagstuhl Seminar 23272). Dagstuhl Reports 13 (7) (2023)
Armando Castañeda, Hans van Ditmarsch, David A. Rosenblueth, Diego A. Velázquez
Communication Pattern Logic: Epistemic and Topological Views. J. Philos. Log. 52 (5) (2023)
Armando Castañeda, Gilde Valeria Rodríguez
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. PODC (2023)
Hagit Attiya, Armando Castañeda, Thomas Nowak
Topological Characterization of Task Solvability in General Models of Computation. CoRR (2023)
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity. Distributed Comput. 36 (2) (2023)
Armando Castañeda, Aurélie Hurault, Philippe Quéinnec, Matthieu Roy
Tasks in modular proofs of concurrent algorithms. Inf. Comput. 292 (2023)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
-resilient consensus in arbitrary graphs. Inf. Comput. 292 (2023)
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
A Linearizability-based Hierarchy for Concurrent Specifications. Commun. ACM 66 (1) (2023)
Armando Castañeda, Hans van Ditmarsch, David A. Rosenblueth, Diego A. Velázquez
Comparing the Update Expressivity of Communication Patterns and Action Models. TARK (2023)
Hagit Attiya, Armando Castañeda, Thomas Nowak
Topological Characterization of Task Solvability in General Models of Computation. DISC (2023)
Armando Castañeda, Miguel Piña
Modular Baskets Queue. CoRR (2022)
Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
Unbeatable consensus. Distributed Comput. 35 (2) (2022)
Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin
Separating lock-freedom from wait-freedom at every level of the consensus hierarchy. J. Parallel Distributed Comput. 163 (2022)
Armando Castañeda, Hans van Ditmarsch, David A. Rosenblueth, Diego A. Velázquez
Communication Pattern Logic: Epistemic and Topological Views. CoRR (2022)
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
A Snapshot-Based Introduction to the Linearizability Hierarchy. NETYS (2022)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
A topological perspective on distributed network algorithms. Theor. Comput. Sci. 849 (2021)
Armando Castañeda, Miguel Piña
Fully Read/Write Fence-Free Work-Stealing with Multiplicity. DISC (2021)
Diego A. Velázquez, Armando Castañeda, David A. Rosenblueth
Communication Pattern Models: An Extension of Action Models for Dynamic-Network Distributed Systems. TARK (2021)
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
Relaxed Queues and Stacks from Read/Write Operations. OPODIS (2020)
Hagit Attiya, Armando Castañeda, Sergio Rajsbaum
Locally Solvable Tasks and the Limitations of Valency Arguments. CoRR (2020)
Adam Shimi, Armando Castañeda
K set-agreement bounds in round-based models through combinatorial topology. CoRR (2020)
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
What Can Be Done with Consensus Number One: Relaxed Queues and Stacks. CoRR (2020)
Hagit Attiya, Armando Castañeda, Sergio Rajsbaum
Locally Solvable Tasks and the Limitations of Valency Arguments. OPODIS (2020)
Adam Shimi, Armando Castañeda
K-set agreement bounds in round-based models through combinatorial topology. PODC (2020)
Armando Castañeda, Jonas Lefèvre, Amitabh Trehan
Fully Compact Routing in Low Memory Self-Healing Trees. ICDCN (2020)
Armando Castañeda, Miguel Piña
Fully Read/Write Fence-Free Work-Stealing with Multiplicity. CoRR (2020)
Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz
Bounds on the Step and Namespace Complexity of Renaming. SIAM J. Comput. 48 (1) (2019)
Manuel Alcantara, Armando Castañeda, David Flores-Peñaloza, Sergio Rajsbaum
The topology of look-compute-move robot wait-free algorithms with hard termination. Distributed Comput. 32 (3) (2019)
Armando Castañeda, Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal
Making Local Algorithms Wait-Free: the Case of Ring Coloring. Theory Comput. Syst. 63 (2) (2019)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
Synchronous t-Resilient Consensus in Arbitrary Graphs. SSS (2019)
Armando Castañeda, Aurélie Hurault, Philippe Quéinnec, Matthieu Roy
Tasks in Modular Proofs of Concurrent Algorithms. SSS (2019)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
A Topological Perspective on Distributed Network Algorithms. SIROCCO (2019)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
A Topological Perspective on Distributed Network Algorithms. CoRR (2019)
Armando Castañeda, Aurélie Hurault, Philippe Quéinnec, Matthieu Roy
Tasks in Modular Proofs of Concurrent Algorithms. CoRR (2019)
Armando Castañeda, Sergio Rajsbaum, Matthieu Roy
Convergence and covering on graphs for wait-free robots. J. Braz. Comput. Soc. 24 (1) (2018)
Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin
Separating Lock-Freedom from Wait-Freedom. PODC (2018)
Hagit Attiya, Armando Castañeda, Danny Hendler
Nontrivial and universal helping for wait-free queues and stacks. J. Parallel Distributed Comput. 121 (2018)
Armando Castañeda, Danny Dolev, Amitabh Trehan
Compact routing messages in self-healing trees. Theor. Comput. Sci. 709 (2018)
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability. J. ACM 65 (6) (2018)
Armando Castañeda, Jonas Lefèvre, Amitabh Trehan
Self-healing Routing and Other Problems in Compact Memory. CoRR (2018)
Sergio Rajsbaum, Armando Castañeda, David Flores-Peñaloza, Manuel Alcantara
Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times. IPDPS (2017)
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
Long-Lived Tasks. NETYS (2017)
Armando Castañeda, Yoram Moses, Michel Raynal, Matthieu Roy
Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour. NETYS (2017)
Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy
Brief Announcement: Asynchronous Coordination with Constraints and Preferences. PODC (2016)
Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy
Asynchronous Coordination Under Preferences and Constraints. SIROCCO (2016)
Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
Unbeatable Set Consensus via Topological and Combinatorial Reasoning. CoRR (2016)
Armando Castañeda, Danny Dolev, Amitabh Trehan
Compact routing messages in self-healing trees. ICDCN (2016)
Armando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal
Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects. SIAM J. Comput. 45 (2) (2016)
Armando Castañeda, Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal
Making Local Algorithms Wait-Free: The Case of Ring Coloring. SSS (2016)
Armando Castañeda, Sergio Rajsbaum, Matthieu Roy
Two Convergence Problems for Robots on Graphs. LADC (2016)
Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
Unbeatable Set Consensus via Topological and Combinatorial Reasoning. PODC (2016)
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract). DISC (2015)
Armando Castañeda, Danny Dolev, Amitabh Trehan
Compact Routing Messages in Self-Healing Trees. CoRR (2015)
Armando Castañeda, Michel Raynal, Sergio Rajsbaum
Specifying Concurrent Problems: Beyond Linearizability. CoRR (2015)
Hagit Attiya, Armando Castañeda, Danny Hendler
Nontrivial and Universal Helping for Wait-Free Queues and Stacks. OPODIS (2015)
Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
Unbeatable Consensus. DISC (2014)
Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum
An Equivariance Theorem with Applications to Renaming. Algorithmica 70 (2) (2014)
Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
Unbeatable Consensus. CoRR (2014)
Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
Brief announcement: pareto optimal solutions to consensus and set consensus. PODC (2013)
Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
Good, Better, Best! - Unbeatable Protocols for Consensus and Set Consensus. CoRR (2013)
Armando Castañeda, Michel Raynal
On the Consensus Number of Non-adaptive Perfect Renaming. NETYS (2013)
Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz
Upper bound on the complexity of solving hard renaming. PODC (2013)
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
Agreement via Symmetry Breaking: On the Structure of Weak Subconsensus Tasks. IPDPS (2013)
Hagit Attiya, Armando Castañeda
A non-topological proof for the impossibility of k-set agreement. Theor. Comput. Sci. 512 (2013)
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement. PODC (2012)
Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum
An Equivariance Theorem with Applications to Renaming. LATIN (2012)
Armando Castañeda, Michel Raynal, Julien Stainer
When and How Process Groups Can Be Used to Reduce the Renaming Space. OPODIS (2012)
Armando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal
Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks. LATIN (2012)
Armando Castañeda, Sergio Rajsbaum
An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing. Electron. Notes Theor. Comput. Sci. 283 (2012)
Armando Castañeda, Sergio Rajsbaum
New combinatorial topology bounds for renaming: The upper bound. J. ACM 59 (1) (2012)
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
The renaming problem in shared memory systems: An introduction. Comput. Sci. Rev. 5 (3) (2011)
Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum
An Equivariance Theorem with Applications to Renaming (Preliminary Version) CoRR (2011)
Hagit Attiya, Armando Castañeda
A Non-topological Proof for the Impossibility of k-Set Agreement. SSS (2011)
Armando Castañeda, Sergio Rajsbaum
New combinatorial topology bounds for renaming: the lower bound. Distributed Comput. 22 (5-6) (2010)
Armando Castañeda
A review of PODC 2008. SIGACT News 39 (4) (2008)
Armando Castañeda, Sergio Rajsbaum
New combinatorial topology upper and lower bounds for renaming. PODC (2008)