| 
(11) 2799-1677 |
NÚCLEOS DE PESQUISA
Núcleo de Pesquisa em Computação - Publicações, Dissertações, Teses
Periódicos
2008
1. ALVES, C.E.R., CÁCERES, E.N., SONG, S.W. An all-substrings common subsequence algorithm. Discrete Applied Mathematics, Holanda : Elsevier, 2008, v. 156, p.1025-1035.
Trabalhos em eventos (Completos)
2007
8. ALVES, C.E.R., CÁCERES, E.N., SONG, S.W. Efficient Representations of Row-Sorted 1 – Variant Matrices for Parallel String Applications. In: H.Jin et al. (eds). Proceedings of 7th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP), 2007, Hangzhou. Lecture Notes in Computer Science. Berlin : Springer Verlag, 2007, v. 4494 p. 60-71.
2005
7. ALVES, Carlos Eduardo Rodrigues; CÁCERES, Edson Norberto; SONG, Siang Wun. An All-Substrings Common Subsequence Algorithm. In: 2ND BRAZILIAN SYMPOSIUM ON GRAPHS, ALGORITHMS AND COMBINATORICS (GRACO 2005), 2005, Angra dos Reis. Electronic Notes in Discrete Mathematics. Elsevier, 2005. v. 19, p. 133-139.
6. ALVES, Carlos Eduardo Rodrigues; CÁCERES, Edson Norberto; SONG, Siang Wun. A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem. Algorithmica, Berlin. Accepted, 2005.
5. RICCHETTI, Pier Marco, NETO, João José A practical method for the implementation of syntactic parsers. In: WSEAS International Conference on Automation & Information - ICAI'05, 2005, Buenos Aires, Argentina.
4. RICCHETTI, Pier Marco, NETO, João José A practical method for the implementation of syntactic parsers. In: WSEAS International Conference on Automation & Information - ICAI'05, 2005, Buenos Aires, Argentina.
2004
3. ALVES, Carlos Eduardo Rodrigues; CÁCERES, Edson Norberto; SONG, Siang Wun. BSP/CGM Algorithms for Maximum Subsequence and Maximum Subarray. In: 11TH EUROPEAN PVM/MPI USER'S GROUP CONFERENCE, 2004, Budapeste. Lecture Notes in Computer Science. Springer-Verlag, 2004. v. 3241, p. 139-146.
2003
2. ALVES, Carlos Eduardo Rodrigues; CÁCERES, Edson Norberto; SONG, Siang Wun. A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem. In: IEEE ANNUAL INTERNATIONAL PARALLEL & DISTRIBUTED PROCESSING SYMPOSIUM IPDPS 2003, 2003, Nice. Proc. 17th IEEE Annual International Parallel & Distributed Processing Symposium. IEEE Computer Society Press., 2003. p. 1-8.
2002
1. ALVES, Carlos Eduardo Rodrigues; CÁCERES, Edson Norberto; DEHNE, Frank; SONG, Siang Wun. Parallel Dynamic Programming For Solving The String Editing Problem On A CGM/BSP. In: FOURTEENTH ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES, 2002, Winnipeg. Proeedings Fourteenth ACM Symposium on Parallel Algorithms and Architectures. ACM., 2002. p. 275-281.
Capítulos de Livros
2010
ALVES, C.E.R.; CÁCERES, E.N.; DEHNE, F. ; SONG, S.W. Communication Issues in Scalable Parallel Computing. In: Kuan-Ching Li; Ching-Hsien Hsu ; Laurence Tianruo Yang; Jack Dongarra; Hans Zima (Orgs). Handbook of Research on Scalable Computing Technologies. IGI Global, 2010.
Informações Adicionais
Publicações
Unidade Mooca - R. Taquari, 546 - Mooca - São Paulo/SP - CEP 03166-000 | Unidade Butantã - Av. Vital Brasil, 1000 - Butantã - São Paulo/SP - CEP 05503-001
© 2000 / 2012 Universidade São Judas Tadeu
topo