Armando Castañeda

894 total citations
41 papers, 391 citations indexed

About

Armando Castañeda is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Armando Castañeda has authored 41 papers receiving a total of 391 indexed citations (citations by other indexed papers that have themselves been cited), including 35 papers in Computer Networks and Communications, 12 papers in Computational Theory and Mathematics and 11 papers in Artificial Intelligence. Recurrent topics in Armando Castañeda's work include Distributed systems and fault tolerance (35 papers), Optimization and Search Problems (23 papers) and Petri Nets in System Modeling (8 papers). Armando Castañeda is often cited by papers focused on Distributed systems and fault tolerance (35 papers), Optimization and Search Problems (23 papers) and Petri Nets in System Modeling (8 papers). Armando Castañeda collaborates with scholars based in Mexico, France and Israel. Armando Castañeda's co-authors include Sergio Rajsbaum, Larry E. Overman, Todd A. Blumenkopf, Andrew S. Thompson, Michel Raynal, David J. Kucera, Gary C. Look, Matthias Bratz, Hagit Attiya and Yannai A. Gonczarowski and has published in prestigious journals such as Journal of the American Chemical Society, Communications of the ACM and The Journal of Organic Chemistry.

In The Last Decade

Armando Castañeda

30 papers receiving 352 citations

Peers

Armando Castañeda

CNC

CTM

BIOTE

Csaba Nemes Hungary

Yongjian Li China

Hui Ding United States

David J. Hamilton Netherlands

Andreas Greb Germany

Wenxiang Hu China

Paul Petersen United States

Wenxuan Wang China

George Theodoridis Greece

Michael P. Kirkup United States

Csaba Nemes Hungary

Armando Castañeda

228 ×1.1

98 ×0.7

CNC

18 ×0.2

CTM

13 ×0.3

12 ×0.3

BIOTE

Citations per year, relative to Armando Castañeda Armando Castañeda (= 1×) peers Csaba Nemes

Countries citing papers authored by Armando Castañeda

Since Specialization

Citations

This map shows the geographic impact of Armando Castañeda's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Armando Castañeda with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Armando Castañeda more than expected).

Fields of papers citing papers by Armando Castañeda

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Armando Castañeda. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Armando Castañeda. The network helps show where Armando Castañeda may publish in the future.

Co-authorship network of co-authors of Armando Castañeda

This figure shows the co-authorship network connecting the top 25 collaborators of Armando Castañeda. A scholar is included among the top collaborators of Armando Castañeda based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Armando Castañeda. Armando Castañeda is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Attiya, Hagit, Armando Castañeda, & Constantin Enea. (2024). Strong Linearizability using Primitives with Consensus Number 2. 432–442.

Castañeda, Armando, et al.. (2023). Synchronous t-resilient consensus in arbitrary graphs. Information and Computation. 292. 105035–105035.

Castañeda, Armando, et al.. (2023). Tasks in modular proofs of concurrent algorithms. Information and Computation. 292. 105040–105040.

Castañeda, Armando, et al.. (2023). Communication Pattern Logic: Epistemic and Topological Views. Journal of Philosophical Logic. 52(5). 1445–1473.

Attiya, Hagit, Armando Castañeda, & Sergio Rajsbaum. (2023). Locally solvable tasks and the limitations of valency arguments. Journal of Parallel and Distributed Computing. 176. 28–40.

Castañeda, Armando, et al.. (2023). Comparing the Update Expressivity of Communication Patterns and Action Models. Electronic Proceedings in Theoretical Computer Science. 379. 157–172. 1 indexed citations

Castañeda, Armando, Sergio Rajsbaum, & Michel Raynal. (2022). Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity. Distributed Computing. 36(2). 89–106. 2 indexed citations

Castañeda, Armando, Sergio Rajsbaum, & Michel Raynal. (2021). Relaxed Queues and Stacks from Read/Write Operations. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).

Castañeda, Armando, et al.. (2020). K-set agreement bounds in round-based models through combinatorial topology. Open Archive Toulouse Archive Ouverte (University of Toulouse). 395–404. 1 indexed citations

10.

Attiya, Hagit, Armando Castañeda, Maurice Herlihy, & Ami Paz. (2019). Bounds on the Step and Namespace Complexity of Renaming. SIAM Journal on Computing. 48(1). 1–32. 2 indexed citations

11.

Castañeda, Armando, Sergio Rajsbaum, & Matthieu Roy. (2018). Convergence and covering on graphs for wait-free robots. Journal of the Brazilian Computer Society. 24(1). 4 indexed citations

12.

Castañeda, Armando, Sergio Rajsbaum, & Michel Raynal. (2018). Unifying Concurrent Objects and Distributed Tasks. Journal of the ACM. 65(6). 1–42. 12 indexed citations

13.

Rajsbaum, Sergio, et al.. (2017). Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times. 493–502. 4 indexed citations

14.

Castañeda, Armando, Damien Imbs, Sergio Rajsbaum, & Michel Raynal. (2016). Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects. SIAM Journal on Computing. 45(2). 379–414. 6 indexed citations

15.

Attiya, Hagit, Armando Castañeda, Maurice Herlihy, & Ami Paz. (2013). Upper bound on the complexity of solving hard renaming. 190–199. 3 indexed citations

16.

Castañeda, Armando, Sergio Rajsbaum, & Michel Raynal. (2013). Agreement via Symmetry Breaking: On the Structure of Weak Subconsensus Tasks. 5401. 1147–1158. 1 indexed citations

17.

Attiya, Hagit & Armando Castañeda. (2012). A non-topological proof for the impossibility ofk-set agreement. Theoretical Computer Science. 512. 41–48. 4 indexed citations

18.

Castañeda, Armando & Sergio Rajsbaum. (2010). New combinatorial topology bounds for renaming: the lower bound. Distributed Computing. 22(5-6). 287–301. 32 indexed citations

19.

Castañeda, Armando, et al.. (1999). Rheology of complex fluids; associating polymers. Revista Mexicana de Física. 45(1). 96–98. 1 indexed citations

20.

Overman, Larry E., Armando Castañeda, & Todd A. Blumenkopf. (1986). Acetal-initiated cyclizations of vinylsilanes. A general synthesis of allylically unsaturated oxacyclics. Journal of the American Chemical Society. 108(6). 1303–1304. 53 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact