Följ
Armando Castañeda
Armando Castañeda
Instituto de Matemáticas, UNAM
Verifierad e-postadress på im.unam.mx - Startsida
Titel
Citeras av
Citeras av
År
The renaming problem in shared memory systems: An introduction
A Castañeda, S Rajsbaum, M Raynal
Computer Science Review 5 (3), 229-251, 2011
872011
New combinatorial topology bounds for renaming: the lower bound
A Castañeda, S Rajsbaum
Distributed Computing 22 (5), 287-301, 2010
692010
New combinatorial topology bounds for renaming: The upper bound
A Castañeda, S Rajsbaum
Journal of the ACM (JACM) 59 (1), 1-49, 2012
622012
New combinatorial topology upper and lower bounds for renaming
A Castaneda, S Rajsbaum
Proceedings of the twenty-seventh ACM symposium on Principles of distributed …, 2008
542008
Unifying concurrent objects and distributed tasks: Interval-linearizability
A Castañeda, S Rajsbaum, M Raynal
Journal of the ACM (JACM) 65 (6), 1-42, 2018
432018
Specifying concurrent problems: beyond linearizability and up to tasks
A Castañeda, S Rajsbaum, M Raynal
Distributed Computing: 29th International Symposium, DISC 2015, Tokyo, Japan …, 2015
382015
Unbeatable consensus
A Castañeda, YA Gonczarowski, Y Moses
Distributed Computing: 28th International Symposium, DISC 2014, Austin, TX …, 2014
332014
A topological perspective on distributed network algorithms
A Castañeda, P Fraigniaud, A Paz, S Rajsbaum, M Roy, C Travers
Theoretical Computer Science 849, 121-137, 2021
312021
Nontrivial and universal helping for wait-free queues and stacks
H Attiya, A Castañeda, D Hendler
Journal of Parallel and Distributed Computing 121, 1-14, 2018
272018
Renaming is weaker than set agreement but for perfect renaming: A map of sub-consensus tasks
A Castañeda, D Imbs, S Rajsbaum, M Raynal
LATIN 2012: Theoretical Informatics: 10th Latin American Symposium, Arequipa …, 2012
202012
Generalized symmetry breaking tasks and nondeterminism in concurrent objects
A Castañeda, D Imbs, S Rajsbaum, M Raynal
SIAM Journal on Computing 45 (2), 379-414, 2016
172016
An equivariance theorem with applications to renaming
A Castañeda, M Herlihy, S Rajsbaum
Algorithmica 70, 171-194, 2014
162014
The topology of look-compute-move robot wait-free algorithms with hard termination
M Alcantara, A Castañeda, D Flores-Peñaloza, S Rajsbaum
Distributed Computing 32, 235-255, 2019
142019
Bounds on the step and namespace complexity of renaming
H Attiya, A Castañeda, M Herlihy, A Paz
SIAM Journal on Computing 48 (1), 1-32, 2019
142019
Upper bound on the complexity of solving hard renaming
H Attiya, A Castañeda, M Herlihy, A Paz
Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013
142013
Relaxed queues and stacks from read/write operations
A Castañeda, S Rajsbaum, M Raynal
arXiv preprint arXiv:2005.05427, 2020
132020
Long-lived tasks
A Castañeda, S Rajsbaum, M Raynal
Networked Systems: 5th International Conference, NETYS 2017, Marrakech …, 2017
132017
A non-topological proof for the impossibility of k-set agreement
H Attiya, A Castañeda
Theoretical Computer Science 512, 41-48, 2013
132013
A Non-topological Proof for the Impossibility of k-Set Agreement
H Attiya, A Castaneda
Stabilization, Safety, and Security of Distributed Systems: 13th …, 2011
132011
Early decision and stopping in synchronous consensus: a predicate-based guided tour
A Castañeda, Y Moses, M Raynal, M Roy
International Conference on Networked Systems, 206-221, 2017
122017
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20