Armando Castañeda

Available identifiers

zbMath Open castaneda.armandoMaRDI QIDQ391996

List of research outcomes

Publication	Date of Publication	Type
Communication pattern models: an extension of action models for dynamic-network distributed systems	2024-11-24	Paper
Synchronous \(t\)-resilient consensus in arbitrary graphs	2024-04-19	Paper
Tasks in modular proofs of concurrent algorithms	2024-04-19	Paper
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability	2024-03-26	Paper
Comparing the Update Expressivity of Communication Patterns and Action Models	2024-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q6083378	2023-12-08	Paper
Communication pattern logic: epistemic and topological views	2023-10-24	Paper
Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity	2023-06-19	Paper
Tasks in modular proofs of concurrent algorithms	2023-05-19	Paper
Synchronous \(t\)-resilient consensus in arbitrary graphs	2023-05-19	Paper
Unbeatable consensus	2022-04-01	Paper
K-set agreement bounds in round-based models through combinatorial topology	2021-03-15	Paper
A topological perspective on distributed network algorithms	2020-12-15	Paper
A topological perspective on distributed network algorithms	2020-03-03	Paper
Making local algorithms wait-free: the case of ring coloring	2019-11-22	Paper
Separating Lock-Freedom from Wait-Freedom	2019-09-19	Paper
The topology of look-compute-move robot wait-free algorithms with hard termination	2019-07-11	Paper
Making local algorithms wait-free: the case of ring coloring	2019-06-21	Paper
Unifying Concurrent Objects and Distributed Tasks	2019-02-25	Paper
Bounds on the Step and Namespace Complexity of Renaming	2019-01-14	Paper
Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)	2018-08-24	Paper
Compact routing messages in self-healing trees	2017-12-20	Paper
Unbeatable Set Consensus via Topological and Combinatorial Reasoning	2017-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q5363822	2017-09-29	Paper
Brief Announcement	2017-09-29	Paper
Asynchronous Coordination Under Preferences and Constraints	2016-12-01	Paper
Generalized symmetry breaking tasks and nondeterminism in concurrent objects	2016-04-25	Paper
An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing	2015-03-18	Paper
Upper bound on the complexity of solving hard renaming	2015-03-02	Paper
An equivariance theorem with applications to renaming	2015-01-19	Paper
New combinatorial topology upper and lower bounds for renaming	2014-12-12	Paper
Brief announcement	2014-12-05	Paper
The renaming problem in shared memory systems: an introduction	2014-10-24	Paper
New combinatorial topology bounds for renaming	2014-02-17	Paper
A non-topological proof for the impossibility of \(k\)-set agreement	2014-01-13	Paper
An Equivariance Theorem with Applications to Renaming	2012-06-29	Paper
Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks	2012-06-29	Paper
New combinatorial topology bounds for renaming: the lower bound	2010-09-09	Paper

Research outcomes over time

This page was built for person: Armando Castañeda