The following publications are possibly variants of this publication:
- Parallel dynamic programming for solving the string editing problem on a CGM/BSPCarlos E. R. Alves, Edson Cáceres, Frank K. H. A. Dehne. spaa 2002: 275-281 [doi]
- Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT AlgorithmErik J. Hanashiro, Henrique Mongelli, Siang W. Song. wea 2004: 253-268 [doi]
- Efficient Parallel Implementations of Multiple Sequence Alignment using BSP/CGM ModelJucele F. A. Vasconcellos, Christiane Nishibe, Nalvo F. Almeida, Edson Norberto Cáceres. ppopp 2014: 103 [doi]
- BSP/CGM Algorithms for Maximum Subsequence and Maximum SubarrayCarlos E. R. Alves, Edson Cáceres, Siang W. Song. pvm 2004: 139-146 [doi]
- 0-1 Knapsack Problem: BSP/CGM Algorithm and ImplementationEdson Norberto Cáceres, Christiane Nishibe. pdcs 2005: 331-335
- A BSP/CGM Algorithm for Computing Euler Tours in GraphsEdson Cáceres, C. Y. Nasu. sbac-pad 2003: 175-182 [doi]
- Revisiting a BSP/CGM Transitive Closure AlgorithmEdson Norberto Cáceres, Cristiano Costa Argemom Vieira. sbac-pad 2004: 174-179 [doi]
- New BSP/CGM algorithms for spanning treesJucele Franca de Alencar Vasconcellos, Edson Norberto Cáceres, Henrique Mongelli, Siang Wun Song, Frank Dehne, Jayme Luiz Szwarcfiter. ijhpca, 33(3), 2019. [doi]