We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio] (2019)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- DOI: 10.1016/j.entcs.2019.08.001
- Assunto: TEORIA DOS GRAFOS
- Language: Inglês
- Imprenta:
- Source:
- Título: Electronic Notes in Theoretical Computer Science
- ISSN: 1571-0661
- Volume/Número/Paginação/Ano: v. 346, p.1-2, 2019
- Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS
- Este periódico é de acesso aberto
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: gold
- Licença: cc-by-nc-nd
-
ABNT
We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio]. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.entcs.2019.08.001. Acesso em: 02 out. 2024. , 2019 -
APA
We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio]. (2019). We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio]. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.entcs.2019.08.001 -
NLM
We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio] [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 1-2.[citado 2024 out. 02 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.001 -
Vancouver
We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio] [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 1-2.[citado 2024 out. 02 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.001 - A practical minimal perfect hashing method
- Evolution of random subgraphs of the cube
- On Richardson's model on the hypercube
- The Turan theorem for random graphs
- Embedding graphs with bounded degree in sparse pseudorandom graphs
- Universality and tolerance
- Hereditary properties of triple systems
- An optimal algorithm for checking regularity
- Searching in Random partially ordered sets
- Discrepancy and eigenvalues of Cayley graphs
Informações sobre o DOI: 10.1016/j.entcs.2019.08.001 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 3000163.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
