Menu

Filtros : "Israel" "IME-MAC" Removidos: "Cingapura" "EERP-ERP" "mg" "1959" "2010" Limpar

Filtros

Refine with date range

  • 1

1 - 13 (13 records)

  • Artigo de periodico

    Densities in large permutations and parameter testing (2017)

    Glebov, Roman; Hoppen, Carlos; Klimošová, Tereza; Kohayakawa, Yoshiharu ; Král, Daniel; Liu, Hong

    Source: European Journal of Combinatorics. Unidade: IME

    Subjects: DENSIDADE, PERMUTAÇÕES, TEOREMAS LIMITES

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

    • ABNT

      GLEBOV, Roman et al. Densities in large permutations and parameter testing. European Journal of Combinatorics, v. 60, n. 1, p. 89-99, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ejc.2016.09.006. Acesso em: 10 out. 2024.

    • APA

      Glebov, R., Hoppen, C., Klimošová, T., Kohayakawa, Y., Král, D., & Liu, H. (2017). Densities in large permutations and parameter testing. European Journal of Combinatorics, 60( 1), 89-99. doi:10.1016/j.ejc.2016.09.006

    • NLM

      Glebov R, Hoppen C, Klimošová T, Kohayakawa Y, Král D, Liu H. Densities in large permutations and parameter testing [Internet]. European Journal of Combinatorics. 2017 ; 60( 1): 89-99.[citado 2024 out. 10 ] Available from: https://doi.org/10.1016/j.ejc.2016.09.006

    • Vancouver

      Glebov R, Hoppen C, Klimošová T, Kohayakawa Y, Král D, Liu H. Densities in large permutations and parameter testing [Internet]. European Journal of Combinatorics. 2017 ; 60( 1): 89-99.[citado 2024 out. 10 ] Available from: https://doi.org/10.1016/j.ejc.2016.09.006

  • 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: 10 out. 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 out. 10 ] 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 out. 10 ] 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: 10 out. 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 out. 10 ] 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 out. 10 ] Available from: https://doi.org/10.1017/S0963548315000206

  • Relatorio tecnico

    A conceptual framework for software startup ecosystems: the case of Israel (2015)

    Kon, Fábio ; Cukier, Daniel; Melo, Claudia de Oliveira; Hazzan, Orit,; Yuklea, Harry

    Unidade: IME

    Subjects: CIÊNCIA DA COMPUTAÇÃO, EMPREENDEDORISMO, DESENVOLVIMENTO DE SOFTWARE

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

    • ABNT

      KON, Fábio et al. A conceptual framework for software startup ecosystems: the case of Israel. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/3275191a-a51f-46be-837e-f671f4ee1d9f/2708467.pdf. Acesso em: 10 out. 2024. , 2015

    • APA

      Kon, F., Cukier, D., Melo, C. de O., Hazzan, O., & Yuklea, H. (2015). A conceptual framework for software startup ecosystems: the case of Israel. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/3275191a-a51f-46be-837e-f671f4ee1d9f/2708467.pdf

    • NLM

      Kon F, Cukier D, Melo C de O, Hazzan O, Yuklea H. A conceptual framework for software startup ecosystems: the case of Israel [Internet]. 2015 ;[citado 2024 out. 10 ] Available from: https://repositorio.usp.br/directbitstream/3275191a-a51f-46be-837e-f671f4ee1d9f/2708467.pdf

    • Vancouver

      Kon F, Cukier D, Melo C de O, Hazzan O, Yuklea H. A conceptual framework for software startup ecosystems: the case of Israel [Internet]. 2015 ;[citado 2024 out. 10 ] Available from: https://repositorio.usp.br/directbitstream/3275191a-a51f-46be-837e-f671f4ee1d9f/2708467.pdf

  • Artigo de periodico

    Semantics and proof-theory of depth bounded Boolean logics (2013)

    D'Agostino, Marcello; Finger, Marcelo ; Gabbay, Dov

    Source: Theoretical Computer Science. Unidade: IME

    Assunto: LÓGICA MATEMÁTICA

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

    • ABNT

      D'AGOSTINO, Marcello e FINGER, Marcelo e GABBAY, Dov. Semantics and proof-theory of depth bounded Boolean logics. Theoretical Computer Science, v. 480, p. 43-68, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2013.02.014. Acesso em: 10 out. 2024.

    • APA

      D'Agostino, M., Finger, M., & Gabbay, D. (2013). Semantics and proof-theory of depth bounded Boolean logics. Theoretical Computer Science, 480, 43-68. doi:10.1016/j.tcs.2013.02.014

    • NLM

      D'Agostino M, Finger M, Gabbay D. Semantics and proof-theory of depth bounded Boolean logics [Internet]. Theoretical Computer Science. 2013 ; 480 43-68.[citado 2024 out. 10 ] Available from: https://doi.org/10.1016/j.tcs.2013.02.014

    • Vancouver

      D'Agostino M, Finger M, Gabbay D. Semantics and proof-theory of depth bounded Boolean logics [Internet]. Theoretical Computer Science. 2013 ; 480 43-68.[citado 2024 out. 10 ] Available from: https://doi.org/10.1016/j.tcs.2013.02.014

  • Artigo de periodico

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

    Chataigner, Frederic; Manic, Gerhard; Wakabayashi, Yoshiko ; Yuster, R

    Source: Discrete Applied Mathematics. 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

      CHATAIGNER, Frederic et al. Approximation algorithms and hardness results for the clique packing problem. Discrete Applied Mathematics, v. 157, n. 7, p. 1396-1406, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.dam.2008.10.017. Acesso em: 10 out. 2024.

    • APA

      Chataigner, F., Manic, G., Wakabayashi, Y., & Yuster, R. (2009). Approximation algorithms and hardness results for the clique packing problem. Discrete Applied Mathematics, 157( 7), 1396-1406. doi:10.1016/j.dam.2008.10.017

    • NLM

      Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Discrete Applied Mathematics. 2009 ; 157( 7): 1396-1406.[citado 2024 out. 10 ] Available from: https://doi.org/10.1016/j.dam.2008.10.017

    • Vancouver

      Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Discrete Applied Mathematics. 2009 ; 157( 7): 1396-1406.[citado 2024 out. 10 ] Available from: https://doi.org/10.1016/j.dam.2008.10.017

  • 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: 10 out. 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 out. 10 ] 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 out. 10 ] Available from: https://doi.org/10.1016/j.endm.2007.07.065

  • Artigo de periodico

    Nonmonotone projected gradient methods based on barrier and Euclidean distances (2007)

    Auslender, Alfred; Silva, Paulo J. S. ; Teboulle, Marc

    Source: Computational Optimization and Applications. Unidade: IME

    Subjects: OTIMIZAÇÃO RESTRITA, MÉTODOS NUMÉRICOS, OTIMIZAÇÃO CONVEXA, TEORIA ESPECTRAL

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

    • ABNT

      AUSLENDER, Alfred e SILVA, Paulo J. S. e TEBOULLE, Marc. Nonmonotone projected gradient methods based on barrier and Euclidean distances. Computational Optimization and Applications, v. 38, n. 3, p. 305-327, 2007Tradução . . Disponível em: https://doi.org/10.1007/s10589-007-9025-0. Acesso em: 10 out. 2024.

    • APA

      Auslender, A., Silva, P. J. S., & Teboulle, M. (2007). Nonmonotone projected gradient methods based on barrier and Euclidean distances. Computational Optimization and Applications, 38( 3), 305-327. doi:10.1007/s10589-007-9025-0

    • NLM

      Auslender A, Silva PJS, Teboulle M. Nonmonotone projected gradient methods based on barrier and Euclidean distances [Internet]. Computational Optimization and Applications. 2007 ; 38( 3): 305-327.[citado 2024 out. 10 ] Available from: https://doi.org/10.1007/s10589-007-9025-0

    • Vancouver

      Auslender A, Silva PJS, Teboulle M. Nonmonotone projected gradient methods based on barrier and Euclidean distances [Internet]. Computational Optimization and Applications. 2007 ; 38( 3): 305-327.[citado 2024 out. 10 ] Available from: https://doi.org/10.1007/s10589-007-9025-0

  • 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: 10 out. 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 out. 10 ] 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 out. 10 ] 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: 10 out. 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 out. 10 ] 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 out. 10 ] Available from: https://doi.org/10.1017/S0963548305007170

  • 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: 10 out. 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 out. 10 ] 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 out. 10 ] 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: 10 out. 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 out. 10 ] 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 out. 10 ] 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: 10 out. 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 out. 10 ] 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 out. 10 ] Available from: https://doi.org/10.1109/SFCS.2000.892007
  • 1

1 - 13 (13 records)

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