Menu

Filtros : "Dellamonica Junior, Domingos" Limpar

Filtros

Refine with date range

  • 1

1 - 11 (11 records)

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

  • Artigo de periodico

    An improved upper bound on the density of universal random graphs (2015)

    Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej

    Source: Random Structures & Algorithms. Unidade: IME

    Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS

    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. An improved upper bound on the density of universal random graphs. Random Structures & Algorithms, v. 46, n. 2, p. 274-299, 2015Tradução . . Disponível em: https://doi.org/10.1002/rsa.20545. Acesso em: 03 out. 2024.

    • APA

      Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2015). An improved upper bound on the density of universal random graphs. Random Structures & Algorithms, 46( 2), 274-299. doi:10.1002/rsa.20545

    • NLM

      Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Random Structures & Algorithms. 2015 ; 46( 2): 274-299.[citado 2024 out. 03 ] Available from: https://doi.org/10.1002/rsa.20545

    • Vancouver

      Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Random Structures & Algorithms. 2015 ; 46( 2): 274-299.[citado 2024 out. 03 ] Available from: https://doi.org/10.1002/rsa.20545

  • Trabalho de evento

    An improved upper bound on the density of universal random graphs (2012)

    Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej

    Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. 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

      DELLAMONICA JUNIOR, Domingos et al. An improved upper bound on the density of universal random graphs. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-29344-3_20. Acesso em: 03 out. 2024.

    • APA

      Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2012). An improved upper bound on the density of universal random graphs. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-29344-3_20

    • NLM

      Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2024 out. 03 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20

    • Vancouver

      Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2024 out. 03 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20

  • Artigo de periodico

    Universality of random graphs (2012)

    Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej

    Source: SIAM Journal on Discrete Mathematics. Unidade: IME

    Assunto: GRAFOS ALEATÓRIOS

    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. Universality of random graphs. SIAM Journal on Discrete Mathematics, v. 26, n. 1, p. 353-374, 2012Tradução . . Disponível em: https://doi.org/10.1137/10079882X. Acesso em: 03 out. 2024.

    • APA

      Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2012). Universality of random graphs. SIAM Journal on Discrete Mathematics, 26( 1), 353-374. doi:10.1137/10079882X

    • NLM

      Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. Universality of random graphs [Internet]. SIAM Journal on Discrete Mathematics. 2012 ; 26( 1): 353-374.[citado 2024 out. 03 ] Available from: https://doi.org/10.1137/10079882X

    • Vancouver

      Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. Universality of random graphs [Internet]. SIAM Journal on Discrete Mathematics. 2012 ; 26( 1): 353-374.[citado 2024 out. 03 ] Available from: https://doi.org/10.1137/10079882X

  • Artigo de periodico

    On the resilience of long cycles in random graphs (2008)

    Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Marciniszyn, Martin; Steger, Angelika

    Source: Electronic Journal of Combinatorics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Acesso à fonteHow 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 resilience of long cycles in random graphs. Electronic Journal of Combinatorics, v. 15, n. 1, p. 1-26, 2008Tradução . . Disponível em: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r32. Acesso em: 03 out. 2024.

    • APA

      Dellamonica Junior, D., Kohayakawa, Y., Marciniszyn, M., & Steger, A. (2008). On the resilience of long cycles in random graphs. Electronic Journal of Combinatorics, 15( 1), 1-26. Recuperado de https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r32

    • NLM

      Dellamonica Junior D, Kohayakawa Y, Marciniszyn M, Steger A. On the resilience of long cycles in random graphs [Internet]. Electronic Journal of Combinatorics. 2008 ; 15( 1): 1-26.[citado 2024 out. 03 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r32

    • Vancouver

      Dellamonica Junior D, Kohayakawa Y, Marciniszyn M, Steger A. On the resilience of long cycles in random graphs [Internet]. Electronic Journal of Combinatorics. 2008 ; 15( 1): 1-26.[citado 2024 out. 03 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r32

  • Trabalho de evento

    Universality of random graphs (2008)

    Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; RÖdlt, VojtĚch; Ruciński, Andrzej

    Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      DELLAMONICA JUNIOR, Domingos et al. Universality of random graphs. 2008, Anais.. Philadelphia: SIAM, 2008. Disponível em: https://dl.acm.org/citation.cfm?id=1347168. Acesso em: 03 out. 2024.

    • APA

      Dellamonica Junior, D., Kohayakawa, Y., RÖdlt, V. Ě., & Ruciński, A. (2008). Universality of random graphs. In Proceedings. Philadelphia: SIAM. Recuperado de https://dl.acm.org/citation.cfm?id=1347168

    • NLM

      Dellamonica Junior D, Kohayakawa Y, RÖdlt VĚ, Ruciński A. Universality of random graphs [Internet]. Proceedings. 2008 ;[citado 2024 out. 03 ] Available from: https://dl.acm.org/citation.cfm?id=1347168

    • Vancouver

      Dellamonica Junior D, Kohayakawa Y, RÖdlt VĚ, Ruciński A. Universality of random graphs [Internet]. Proceedings. 2008 ;[citado 2024 out. 03 ] Available from: https://dl.acm.org/citation.cfm?id=1347168

  • Artigo de periodico

    An algorithmic Friedman-Pippenger theorem on tree embeddings and applications (2008)

    Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu

    Source: The Electronic Journal of Combinatorics. Unidade: IME

    Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS

    Acesso à fonteHow to cite
    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. The Electronic Journal of Combinatorics, v. 15, p. 1-15, 2008Tradução . . Disponível em: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r127. Acesso em: 03 out. 2024.

    • APA

      Dellamonica Junior, D., & Kohayakawa, Y. (2008). An algorithmic Friedman-Pippenger theorem on tree embeddings and applications. The Electronic Journal of Combinatorics, 15, 1-15. Recuperado de https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r127

    • NLM

      Dellamonica Junior D, Kohayakawa Y. An algorithmic Friedman-Pippenger theorem on tree embeddings and applications [Internet]. The Electronic Journal of Combinatorics. 2008 ; 15 1-15.[citado 2024 out. 03 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r127

    • Vancouver

      Dellamonica Junior D, Kohayakawa Y. An algorithmic Friedman-Pippenger theorem on tree embeddings and applications [Internet]. The Electronic Journal of Combinatorics. 2008 ; 15 1-15.[citado 2024 out. 03 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r127

  • Dissertação (Mestrado)

    Extração de aleatoriedade a partir de fontes defeituosas (2007)

    Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu (Orientador)

    Unidade: IME

    Assunto: COMPUTABILIDADE E COMPLEXIDADE

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

    • ABNT

      DELLAMONICA JUNIOR, Domingos. Extração de aleatoriedade a partir de fontes defeituosas. 2007. Dissertação (Mestrado) – Universidade de São Paulo, São Paulo, 2007. Disponível em: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-04052007-160412/. Acesso em: 03 out. 2024.

    • APA

      Dellamonica Junior, D. (2007). Extração de aleatoriedade a partir de fontes defeituosas (Dissertação (Mestrado). Universidade de São Paulo, São Paulo. Recuperado de http://www.teses.usp.br/teses/disponiveis/45/45134/tde-04052007-160412/

    • NLM

      Dellamonica Junior D. Extração de aleatoriedade a partir de fontes defeituosas [Internet]. 2007 ;[citado 2024 out. 03 ] Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-04052007-160412/

    • Vancouver

      Dellamonica Junior D. Extração de aleatoriedade a partir de fontes defeituosas [Internet]. 2007 ;[citado 2024 out. 03 ] Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-04052007-160412/

  • Artigo de periodico

    An exact algorithm for optimal MAE stack filter design (2007)

    Dellamonica Junior, Domingos; Silva, Paulo J. S. ; Humes Júnior, Carlos; Hirata, Nina Sumiko Tomita ; Barrera, Júnior

    Source: IEEE Transactions on image Processing. Unidade: IME

    Assunto: PROCESSAMENTO DE IMAGENS

    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. An exact algorithm for optimal MAE stack filter design. IEEE Transactions on image Processing, v. 16, n. 2, p. 453-462, 2007Tradução . . Disponível em: https://doi.org/10.1109/TIP.2006.888358. Acesso em: 03 out. 2024.

    • APA

      Dellamonica Junior, D., Silva, P. J. S., Humes Júnior, C., Hirata, N. S. T., & Barrera, J. (2007). An exact algorithm for optimal MAE stack filter design. IEEE Transactions on image Processing, 16( 2), 453-462. doi:10.1109/TIP.2006.888358

    • NLM

      Dellamonica Junior D, Silva PJS, Humes Júnior C, Hirata NST, Barrera J. An exact algorithm for optimal MAE stack filter design [Internet]. IEEE Transactions on image Processing. 2007 ; 16( 2): 453-462.[citado 2024 out. 03 ] Available from: https://doi.org/10.1109/TIP.2006.888358

    • Vancouver

      Dellamonica Junior D, Silva PJS, Humes Júnior C, Hirata NST, Barrera J. An exact algorithm for optimal MAE stack filter design [Internet]. IEEE Transactions on image Processing. 2007 ; 16( 2): 453-462.[citado 2024 out. 03 ] Available from: https://doi.org/10.1109/TIP.2006.888358

  • Trabalho de evento

    An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing (2006)

    Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu

    Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Acesso à fonteHow to cite
    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: 03 out. 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 out. 03 ] 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 out. 03 ] Available from: https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672
  • 1

1 - 11 (11 records)

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