Edson Norberto Cáceres, E. N. Cáceres
List of publications from the DBLP Bibliography Server - FAQ
2008 | ||
---|---|---|
24 | EE | Carlos Eduardo Rodrigues Alves, E. N. Cáceres, Siang Wun Song: An all-substrings common subsequence algorithm. Discrete Applied Mathematics 156(7): 1025-1035 (2008) |
2007 | ||
23 | EE | 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 | ||
22 | EE | 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 |
21 | EE | 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) |
2005 | ||
20 | Edson Norberto Cáceres, Christiane Nishibe: 0-1 Knapsack Problem: BSP/CGM Algorithm and Implementation. IASTED PDCS 2005: 331-335 | |
19 | EE | Carlos Eduardo Rodrigues Alves, Edson Norberto Cáceres, Siang Wun Song: An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics 19: 133-139 (2005) |
2004 | ||
18 | EE | 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 |
17 | EE | Carlos E. R. Alves, Edson Cáceres, Siang W. Song: BSP/CGM Algorithms for Maximum Subsequence and Maximum Subarray. PVM/MPI 2004: 139-146 |
16 | EE | Edson Norberto Cáceres, Cristiano Costa Argemom Vieira: Revisiting a BSP/CGM Transitive Closure Algorithm. SBAC-PAD 2004: 174-179 |
2003 | ||
15 | EE | 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 |
14 | EE | 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 |
13 | EE | Carlos E. R. Alves, Edson Cáceres, A. A. Castro Jr., Siang W. Song, Jayme Luiz Szwarcfiter: Efficient Parallel Implementation of Transitive Closure of Digraphs. PVM/MPI 2003: 126-133 |
12 | EE | 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 |
11 | EE | Edson Cáceres, C. Y. Nasu: A BSP/CGM Algorithm for Computing Euler Tours in Graphs. SBAC-PAD 2003: 175-182 |
10 | Carlos E. R. Alves, Edson Cáceres, Siang W. Song: Computing Maximum Subsequence in Parallel. WOB 2003: 80-87 | |
2002 | ||
9 | Edson Norberto Cáceres, Siang W. Song, Jayme Luiz Szwarcfiter: A Parallel Algorithm for Transitive Closure. IASTED PDCS 2002: 114-116 | |
8 | EE | 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 |
7 | 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 | |
6 | EE | 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) |
2001 | ||
5 | EE | 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 | ||
4 | Edson Cáceres, Albert Chan, Frank K. H. A. Dehne, Siang W. Song: Coarse Grained Parallel Graph Planarity Testing. PDPTA 2000 | |
3 | EE | 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 |
1997 | ||
2 | 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 | ||
1 | Edson Cáceres, Narsingh Deo, Shivakumar Sastry, Jayme Luiz Szwarcfiter: On Finding Euler Tours in Parallel. Parallel Processing Letters 3: 223-231 (1993) |
1 | Nalvo F. Almeida Jr. | [12] |
2 | Carlos Eduardo Rodrigues Alves (Carlos E. R. Alves) | [7] [8] [10] [12] [13] [14] [15] [17] [19] [21] [22] [23] [24] |
3 | A. A. Castro Jr. | [13] |
4 | Albert Chan | [3] [4] |
5 | Frank K. H. A. Dehne | [2] [3] [4] [6] [7] [8] [15] [18] |
6 | Narsingh Deo | [1] |
7 | Afonso Ferreira | [2] [6] |
8 | Paola Flocchini | [2] |
9 | Henrique Mongelli | [18] |
10 | C. Y. Nasu | [11] |
11 | Christiane Nishibe | [20] |
12 | Giuseppe Prencipe | [3] |
13 | Ingo Rieping | [2] |
14 | Alessandro Roncato | [2] [6] |
15 | Nicola Santoro | [2] |
16 | Shivakumar Sastry | [1] |
17 | Siang Wun Song (Siang W. Song) | [2] [4] [5] [6] [7] [9] [10] [12] [13] [14] [15] [17] [18] [19] [21] [22] [23] [24] |
18 | Jayme Luiz Szwarcfiter | [1] [5] [9] [13] [18] |
19 | Cristiano Costa Argemom Vieira | [16] |