default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdson Cáceres
- > Home > Persons > Edson Cáceres
Publications
- 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) - 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) - 2004
- [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 - 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 - [c8]Carlos E. R. Alves, Edson Cáceres, Siang W. Song:
Computing Maximum Subsequence in Parallel. WOB 2003: 80-87 - 2002
- [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
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.
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.
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.
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-09-18 13:38 CEST 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:
