Menu

Filtros : "COMBINATÓRIA" "Israel" Removido: "mf" Limpar

Filtros

Refine with date range

  • 1

1 - 6 (6 records)

  • Artigo de periodico

    Counting contours on trees (2017)

    Alon, Noga; Bissacot, Rodrigo ; Endo, Eric Ossami

    Source: Letters in Mathematical Physics. Unidade: IME

    Subjects: GRAFOS ALEATÓRIOS, COMBINATÓRIA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      ALON, Noga e BISSACOT, Rodrigo e ENDO, Eric Ossami. Counting contours on trees. Letters in Mathematical Physics, v. 107, n. 5, p. 887-899, 2017Tradução . . Disponível em: https://doi.org/10.1007/s11005-016-0927-6. Acesso em: 20 ago. 2024.

    • APA

      Alon, N., Bissacot, R., & Endo, E. O. (2017). Counting contours on trees. Letters in Mathematical Physics, 107( 5), 887-899. doi:10.1007/s11005-016-0927-6

    • NLM

      Alon N, Bissacot R, Endo EO. Counting contours on trees [Internet]. Letters in Mathematical Physics. 2017 ; 107( 5): 887-899.[citado 2024 ago. 20 ] Available from: https://doi.org/10.1007/s11005-016-0927-6

    • Vancouver

      Alon N, Bissacot R, Endo EO. Counting contours on trees [Internet]. Letters in Mathematical Physics. 2017 ; 107( 5): 887-899.[citado 2024 ago. 20 ] Available from: https://doi.org/10.1007/s11005-016-0927-6

  • Artigo de periodico

    The number of B3-sets of a given cardinality (2016)

    Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Lee, Sang June; Rödl, Vojtěch; Samotij, Wojciech

    Source: Journal of Combinatorial Theory, Series A. Unidade: IME

    Subjects: ANÁLISE HARMÔNICA, SÉRIES, COMBINATÓRIA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      DELLAMONICA JUNIOR, Domingos et al. The number of B3-sets of a given cardinality. Journal of Combinatorial Theory, Series A, v. 142, p. 44-76, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.jcta.2016.03.004. Acesso em: 20 ago. 2024.

    • APA

      Dellamonica Junior, D., Kohayakawa, Y., Lee, S. J., Rödl, V., & Samotij, W. (2016). The number of B3-sets of a given cardinality. Journal of Combinatorial Theory, Series A, 142, 44-76. doi:10.1016/j.jcta.2016.03.004

    • NLM

      Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rödl V, Samotij W. The number of B3-sets of a given cardinality [Internet]. Journal of Combinatorial Theory, Series A. 2016 ; 142 44-76.[citado 2024 ago. 20 ] Available from: https://doi.org/10.1016/j.jcta.2016.03.004

    • Vancouver

      Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rödl V, Samotij W. The number of B3-sets of a given cardinality [Internet]. Journal of Combinatorial Theory, Series A. 2016 ; 142 44-76.[citado 2024 ago. 20 ] Available from: https://doi.org/10.1016/j.jcta.2016.03.004

  • Artigo de periodico

    On the number of Bh-Sets (2016)

    Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Lee, Sang June; Rodl, Vojtech; Samotij, Wojciech

    Source: Combinatorics, Probability & Computing. Unidade: IME

    Subjects: TEORIA DOS NÚMEROS, SEQUÊNCIAS, COMBINATÓRIA, MÉTODOS PROBABILÍSTICOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      DELLAMONICA JUNIOR, Domingos et al. On the number of Bh-Sets. Combinatorics, Probability & Computing, v. 25, n. Ja 2016, p. 108-129, 2016Tradução . . Disponível em: https://doi.org/10.1017/S0963548315000206. Acesso em: 20 ago. 2024.

    • APA

      Dellamonica Junior, D., Kohayakawa, Y., Lee, S. J., Rodl, V., & Samotij, W. (2016). On the number of Bh-Sets. Combinatorics, Probability & Computing, 25( Ja 2016), 108-129. doi:10.1017/S0963548315000206

    • NLM

      Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rodl V, Samotij W. On the number of Bh-Sets [Internet]. Combinatorics, Probability & Computing. 2016 ; 25( Ja 2016): 108-129.[citado 2024 ago. 20 ] Available from: https://doi.org/10.1017/S0963548315000206

    • Vancouver

      Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rodl V, Samotij W. On the number of Bh-Sets [Internet]. Combinatorics, Probability & Computing. 2016 ; 25( Ja 2016): 108-129.[citado 2024 ago. 20 ] Available from: https://doi.org/10.1017/S0963548315000206

  • Trabalho de evento-anais periodico

    Approximation algorithms and hardness results for the clique packing problem (2007)

    Chataigner, Frederic; Manic, Gordana; Wakabayashi, Yoshiko ; Yuster, Raphael

    Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA, ALGORITMOS DE APROXIMAÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      CHATAIGNER, Frederic et al. Approximation algorithms and hardness results for the clique packing problem. 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.2007.07.065. Acesso em: 20 ago. 2024. , 2007

    • APA

      Chataigner, F., Manic, G., Wakabayashi, Y., & Yuster, R. (2007). Approximation algorithms and hardness results for the clique packing problem. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2007.07.065

    • NLM

      Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Electronic Notes in Discrete Mathematics. 2007 ; 29 397-401.[citado 2024 ago. 20 ] Available from: https://doi.org/10.1016/j.endm.2007.07.065

    • Vancouver

      Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Electronic Notes in Discrete Mathematics. 2007 ; 29 397-401.[citado 2024 ago. 20 ] Available from: https://doi.org/10.1016/j.endm.2007.07.065

  • Artigo de periodico

    Measures of pseudorandomness for finite sequences: typical values (2007)

    Alon, Noga; Kohayakawa, Yoshiharu ; Mauduit, Christian; Moreira, Carlos Gustavo; Rodl, Vojtech

    Source: Proceedings of the London Mathematical Society. Unidade: IME

    Subjects: CIÊNCIA DA COMPUTAÇÃO, MATEMÁTICA DISCRETA, COMBINATÓRIA

    Acesso à fonteDOIHow to cite
    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: typical values. Proceedings of the London Mathematical Society, v. 95, n. 3, p. 778-812, 2007Tradução . . Disponível em: https://doi.org/10.1112/plms/pdm027. Acesso em: 20 ago. 2024.

    • APA

      Alon, N., Kohayakawa, Y., Mauduit, C., Moreira, C. G., & Rodl, V. (2007). Measures of pseudorandomness for finite sequences: typical values. Proceedings of the London Mathematical Society, 95( 3), 778-812. doi:10.1112/plms/pdm027

    • NLM

      Alon N, Kohayakawa Y, Mauduit C, Moreira CG, Rodl V. Measures of pseudorandomness for finite sequences: typical values [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 778-812.[citado 2024 ago. 20 ] Available from: https://doi.org/10.1112/plms/pdm027

    • Vancouver

      Alon N, Kohayakawa Y, Mauduit C, Moreira CG, Rodl V. Measures of pseudorandomness for finite sequences: typical values [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 778-812.[citado 2024 ago. 20 ] Available from: https://doi.org/10.1112/plms/pdm027

  • Artigo de periodico

    Measures of pseudorandomness for finite sequences: minimal values (2006)

    Alon, Noga; Kohayakawa, Yoshiharu ; Mauduit, Caroline; Moreira, C. G; Rodl, M

    Source: Combinatorics Probability & Computing. Unidade: IME

    Assunto: COMBINATÓRIA

    Acesso à fonteDOIHow to cite
    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: 20 ago. 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 ago. 20 ] 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 ago. 20 ] Available from: https://doi.org/10.1017/S0963548305007170
  • 1

1 - 6 (6 records)

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024