ReP USP - Resultado da busca

Trabalho de evento
Wise toolkit: enabling microservice-based system performance experiments (2020)
Lima, Rodrigo Alves; Kimball, Joshua; Ferreira, João Eduardo ; Pu, Calton
Source: Proceedings. Conference titles: International Conference on Cloud Computing - CLOUD. Unidade: IME
Assunto: COMPUTAÇÃO EM NUVEM
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LIMA, Rodrigo Alves et al. Wise toolkit: enabling microservice-based system performance experiments. 2020, Anais.. Cham: Springer, 2020. Disponível em: https://doi.org/10.1007/978-3-030-59635-4_11. Acesso em: 16 set. 2024.
APA
Lima, R. A., Kimball, J., Ferreira, J. E., & Pu, C. (2020). Wise toolkit: enabling microservice-based system performance experiments. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-59635-4_11
NLM
Lima RA, Kimball J, Ferreira JE, Pu C. Wise toolkit: enabling microservice-based system performance experiments [Internet]. Proceedings. 2020 ;[citado 2024 set. 16 ] Available from: https://doi.org/10.1007/978-3-030-59635-4_11
Vancouver
Lima RA, Kimball J, Ferreira JE, Pu C. Wise toolkit: enabling microservice-based system performance experiments [Internet]. Proceedings. 2020 ;[citado 2024 set. 16 ] Available from: https://doi.org/10.1007/978-3-030-59635-4_11
Parte de monografia/livro
A note on Blackwell sufficiency and a Skibinsky characterization of distributions (2011)
Basu, Debabrata; Pereira, Carlos Alberto de Bragança
Source: Selected works of Debabrata Basu. Unidade: IME
Subjects: ESTATÍSTICA SUFICIENTE, DISTRIBUIÇÕES (PROBABILIDADE)
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BASU, Debabrata e PEREIRA, Carlos Alberto de Bragança. A note on Blackwell sufficiency and a Skibinsky characterization of distributions. Selected works of Debabrata Basu. Tradução . New York: Springer, 2011. . Disponível em: https://doi.org/10.1007/978-1-4419-5825-9_33. Acesso em: 16 set. 2024.
APA
Basu, D., & Pereira, C. A. de B. (2011). A note on Blackwell sufficiency and a Skibinsky characterization of distributions. In Selected works of Debabrata Basu. New York: Springer. doi:10.1007/978-1-4419-5825-9_33
NLM
Basu D, Pereira CA de B. A note on Blackwell sufficiency and a Skibinsky characterization of distributions [Internet]. In: Selected works of Debabrata Basu. New York: Springer; 2011. [citado 2024 set. 16 ] Available from: https://doi.org/10.1007/978-1-4419-5825-9_33
Vancouver
Basu D, Pereira CA de B. A note on Blackwell sufficiency and a Skibinsky characterization of distributions [Internet]. In: Selected works of Debabrata Basu. New York: Springer; 2011. [citado 2024 set. 16 ] Available from: https://doi.org/10.1007/978-1-4419-5825-9_33
Parte de monografia/livro
Conditional independence in statistics (2011)
Basu, D; Pereira, Carlos Alberto de Bragança
Source: Selected works of Debabrata Basu. Unidade: IME
Subjects: ESTATÍSTICA SUFICIENTE, MEDIDA E INTEGRAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BASU, D e PEREIRA, Carlos Alberto de Bragança. Conditional independence in statistics. Selected works of Debabrata Basu. Tradução . New York: Springer, 2011. . Disponível em: https://doi.org/10.1007/978-1-4419-5825-9_32. Acesso em: 16 set. 2024.
APA
Basu, D., & Pereira, C. A. de B. (2011). Conditional independence in statistics. In Selected works of Debabrata Basu. New York: Springer. doi:10.1007/978-1-4419-5825-9_32
NLM
Basu D, Pereira CA de B. Conditional independence in statistics [Internet]. In: Selected works of Debabrata Basu. New York: Springer; 2011. [citado 2024 set. 16 ] Available from: https://doi.org/10.1007/978-1-4419-5825-9_32
Vancouver
Basu D, Pereira CA de B. Conditional independence in statistics [Internet]. In: Selected works of Debabrata Basu. New York: Springer; 2011. [citado 2024 set. 16 ] Available from: https://doi.org/10.1007/978-1-4419-5825-9_32
Parte de monografia/livro
On the triangle removal lemma for subgraphs of sparse pseudorandom graphs (2010)
Kohayakawa, Yoshiharu ; RÖdlt, VojtĚch; Schacht, Mathias; Skokan, Jozef
Source: An irregular mind. Unidade: IME
Subjects: MÉTODOS PROBABILÍSTICOS, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. An irregular mind. Tradução . Berlin: Springer, 2010. . Disponível em: https://doi.org/10.1007/978-3-642-14444-8_10. Acesso em: 16 set. 2024.
APA
Kohayakawa, Y., RÖdlt, V. Ě., Schacht, M., & Skokan, J. (2010). On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. In An irregular mind. Berlin: Springer. doi:10.1007/978-3-642-14444-8_10
NLM
Kohayakawa Y, RÖdlt VĚ, Schacht M, Skokan J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs [Internet]. In: An irregular mind. Berlin: Springer; 2010. [citado 2024 set. 16 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10
Vancouver
Kohayakawa Y, RÖdlt VĚ, Schacht M, Skokan J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs [Internet]. In: An irregular mind. Berlin: Springer; 2010. [citado 2024 set. 16 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10
Parte de monografia/livro
Szemerédi's regularity lemma and quasi-randominess (2003)
Kohayakawa, Yoshiharu ; RÖdlt, VojtĚch
Source: Recent advances in algorithms and combinatorics. 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ÖDLT, VojtĚch. Szemerédi's regularity lemma and quasi-randominess. Recent advances in algorithms and combinatorics. Tradução . New York: Springer, 2003. . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/0-387-22444-0_9. Acesso em: 16 set. 2024.
APA
Kohayakawa, Y., & RÖdlt, V. Ě. (2003). Szemerédi's regularity lemma and quasi-randominess. In Recent advances in algorithms and combinatorics. New York: Springer. doi:10.1007/0-387-22444-0_9
NLM
Kohayakawa Y, RÖdlt VĚ. Szemerédi's regularity lemma and quasi-randominess [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 set. 16 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/0-387-22444-0_9
Vancouver
Kohayakawa Y, RÖdlt VĚ. Szemerédi's regularity lemma and quasi-randominess [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 set. 16 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/0-387-22444-0_9
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: 16 set. 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 set. 16 ] 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 set. 16 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/3-540-45465-9_87

USP Schools

ReP

Filtros

Authors

Subjects

Funding Agencies

Non normalized affiliation