ReP USP - Resultado da busca

Artigo de periodico
New BSP/CGM algorithms for spanning trees (2019)
Vasconcellos, Jucele França de Alencar; Cáceres, Edson Norberto; Mongelli, Henrique; Song, Siang Wun; Dehne, Frank; Szwarcfiter, Jayme Luiz
Source: The International Journal of High Performance Computing Applications. Unidade: IME
Assunto: REDES DE COMPUTADORES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VASCONCELLOS, Jucele França de Alencar et al. New BSP/CGM algorithms for spanning trees. The International Journal of High Performance Computing Applications, v. 33, n. 3, p. 444-461, 2019Tradução . . Disponível em: https://doi.org/10.1177/1094342018803672. Acesso em: 23 abr. 2024.
APA
Vasconcellos, J. F. de A., Cáceres, E. N., Mongelli, H., Song, S. W., Dehne, F., & Szwarcfiter, J. L. (2019). New BSP/CGM algorithms for spanning trees. The International Journal of High Performance Computing Applications, 33( 3), 444-461. doi:10.1177/1094342018803672
NLM
Vasconcellos JF de A, Cáceres EN, Mongelli H, Song SW, Dehne F, Szwarcfiter JL. New BSP/CGM algorithms for spanning trees [Internet]. The International Journal of High Performance Computing Applications. 2019 ; 33( 3): 444-461.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1177/1094342018803672
Vancouver
Vasconcellos JF de A, Cáceres EN, Mongelli H, Song SW, Dehne F, Szwarcfiter JL. New BSP/CGM algorithms for spanning trees [Internet]. The International Journal of High Performance Computing Applications. 2019 ; 33( 3): 444-461.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1177/1094342018803672
Trabalho de evento
A new efficient parallel algorithm for minimum spanning tree (2019)
Vasconcellos, Jucele França de Alencar ; Cáceres, Edson Norberto ; Mongelli, Henrique ; Song, Siang Wun
Source: Proceedings. Conference titles: International Symposium on Computer Architecture and High Performance Computing - SBAC-PAD. Unidade: IME
Subjects: GEOMETRIA E MODELAGEM COMPUTACIONAL, COMPUTAÇÃO GRÁFICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VASCONCELLOS, Jucele França de Alencar et al. A new efficient parallel algorithm for minimum spanning tree. 2019, Anais.. Piscataway: IEEE, 2019. Disponível em: https://doi.org/10.1109/CAHPC.2018.8645917. Acesso em: 23 abr. 2024.
APA
Vasconcellos, J. F. de A., Cáceres, E. N., Mongelli, H., & Song, S. W. (2019). A new efficient parallel algorithm for minimum spanning tree. In Proceedings. Piscataway: IEEE. doi:10.1109/CAHPC.2018.8645917
NLM
Vasconcellos JF de A, Cáceres EN, Mongelli H, Song SW. A new efficient parallel algorithm for minimum spanning tree [Internet]. Proceedings. 2019 ;[citado 2024 abr. 23 ] Available from: https://doi.org/10.1109/CAHPC.2018.8645917
Vancouver
Vasconcellos JF de A, Cáceres EN, Mongelli H, Song SW. A new efficient parallel algorithm for minimum spanning tree [Internet]. Proceedings. 2019 ;[citado 2024 abr. 23 ] Available from: https://doi.org/10.1109/CAHPC.2018.8645917
Trabalho de evento-anais periodico
Efficient BSP/CGM algorithms for the maximum subsequence sum and related problems (2015)
Lima, Anderson C; Branco, Rodrigo G; Cáceres, Edson Norberto; Gaioso, Roussian R. A; Ferraz, Samuel; Song, Siang Wun; Martins, Wellington S
Source: Procedia Computer Science. Conference titles: International Conference On Computational Science - ICCS. 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
LIMA, Anderson C et al. Efficient BSP/CGM algorithms for the maximum subsequence sum and related problems. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.procs.2015.05.421. Acesso em: 23 abr. 2024. , 2015
APA
Lima, A. C., Branco, R. G., Cáceres, E. N., Gaioso, R. R. A., Ferraz, S., Song, S. W., & Martins, W. S. (2015). Efficient BSP/CGM algorithms for the maximum subsequence sum and related problems. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.procs.2015.05.421
NLM
Lima AC, Branco RG, Cáceres EN, Gaioso RRA, Ferraz S, Song SW, Martins WS. Efficient BSP/CGM algorithms for the maximum subsequence sum and related problems [Internet]. Procedia Computer Science. 2015 ; 51 2754–2758.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.procs.2015.05.421
Vancouver
Lima AC, Branco RG, Cáceres EN, Gaioso RRA, Ferraz S, Song SW, Martins WS. Efficient BSP/CGM algorithms for the maximum subsequence sum and related problems [Internet]. Procedia Computer Science. 2015 ; 51 2754–2758.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.procs.2015.05.421
Trabalho de evento-anais periodico
A CUDA based solution to the multidimensional knapsack problem using the ant colony optimization (2014)
Fingler, Henrique; Cáceres, Edson Norberto; Mongelli, Henrique; Song, Siang Wun
Source: Procedia Computer Science. Conference titles: International Conference on Computational Science - ICCS 2014. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, PROGRAMAÇÃO PARALELA, COMPUTAÇÃO BIOINSPIRADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGLER, Henrique et al. A CUDA based solution to the multidimensional knapsack problem using the ant colony optimization. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.procs.2014.05.008. Acesso em: 23 abr. 2024. , 2014
APA
Fingler, H., Cáceres, E. N., Mongelli, H., & Song, S. W. (2014). A CUDA based solution to the multidimensional knapsack problem using the ant colony optimization. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.procs.2014.05.008
NLM
Fingler H, Cáceres EN, Mongelli H, Song SW. A CUDA based solution to the multidimensional knapsack problem using the ant colony optimization [Internet]. Procedia Computer Science. 2014 ; 29 84-94.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.procs.2014.05.008
Vancouver
Fingler H, Cáceres EN, Mongelli H, Song SW. A CUDA based solution to the multidimensional knapsack problem using the ant colony optimization [Internet]. Procedia Computer Science. 2014 ; 29 84-94.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.procs.2014.05.008
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
Source: 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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] 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
Source: 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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] 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
Source: Proceedings. Conference titles: International conference on High Peformance Computing and Simulation - HPCS. Unidade: IME
Subjects: 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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] Available from: https://doi.org/10.1109/HPCS.2010.5547062
Parte de monografia/livro
Communication issues in scalable parallel computing (2010)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Dehne, Frank; Song, Siang Wun
Source: The handbook of research on scalable computing technologies. 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 et al. Communication issues in scalable parallel computing. The handbook of research on scalable computing technologies. Tradução . Hershey, PA: Information Science Reference, 2010. . Disponível em: https://doi.org/10.4018/978-1-60566-661-7.ch017. Acesso em: 23 abr. 2024.
APA
Alves, C. E. R., Cáceres, E. N., Dehne, F., & Song, S. W. (2010). Communication issues in scalable parallel computing. In The handbook of research on scalable computing technologies. Hershey, PA: Information Science Reference. doi:10.4018/978-1-60566-661-7.ch017
NLM
Alves CER, Cáceres EN, Dehne F, Song SW. Communication issues in scalable parallel computing [Internet]. In: The handbook of research on scalable computing technologies. Hershey, PA: Information Science Reference; 2010. [citado 2024 abr. 23 ] Available from: https://doi.org/10.4018/978-1-60566-661-7.ch017
Vancouver
Alves CER, Cáceres EN, Dehne F, Song SW. Communication issues in scalable parallel computing [Internet]. In: The handbook of research on scalable computing technologies. Hershey, PA: Information Science Reference; 2010. [citado 2024 abr. 23 ] Available from: https://doi.org/10.4018/978-1-60566-661-7.ch017
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
Source: 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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] Available from: https://doi.org/10.1051/ita/2010016
Artigo de periodico
Performance results of running parallel applications on the InteGrade (2010)
Cáceres, Edson Norberto; Mongelli, Henrique
Source: Concurrecy and Computation: Practice and Experience. Unidade: IME
Subjects: 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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] Available from: https://doi.org/10.1002/cpe.1524
Trabalho de evento-anais periodico
An all-substrings common subsequence algorithm (2008)
Alves, C. E. R.; Cáceres, Edson Norberto; Song, Siang Wun
Source: Discrete Applied Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Assunto: ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, C. E. R. e CÁCERES, Edson Norberto e SONG, Siang Wun. An all-substrings common subsequence algorithm. 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.2007.05.056. Acesso em: 23 abr. 2024. , 2008
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2008). An all-substrings common subsequence algorithm. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2007.05.056
NLM
Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 1025-1035.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.dam.2007.05.056
Vancouver
Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 1025-1035.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.dam.2007.05.056
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
Source: Proceedings. Conference titles: 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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] 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
Source: Proceedings. Conference titles: European Conference on Parallel Processing - Euro-Par. Unidade: IME
Subjects: 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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] Available from: https://doi.org/10.1007/11823285_87
Artigo de periodico
A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem (2006)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
Source: Algorithmica. Unidade: IME
Assunto: 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 coarse-grained parallel algorithm for the all-substrings longest common subsequence problem. Algorithmica, v. 45, n. 3, p. 301-335, 2006Tradução . . Disponível em: https://doi.org/10.1007/s00453-006-1216-z. Acesso em: 23 abr. 2024.
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2006). A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem. Algorithmica, 45( 3), 301-335. doi:10.1007/s00453-006-1216-z
NLM
Alves CER, Cáceres EN, Song SW. A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem [Internet]. Algorithmica. 2006 ; 45( 3): 301-335.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1007/s00453-006-1216-z
Vancouver
Alves CER, Cáceres EN, Song SW. A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem [Internet]. Algorithmica. 2006 ; 45( 3): 301-335.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1007/s00453-006-1216-z
Trabalho de evento-anais periodico
An all-substrings common subsequence algorithm (2005)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Assunto: ANÁLISE DE 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. An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2005.05.019. Acesso em: 23 abr. 2024. , 2005
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2005). An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2005.05.019
NLM
Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 133-139.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.endm.2005.05.019
Vancouver
Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 133-139.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.endm.2005.05.019
Relatorio tecnico
A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers (2005)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
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. A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/ef5e9997-cd98-4742-b72d-f10d5a9a7847/1419659.pdf. Acesso em: 23 abr. 2024. , 2005
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2005). A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/ef5e9997-cd98-4742-b72d-f10d5a9a7847/1419659.pdf
NLM
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers [Internet]. 2005 ;[citado 2024 abr. 23 ] Available from: https://repositorio.usp.br/directbitstream/ef5e9997-cd98-4742-b72d-f10d5a9a7847/1419659.pdf
Vancouver
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers [Internet]. 2005 ;[citado 2024 abr. 23 ] Available from: https://repositorio.usp.br/directbitstream/ef5e9997-cd98-4742-b72d-f10d5a9a7847/1419659.pdf
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
Source: Proceedings. Conference titles: 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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] 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
Source: Proceedings. Conference titles: 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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] Available from: https://doi.org/10.1007/978-3-540-30218-6_24
Trabalho de evento
A parallel wavefront algorithm for efficient biological sequence comparison (2003)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Dehne, Frank; Song, Siang Wun
Source: Proceedings. Conference titles: International Conference on Computational Science and Its Applications - ICCSA. 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. A parallel wavefront algorithm for efficient biological sequence comparison. 2003, Anais.. Berlin: Springer, 2003. Disponível em: https://doi.org/10.1007/3-540-44843-8_27. Acesso em: 23 abr. 2024.
APA
Alves, C. E. R., Cáceres, E. N., Dehne, F., & Song, S. W. (2003). A parallel wavefront algorithm for efficient biological sequence comparison. In Proceedings. Berlin: Springer. doi:10.1007/3-540-44843-8_27
NLM
Alves CER, Cáceres EN, Dehne F, Song SW. A parallel wavefront algorithm for efficient biological sequence comparison [Internet]. Proceedings. 2003 ;[citado 2024 abr. 23 ] Available from: https://doi.org/10.1007/3-540-44843-8_27
Vancouver
Alves CER, Cáceres EN, Dehne F, Song SW. A parallel wavefront algorithm for efficient biological sequence comparison [Internet]. Proceedings. 2003 ;[citado 2024 abr. 23 ] Available from: https://doi.org/10.1007/3-540-44843-8_27
Relatorio tecnico
Sequential and parallel algorithms for the all-substrings longest common subsequence problem (2003)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
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. Sequential and parallel algorithms for the all-substrings longest common subsequence problem. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/4ba5e2d8-e2a9-42ec-9d5a-e69267f5f987/1315979.pdf. Acesso em: 23 abr. 2024. , 2003
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2003). Sequential and parallel algorithms for the all-substrings longest common subsequence problem. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/4ba5e2d8-e2a9-42ec-9d5a-e69267f5f987/1315979.pdf
NLM
Alves CER, Cáceres EN, Song SW. Sequential and parallel algorithms for the all-substrings longest common subsequence problem [Internet]. 2003 ;[citado 2024 abr. 23 ] Available from: https://repositorio.usp.br/directbitstream/4ba5e2d8-e2a9-42ec-9d5a-e69267f5f987/1315979.pdf
Vancouver
Alves CER, Cáceres EN, Song SW. Sequential and parallel algorithms for the all-substrings longest common subsequence problem [Internet]. 2003 ;[citado 2024 abr. 23 ] Available from: https://repositorio.usp.br/directbitstream/4ba5e2d8-e2a9-42ec-9d5a-e69267f5f987/1315979.pdf

USP Schools

ReP

Filtros

Document Types

Authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration