ReP USP - Resultado da busca

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
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: 14 nov. 2025.
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 2025 nov. 14 ] 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 2025 nov. 14 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20
Trabalho de evento
Measures of pseudorandomness for finite sequences: minimum and typical values (2003)
Kohayakawa, Yoshiharu ; Mauduit, Christian; Moreira, Carlos Gustavo Tamm de Araujo; Rodl, Vojtech
Source: Proceedings. Conference titles: International Conference on Combinatorics on Words. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. Measures of pseudorandomness for finite sequences: minimum and typical values. 2003, Anais.. Turku: University of Turku, 2003. . Acesso em: 14 nov. 2025.
APA
Kohayakawa, Y., Mauduit, C., Moreira, C. G. T. de A., & Rodl, V. (2003). Measures of pseudorandomness for finite sequences: minimum and typical values. In Proceedings. Turku: University of Turku.
NLM
Kohayakawa Y, Mauduit C, Moreira CGT de A, Rodl V. Measures of pseudorandomness for finite sequences: minimum and typical values. Proceedings. 2003 ;[citado 2025 nov. 14 ]
Vancouver
Kohayakawa Y, Mauduit C, Moreira CGT de A, Rodl V. Measures of pseudorandomness for finite sequences: minimum and typical values. Proceedings. 2003 ;[citado 2025 nov. 14 ]
Trabalho de evento
Efficient testing of hypergraphs (2002)
Kohayakawa, Yoshiharu ; Nagle, Brendan; Rodl, Vojtech
Source: Proceedings. Conference titles: Colloquium on Automata, Languages and Programming. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e NAGLE, Brendan e RODL, Vojtech. Efficient testing of hypergraphs. 2002, Anais.. Berlin: Springer, 2002. Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/3-540-45465-9_87. Acesso em: 14 nov. 2025.
APA
Kohayakawa, Y., Nagle, B., & Rodl, V. (2002). Efficient testing of hypergraphs. In Proceedings. Berlin: Springer. doi:10.1007/3-540-45465-9_87
NLM
Kohayakawa Y, Nagle B, Rodl V. Efficient testing of hypergraphs [Internet]. Proceedings. 2002 ;[citado 2025 nov. 14 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/3-540-45465-9_87
Vancouver
Kohayakawa Y, Nagle B, Rodl V. Efficient testing of hypergraphs [Internet]. Proceedings. 2002 ;[citado 2025 nov. 14 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/3-540-45465-9_87
Trabalho de evento
Equivalent conditions for regularity (2000)
Kohayakawa, Yoshiharu ; Rodl, Vojtech; Skokan, J.
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e RODL, Vojtech e SKOKAN, J. Equivalent conditions for regularity. 2000, Anais.. Berlin: Springer, 2000. Disponível em: https://doi.org/10.1007/10719839_5. Acesso em: 14 nov. 2025.
APA
Kohayakawa, Y., Rodl, V., & Skokan, J. (2000). Equivalent conditions for regularity. In Proceedings. Berlin: Springer. doi:10.1007/10719839_5
NLM
Kohayakawa Y, Rodl V, Skokan J. Equivalent conditions for regularity [Internet]. Proceedings. 2000 ;[citado 2025 nov. 14 ] Available from: https://doi.org/10.1007/10719839_5
Vancouver
Kohayakawa Y, Rodl V, Skokan J. Equivalent conditions for regularity [Internet]. Proceedings. 2000 ;[citado 2025 nov. 14 ] Available from: https://doi.org/10.1007/10719839_5
Trabalho de evento
Algorithmic aspects of regularity (2000)
Kohayakawa, Yoshiharu ; Rodl, Vojtech
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e RODL, Vojtech. Algorithmic aspects of regularity. 2000, Anais.. Berlin: Springer, 2000. Disponível em: https://doi.org/10.1007/10719839_1. Acesso em: 14 nov. 2025.
APA
Kohayakawa, Y., & Rodl, V. (2000). Algorithmic aspects of regularity. In Proceedings. Berlin: Springer. doi:10.1007/10719839_1
NLM
Kohayakawa Y, Rodl V. Algorithmic aspects of regularity [Internet]. Proceedings. 2000 ;[citado 2025 nov. 14 ] Available from: https://doi.org/10.1007/10719839_1
Vancouver
Kohayakawa Y, Rodl V. Algorithmic aspects of regularity [Internet]. Proceedings. 2000 ;[citado 2025 nov. 14 ] Available from: https://doi.org/10.1007/10719839_1

USP Schools

ReP

Filtros

Authors

Funding Agencies