ReP USP - Resultado da busca

Trabalho de evento
A canonical van der Waerden theorem in random sets (2024)
Alvarado Morales, José Diego ; Kohayakawa, Yoshiharu ; Morris, Patrick ; Mota, Guilherme Oliveira ; Ortega, Miquel
Source: Proceedings. Conference titles: Discrete Mathematics Days. Unidade: IME
Subjects: COMBINATÓRIA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVARADO MORALES, José Diego et al. A canonical van der Waerden theorem in random sets. 2024, Anais.. Alcalá de Henares: Universidad de Alcalá, 2024. Disponível em: https://dmd2024.web.uah.es/files/abstracts/paper_31.pdf. Acesso em: 15 out. 2024.
APA
Alvarado Morales, J. D., Kohayakawa, Y., Morris, P., Mota, G. O., & Ortega, M. (2024). A canonical van der Waerden theorem in random sets. In Proceedings. Alcalá de Henares: Universidad de Alcalá. Recuperado de https://dmd2024.web.uah.es/files/abstracts/paper_31.pdf
NLM
Alvarado Morales JD, Kohayakawa Y, Morris P, Mota GO, Ortega M. A canonical van der Waerden theorem in random sets [Internet]. Proceedings. 2024 ;[citado 2024 out. 15 ] Available from: https://dmd2024.web.uah.es/files/abstracts/paper_31.pdf
Vancouver
Alvarado Morales JD, Kohayakawa Y, Morris P, Mota GO, Ortega M. A canonical van der Waerden theorem in random sets [Internet]. Proceedings. 2024 ;[citado 2024 out. 15 ] Available from: https://dmd2024.web.uah.es/files/abstracts/paper_31.pdf
Trabalho de evento
Extremal and probabilistic results for order types (2019)
Han, Jie; Kohayakawa, Yoshiharu ; Sales, Marcelo T; Stagni, Henrique
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: COMBINATÓRIA PROBABILÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie et al. Extremal and probabilistic results for order types. 2019, Anais.. Philadelphia: SIAM, 2019. Disponível em: https://doi.org/10.1137/1.9781611975482.27. Acesso em: 15 out. 2024.
APA
Han, J., Kohayakawa, Y., Sales, M. T., & Stagni, H. (2019). Extremal and probabilistic results for order types. In Proceedings. Philadelphia: SIAM. doi:10.1137/1.9781611975482.27
NLM
Han J, Kohayakawa Y, Sales MT, Stagni H. Extremal and probabilistic results for order types [Internet]. Proceedings. 2019 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1137/1.9781611975482.27
Vancouver
Han J, Kohayakawa Y, Sales MT, Stagni H. Extremal and probabilistic results for order types [Internet]. Proceedings. 2019 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1137/1.9781611975482.27
Trabalho de evento
Property testing for point sets on the plane (2018)
Han, Jie; Kohayakawa, Yoshiharu ; Sales, Marcelo Tadeu; Stagni, Henrique
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN 2018. Unidade: IME
Assunto: MATEMÁTICA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie et al. Property testing for point sets on the plane. 2018, Anais.. Cham: Springer, 2018. Disponível em: https://doi.org/10.1007/978-3-319-77404-6_43. Acesso em: 15 out. 2024.
APA
Han, J., Kohayakawa, Y., Sales, M. T., & Stagni, H. (2018). Property testing for point sets on the plane. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-77404-6_43
NLM
Han J, Kohayakawa Y, Sales MT, Stagni H. Property testing for point sets on the plane [Internet]. Proceedings. 2018 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1007/978-3-319-77404-6_43
Vancouver
Han J, Kohayakawa Y, Sales MT, Stagni H. Property testing for point sets on the plane [Internet]. Proceedings. 2018 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1007/978-3-319-77404-6_43
Trabalho de evento
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game (2018)
Kohayakawa, Yoshiharu ; Miyazawa, Flávio Keidi; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN 2018. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS PARA PROCESSAMENTO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e MIYAZAWA, Flávio Keidi e WAKABAYASHI, Yoshiko. A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game. 2018, Anais.. Cham: Springer, 2018. Disponível em: https://doi.org/10.1007/978-3-319-77404-6_51. Acesso em: 15 out. 2024.
APA
Kohayakawa, Y., Miyazawa, F. K., & Wakabayashi, Y. (2018). A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-77404-6_51
NLM
Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game [Internet]. Proceedings. 2018 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1007/978-3-319-77404-6_51
Vancouver
Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game [Internet]. Proceedings. 2018 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1007/978-3-319-77404-6_51
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: 15 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. 15 ] 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. 15 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20
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
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: 15 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. 15 ] 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. 15 ] Available from: https://dl.acm.org/citation.cfm?id=1347168
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
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: 15 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. 15 ] 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. 15 ] Available from: https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672
Trabalho de evento
A practical minimal perfect hashing method (2005)
Botelho, C. Fabiano; Kohayakawa, Yoshiharu ; Ziviani, Nivio
Source: Proceedings. Conference titles: International Workshop on Experimental and Efficient Algorithms - WEA. 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
BOTELHO, C. Fabiano e KOHAYAKAWA, Yoshiharu e ZIVIANI, Nivio. A practical minimal perfect hashing method. 2005, Anais.. Berlin: Springer, 2005. Disponível em: https://doi.org/10.1007%2F11427186_42. Acesso em: 15 out. 2024.
APA
Botelho, C. F., Kohayakawa, Y., & Ziviani, N. (2005). A practical minimal perfect hashing method. In Proceedings. Berlin: Springer. doi:10.1007%2F11427186_42
NLM
Botelho CF, Kohayakawa Y, Ziviani N. A practical minimal perfect hashing method [Internet]. Proceedings. 2005 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1007%2F11427186_42
Vancouver
Botelho CF, Kohayakawa Y, Ziviani N. A practical minimal perfect hashing method [Internet]. Proceedings. 2005 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1007%2F11427186_42
Trabalho de evento
Querying priced information in databases: the conjunctive case: extended abstract (2004)
Laber, Eduardo Sany; Carmo, Renato José da Silva; Kohayakawa, Yoshiharu
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: TEORIA DA INFORMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LABER, Eduardo Sany e CARMO, Renato José da Silva e KOHAYAKAWA, Yoshiharu. Querying priced information in databases: the conjunctive case: extended abstract. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/978-3-540-24698-5_5. Acesso em: 15 out. 2024.
APA
Laber, E. S., Carmo, R. J. da S., & Kohayakawa, Y. (2004). Querying priced information in databases: the conjunctive case: extended abstract. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24698-5_5
NLM
Laber ES, Carmo RJ da S, Kohayakawa Y. Querying priced information in databases: the conjunctive case: extended abstract [Internet]. Proceedings. 2004 ;[citado 2024 out. 15 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/978-3-540-24698-5_5
Vancouver
Laber ES, Carmo RJ da S, Kohayakawa Y. Querying priced information in databases: the conjunctive case: extended abstract [Internet]. Proceedings. 2004 ;[citado 2024 out. 15 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/978-3-540-24698-5_5
Trabalho de evento-resumo
Advances in the regularity method (2004)
Kohayakawa, Yoshiharu
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: TEORIA DA INFORMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu. Advances in the regularity method. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24698-5_2. Acesso em: 15 out. 2024.
APA
Kohayakawa, Y. (2004). Advances in the regularity method. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24698-5_2
NLM
Kohayakawa Y. Advances in the regularity method [Internet]. Proceedings. 2004 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_2
Vancouver
Kohayakawa Y. Advances in the regularity method [Internet]. Proceedings. 2004 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_2
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: 15 out. 2024.
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 2024 out. 15 ]
Vancouver
Kohayakawa Y, Mauduit C, Moreira CGT de A, Rodl V. Measures of pseudorandomness for finite sequences: minimum and typical values. Proceedings. 2003 ;[citado 2024 out. 15 ]
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: 15 out. 2024.
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 2024 out. 15 ] 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 2024 out. 15 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/3-540-45465-9_87
Trabalho de evento-resumo
An optimal algorithm for checking regularity: (extended abstract) (2002)
Kohayakawa, Yoshiharu ; Rödl, Vojtěch; Thoma, Luboš
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. 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 RÖDL, Vojtěch e THOMA, Luboš. An optimal algorithm for checking regularity: (extended abstract). 2002, Anais.. Philadelphia: SIAM, 2002. Disponível em: https://dl.acm.org/doi/pdf/10.5555/545381.545418. Acesso em: 15 out. 2024.
APA
Kohayakawa, Y., Rödl, V., & Thoma, L. (2002). An optimal algorithm for checking regularity: (extended abstract). In Proceedings. Philadelphia: SIAM. Recuperado de https://dl.acm.org/doi/pdf/10.5555/545381.545418
NLM
Kohayakawa Y, Rödl V, Thoma L. An optimal algorithm for checking regularity: (extended abstract) [Internet]. Proceedings. 2002 ;[citado 2024 out. 15 ] Available from: https://dl.acm.org/doi/pdf/10.5555/545381.545418
Vancouver
Kohayakawa Y, Rödl V, Thoma L. An optimal algorithm for checking regularity: (extended abstract) [Internet]. Proceedings. 2002 ;[citado 2024 out. 15 ] Available from: https://dl.acm.org/doi/pdf/10.5555/545381.545418
Trabalho de evento
Searching in Random partially ordered sets (2002)
Carmo, Renato José da Silva; Donadelli Junior, Jair; Kohayakawa, Yoshiharu ; Laber, Eduardo Sany
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
CARMO, Renato José da Silva et al. Searching in Random partially ordered sets. 2002, Anais.. Berlin: Springer, 2002. Disponível em: https://doi.org/10.1007/3-540-45995-2_27. Acesso em: 15 out. 2024.
APA
Carmo, R. J. da S., Donadelli Junior, J., Kohayakawa, Y., & Laber, E. S. (2002). Searching in Random partially ordered sets. In Proceedings. Berlin: Springer. doi:10.1007/3-540-45995-2_27
NLM
Carmo RJ da S, Donadelli Junior J, Kohayakawa Y, Laber ES. Searching in Random partially ordered sets [Internet]. Proceedings. 2002 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1007/3-540-45995-2_27
Vancouver
Carmo RJ da S, Donadelli Junior J, Kohayakawa Y, Laber ES. Searching in Random partially ordered sets [Internet]. Proceedings. 2002 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1007/3-540-45995-2_27
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: 15 out. 2024.
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 2024 out. 15 ] Available from: https://doi.org/10.1007/10719839_5
Vancouver
Kohayakawa Y, Rodl V, Skokan J. Equivalent conditions for regularity [Internet]. Proceedings. 2000 ;[citado 2024 out. 15 ] 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: 15 out. 2024.
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 2024 out. 15 ] Available from: https://doi.org/10.1007/10719839_1
Vancouver
Kohayakawa Y, Rodl V. Algorithmic aspects of regularity [Internet]. Proceedings. 2000 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1007/10719839_1
Trabalho de evento
Finding skew partitions efficiently (2000)
Figueiredo, Celina Miraglia Herrera de; Klein, Sulamita; Kohayakawa, Yoshiharu ; Reed, Bruce A
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
FIGUEIREDO, Celina Miraglia Herrera de et al. Finding skew partitions efficiently. 2000, Anais.. Berlin: Springer, 2000. Disponível em: https://doi.org/10.1007/10719839_18. Acesso em: 15 out. 2024.
APA
Figueiredo, C. M. H. de, Klein, S., Kohayakawa, Y., & Reed, B. A. (2000). Finding skew partitions efficiently. In Proceedings. Berlin: Springer. doi:10.1007/10719839_18
NLM
Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Proceedings. 2000 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1007/10719839_18
Vancouver
Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Proceedings. 2000 ;[citado 2024 out. 15 ] Available from: https://doi.org/10.1007/10719839_18
Trabalho de evento
On the evolution of random boolean functions (1994)
Bollobás, Béla ; Kohayakawa, Yoshiharu ; Luczak, T
Source: Proceedings. Conference titles: Conference Extremal Problems for Finite Sets. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu e LUCZAK, T. On the evolution of random boolean functions. 1994, Anais.. Budapest: János Bolyai Mathematical Society, 1994. Disponível em: https://www.tib.eu/en/search/id/BLCP%3ACN015367308/On-the-evolution-of-Random-Boolean-Functions/. Acesso em: 15 out. 2024.
APA
Bollobás, B., Kohayakawa, Y., & Luczak, T. (1994). On the evolution of random boolean functions. In Proceedings. Budapest: János Bolyai Mathematical Society. Recuperado de https://www.tib.eu/en/search/id/BLCP%3ACN015367308/On-the-evolution-of-Random-Boolean-Functions/
NLM
Bollobás B, Kohayakawa Y, Luczak T. On the evolution of random boolean functions [Internet]. Proceedings. 1994 ;[citado 2024 out. 15 ] Available from: https://www.tib.eu/en/search/id/BLCP%3ACN015367308/On-the-evolution-of-Random-Boolean-Functions/
Vancouver
Bollobás B, Kohayakawa Y, Luczak T. On the evolution of random boolean functions [Internet]. Proceedings. 1994 ;[citado 2024 out. 15 ] Available from: https://www.tib.eu/en/search/id/BLCP%3ACN015367308/On-the-evolution-of-Random-Boolean-Functions/
Trabalho de evento
Hitting time of hamilton cycles in random bipartite graphs (1991)
Bollobás, Béla ; Kohayakawa, Yoshiharu
Source: Proceedings. Conference titles: International Conference in Graph Theory, Combinatorics, Algorithms and Applications. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu. Hitting time of hamilton cycles in random bipartite graphs. 1991, Anais.. Philadelphia: SIAM, 1991. . Acesso em: 15 out. 2024.
APA
Bollobás, B., & Kohayakawa, Y. (1991). Hitting time of hamilton cycles in random bipartite graphs. In Proceedings. Philadelphia: SIAM.
NLM
Bollobás B, Kohayakawa Y. Hitting time of hamilton cycles in random bipartite graphs. Proceedings. 1991 ;[citado 2024 out. 15 ]
Vancouver
Bollobás B, Kohayakawa Y. Hitting time of hamilton cycles in random bipartite graphs. Proceedings. 1991 ;[citado 2024 out. 15 ]

USP Schools

ReP

Filtros

Authors

Date published

Subjects

Conference titles

Countries/Territories

Funding Agencies

Non normalized affiliation