default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArmando Castañeda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[i21]Armando Castañeda, Gilde Valeria Rodríguez:
Asynchronous Fault-Tolerant Language Decidability for Runtime Verification of Distributed Systems. CoRR abs/2502.00191 (2025)- 2024
- [j26]Armando Castañeda
, Sergio Rajsbaum:
Recent Advances on Principles of Concurrent Data Structures. Commun. ACM 67(8): 45-46 (2024) - [j25]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): 2421-2440 (2024) - [j24]Armando Castañeda, Miguel Piña:
Read/write fence-free work-stealing with multiplicity. J. Parallel Distributed Comput. 186: 104816 (2024) - [c40]Hagit Attiya, Armando Castañeda, Constantin Enea:
Strong Linearizability using Primitives with Consensus Number 2. PODC 2024: 432-442 - [c39]Gilde Valeria Rodríguez, Armando Castañeda:
Towards Efficient Runtime Verified Linearizable Algorithms. RV 2024: 262-281 - [c38]Armando Castañeda, Gregory V. Chockler, Brijesh Dongol, Ori Lahav:
What Cannot Be Implemented on Weak Memory? DISC 2024: 11:1-11:22 - [e2]Armando Castañeda, Constantin Enea, Nirupam Gupta:
Networked Systems - 12th International Conference, NETYS 2024, Rabat, Morocco, May 29-31, 2024, Proceedings. Lecture Notes in Computer Science 14783, Springer 2024, ISBN 978-3-031-67320-7 [contents] - [i20]Hagit Attiya, Armando Castañeda, Constantin Enea:
Strong Linearizability using Primitives with Consensus Number 2. CoRR abs/2402.13618 (2024) - [i19]Armando Castañeda, Gregory V. Chockler, Brijesh Dongol, Ori Lahav:
What Cannot Be Implemented on Weak Memory? CoRR abs/2405.16611 (2024) - 2023
- [j23]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
A Linearizability-based Hierarchy for Concurrent Specifications. Commun. ACM 66(1): 86-97 (2023) - [j22]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): 89-106 (2023) - [j21]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
Synchronous t-resilient consensus in arbitrary graphs. Inf. Comput. 292: 105035 (2023) - [j20]Armando Castañeda, Aurélie Hurault, Philippe Quéinnec, Matthieu Roy:
Tasks in modular proofs of concurrent algorithms. Inf. Comput. 292: 105040 (2023) - [j19]Hagit Attiya, Armando Castañeda, Sergio Rajsbaum:
Locally solvable tasks and the limitations of valency arguments. J. Parallel Distributed Comput. 176: 28-40 (2023) - [j18]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): 1445-1473 (2023) - [c37]Armando Castañeda, Gilde Valeria Rodríguez:
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. PODC 2023: 90-101 - [c36]Hagit Attiya, Armando Castañeda, Thomas Nowak:
Topological Characterization of Task Solvability in General Models of Computation. DISC 2023: 5:1-5:21 - [c35]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: 157-172 - [i18]Armando Castañeda, Gilde Valeria Rodríguez:
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. CoRR abs/2301.02638 (2023) - [i17]Hagit Attiya, Armando Castañeda, Thomas Nowak:
Topological Characterization of Task Solvability in General Models of Computation. CoRR abs/2301.13837 (2023) - [i16]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): 34-65 (2023) - 2022
- [j17]Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses:
Unbeatable consensus. Distributed Comput. 35(2): 123-143 (2022) - [j16]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: 181-197 (2022) - [c34]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
A Snapshot-Based Introduction to the Linearizability Hierarchy. NETYS 2022: 3-15 - [e1]Armando Castañeda, Francisco Rodríguez-Henríquez:
LATIN 2022: Theoretical Informatics - 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022, Proceedings. Lecture Notes in Computer Science 13568, Springer 2022, ISBN 978-3-031-20623-8 [contents] - [i15]Armando Castañeda, Miguel Piña:
Modular Baskets Queue. CoRR abs/2205.06323 (2022) - [i14]Armando Castañeda, Hans van Ditmarsch, David A. Rosenblueth, Diego A. Velázquez:
Communication Pattern Logic: Epistemic and Topological Views. CoRR abs/2207.00823 (2022) - 2021
- [j15]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
A topological perspective on distributed network algorithms. Theor. Comput. Sci. 849: 121-137 (2021) - [c33]Armando Castañeda, Miguel Piña:
Fully Read/Write Fence-Free Work-Stealing with Multiplicity. DISC 2021: 16:1-16:20 - [c32]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: 307-321 - 2020
- [c31]Armando Castañeda, Jonas Lefèvre, Amitabh Trehan:
Fully Compact Routing in Low Memory Self-Healing Trees. ICDCN 2020: 21:1-21:10 - [c30]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
Relaxed Queues and Stacks from Read/Write Operations. OPODIS 2020: 13:1-13:19 - [c29]Hagit Attiya, Armando Castañeda, Sergio Rajsbaum:
Locally Solvable Tasks and the Limitations of Valency Arguments. OPODIS 2020: 18:1-18:16 - [c28]Adam Shimi, Armando Castañeda:
K-set agreement bounds in round-based models through combinatorial topology. PODC 2020: 395-404 - [i13]Adam Shimi, Armando Castañeda:
K set-agreement bounds in round-based models through combinatorial topology. CoRR abs/2003.02869 (2020) - [i12]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
What Can Be Done with Consensus Number One: Relaxed Queues and Stacks. CoRR abs/2005.05427 (2020) - [i11]Armando Castañeda, Miguel Piña:
Fully Read/Write Fence-Free Work-Stealing with Multiplicity. CoRR abs/2008.04424 (2020) - [i10]Hagit Attiya, Armando Castañeda, Sergio Rajsbaum:
Locally Solvable Tasks and the Limitations of Valency Arguments. CoRR abs/2011.10436 (2020)
2010 – 2019
- 2019
- [j14]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): 235-255 (2019) - [j13]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): 344-365 (2019) - [j12]Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz:
Bounds on the Step and Namespace Complexity of Renaming. SIAM J. Comput. 48(1): 1-32 (2019) - [c27]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
A Topological Perspective on Distributed Network Algorithms. SIROCCO 2019: 3-18 - [c26]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
Synchronous t-Resilient Consensus in Arbitrary Graphs. SSS 2019: 53-68 - [c25]Armando Castañeda, Aurélie Hurault, Philippe Quéinnec, Matthieu Roy:
Tasks in Modular Proofs of Concurrent Algorithms. SSS 2019: 69-83 - [i9]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
A Topological Perspective on Distributed Network Algorithms. CoRR abs/1907.03565 (2019) - [i8]Armando Castañeda, Aurélie Hurault, Philippe Quéinnec, Matthieu Roy:
Tasks in Modular Proofs of Concurrent Algorithms. CoRR abs/1909.05537 (2019) - 2018
- [j11]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability. J. ACM 65(6): 45:1-45:42 (2018) - [j10]Armando Castañeda, Sergio Rajsbaum, Matthieu Roy:
Convergence and covering on graphs for wait-free robots. J. Braz. Comput. Soc. 24(1): 1:1-1:15 (2018) - [j9]Hagit Attiya, Armando Castañeda, Danny Hendler:
Nontrivial and universal helping for wait-free queues and stacks. J. Parallel Distributed Comput. 121: 1-14 (2018) - [j8]Armando Castañeda, Danny Dolev, Amitabh Trehan:
Compact routing messages in self-healing trees. Theor. Comput. Sci. 709: 2-19 (2018) - [c24]Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin:
Separating Lock-Freedom from Wait-Freedom. PODC 2018: 41-50 - [i7]Armando Castañeda, Jonas Lefèvre, Amitabh Trehan:
Self-healing Routing and Other Problems in Compact Memory. CoRR abs/1803.03042 (2018) - 2017
- [c23]Sergio Rajsbaum, Armando Castañeda, David Flores-Peñaloza, Manuel Alcantara:
Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times. IPDPS 2017: 493-502 - [c22]Armando Castañeda, Yoram Moses, Michel Raynal, Matthieu Roy:
Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour. NETYS 2017: 206-221 - [c21]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
Long-Lived Tasks. NETYS 2017: 439-454 - 2016
- [j7]Armando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal:
Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects. SIAM J. Comput. 45(2): 379-414 (2016) - [c20]Armando Castañeda, Danny Dolev, Amitabh Trehan:
Compact routing messages in self-healing trees. ICDCN 2016: 23:1-23:10 - [c19]Armando Castañeda, Sergio Rajsbaum, Matthieu Roy:
Two Convergence Problems for Robots on Graphs. LADC 2016: 81-90 - [c18]Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses:
Unbeatable Set Consensus via Topological and Combinatorial Reasoning. PODC 2016: 107-116 - [c17]Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy:
Brief Announcement: Asynchronous Coordination with Constraints and Preferences. PODC 2016: 299-301 - [c16]Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy:
Asynchronous Coordination Under Preferences and Constraints. SIROCCO 2016: 111-126 - [c15]Armando Castañeda, Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal:
Making Local Algorithms Wait-Free: The Case of Ring Coloring. SSS 2016: 109-125 - [i6]Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses:
Unbeatable Set Consensus via Topological and Combinatorial Reasoning. CoRR abs/1605.07354 (2016) - 2015
- [c14]Hagit Attiya, Armando Castañeda, Danny Hendler:
Nontrivial and Universal Helping for Wait-Free Queues and Stacks. OPODIS 2015: 31:1-31:16 - [c13]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract). DISC 2015: 420-435 - [i5]Armando Castañeda, Michel Raynal, Sergio Rajsbaum:
Specifying Concurrent Problems: Beyond Linearizability. CoRR abs/1507.00073 (2015) - [i4]Armando Castañeda, Danny Dolev, Amitabh Trehan:
Compact Routing Messages in Self-Healing Trees. CoRR abs/1508.04234 (2015) - 2014
- [j6]Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum:
An Equivariance Theorem with Applications to Renaming. Algorithmica 70(2): 171-194 (2014) - [c12]Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses:
Unbeatable Consensus. DISC 2014: 91-106 - [i3]Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses:
Unbeatable Consensus. CoRR abs/1410.2501 (2014) - 2013
- [j5]Hagit Attiya, Armando Castañeda:
A non-topological proof for the impossibility of k-set agreement. Theor. Comput. Sci. 512: 41-48 (2013) - [c11]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
Agreement via Symmetry Breaking: On the Structure of Weak Subconsensus Tasks. IPDPS 2013: 1147-1158 - [c10]Armando Castañeda, Michel Raynal:
On the Consensus Number of Non-adaptive Perfect Renaming. NETYS 2013: 1-12 - [c9]Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses:
Brief announcement: pareto optimal solutions to consensus and set consensus. PODC 2013: 113-115 - [c8]Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz:
Upper bound on the complexity of solving hard renaming. PODC 2013: 190-199 - [i2]Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses:
Good, Better, Best! - Unbeatable Protocols for Consensus and Set Consensus. CoRR abs/1311.6902 (2013) - 2012
- [j4]Armando Castañeda, Sergio Rajsbaum:
New combinatorial topology bounds for renaming: The upper bound. J. ACM 59(1): 3:1-3:49 (2012) - [c7]Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum:
An Equivariance Theorem with Applications to Renaming. LATIN 2012: 133-144 - [c6]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: 145-156 - [c5]Armando Castañeda, Michel Raynal, Julien Stainer:
When and How Process Groups Can Be Used to Reduce the Renaming Space. OPODIS 2012: 91-105 - [c4]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: 97-98 - 2011
- [j3]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
The renaming problem in shared memory systems: An introduction. Comput. Sci. Rev. 5(3): 229-251 (2011) - [c3]Hagit Attiya, Armando Castañeda:
A Non-topological Proof for the Impossibility of k-Set Agreement. SSS 2011: 108-119 - [i1]Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum:
An Equivariance Theorem with Applications to Renaming (Preliminary Version). CoRR abs/1102.4946 (2011) - 2010
- [j2]Armando Castañeda, Sergio Rajsbaum:
New combinatorial topology bounds for renaming: the lower bound. Distributed Comput. 22(5-6): 287-301 (2010) - [c2]Armando Castañeda, Sergio Rajsbaum:
An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing. GETCO 2010: 13-27
2000 – 2009
- 2008
- [j1]Armando Castañeda:
A review of PODC 2008. SIGACT News 39(4): 55-59 (2008) - [c1]Armando Castañeda, Sergio Rajsbaum:
New combinatorial topology upper and lower bounds for renaming. PODC 2008: 295-304
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-10 21:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
