ReP USP - Resultado da busca

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: 25 jul. 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 jul. 25 ]
Vancouver
Bollobás B, Kohayakawa Y. Hitting time of hamilton cycles in random bipartite graphs. Proceedings. 1991 ;[citado 2024 jul. 25 ]
Trabalho de evento
Graph theoretic approach for pla area optimization (1991)
Ferreira, Afonso Galvão; Song, Siang Wun
Source: Proceedings. Conference titles: Workshop on Applications of Combinatorial Optimization in Science and Technology. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Afonso Galvão e SONG, Siang Wun. Graph theoretic approach for pla area optimization. 1991, Anais.. Rutgers: Rutcor, 1991. . Acesso em: 25 jul. 2024.
APA
Ferreira, A. G., & Song, S. W. (1991). Graph theoretic approach for pla area optimization. In Proceedings. Rutgers: Rutcor.
NLM
Ferreira AG, Song SW. Graph theoretic approach for pla area optimization. Proceedings. 1991 ;[citado 2024 jul. 25 ]
Vancouver
Ferreira AG, Song SW. Graph theoretic approach for pla area optimization. Proceedings. 1991 ;[citado 2024 jul. 25 ]
Trabalho de evento
Nonlinear parity circuits and their cryptographic applications (1991)
Koyama, Kenji; Terada, Routo
Source: Proceedings. Conference titles: Conference on the Theory and Application of Cryptography - CRYPTO. Unidade: IME
Assunto: CRIPTOLOGIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOYAMA, Kenji e TERADA, Routo. Nonlinear parity circuits and their cryptographic applications. 1991, Anais.. Berlin: Springer, 1991. Disponível em: https://doi.org/10.1007/3-540-38424-3_41. Acesso em: 25 jul. 2024.
APA
Koyama, K., & Terada, R. (1991). Nonlinear parity circuits and their cryptographic applications. In Proceedings. Berlin: Springer. doi:10.1007/3-540-38424-3_41
NLM
Koyama K, Terada R. Nonlinear parity circuits and their cryptographic applications [Internet]. Proceedings. 1991 ;[citado 2024 jul. 25 ] Available from: https://doi.org/10.1007/3-540-38424-3_41
Vancouver
Koyama K, Terada R. Nonlinear parity circuits and their cryptographic applications [Internet]. Proceedings. 1991 ;[citado 2024 jul. 25 ] Available from: https://doi.org/10.1007/3-540-38424-3_41
Trabalho de evento
Graph theoretic approach for pla area optimization (1991)
Ferreira, Afonso Galvão; Song, Siang Wun
Source: Proceedings. Conference titles: Workshop on Applications of Combinatorial Optimization in Science and Technology. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Afonso Galvão e SONG, Siang Wun. Graph theoretic approach for pla area optimization. 1991, Anais.. Lyon: Instituto de Matemática e Estatística, Universidade de São Paulo, 1991. Disponível em: https://repositorio.usp.br/directbitstream/1fd4de11-d7ba-481e-8311-5e5bd0c2b2ba/813468.pdf. Acesso em: 25 jul. 2024.
APA
Ferreira, A. G., & Song, S. W. (1991). Graph theoretic approach for pla area optimization. In Proceedings. Lyon: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de https://repositorio.usp.br/directbitstream/1fd4de11-d7ba-481e-8311-5e5bd0c2b2ba/813468.pdf
NLM
Ferreira AG, Song SW. Graph theoretic approach for pla area optimization [Internet]. Proceedings. 1991 ;[citado 2024 jul. 25 ] Available from: https://repositorio.usp.br/directbitstream/1fd4de11-d7ba-481e-8311-5e5bd0c2b2ba/813468.pdf
Vancouver
Ferreira AG, Song SW. Graph theoretic approach for pla area optimization [Internet]. Proceedings. 1991 ;[citado 2024 jul. 25 ] Available from: https://repositorio.usp.br/directbitstream/1fd4de11-d7ba-481e-8311-5e5bd0c2b2ba/813468.pdf

USP Schools

ReP

Filtros

Authors