#### Filter Results:

#### Publication Year

1993

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Edson Cáceres, Frank Dehne, +5 authors Siang Wun Song
- ICALP
- 1997

- Carlos Eduardo Rodrigues Alves, Edson Cáceres, Siang Wun Song
- Discrete Applied Mathematics
- 2005

In this paper we present a coarse-grained parallel algorithm for solving the string edit distance problem for a string A and all substrings of a string C. Our method is based on a novel CGM/BSP parallel dynamic programming technique for computing all highest scoring paths in a weighted grid graph. The algorithm requires \log p rounds/supersteps and… (More)

In this paper we present a parallel wavefront algorithm for computing an alignment between two strings A and C, with |A| = m and |C| = n. On a distributed memory parallel computer of p processors each with O((m + n)/p) memory, the proposed algorithm requires O(p) communication rounds and O(mn/p) local computing time. The novelty of this algorithm is based… (More)

Given two strings and of lengths Ñ and Ò, respectively , the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any substring of. The sequential algorithm takes Ç´ÑÒµ time and Ç´Òµ space. We present a parallel algorithm for ALCS on a coarse-grained multi-computer (BSP/CGM) model with Ô Ô Ô Ñ… (More)

- Edson Cáceres, Albert Chan, Frank Dehne, Siang Wun Song
- PDPTA
- 2000

- Edson Cáceres, Henrique Fingler, Henrique Mongelli, Siang Wun Song
- 2012 41st International Conference on Parallel…
- 2012

The NP-hard Quadratic Assignment Problem (QAP) was proposed in 1957. Until this date, it remains one of the hardest problems to solve in any reasonable amount of time, even for small instances. Even using parallel computation and assuming small instances of the problem, some naive and deterministic algorithms require too much time to obtain the solution. In… (More)

- Edson Cáceres, Cristiano C. A. Vieira
- 16th Symposium on Computer Architecture and High…
- 2004

We present a new BSP/CGM parallel algorithm for the transitive closure problem. Our algorithm uses O(n/sup 3//p/spl alpha/) local computation time with O(p//spl alpha/) communication rounds, where /spl alpha/ is the size in bits that can be stored in a primitive data item. For all the randomly generated graphs that were used in the tests, the number of… (More)