The renaming problem in shared memory systems: An introduction A Castañeda, S Rajsbaum, M Raynal Computer Science Review 5 (3), 229-251, 2011 | 76 | 2011 |

New combinatorial topology bounds for renaming: the lower bound A Castaneda, S Rajsbaum Distributed Computing 22 (5-6), 287-301, 2010 | 62 | 2010 |

New combinatorial topology bounds for renaming: The upper bound A Castaneda, S Rajsbaum Journal of the ACM (JACM) 59 (1), 1-49, 2012 | 52 | 2012 |

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 | 50 | 2008 |

Specifying concurrent problems: beyond linearizability and up to tasks A Castañeda, S Rajsbaum, M Raynal International Symposium on Distributed Computing, 420-435, 2015 | 33 | 2015 |

Unbeatable consensus A Castañeda, YA Gonczarowski, Y Moses International Symposium on Distributed Computing, 91-106, 2014 | 28 | 2014 |

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 | 19 | 2018 |

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 | 19 | 2012 |

An equivariance theorem with applications to renaming A Castaneda, M Herlihy, S Rajsbaum Algorithmica 70 (2), 171-194, 2014 | 16 | 2014 |

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 | 15 | 2013 |

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 | 14 | 2016 |

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 | 13 | 2021 |

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 | 12 | 2018 |

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 (3), 235-255, 2019 | 11 | 2019 |

Long-lived tasks A Castañeda, S Rajsbaum, M Raynal International Conference on Networked Systems, 439-454, 2017 | 11 | 2017 |

A Non-topological Proof for the Impossibility of *k*-Set AgreementH Attiya, A Castaneda Symposium on Self-Stabilizing Systems, 108-119, 2011 | 10 | 2011 |

A Non-topological Proof for the Impossibility of *k*-Set AgreementH Attiya, A Castaneda Symposium on Self-Stabilizing Systems, 108-119, 2011 | 10 | 2011 |

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 | 8 | 2016 |

A non-topological proof for the impossibility of k-set agreement H Attiya, A Castañeda Theoretical Computer Science 512, 41-48, 2013 | 8 | 2013 |

Compact routing messages in self-healing trees A Castañeda, D Dolev, A Trehan Theoretical Computer Science 709, 2-19, 2018 | 7 | 2018 |