Edson N. Cáceres

415 total citations
32 papers, 135 citations indexed

About

Edson N. Cáceres is a scholar working on Artificial Intelligence, Computer Networks and Communications and Molecular Biology. According to data from OpenAlex, Edson N. Cáceres has authored 32 papers receiving a total of 135 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Artificial Intelligence, 10 papers in Computer Networks and Communications and 9 papers in Molecular Biology. Recurrent topics in Edson N. Cáceres's work include Algorithms and Data Compression (14 papers), DNA and Biological Computing (7 papers) and Advanced Manufacturing and Logistics Optimization (6 papers). Edson N. Cáceres is often cited by papers focused on Algorithms and Data Compression (14 papers), DNA and Biological Computing (7 papers) and Advanced Manufacturing and Logistics Optimization (6 papers). Edson N. Cáceres collaborates with scholars based in Brazil, Canada and Peru. Edson N. Cáceres's co-authors include F. Dehne, S. W. Song, Jayme L. Szwarcfiter, Frank Dehne, Albert P.C. Chan, Edson Borin, Nalvo F. Almeida, Narsingh Deo, Shivakumar Sastry and Wellington S. Martins and has published in prestigious journals such as IEEE Transactions on Parallel and Distributed Systems, Journal of Parallel and Distributed Computing and Discrete Applied Mathematics.

In The Last Decade

Edson N. Cáceres

30 papers receiving 123 citations

Peers

Countries citing papers authored by Edson N. Cáceres

Since Specialization

Citations

This map shows the geographic impact of Edson N. Cáceres'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 Edson N. Cáceres with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Edson N. Cáceres more than expected).

Fields of papers citing papers by Edson N. Cáceres

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Edson N. Cáceres. 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 Edson N. Cáceres. The network helps show where Edson N. Cáceres may publish in the future.

Co-authorship network of co-authors of Edson N. Cáceres

This figure shows the co-authorship network connecting the top 25 collaborators of Edson N. Cáceres. A scholar is included among the top collaborators of Edson N. Cáceres 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 Edson N. Cáceres. Edson N. Cáceres 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

#	Work	Indexed citations
1	Uma análise da mudança do perfil dos ingressantes do ensino superior brasileiro 2023 ·(unknown), Edson N. Cáceres	1
2	An evaluation of fast segmented sorting implementations on GPUs 2022 ·Parallel Computing ·(unknown), (unknown), Edson N. Cáceres, Edson Borin	2
3	Avaliação de classificadores para relacionar características escolares a indicadores educacionais 2021 ·(unknown), (unknown), Edson N. Cáceres, (unknown)	1
4	Implementações Eficientes da Heurística Min-Min para o HCSP em GPU 2018 ·(unknown), Edson N. Cáceres	1
5	A Parallel Algorithm for Minimum Spanning Tree on GPU 2017 ·(unknown), Edson N. Cáceres, (unknown), (unknown)	3
6	Algoritmo Paralelo para Árvore Geradora Usando GPU 2017 ·(unknown), Edson N. Cáceres, (unknown), (unknown)	1
7	A Parallelization of a Simulated Annealing Approach for 0-1 Multidimensional Knapsack Problem Using GPGPU 2016 ·(unknown), Edson N. Cáceres	9
8	Efficient BSP/CGM Algorithms for the Maximum Subsequence Sum and Related Problems 1 2015 ·Procedia Computer Science ·(unknown), (unknown), Edson N. Cáceres, (unknown), (unknown), (unknown), Wellington S. Martins	1
9	Sequential and Parallel Implementation of GRASP for the 0-1 Multidimensional Knapsack Problem 2015 ·Procedia Computer Science ·(unknown), Edson N. Cáceres	3
10	A parallel implementation to the multidimensional knapsack problem using augmented neural networks 2014 ·(unknown), Edson N. Cáceres	1
11	Parallel transitive closure algorithm 2012 ·Journal of the Brazilian Computer Society ·(unknown), Edson N. Cáceres, (unknown), (unknown), Jayme L. Szwarcfiter	2
12	Performance results of running parallel applications on the InteGrade 2010 ·LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) ·Edson N. Cáceres	0
13	Performance results of running parallel applications on the InteGrade 2009 ·Concurrency and Computation Practice and Experience ·Edson N. Cáceres, (unknown), (unknown), (unknown), S. W. Song	1
14	An all-substrings common subsequence algorithm 2007 ·Discrete Applied Mathematics ·(unknown), Edson N. Cáceres, S. W. Song	8
15	A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem 2006 ·Algorithmica ·(unknown), Edson N. Cáceres, (unknown)	14
16	0-1 Knapsack Problem: BSP/CGM Algorithm and Implementation. 2005 ·Edson N. Cáceres, (unknown)	4
17	An all-substrings common subsequence algorithm 2005 ·Electronic Notes in Discrete Mathematics ·(unknown), Edson N. Cáceres, S. W. Song	6
18	Revisiting a BSP/CGM Transitive Closure Algorithm 2004 ·Edson N. Cáceres, (unknown)	1
19	A parallel algorithm for transitive closure 2002 ·Edson N. Cáceres, (unknown), Jayme L. Szwarcfiter	2
20	Coarse Grained Parallel Graph Planarity Testing. 2000 ·Parallel and Distributed Processing Techniques and Applications ·Edson N. Cáceres, Albert P.C. Chan, Frank Dehne, (unknown)	2

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