Armando Castañeda

95 papers A* 11A 7B 12C 4Misc 2Journal 52Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. J. ACM Armando Castañeda, Gilde Valeria Rodríguez
2026	J	`jnl`	Read-Modify-Writable Snapshots from Read/Write operations. CoRR Armando Castañeda, Braulio Ramses Hernández Martínez
2025	A*	`conf`	Asynchronous Fault-Tolerant Language Decidability for Runtime Verification of Distributed Systems. PODC Armando Castañeda, Gilde Valeria Rodríguez
2025	J	`jnl`	Asynchronous Fault-Tolerant Language Decidability for Runtime Verification of Distributed Systems. CoRR Armando Castañeda, Gilde Valeria Rodríguez
2025	J	`jnl`	Equivalence and Separation between Heard-Of and Asynchronous Message-Passing Models. CoRR Hagit Attiya, Armando Castañeda, Dhrubajyoti Ghosh, Thomas Nowak
2025	J	`jnl`	Preserving hyperproperties of programs using primitives with consensus number 2. Acta Informatica Hagit Attiya, Armando Castañeda, Constantin Enea
2025	J	`jnl`	The Power of Strong Linearizability: the Difficulty of Consistent Refereeing. CoRR Hagit Attiya, Armando Castañeda, Constantin Enea
2024	—	`ed.`	Networked Systems - 12th International Conference, NETYS 2024, Rabat, Morocco, May 29-31, 2024, Proceedings NETYS Armando Castañeda, Constantin Enea, Nirupam Gupta
2024	J	`jnl`	Pattern Models: A Dynamic Epistemic Logic For Distributed Systems. Comput. J. Armando Castañeda, Hans van Ditmarsch, David A. Rosenblueth, Diego A. Velázquez
2024	J	`jnl`	Read/write fence-free work-stealing with multiplicity. J. Parallel Distributed Comput. Armando Castañeda, Miguel Piña
2024	J	`jnl`	Recent Advances on Principles of Concurrent Data Structures. Commun. ACM Armando Castañeda, Sergio Rajsbaum
2024	A*	`conf`	Strong Linearizability using Primitives with Consensus Number 2. PODC Hagit Attiya, Armando Castañeda, Constantin Enea
2024	J	`jnl`	Strong Linearizability using Primitives with Consensus Number 2. CoRR Hagit Attiya, Armando Castañeda, Constantin Enea
2024	B	`conf`	Towards Efficient Runtime Verified Linearizable Algorithms. RV Gilde Valeria Rodríguez, Armando Castañeda
2024	A	`conf`	What Cannot Be Implemented on Weak Memory? DISC Armando Castañeda, Gregory V. Chockler, Brijesh Dongol, Ori Lahav
2024	J	`jnl`	What Cannot Be Implemented on Weak Memory? CoRR Armando Castañeda, Gregory V. Chockler, Brijesh Dongol, Ori Lahav
2023	J	`jnl`	A Linearizability-based Hierarchy for Concurrent Specifications. Commun. ACM Armando Castañeda, Sergio Rajsbaum, Michel Raynal
2023	A*	`conf`	Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. PODC Armando Castañeda, Gilde Valeria Rodríguez
2023	J	`jnl`	Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. CoRR Armando Castañeda, Gilde Valeria Rodríguez
2023	J	`jnl`	Communication Pattern Logic: Epistemic and Topological Views. J. Philos. Log. Armando Castañeda, Hans van Ditmarsch, David A. Rosenblueth, Diego A. Velázquez
2023	B	`conf`	Comparing the Update Expressivity of Communication Patterns and Action Models. TARK Armando Castañeda, Hans van Ditmarsch, David A. Rosenblueth, Diego A. Velázquez
2023	J	`jnl`	Epistemic and Topological Reasoning in Distributed Systems (Dagstuhl Seminar 23272). Dagstuhl Reports Armando Castañeda, Hans van Ditmarsch, Roman Kuznets, Yoram Moses, Ulrich Schmid
2023	J	`jnl`	Locally solvable tasks and the limitations of valency arguments. J. Parallel Distributed Comput. Hagit Attiya, Armando Castañeda, Sergio Rajsbaum
2023	J	`jnl`	Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity. Distributed Comput. Armando Castañeda, Sergio Rajsbaum, Michel Raynal
2023	J	`jnl`	Synchronous Inf. Comput. Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
2023	J	`jnl`	Tasks in modular proofs of concurrent algorithms. Inf. Comput. Armando Castañeda, Aurélie Hurault, Philippe Quéinnec, Matthieu Roy
2023	A	`conf`	Topological Characterization of Task Solvability in General Models of Computation. DISC Hagit Attiya, Armando Castañeda, Thomas Nowak
2023	J	`jnl`	Topological Characterization of Task Solvability in General Models of Computation. CoRR Hagit Attiya, Armando Castañeda, Thomas Nowak
2022	—	`conf`	A Snapshot-Based Introduction to the Linearizability Hierarchy. NETYS Armando Castañeda, Sergio Rajsbaum, Michel Raynal
2022	J	`jnl`	Communication Pattern Logic: Epistemic and Topological Views. CoRR Armando Castañeda, Hans van Ditmarsch, David A. Rosenblueth, Diego A. Velázquez
2022	B	`ed.`	LATIN 2022: Theoretical Informatics - 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022, Proceedings LATIN Armando Castañeda, Francisco Rodríguez-Henríquez
2022	J	`jnl`	Modular Baskets Queue. CoRR Armando Castañeda, Miguel Piña
2022	J	`jnl`	Separating lock-freedom from wait-freedom at every level of the consensus hierarchy. J. Parallel Distributed Comput. Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin
2022	J	`jnl`	Unbeatable consensus. Distributed Comput. Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
2021	J	`jnl`	A topological perspective on distributed network algorithms. Theor. Comput. Sci. Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
2021	B	`conf`	Communication Pattern Models: An Extension of Action Models for Dynamic-Network Distributed Systems. TARK Diego A. Velázquez, Armando Castañeda, David A. Rosenblueth
2021	A	`conf`	Fully Read/Write Fence-Free Work-Stealing with Multiplicity. DISC Armando Castañeda, Miguel Piña
2020	Misc	`conf`	Fully Compact Routing in Low Memory Self-Healing Trees. ICDCN Armando Castañeda, Jonas Lefèvre, Amitabh Trehan
2020	J	`jnl`	Fully Read/Write Fence-Free Work-Stealing with Multiplicity. CoRR Armando Castañeda, Miguel Piña
2020	J	`jnl`	K set-agreement bounds in round-based models through combinatorial topology. CoRR Adam Shimi, Armando Castañeda
2020	A*	`conf`	K-set agreement bounds in round-based models through combinatorial topology. PODC Adam Shimi, Armando Castañeda
2020	B	`conf`	Locally Solvable Tasks and the Limitations of Valency Arguments. OPODIS Hagit Attiya, Armando Castañeda, Sergio Rajsbaum
2020	J	`jnl`	Locally Solvable Tasks and the Limitations of Valency Arguments. CoRR Hagit Attiya, Armando Castañeda, Sergio Rajsbaum
2020	B	`conf`	Relaxed Queues and Stacks from Read/Write Operations. OPODIS Armando Castañeda, Sergio Rajsbaum, Michel Raynal
2020	J	`jnl`	What Can Be Done with Consensus Number One: Relaxed Queues and Stacks. CoRR Armando Castañeda, Sergio Rajsbaum, Michel Raynal
2019	B	`conf`	A Topological Perspective on Distributed Network Algorithms. SIROCCO Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
2019	J	`jnl`	A Topological Perspective on Distributed Network Algorithms. CoRR Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
2019	J	`jnl`	Bounds on the Step and Namespace Complexity of Renaming. SIAM J. Comput. Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz
2019	J	`jnl`	Making Local Algorithms Wait-Free: the Case of Ring Coloring. Theory Comput. Syst. Armando Castañeda, Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal
2019	C	`conf`	Synchronous t-Resilient Consensus in Arbitrary Graphs. SSS Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
2019	C	`conf`	Tasks in Modular Proofs of Concurrent Algorithms. SSS Armando Castañeda, Aurélie Hurault, Philippe Quéinnec, Matthieu Roy
2019	J	`jnl`	Tasks in Modular Proofs of Concurrent Algorithms. CoRR Armando Castañeda, Aurélie Hurault, Philippe Quéinnec, Matthieu Roy
2019	J	`jnl`	The topology of look-compute-move robot wait-free algorithms with hard termination. Distributed Comput. Manuel Alcantara, Armando Castañeda, David Flores-Peñaloza, Sergio Rajsbaum
2018	J	`jnl`	Compact routing messages in self-healing trees. Theor. Comput. Sci. Armando Castañeda, Danny Dolev, Amitabh Trehan
2018	J	`jnl`	Convergence and covering on graphs for wait-free robots. J. Braz. Comput. Soc. Armando Castañeda, Sergio Rajsbaum, Matthieu Roy
2018	J	`jnl`	Nontrivial and universal helping for wait-free queues and stacks. J. Parallel Distributed Comput. Hagit Attiya, Armando Castañeda, Danny Hendler
2018	J	`jnl`	Self-healing Routing and Other Problems in Compact Memory. CoRR Armando Castañeda, Jonas Lefèvre, Amitabh Trehan
2018	A*	`conf`	Separating Lock-Freedom from Wait-Freedom. PODC Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin
2018	J	`jnl`	Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability. J. ACM Armando Castañeda, Sergio Rajsbaum, Michel Raynal
2017	—	`conf`	Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour. NETYS Armando Castañeda, Yoram Moses, Michel Raynal, Matthieu Roy
2017	A	`conf`	Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times. IPDPS Sergio Rajsbaum, Armando Castañeda, David Flores-Peñaloza, Manuel Alcantara
2017	—	`conf`	Long-Lived Tasks. NETYS Armando Castañeda, Sergio Rajsbaum, Michel Raynal
2016	B	`conf`	Asynchronous Coordination Under Preferences and Constraints. SIROCCO Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy
2016	A*	`conf`	Brief Announcement: Asynchronous Coordination with Constraints and Preferences. PODC Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy
2016	Misc	`conf`	Compact routing messages in self-healing trees. ICDCN Armando Castañeda, Danny Dolev, Amitabh Trehan
2016	J	`jnl`	Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects. SIAM J. Comput. Armando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal
2016	C	`conf`	Making Local Algorithms Wait-Free: The Case of Ring Coloring. SSS Armando Castañeda, Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal
2016	—	`conf`	Two Convergence Problems for Robots on Graphs. LADC Armando Castañeda, Sergio Rajsbaum, Matthieu Roy
2016	A*	`conf`	Unbeatable Set Consensus via Topological and Combinatorial Reasoning. PODC Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
2016	J	`jnl`	Unbeatable Set Consensus via Topological and Combinatorial Reasoning. CoRR Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
2015	J	`jnl`	Compact Routing Messages in Self-Healing Trees. CoRR Armando Castañeda, Danny Dolev, Amitabh Trehan
2015	B	`conf`	Nontrivial and Universal Helping for Wait-Free Queues and Stacks. OPODIS Hagit Attiya, Armando Castañeda, Danny Hendler
2015	A	`conf`	Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract). DISC Armando Castañeda, Sergio Rajsbaum, Michel Raynal
2015	J	`jnl`	Specifying Concurrent Problems: Beyond Linearizability. CoRR Armando Castañeda, Michel Raynal, Sergio Rajsbaum
2014	J	`jnl`	An Equivariance Theorem with Applications to Renaming. Algorithmica Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum
2014	A	`conf`	Unbeatable Consensus. DISC Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
2014	J	`jnl`	Unbeatable Consensus. CoRR Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
2013	J	`jnl`	A non-topological proof for the impossibility of k-set agreement. Theor. Comput. Sci. Hagit Attiya, Armando Castañeda
2013	A	`conf`	Agreement via Symmetry Breaking: On the Structure of Weak Subconsensus Tasks. IPDPS Armando Castañeda, Sergio Rajsbaum, Michel Raynal
2013	A*	`conf`	Brief announcement: pareto optimal solutions to consensus and set consensus. PODC Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
2013	J	`jnl`	Good, Better, Best! - Unbeatable Protocols for Consensus and Set Consensus. CoRR Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
2013	—	`conf`	On the Consensus Number of Non-adaptive Perfect Renaming. NETYS Armando Castañeda, Michel Raynal
2013	A*	`conf`	Upper bound on the complexity of solving hard renaming. PODC Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz
2012	B	`conf`	An Equivariance Theorem with Applications to Renaming. LATIN Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum
2012	A*	`conf`	Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement. PODC Armando Castañeda, Sergio Rajsbaum, Michel Raynal
2012	J	`jnl`	New combinatorial topology bounds for renaming: The upper bound. J. ACM Armando Castañeda, Sergio Rajsbaum
2012	B	`conf`	Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks. LATIN Armando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal
2012	B	`conf`	When and How Process Groups Can Be Used to Reduce the Renaming Space. OPODIS Armando Castañeda, Michel Raynal, Julien Stainer
2011	C	`conf`	A Non-topological Proof for the Impossibility of k-Set Agreement. SSS Hagit Attiya, Armando Castañeda
2011	J	`jnl`	An Equivariance Theorem with Applications to Renaming (Preliminary Version) CoRR Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum
2011	J	`jnl`	The renaming problem in shared memory systems: An introduction. Comput. Sci. Rev. Armando Castañeda, Sergio Rajsbaum, Michel Raynal
2010	—	`conf`	An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing. GETCO Armando Castañeda, Sergio Rajsbaum
2010	J	`jnl`	New combinatorial topology bounds for renaming: the lower bound. Distributed Comput. Armando Castañeda, Sergio Rajsbaum
2008	J	`jnl`	A review of PODC 2008. SIGACT News Armando Castañeda
2008	A*	`conf`	New combinatorial topology upper and lower bounds for renaming. PODC Armando Castañeda, Sergio Rajsbaum