ReP USP - Resultado da busca

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: 13 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. 13 ] 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. 13 ] Available from: https://doi.org/10.1007/978-3-540-27866-5_110
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: 13 nov. 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 nov. 13 ] 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 nov. 13 ] Available from: https://doi.org/10.1007/3-540-44843-8_27
Relatorio tecnico
A Coarse-grainded parallel algorithm for spanning tree and connected components (2003)
Cáceres, Edson Norberto; Dehne, Frank; Mongelli, Henrique; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Unidade: IME
Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES
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-grainded parallel algorithm for spanning tree and connected components. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/4cdca472-4330-4db1-a226-2b73d956801d/1332988.pdf. Acesso em: 13 nov. 2024. , 2003
APA
Cáceres, E. N., Dehne, F., Mongelli, H., Song, S. W., & Szwarcfiter, J. L. (2003). A Coarse-grainded parallel algorithm for spanning tree and connected components. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/4cdca472-4330-4db1-a226-2b73d956801d/1332988.pdf
NLM
Cáceres EN, Dehne F, Mongelli H, Song SW, Szwarcfiter JL. A Coarse-grainded parallel algorithm for spanning tree and connected components [Internet]. 2003 ;[citado 2024 nov. 13 ] Available from: https://repositorio.usp.br/directbitstream/4cdca472-4330-4db1-a226-2b73d956801d/1332988.pdf
Vancouver
Cáceres EN, Dehne F, Mongelli H, Song SW, Szwarcfiter JL. A Coarse-grainded parallel algorithm for spanning tree and connected components [Internet]. 2003 ;[citado 2024 nov. 13 ] Available from: https://repositorio.usp.br/directbitstream/4cdca472-4330-4db1-a226-2b73d956801d/1332988.pdf
Relatorio tecnico
A parameterized parallel algorithm for efficient biological sequence comparison (2002)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Dehne, Frank; Song, Siang Wun
Unidade: IME
Subjects: PROGRAMAÇÃO PARALELA, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues et al. A parameterized parallel algorithm for efficient biological sequence comparison. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/98a6f33b-7458-44a1-acf7-c0398b22d3a1/1275100.pdf. Acesso em: 13 nov. 2024. , 2002
APA
Alves, C. E. R., Cáceres, E. N., Dehne, F., & Song, S. W. (2002). A parameterized parallel algorithm for efficient biological sequence comparison. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/98a6f33b-7458-44a1-acf7-c0398b22d3a1/1275100.pdf
NLM
Alves CER, Cáceres EN, Dehne F, Song SW. A parameterized parallel algorithm for efficient biological sequence comparison [Internet]. 2002 ;[citado 2024 nov. 13 ] Available from: https://repositorio.usp.br/directbitstream/98a6f33b-7458-44a1-acf7-c0398b22d3a1/1275100.pdf
Vancouver
Alves CER, Cáceres EN, Dehne F, Song SW. A parameterized parallel algorithm for efficient biological sequence comparison [Internet]. 2002 ;[citado 2024 nov. 13 ] Available from: https://repositorio.usp.br/directbitstream/98a6f33b-7458-44a1-acf7-c0398b22d3a1/1275100.pdf
Trabalho de evento
A CGM/BSP parallel similarity algorithm (2002)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Dehne, Frank; Song, Siang Wun
Source: Anais. Conference titles: Workshop Brasileiro de Bioinformática. 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 et al. A CGM/BSP parallel similarity algorithm. 2002, Anais.. Porto Alegre: II-UFRGS, 2002. . Acesso em: 13 nov. 2024.
APA
Alves, C. E. R., Cáceres, E. N., Dehne, F., & Song, S. W. (2002). A CGM/BSP parallel similarity algorithm. In Anais. Porto Alegre: II-UFRGS.
NLM
Alves CER, Cáceres EN, Dehne F, Song SW. A CGM/BSP parallel similarity algorithm. Anais. 2002 ;[citado 2024 nov. 13 ]
Vancouver
Alves CER, Cáceres EN, Dehne F, Song SW. A CGM/BSP parallel similarity algorithm. Anais. 2002 ;[citado 2024 nov. 13 ]
Trabalho de evento
Parallel dynamic programing for solving the string editing problem on a CGM/BSP (2002)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Dehne, Frank; Song, Siang Wun
Source: Proceedings. Conference titles: ACM Symposium on Parallelism in Algorithms and Architectures - SPAA. Unidade: IME
Subjects: ALGORITMOS, PROGRAMAÇÃO DINÂMICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues et al. Parallel dynamic programing for solving the string editing problem on a CGM/BSP. 2002, Anais.. New York: ACM, 2002. Disponível em: https://doi.org/10.1145/564870.564916. Acesso em: 13 nov. 2024.
APA
Alves, C. E. R., Cáceres, E. N., Dehne, F., & Song, S. W. (2002). Parallel dynamic programing for solving the string editing problem on a CGM/BSP. In Proceedings. New York: ACM. doi:10.1145/564870.564916
NLM
Alves CER, Cáceres EN, Dehne F, Song SW. Parallel dynamic programing for solving the string editing problem on a CGM/BSP [Internet]. Proceedings. 2002 ;[citado 2024 nov. 13 ] Available from: https://doi.org/10.1145/564870.564916
Vancouver
Alves CER, Cáceres EN, Dehne F, Song SW. Parallel dynamic programing for solving the string editing problem on a CGM/BSP [Internet]. Proceedings. 2002 ;[citado 2024 nov. 13 ] Available from: https://doi.org/10.1145/564870.564916
Trabalho de evento
Efficient parallel graph algorithms for coarse grained multicomputers and BSP (1997)
Cáceres, Edson Norberto ; Dehne, Frank; Ferreira, A; Flocchini, P; Rieping, I; Roncato, A; Santoro, N; Song, Siang Wun
Source: Proceedings. Conference titles: International Colloquium on Automata, Languages, and Programming - ICALP. 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. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. 1997, Anais.. Berlin: Springer, 1997. Disponível em: https://doi.org/10.1007/3-540-63165-8_195. Acesso em: 13 nov. 2024.
APA
Cáceres, E. N., Dehne, F., Ferreira, A., Flocchini, P., Rieping, I., Roncato, A., et al. (1997). Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proceedings. Berlin: Springer. doi:10.1007/3-540-63165-8_195
NLM
Cáceres EN, Dehne F, Ferreira A, Flocchini P, Rieping I, Roncato A, Santoro N, Song SW. Efficient parallel graph algorithms for coarse grained multicomputers and BSP [Internet]. Proceedings. 1997 ;[citado 2024 nov. 13 ] Available from: https://doi.org/10.1007/3-540-63165-8_195
Vancouver
Cáceres EN, Dehne F, Ferreira A, Flocchini P, Rieping I, Roncato A, Santoro N, Song SW. Efficient parallel graph algorithms for coarse grained multicomputers and BSP [Internet]. Proceedings. 1997 ;[citado 2024 nov. 13 ] Available from: https://doi.org/10.1007/3-540-63165-8_195

USP Schools

ReP

Filtros

Authors

Conference titles

Funding Agencies

Non normalized affiliation