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
702011
New combinatorial topology bounds for renaming: the lower bound
A Castaneda, S Rajsbaum
Distributed Computing 22 (5-6), 287-301, 2010
562010
New combinatorial topology bounds for renaming: The upper bound
A Castaneda, S Rajsbaum
Journal of the ACM (JACM) 59 (1), 1-49, 2012
502012
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
492008
Specifying concurrent problems: beyond linearizability and up to tasks
A Castañeda, S Rajsbaum, M Raynal
International Symposium on Distributed Computing, 420-435, 2015
332015
Unbeatable consensus
A Castañeda, YA Gonczarowski, Y Moses
International Symposium on Distributed Computing, 91-106, 2014
242014
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 American Symposium on Theoretical Informatics, 145-156, 2012
182012
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
172018
An equivariance theorem with applications to renaming
A Castañeda, M Herlihy, S Rajsbaum
Algorithmica 70 (2), 171-194, 2014
152014
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
142016
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
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
112018
Long-lived tasks
A Castañeda, S Rajsbaum, M Raynal
International Conference on Networked Systems, 439-454, 2017
112017
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
102021
A Non-topological Proof for the Impossibility of k-Set Agreement
H Attiya, A Castaneda
Symposium on Self-Stabilizing Systems, 108-119, 2011
92011
A Non-topological Proof for the Impossibility of k-Set Agreement
H Attiya, A Castaneda
Symposium on Self-Stabilizing Systems, 108-119, 2011
92011
Compact routing messages in self-healing trees
A Castañeda, D Dolev, A Trehan
Theoretical Computer Science 709, 2-19, 2018
82018
A non-topological proof for the impossibility of k-set agreement
H Attiya, A Castañeda
Theoretical Computer Science 512, 41-48, 2013
82013
Fault-tolerant robot gathering problems on graphs with arbitrary appearing times
S Rajsbaum, A Castañeda, DF Peñaloza, M Alcantara
2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2017
62017
Unbeatable set consensus via topological and combinatorial reasoning
A Castañeda, YA Gonczarowski, Y Moses
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
62016
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20