ReP USP - Resultado da busca

Artigo de periodico
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds (2013)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
Fonte: IEEE Transactions on Parallel and Distributed Systems. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds. IEEE Transactions on Parallel and Distributed Systems, v. 24, n. 4, p. 724-733, 2013Tradução . . Disponível em: https://doi.org/10.1109/TPDS.2012.149. Acesso em: 04 nov. 2024.
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2013). Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds. IEEE Transactions on Parallel and Distributed Systems, 24( 4), 724-733. doi:10.1109/TPDS.2012.149
NLM
Alves CER, Cáceres EN, Song SW. Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds [Internet]. IEEE Transactions on Parallel and Distributed Systems. 2013 ; 24( 4): 724-733.[citado 2024 nov. 04 ] Available from: https://doi.org/10.1109/TPDS.2012.149
Vancouver
Alves CER, Cáceres EN, Song SW. Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds [Internet]. IEEE Transactions on Parallel and Distributed Systems. 2013 ; 24( 4): 724-733.[citado 2024 nov. 04 ] Available from: https://doi.org/10.1109/TPDS.2012.149
Artigo de periodico
Parallel transitive closure algorithm (2013)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Castro Junior, Amaury Antônio de; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Fonte: Journal of the Brazilian Computer Society. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues et al. Parallel transitive closure algorithm. Journal of the Brazilian Computer Society, v. 19, p. 161-166, 2013Tradução . . Disponível em: https://doi.org/10.1007/s13173-012-0089-z. Acesso em: 04 nov. 2024.
APA
Alves, C. E. R., Cáceres, E. N., Castro Junior, A. A. de, Song, S. W., & Szwarcfiter, J. L. (2013). Parallel transitive closure algorithm. Journal of the Brazilian Computer Society, 19, 161-166. doi:10.1007/s13173-012-0089-z
NLM
Alves CER, Cáceres EN, Castro Junior AA de, Song SW, Szwarcfiter JL. Parallel transitive closure algorithm [Internet]. Journal of the Brazilian Computer Society. 2013 ; 19 161-166.[citado 2024 nov. 04 ] Available from: https://doi.org/10.1007/s13173-012-0089-z
Vancouver
Alves CER, Cáceres EN, Castro Junior AA de, Song SW, Szwarcfiter JL. Parallel transitive closure algorithm [Internet]. Journal of the Brazilian Computer Society. 2013 ; 19 161-166.[citado 2024 nov. 04 ] Available from: https://doi.org/10.1007/s13173-012-0089-z
Trabalho de evento
Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components (2010)
Cáceres, Edson Norberto; Mongelli, Henrique; Nishibe, Christiane; Song, Siang Wun
Fonte: Proceedings. Nome do evento: International conference on High Peformance Computing and Simulation - HPCS. Unidade: IME
Assuntos: ALGORITMOS, ALGORITMOS PARA PROCESSAMENTO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÁCERES, Edson Norberto et al. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components. 2010, Anais.. Piscataway: IEEE, 2010. Disponível em: https://doi.org/10.1109/HPCS.2010.5547062. Acesso em: 04 nov. 2024.
APA
Cáceres, E. N., Mongelli, H., Nishibe, C., & Song, S. W. (2010). Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components. In Proceedings. Piscataway: IEEE. doi:10.1109/HPCS.2010.5547062
NLM
Cáceres EN, Mongelli H, Nishibe C, Song SW. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2010 ;[citado 2024 nov. 04 ] Available from: https://doi.org/10.1109/HPCS.2010.5547062
Vancouver
Cáceres EN, Mongelli H, Nishibe C, Song SW. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2010 ;[citado 2024 nov. 04 ] Available from: https://doi.org/10.1109/HPCS.2010.5547062
Artigo de periodico
Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search (2010)
Cáceres, Edson Norberto; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Fonte: RAIRO: Theoretical Informatics and Applications. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÁCERES, Edson Norberto e SONG, Siang Wun e SZWARCFITER, Jayme Luiz. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search. RAIRO: Theoretical Informatics and Applications, v. 44, n. 3, p. 293-312, 2010Tradução . . Disponível em: https://doi.org/10.1051/ita/2010016. Acesso em: 04 nov. 2024.
APA
Cáceres, E. N., Song, S. W., & Szwarcfiter, J. L. (2010). Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search. RAIRO: Theoretical Informatics and Applications, 44( 3), 293-312. doi:10.1051/ita/2010016
NLM
Cáceres EN, Song SW, Szwarcfiter JL. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search [Internet]. RAIRO: Theoretical Informatics and Applications. 2010 ; 44( 3): 293-312.[citado 2024 nov. 04 ] Available from: https://doi.org/10.1051/ita/2010016
Vancouver
Cáceres EN, Song SW, Szwarcfiter JL. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search [Internet]. RAIRO: Theoretical Informatics and Applications. 2010 ; 44( 3): 293-312.[citado 2024 nov. 04 ] Available from: https://doi.org/10.1051/ita/2010016
Trabalho de evento-anais periodico
Repetition-free longest common subsequence (2010)
Adi, Said Sadique ; Braga, Marilia D. V. ; Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Martinez, Fábio Henrique Viduani ; Sagot, Marie-France ; Stefanes, Marco Aurélio ; Tjandraatmadja, Christian ; Wakabayashi, Yoshiko
Fonte: Discrete Applied Mathematics. Nome do evento: Latin American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ADI, Said Sadique et al. Repetition-free longest common subsequence. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.dam.2009.04.023. Acesso em: 04 nov. 2024. , 2010
APA
Adi, S. S., Braga, M. D. V., Fernandes, C. G., Ferreira, C. E., Martinez, F. H. V., Sagot, M. -F., et al. (2010). Repetition-free longest common subsequence. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2009.04.023
NLM
Adi SS, Braga MDV, Fernandes CG, Ferreira CE, Martinez FHV, Sagot M-F, Stefanes MA, Tjandraatmadja C, Wakabayashi Y. Repetition-free longest common subsequence [Internet]. Discrete Applied Mathematics. 2010 ; 158( 12): 1315-1324.[citado 2024 nov. 04 ] Available from: https://doi.org/10.1016/j.dam.2009.04.023
Vancouver
Adi SS, Braga MDV, Fernandes CG, Ferreira CE, Martinez FHV, Sagot M-F, Stefanes MA, Tjandraatmadja C, Wakabayashi Y. Repetition-free longest common subsequence [Internet]. Discrete Applied Mathematics. 2010 ; 158( 12): 1315-1324.[citado 2024 nov. 04 ] Available from: https://doi.org/10.1016/j.dam.2009.04.023
Artigo de periodico
Performance results of running parallel applications on the InteGrade (2010)
Cáceres, Edson Norberto; Mongelli, Henrique
Fonte: Concurrecy and Computation: Practice and Experience. Unidade: IME
Assuntos: PROGRAMAÇÃO PARALELA, MIDDLEWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÁCERES, Edson Norberto e MONGELLI, Henrique. Performance results of running parallel applications on the InteGrade. Concurrecy and Computation: Practice and Experience, v. 22, n. 3, p. 375-393, 2010Tradução . . Disponível em: https://doi.org/10.1002/cpe.1524. Acesso em: 04 nov. 2024.
APA
Cáceres, E. N., & Mongelli, H. (2010). Performance results of running parallel applications on the InteGrade. Concurrecy and Computation: Practice and Experience, 22( 3), 375-393. doi:10.1002/cpe.1524
NLM
Cáceres EN, Mongelli H. Performance results of running parallel applications on the InteGrade [Internet]. Concurrecy and Computation: Practice and Experience. 2010 ; 22( 3): 375-393.[citado 2024 nov. 04 ] Available from: https://doi.org/10.1002/cpe.1524
Vancouver
Cáceres EN, Mongelli H. Performance results of running parallel applications on the InteGrade [Internet]. Concurrecy and Computation: Practice and Experience. 2010 ; 22( 3): 375-393.[citado 2024 nov. 04 ] Available from: https://doi.org/10.1002/cpe.1524
Trabalho de evento-anais periodico
Repetition-free longest common subsequence (2008)
Adi, Said Sadique ; Braga, Marilia D. V. ; Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Martinez, Fábio Henrique Viduani ; Sagot, Marie France ; Stefanes, Marco Aurélio ; Tjandraatmadja, Christian ; Wakabayashi, Yoshiko
Fonte: Electronic Notes in Discrete Mathematics. Nome do evento: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ADI, Said Sadique et al. Repetition-free longest common subsequence. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2008.01.042. Acesso em: 04 nov. 2024. , 2008
APA
Adi, S. S., Braga, M. D. V., Fernandes, C. G., Ferreira, C. E., Martinez, F. H. V., Sagot, M. F., et al. (2008). Repetition-free longest common subsequence. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2008.01.042
NLM
Adi SS, Braga MDV, Fernandes CG, Ferreira CE, Martinez FHV, Sagot MF, Stefanes MA, Tjandraatmadja C, Wakabayashi Y. Repetition-free longest common subsequence [Internet]. Electronic Notes in Discrete Mathematics. 2008 ; 30 243-248.[citado 2024 nov. 04 ] Available from: https://doi.org/10.1016/j.endm.2008.01.042
Vancouver
Adi SS, Braga MDV, Fernandes CG, Ferreira CE, Martinez FHV, Sagot MF, Stefanes MA, Tjandraatmadja C, Wakabayashi Y. Repetition-free longest common subsequence [Internet]. Electronic Notes in Discrete Mathematics. 2008 ; 30 243-248.[citado 2024 nov. 04 ] Available from: https://doi.org/10.1016/j.endm.2008.01.042
Trabalho de evento
Efficient representations of row-sorted 1-variant matrices for parallel string applications (2007)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Song, Siang Wun
Fonte: Proceedings. Nome do evento: International Conference on Algorithms and Architectures for Parallel Processing - ICA3PP. Unidade: IME
Assunto: PROGRAMAÇÃO PARALELA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. Efficient representations of row-sorted 1-variant matrices for parallel string applications. 2007, Anais.. Berlin: Springer, 2007. Disponível em: https://doi.org/10.1007/978-3-540-72905-1_6. Acesso em: 04 nov. 2024.
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2007). Efficient representations of row-sorted 1-variant matrices for parallel string applications. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-72905-1_6
NLM
Alves CER, Cáceres EN, Song SW. Efficient representations of row-sorted 1-variant matrices for parallel string applications [Internet]. Proceedings. 2007 ;[citado 2024 nov. 04 ] Available from: https://doi.org/10.1007/978-3-540-72905-1_6
Vancouver
Alves CER, Cáceres EN, Song SW. Efficient representations of row-sorted 1-variant matrices for parallel string applications [Internet]. Proceedings. 2007 ;[citado 2024 nov. 04 ] Available from: https://doi.org/10.1007/978-3-540-72905-1_6
Trabalho de evento
A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers (2006)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Song, Siang Wun
Fonte: Proceedings. Nome do evento: European Conference on Parallel Processing - Euro-Par. Unidade: IME
Assuntos: TEORIA DA INFORMAÇÃO, TEORIA DOS NÚMEROS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
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: 04 nov. 2024.
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 2024 nov. 04 ] 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 2024 nov. 04 ] Available from: https://doi.org/10.1007/11823285_87
Trabalho de evento
A coarse-grained parallel algorithm for spanning tree and connected components (2004)
Cáceres, Edson Norberto; Dehne, Frank; Mongelli, Henrique ; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Fonte: Proceedings. Nome do evento: European Conference on Parallel Processing - Euro-Par. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÁCERES, Edson Norberto et al. A coarse-grained parallel algorithm for spanning tree and connected components. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-27866-5_110. Acesso em: 04 nov. 2024.
APA
Cáceres, E. N., Dehne, F., Mongelli, H., Song, S. W., & Szwarcfiter, J. L. (2004). A coarse-grained parallel algorithm for spanning tree and connected components. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-27866-5_110
NLM
Cáceres EN, Dehne F, Mongelli H, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2004 ;[citado 2024 nov. 04 ] Available from: https://doi.org/10.1007/978-3-540-27866-5_110
Vancouver
Cáceres EN, Dehne F, Mongelli H, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2004 ;[citado 2024 nov. 04 ] Available from: https://doi.org/10.1007/978-3-540-27866-5_110
Trabalho de evento
BSP/CGM algorithms for maximum subsequence and maximum subarray (2004)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
Fonte: Proceedings. Nome do evento: European Parallel Virtual Machine / Message Passing Interface Users’ Group Meeting - EuroPVM/MPI. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. BSP/CGM algorithms for maximum subsequence and maximum subarray. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-30218-6_24. Acesso em: 04 nov. 2024.
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2004). BSP/CGM algorithms for maximum subsequence and maximum subarray. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-30218-6_24
NLM
Alves CER, Cáceres EN, Song SW. BSP/CGM algorithms for maximum subsequence and maximum subarray [Internet]. Proceedings. 2004 ;[citado 2024 nov. 04 ] Available from: https://doi.org/10.1007/978-3-540-30218-6_24
Vancouver
Alves CER, Cáceres EN, Song SW. BSP/CGM algorithms for maximum subsequence and maximum subarray [Internet]. Proceedings. 2004 ;[citado 2024 nov. 04 ] Available from: https://doi.org/10.1007/978-3-540-30218-6_24

Unidades USP

ReP

Filtros

Autores

Ano de publicação

Assuntos

Título da fonte

Nome do evento

Agência de fomento

Afiliação dos autores externos não normalizada