ReP USP - Resultado da busca

Artigo de periodico
Measures of pseudorandomness for finite sequences: minimal values (2006)
Alon, Noga; Kohayakawa, Yoshiharu ; Mauduit, Caroline; Moreira, C. G; Rodl, M
Fonte: Combinatorics Probability & Computing. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALON, Noga et al. Measures of pseudorandomness for finite sequences: minimal values. Combinatorics Probability & Computing, v. 15, n. 1-2, p. 1-29, 2006Tradução . . Disponível em: https://doi.org/10.1017/S0963548305007170. Acesso em: 13 set. 2024.
APA
Alon, N., Kohayakawa, Y., Mauduit, C., Moreira, C. G., & Rodl, M. (2006). Measures of pseudorandomness for finite sequences: minimal values. Combinatorics Probability & Computing, 15( 1-2), 1-29. doi:10.1017/S0963548305007170
NLM
Alon N, Kohayakawa Y, Mauduit C, Moreira CG, Rodl M. Measures of pseudorandomness for finite sequences: minimal values [Internet]. Combinatorics Probability & Computing. 2006 ; 15( 1-2): 1-29.[citado 2024 set. 13 ] Available from: https://doi.org/10.1017/S0963548305007170
Vancouver
Alon N, Kohayakawa Y, Mauduit C, Moreira CG, Rodl M. Measures of pseudorandomness for finite sequences: minimal values [Internet]. Combinatorics Probability & Computing. 2006 ; 15( 1-2): 1-29.[citado 2024 set. 13 ] Available from: https://doi.org/10.1017/S0963548305007170
Relatorio tecnico
Entropia de grafos (2006)
Sato, Cristiane Maria; Kohayakawa, Yoshiharu
Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SATO, Cristiane Maria e KOHAYAKAWA, Yoshiharu. Entropia de grafos. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/4ba1deaf-bd6b-49aa-8606-8112b83cc881/2903329.pdf. Acesso em: 13 set. 2024. , 2006
APA
Sato, C. M., & Kohayakawa, Y. (2006). Entropia de grafos. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/4ba1deaf-bd6b-49aa-8606-8112b83cc881/2903329.pdf
NLM
Sato CM, Kohayakawa Y. Entropia de grafos [Internet]. 2006 ;[citado 2024 set. 13 ] Available from: https://repositorio.usp.br/directbitstream/4ba1deaf-bd6b-49aa-8606-8112b83cc881/2903329.pdf
Vancouver
Sato CM, Kohayakawa Y. Entropia de grafos [Internet]. 2006 ;[citado 2024 set. 13 ] Available from: https://repositorio.usp.br/directbitstream/4ba1deaf-bd6b-49aa-8606-8112b83cc881/2903329.pdf
Trabalho de evento
An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing (2006)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu
Fonte: Proceedings. Nome do evento: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos e KOHAYAKAWA, Yoshiharu. An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing. 2006, Anais.. Philadelphia: SIAM, 2006. Disponível em: https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672. Acesso em: 13 set. 2024.
APA
Dellamonica Junior, D., & Kohayakawa, Y. (2006). An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing. In Proceedings. Philadelphia: SIAM. Recuperado de https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672
NLM
Dellamonica Junior D, Kohayakawa Y. An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing [Internet]. Proceedings. 2006 ;[citado 2024 set. 13 ] Available from: https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672
Vancouver
Dellamonica Junior D, Kohayakawa Y. An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing [Internet]. Proceedings. 2006 ;[citado 2024 set. 13 ] Available from: https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672

Unidades USP

ReP

Filtros

Autores

Agência de fomento