Carlos Eduardo Rodrigues Alves

According to our database1, Carlos Eduardo Rodrigues Alves authored at least 16 papers between 2002 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2013
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds.
IEEE Trans. Parallel Distrib. Syst., 2013

Parallel transitive closure algorithm.
J. Braz. Comp. Soc., 2013

2007
Efficient Representations of Row-Sorted 1-Variant Matrices for Parallel String Applications.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2007

2006
A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem.
Algorithmica, 2006

Alignment with Non-overlapping Inversions in O(n3)-Time.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2005
Alignment with non-overlapping inversions in O(n3logn)-time.
Electron. Notes Discret. Math., 2005

An all-substrings common subsequence algorithm.
Electron. Notes Discret. Math., 2005

2004
BSP/CGM Algorithms for Maximum Subsequence and Maximum Subarray.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2004

2003
Computing Maximum Subsequence in Parallel.
Proceedings of the II Brazilian Workshop on Bioinformatics, 2003

Comparison of Genomes Using High-Performance Parallel Computing.
Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2003), 2003

Efficient Parallel Implementation of Transitive Closure of Digraphs.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface,10th European PVM/MPI Users' Group Meeting, Venice, Italy, September 29, 2003

A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison.
Proceedings of the Computational Science and Its Applications, 2003

2002
A CGM/BSP Parallel Similarity Algorithm.
Proceedings of the I Brazilian Workshop on Bioinformatics, 2002

Parallel dynamic programming for solving the string editing problem on a CGM/BSP.
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002


  Loading...