Armando Castañeda

Orcid: 0000-0002-8017-8639

According to our database1, Armando Castañeda authored at least 64 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Recent Advances on Principles of Concurrent Data Structures.
Commun. ACM, August, 2024

Read/write fence-free work-stealing with multiplicity.
J. Parallel Distributed Comput., April, 2024

Pattern Models: A Dynamic Epistemic Logic For Distributed Systems.
Comput. J., 2024

What Cannot Be Implemented on Weak Memory?
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Towards Efficient Runtime Verified Linearizable Algorithms.
Proceedings of the Runtime Verification - 24th International Conference, 2024

Strong Linearizability using Primitives with Consensus Number 2.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023
Communication Pattern Logic: Epistemic and Topological Views.
J. Philos. Log., October, 2023

Locally solvable tasks and the limitations of valency arguments.
J. Parallel Distributed Comput., June, 2023

Tasks in modular proofs of concurrent algorithms.
Inf. Comput., June, 2023

Synchronous <i>t</i>-resilient consensus in arbitrary graphs.
Inf. Comput., June, 2023

Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity.
Distributed Comput., June, 2023

Epistemic and Topological Reasoning in Distributed Systems (Dagstuhl Seminar 23272).
Dagstuhl Reports, 2023

Comparing the Update Expressivity of Communication Patterns and Action Models.
Proceedings of the Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, 2023

A Linearizability-based Hierarchy for Concurrent Specifications.
Commun. ACM, 2023

Topological Characterization of Task Solvability in General Models of Computation.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022
Separating lock-freedom from wait-freedom at every level of the consensus hierarchy.
J. Parallel Distributed Comput., 2022

Unbeatable consensus.
Distributed Comput., 2022

Modular Baskets Queue.
CoRR, 2022

A Snapshot-Based Introduction to the Linearizability Hierarchy.
Proceedings of the Networked Systems - 10th International Conference, 2022

2021
A topological perspective on distributed network algorithms.
Theor. Comput. Sci., 2021

Communication Pattern Models: An Extension of Action Models for Dynamic-Network Distributed Systems.
Proceedings of the Proceedings Eighteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2021

Fully Read/Write Fence-Free Work-Stealing with Multiplicity.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

2020
What Can Be Done with Consensus Number One: Relaxed Queues and Stacks.
CoRR, 2020

K-set agreement bounds in round-based models through combinatorial topology.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Relaxed Queues and Stacks from Read/Write Operations.
Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

Fully Compact Routing in Low Memory Self-Healing Trees.
Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

2019
Bounds on the Step and Namespace Complexity of Renaming.
SIAM J. Comput., 2019

Making Local Algorithms Wait-Free: the Case of Ring Coloring.
Theory Comput. Syst., 2019

The topology of look-compute-move robot wait-free algorithms with hard termination.
Distributed Comput., 2019

Synchronous t-Resilient Consensus in Arbitrary Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

2018
Compact routing messages in self-healing trees.
Theor. Comput. Sci., 2018

Nontrivial and universal helping for wait-free queues and stacks.
J. Parallel Distributed Comput., 2018

Convergence and covering on graphs for wait-free robots.
J. Braz. Comput. Soc., 2018

Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability.
J. ACM, 2018

Self-healing Routing and Other Problems in Compact Memory.
CoRR, 2018

Separating Lock-Freedom from Wait-Freedom.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
Long-Lived Tasks.
Proceedings of the Networked Systems - 5th International Conference, 2017

Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour.
Proceedings of the Networked Systems - 5th International Conference, 2017

Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016
Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects.
SIAM J. Comput., 2016

Asynchronous Coordination Under Preferences and Constraints.
Proceedings of the Structural Information and Communication Complexity, 2016

Unbeatable Set Consensus via Topological and Combinatorial Reasoning.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Brief Announcement: Asynchronous Coordination with Constraints and Preferences.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Two Convergence Problems for Robots on Graphs.
Proceedings of the 2016 Seventh Latin-American Symposium on Dependable Computing, 2016

2015
Specifying Concurrent Problems: Beyond Linearizability.
CoRR, 2015

Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract).
Proceedings of the Distributed Computing - 29th International Symposium, 2015

2014
An Equivariance Theorem with Applications to Renaming.
Algorithmica, 2014

2013
A non-topological proof for the impossibility of k-set agreement.
Theor. Comput. Sci., 2013

Good, Better, Best! - Unbeatable Protocols for Consensus and Set Consensus.
CoRR, 2013

Brief announcement: pareto optimal solutions to consensus and set consensus.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Upper bound on the complexity of solving hard renaming.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

On the Consensus Number of Non-adaptive Perfect Renaming.
Proceedings of the Networked Systems - First International Conference, 2013

Agreement via Symmetry Breaking: On the Structure of Weak Subconsensus Tasks.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

2012
New combinatorial topology bounds for renaming: The upper bound.
J. ACM, 2012

Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

When and How Process Groups Can Be Used to Reduce the Renaming Space.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
The renaming problem in shared memory systems: An introduction.
Comput. Sci. Rev., 2011

An Equivariance Theorem with Applications to Renaming (Preliminary Version)
CoRR, 2011

2010
An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing.
Proceedings of the workshop on Geometric and Topological Methods in Computer Science, 2010

New combinatorial topology bounds for renaming: the lower bound.
Distributed Comput., 2010

2008
A review of PODC 2008.
SIGACT News, 2008

New combinatorial topology upper and lower bounds for renaming.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008


  Loading...