A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers (2006)
- Authors:
- Autor USP: SONG, SIANG WUN - IME
- Unidade: IME
- DOI: 10.1007/11823285_87
- Subjects: TEORIA DA INFORMAÇÃO; TEORIA DOS NÚMEROS; ALGORITMOS
- Keywords: Parallel Algorithm; Constant Number; Communication Round; Maximal Subsequence; EREW Pram
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: European Conference on Parallel Processing - Euro-Par
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers. 2006, Anais.. Berlin: Springer, 2006. Disponível em: https://doi.org/10.1007/11823285_87. Acesso em: 05 jan. 2026. -
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2006). A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers. In Proceedings. Berlin: Springer. doi:10.1007/11823285_87 -
NLM
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers [Internet]. Proceedings. 2006 ;[citado 2026 jan. 05 ] Available from: https://doi.org/10.1007/11823285_87 -
Vancouver
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers [Internet]. Proceedings. 2006 ;[citado 2026 jan. 05 ] Available from: https://doi.org/10.1007/11823285_87 - Comprehensive evaluation of a two dimensional configurable array
- Towards a simple construction method for hamiltonian decomposition of the hypercube
- Revisiting cycle shrinking
- Randomized parallel list ranking for distributed memory multiprocessors
- A BSP/CGM algorithm for the all-substrings longest common subsequence problem
- A parallel solution to infer genetic network architectures in gene expression analysis
- A range minima parallel algorithm for coarse grained multicomputers
- Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm
- Message from de guest editors
- Reconhecimento de linguagens regulares por standard cells
Informações sobre o DOI: 10.1007/11823285_87 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3036537.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
