| 2026 | PODC | Impossibility Results for Strong Linearizability: The Difficulty of Consistent Refereeing. | Hagit Attiya, Armando Castaeda, Constantin Enea |
| 2026 | SIROCCO | Equivalence and Separation Between Heard-Of and Asynchronous Message-Passing Models. | Hagit Attiya, Armando Castaeda, Dhrubajyoti Ghosh, Thomas Nowak |
| 2025 | PODC | Asynchronous Fault-Tolerant Language Decidability for Runtime Verification of Distributed Systems. | Armando Castaeda, Gilde Valeria Rodrguez |
| 2024 | PODC | Strong Linearizability using Primitives with Consensus Number 2. | Hagit Attiya, Armando Castaeda, Constantin Enea |
| 2024 | RV | Towards Efficient Runtime Verified Linearizable Algorithms. | Gilde Valeria Rodrguez, Armando Castaeda |
| 2023 | PODC | Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. | Armando Castaeda, Gilde Valeria Rodrguez |
| 2020 | ICDCN | Fully Compact Routing in Low Memory Self-Healing Trees. | Armando Castaeda, Jonas Lefvre, Amitabh Trehan |
| 2020 | OPODIS | Locally Solvable Tasks and the Limitations of Valency Arguments. | Hagit Attiya, Armando Castaeda, Sergio Rajsbaum |
| 2020 | OPODIS | Relaxed Queues and Stacks from Read/Write Operations. | Armando Castaeda, Sergio Rajsbaum, Michel Raynal |
| 2020 | PODC | K-set agreement bounds in round-based models through combinatorial topology. | Adam Shimi, Armando Castaeda |
| 2019 | SIROCCO | A Topological Perspective on Distributed Network Algorithms. | Armando Castaeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers |
| 2019 | SSS | Synchronous t-Resilient Consensus in Arbitrary Graphs. | Armando Castaeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers |
| 2019 | SSS | Tasks in Modular Proofs of Concurrent Algorithms. | Armando Castaeda, Aurlie Hurault, Philippe Quinnec, Matthieu Roy |
| 2018 | PODC | Separating Lock-Freedom from Wait-Freedom. | Hagit Attiya, Armando Castaeda, Danny Hendler, Matthieu Perrin |
| 2016 | ICDCN | Compact routing messages in self-healing trees. | Armando Castaeda, Danny Dolev, Amitabh Trehan |
| 2016 | PODC | Brief Announcement: Asynchronous Coordination with Constraints and Preferences. | Armando Castaeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy |
| 2016 | PODC | Unbeatable Set Consensus via Topological and Combinatorial Reasoning. | Armando Castaeda, Yannai A. Gonczarowski, Yoram Moses |
| 2016 | SIROCCO | Asynchronous Coordination Under Preferences and Constraints. | Armando Castaeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy |
| 2016 | SSS | Making Local Algorithms Wait-Free: The Case of Ring Coloring. | Armando Castaeda, Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal |
| 2015 | OPODIS | Nontrivial and Universal Helping for Wait-Free Queues and Stacks. | Hagit Attiya, Armando Castaeda, Danny Hendler |
| 2013 | PODC | Upper bound on the complexity of solving hard renaming. | Hagit Attiya, Armando Castaeda, Maurice Herlihy, Ami Paz |
| 2013 | PODC | Brief announcement: pareto optimal solutions to consensus and set consensus. | Armando Castaeda, Yannai A. Gonczarowski, Yoram Moses |
| 2012 | LATIN | An Equivariance Theorem with Applications to Renaming. | Armando Castaeda, Maurice Herlihy, Sergio Rajsbaum |
| 2012 | LATIN | Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks. | Armando Castaeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal |
| 2012 | OPODIS | When and How Process Groups Can Be Used to Reduce the Renaming Space. | Armando Castaeda, Michel Raynal, Julien Stainer |
| 2012 | PODC | Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement. | Armando Castaeda, Sergio Rajsbaum, Michel Raynal |
| 2011 | SSS | A Non-topological Proof for the Impossibility of k-Set Agreement. | Hagit Attiya, Armando Castaeda |
| 2008 | PODC | New combinatorial topology upper and lower bounds for renaming. | Armando Castaeda, Sergio Rajsbaum |