Menu

Filtros : "Polônia" "Rodl, Vojtech" Removidos: "1967" "2022" "Folha de São Paulo" "Roca" Limpar

Filtros

Refine with date range

  • 1

1 - 5 (5 records)

  • Artigo de periodico

    Ramsey games against a one-armed bandit (2003)

    Friedgut, Ehud; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej; Tetali, Prasad

    Source: Combinatorics, Probability & Computing. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      FRIEDGUT, Ehud et al. Ramsey games against a one-armed bandit. Combinatorics, Probability & Computing, v. 12, n. 5-6, p. 515-545, 2003Tradução . . Disponível em: https://doi.org/10.1017/S0963548303005881. Acesso em: 18 nov. 2024.

    • APA

      Friedgut, E., Kohayakawa, Y., Rodl, V., Rucinski, A., & Tetali, P. (2003). Ramsey games against a one-armed bandit. Combinatorics, Probability & Computing, 12( 5-6), 515-545. doi:10.1017/S0963548303005881

    • NLM

      Friedgut E, Kohayakawa Y, Rodl V, Rucinski A, Tetali P. Ramsey games against a one-armed bandit [Internet]. Combinatorics, Probability & Computing. 2003 ; 12( 5-6): 515-545.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1017/S0963548303005881

    • Vancouver

      Friedgut E, Kohayakawa Y, Rodl V, Rucinski A, Tetali P. Ramsey games against a one-armed bandit [Internet]. Combinatorics, Probability & Computing. 2003 ; 12( 5-6): 515-545.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1017/S0963548303005881

  • Trabalho de evento

    Near-optimum universal graphs for graphs with bounded degrees (2001)

    Alon, Noga; Capalbo, Michael; Wakabayashi, Yoshiko ; Rodl, Vojtech; Rucinski, Andrzej; Szemerédi, Endre

    Source: Proceedings. Conference titles: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems - APPROX 2001. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    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. Near-optimum universal graphs for graphs with bounded degrees. 2001, Anais.. Berlin: Springer, 2001. Disponível em: https://doi.org/10.1007/3-540-44666-4_20. Acesso em: 18 nov. 2024.

    • APA

      Alon, N., Capalbo, M., Wakabayashi, Y., Rodl, V., Rucinski, A., & Szemerédi, E. (2001). Near-optimum universal graphs for graphs with bounded degrees. In Proceedings. Berlin: Springer. doi:10.1007/3-540-44666-4_20

    • NLM

      Alon N, Capalbo M, Wakabayashi Y, Rodl V, Rucinski A, Szemerédi E. Near-optimum universal graphs for graphs with bounded degrees [Internet]. Proceedings. 2001 ;[citado 2024 nov. 18 ] Available from: https://doi.org/10.1007/3-540-44666-4_20

    • Vancouver

      Alon N, Capalbo M, Wakabayashi Y, Rodl V, Rucinski A, Szemerédi E. Near-optimum universal graphs for graphs with bounded degrees [Internet]. Proceedings. 2001 ;[citado 2024 nov. 18 ] Available from: https://doi.org/10.1007/3-540-44666-4_20

  • Trabalho de evento

    Universality and tolerance (2000)

    Alon, Noga; Capalbo, Michael; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Ruciânski, Andrzej; Szemerédi, Endre

    Conference titles: Annual Symposium on Foundations of Computer Science. Unidade: IME

    Assunto: COMPUTAÇÃO GRÁFICA

    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. Universality and tolerance. 2000, Anais.. Los alamitos: IEEE Computer Society, 2000. Disponível em: https://doi.org/10.1109/SFCS.2000.892007. Acesso em: 18 nov. 2024.

    • APA

      Alon, N., Capalbo, M., Kohayakawa, Y., Rodl, V., Ruciânski, A., & Szemerédi, E. (2000). Universality and tolerance. In . Los alamitos: IEEE Computer Society. doi:10.1109/SFCS.2000.892007

    • NLM

      Alon N, Capalbo M, Kohayakawa Y, Rodl V, Ruciânski A, Szemerédi E. Universality and tolerance [Internet]. 2000 ;[citado 2024 nov. 18 ] Available from: https://doi.org/10.1109/SFCS.2000.892007

    • Vancouver

      Alon N, Capalbo M, Kohayakawa Y, Rodl V, Ruciânski A, Szemerédi E. Universality and tolerance [Internet]. 2000 ;[citado 2024 nov. 18 ] Available from: https://doi.org/10.1109/SFCS.2000.892007

  • Artigo de periodico

    On K4-free subgraphs of random graphs (1997)

    Kohayakawa, Yoshiharu ; Luczak, Tomasz; Rodl, Vojtech

    Source: Combinatorica. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz e RODL, Vojtech. On K4-free subgraphs of random graphs. Combinatorica, v. 17, n. 2, p. 173-213, 1997Tradução . . Disponível em: https://doi.org/10.1007/BF01200906. Acesso em: 18 nov. 2024.

    • APA

      Kohayakawa, Y., Luczak, T., & Rodl, V. (1997). On K4-free subgraphs of random graphs. Combinatorica, 17( 2), 173-213. doi:10.1007/BF01200906

    • NLM

      Kohayakawa Y, Luczak T, Rodl V. On K4-free subgraphs of random graphs [Internet]. Combinatorica. 1997 ; 17( 2): 173-213.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1007/BF01200906

    • Vancouver

      Kohayakawa Y, Luczak T, Rodl V. On K4-free subgraphs of random graphs [Internet]. Combinatorica. 1997 ; 17( 2): 173-213.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1007/BF01200906

  • Artigo de periodico

    Arithmetic progressions of length three in subsets of a random set (1996)

    Kohayakawa, Yoshiharu ; Luczak, Tomasz; Rodl, Vojtech

    Source: Acta Arithmetica. Unidade: IME

    Subjects: TEORIA DOS NÚMEROS, COMBINATÓRIA, TEORIA DOS GRAFOS, TEORIA DA PROBABILIDADE, PROCESSOS ESTOCÁSTICOS

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

    • ABNT

      KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz e RODL, Vojtech. Arithmetic progressions of length three in subsets of a random set. Acta Arithmetica, v. 75, n. 2, p. 133-163, 1996Tradução . . Disponível em: https://doi.org/10.4064/aa-75-2-133-163. Acesso em: 18 nov. 2024.

    • APA

      Kohayakawa, Y., Luczak, T., & Rodl, V. (1996). Arithmetic progressions of length three in subsets of a random set. Acta Arithmetica, 75( 2), 133-163. doi:10.4064/aa-75-2-133-163

    • NLM

      Kohayakawa Y, Luczak T, Rodl V. Arithmetic progressions of length three in subsets of a random set [Internet]. Acta Arithmetica. 1996 ; 75( 2): 133-163.[citado 2024 nov. 18 ] Available from: https://doi.org/10.4064/aa-75-2-133-163

    • Vancouver

      Kohayakawa Y, Luczak T, Rodl V. Arithmetic progressions of length three in subsets of a random set [Internet]. Acta Arithmetica. 1996 ; 75( 2): 133-163.[citado 2024 nov. 18 ] Available from: https://doi.org/10.4064/aa-75-2-133-163
  • 1

1 - 5 (5 records)

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