( en | de | ru )

 

Disambiguation of "Cáceres, Edson"

Author of the publication

copydeleteadd this publication to your clipboard
A BSP/CGM Algorithm for Computing Euler Tours in Graphs.

, and . SBAC-PAD, page 175-182. IEEE Computer Society, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dean Cáceres

Daniel Cáceres González

Orlando Cáceres M

Silvia Mercedes Ochoa Cáceres

Ramiro José Cáceres Espinoza

 

Other publications of authors with the same name

A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem., , and . Algorithmica, 45 (3): 301-335 (2006)A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs., , and . International Conference on Computational Science (2), volume 2074 of Lecture Notes in Computer Science, page 638-647. Springer, (2001)A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem., , and . IPDPS, page 57. IEEE Computer Society, (2003)A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison., , , and . ICCSA (2), volume 2668 of Lecture Notes in Computer Science, page 249-258. Springer, (2003)Coarse Grained Parallel Graph Planarity Testing., , , and . PDPTA, CSREA Press, (2000)Computing Maximum Subsequence in Parallel., , and . WOB, page 80-87. (2003)Parallel dynamic programming for solving the string editing problem on a CGM/BSP., , and . SPAA, page 275-281. ACM, (2002)A BSP/CGM Algorithm for Computing Euler Tours in Graphs., and . SBAC-PAD, page 175-182. IEEE Computer Society, (2003)Efficient Parallel Implementation of Transitive Closure of Digraphs., , , , and . PVM/MPI, volume 2840 of Lecture Notes in Computer Science, page 126-133. Springer, (2003)On Finding Euler Tours in Parallel., , , and . Parallel Process. Lett., (1993)