default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdson Cáceres
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j13]Rafael F. Schmid
, Flávia Pisani, Edson Norberto Cáceres, Edson Borin:
An evaluation of fast segmented sorting implementations on GPUs. Parallel Comput. 110: 102889 (2022)- 2021
- [c35]Roberto Aragy, Eraldo Rezende Fernandes, Edson Norberto Cáceres:
Rhetorical Role Identification for Portuguese Legal Documents. BRACIS (2) 2021: 557-571
2010 – 2019
- 2019
- [j12]Jucele Franca de Alencar Vasconcellos, Edson Norberto Cáceres, Henrique Mongelli, Siang Wun Song, Frank Dehne, Jayme Luiz Szwarcfiter:
New BSP/CGM algorithms for spanning trees. Int. J. High Perform. Comput. Appl. 33(3) (2019) - [c34]Rafael F. Schmid, Edson Norberto Cáceres:
Fix Sort: A Good Strategy to Perform Segmented Sorting. HPCS 2019: 290-297 - 2018
- [j11]Bianca de Almeida Dantas, Edson Norberto Cáceres:
An experimental evaluation of a parallel simulated annealing approach for the 0-1 multidimensional knapsack problem. J. Parallel Distributed Comput. 120: 211-221 (2018) - [c33]Jucele Franca de Alencar Vasconcellos, Edson Norberto Cáceres, Henrique Mongelli, Siang Wun Song:
A New Efficient Parallel Algorithm for Minimum Spanning Tree. SBAC-PAD 2018: 107-114 - 2017
- [c32]Jucele Franca de Alencar Vasconcellos, Edson Norberto Cáceres, Henrique Mongelli, Siang Wun Song:
A Parallel Algorithm for Minimum Spanning Tree on GPU. SBAC-PAD (Workshops) 2017: 67-72 - 2016
- [j10]Anderson C. Lima, Rodrigo G. Branco, Samuel Ferraz, Edson Norberto Cáceres, Roussian R. A. Gaioso, Wellington Santos Martins, Siang W. Song:
Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA. J. Braz. Comput. Soc. 22(1): 7:1-7:13 (2016) - [c31]Rafael F. Schmid, Flavia Pisani, Edson Borin, Edson Cáceres:
An Evaluation of Segmented Sorting Strategies on GPUs. HPCC/SmartCity/DSS 2016: 1123-1130 - [c30]Bianca de Almeida Dantas, Edson Norberto Cáceres:
Sequential and Parallel Hybrid Approaches of Augmented Neural Networks and GRASP for the 0-1 Multidimensional Knapsack Problem. ICCSA (2) 2016: 207-222 - [c29]Bianca de Almeida Dantas, Edson Norberto Cáceres:
A Parallelization of a Simulated Annealing Approach for 0-1 Multidimensional Knapsack Problem Using GPGPU. SBAC-PAD 2016: 134-140 - 2015
- [c28]Bianca de Almeida Dantas, Edson Norberto Cáceres:
Sequential and Parallel Implementation of GRASP for the 0-1 Multidimensional Knapsack Problem. ICCS 2015: 2739-2743 - [c27]Anderson C. Lima, Rodrigo G. Branco, Edson Norberto Cáceres, Roussian R. A. Gaioso, Samuel Ferraz, Siang Wun Song, Wellington Santos Martins:
Efficient BSP/CGM Algorithms for the Maximum Subsequence Sum and Related Problems1. ICCS 2015: 2754-2758 - [c26]Anderson C. Lima, Rodrigo G. Branco, Edson Norberto Cáceres:
Efficient BSP/CGM Algorithms for the Maximum Subarray Sum and Related Problems. ICCSA (1) 2015: 392-407 - 2014
- [c25]Bianca de Almeida Dantas, Edson Norberto Cáceres:
A parallel implementation to the multidimensional knapsack problem using augmented neural networks. CLEI 2014: 1-9 - [c24]Henrique Fingler, Edson Norberto Cáceres, Henrique Mongelli, Siang W. Song:
A CUDA based Solution to the Multidimensional Knapsack Problem Using the Ant Colony Optimization. ICCS 2014: 84-94 - [c23]Jucele Franca de Alencar Vasconcellos, Christiane Nishibe, Nalvo F. Almeida, Edson Norberto Cáceres:
Efficient Parallel Implementations of Multiple Sequence Alignment using BSP/CGM Model. PMAM 2014: 103 - 2013
- [j9]Carlos Eduardo Rodrigues Alves, E. N. Cáceres, Amaury Antônio de Castro Jr., Siang Wun Song, Jayme Luiz Szwarcfiter:
Parallel transitive closure algorithm. J. Braz. Comput. Soc. 19(2): 161-166 (2013) - [j8]Carlos Eduardo Rodrigues Alves, Edson Norberto Cáceres, Siang Wun Song:
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds. IEEE Trans. Parallel Distributed Syst. 24(4): 724-733 (2013) - 2012
- [c22]Edson Norberto Cáceres, Henrique Fingler, Henrique Mongelli, Siang Wun Song:
Ant Colony System Based Solutions to the Quadratic Assignment Problem on GPGPU. ICPP Workshops 2012: 314-322 - [c21]Wellington Santos Martins, Thiago Fernando Rangel, Divino Cesar S. Lucas, Elias B. Ferreira, Edson Cáceres:
Phylogenetic Distance Computation Using CUDA. BSB 2012: 168-178 - 2010
- [j7]E. N. Cáceres, Henrique Mongelli, L. Loureiro, Christiane Nishibe, Siang Wun Song:
Performance results of running parallel applications on the InteGrade. Concurr. Comput. Pract. Exp. 22(3): 375-393 (2010) - [j6]Edson Norberto Cáceres, Siang Wun Song, Jayme Luiz Szwarcfiter:
Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search. RAIRO Theor. Informatics Appl. 44(3): 293-311 (2010) - [c20]Edson Norberto Cáceres, Henrique Mongelli, Christiane Nishibe, Siang Wun Song:
Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components. HPCS 2010: 631-637
2000 – 2009
- 2008
- [j5]Carlos Eduardo Rodrigues Alves, E. N. Cáceres, Siang Wun Song:
An all-substrings common subsequence algorithm. Discret. Appl. Math. 156(7): 1025-1035 (2008) - 2007
- [c19]Carlos Eduardo Rodrigues Alves, Edson Norberto Cáceres, Siang Wun Song:
Efficient Representations of Row-Sorted 1-Variant Matrices for Parallel String Applications. ICA3PP 2007: 60-71 - 2006
- [j4]Carlos E. R. Alves, Edson Cáceres, Siang Wun Song:
A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem. Algorithmica 45(3): 301-335 (2006) - [c18]Carlos E. R. Alves, Edson Norberto Cáceres, Siang Wun Song:
A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers. Euro-Par 2006: 831-840 - 2005
- [j3]Carlos Eduardo Rodrigues Alves, Edson Norberto Cáceres, Siang Wun Song:
An all-substrings common subsequence algorithm. Electron. Notes Discret. Math. 19: 133-139 (2005) - [c17]Edson Norberto Cáceres, Christiane Nishibe:
0-1 Knapsack Problem: BSP/CGM Algorithm and Implementation. IASTED PDCS 2005: 331-335 - 2004
- [c16]Edson Norberto Cáceres, Frank K. H. A. Dehne, Henrique Mongelli, Siang W. Song, Jayme Luiz Szwarcfiter:
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components. Euro-Par 2004: 828-831 - [c15]Carlos E. R. Alves, Edson Cáceres, Siang W. Song:
BSP/CGM Algorithms for Maximum Subsequence and Maximum Subarray. PVM/MPI 2004: 139-146 - [c14]Edson Norberto Cáceres, Cristiano Costa Argemon Vieira:
Revisiting a BSP/CGM Transitive Closure Algorithm. SBAC-PAD 2004: 174-179 - 2003
- [c13]Carlos E. R. Alves, Edson Cáceres, Frank K. H. A. Dehne, Siang W. Song:
A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison. ICCSA (2) 2003: 249-258 - [c12]Carlos E. R. Alves, Edson Cáceres, Siang W. Song:
A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem. IPDPS 2003: 57 - [c11]Carlos E. R. Alves, Edson Cáceres, Amaury Antônio de Castro Jr., Siang W. Song, Jayme Luiz Szwarcfiter:
Efficient Parallel Implementation of Transitive Closure of Digraphs. PVM/MPI 2003: 126-133 - [c10]Nalvo F. Almeida Jr., Carlos E. R. Alves, Edson Cáceres, Siang W. Song:
Comparison of Genomes Using High-Performance Parallel Computing. SBAC-PAD 2003: 142-148 - [c9]Edson Cáceres, C. Y. Nasu:
A BSP/CGM Algorithm for Computing Euler Tours in Graphs. SBAC-PAD 2003: 175-182 - [c8]Carlos E. R. Alves, Edson Cáceres, Siang W. Song:
Computing Maximum Subsequence in Parallel. WOB 2003: 80-87 - 2002
- [j2]Frank K. H. A. Dehne, Afonso Ferreira, Edson Cáceres, Siang W. Song, Alessandro Roncato:
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP. Algorithmica 33(2): 183-200 (2002) - [c7]Edson Norberto Cáceres, Siang W. Song, Jayme Luiz Szwarcfiter:
A Parallel Algorithm for Transitive Closure. IASTED PDCS 2002: 114-116 - [c6]Carlos E. R. Alves, Edson Cáceres, Frank K. H. A. Dehne:
Parallel dynamic programming for solving the string editing problem on a CGM/BSP. SPAA 2002: 275-281 - [c5]Carlos E. R. Alves, Edson Cáceres, Frank K. H. A. Dehne, Siang W. Song:
A CGM/BSP Parallel Similarity Algorithm. WOB 2002: 1-8 - 2001
- [c4]Edson Cáceres, Siang W. Song, Jayme Luiz Szwarcfiter:
A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs. International Conference on Computational Science (2) 2001: 638-647 - 2000
- [c3]Edson Cáceres, Albert Chan, Frank K. H. A. Dehne, Siang W. Song:
Coarse Grained Parallel Graph Planarity Testing. PDPTA 2000 - [c2]Edson Cáceres, Albert Chan, Frank K. H. A. Dehne, Giuseppe Prencipe:
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs. WG 2000: 83-94
1990 – 1999
- 1997
- [c1]Edson Cáceres, Frank K. H. A. Dehne, Afonso Ferreira, Paola Flocchini, Ingo Rieping, Alessandro Roncato, Nicola Santoro, Siang W. Song:
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP. ICALP 1997: 390-400 - 1993
- [j1]Edson Cáceres, Narsingh Deo, Shivakumar Sastry, Jayme Luiz Szwarcfiter:
On Finding Euler Tours in Parallel. Parallel Process. Lett. 3: 223-231 (1993)
Coauthor Index
aka: Carlos E. R. Alves
aka: Siang W. Song
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
