Property testing and parameter testing for permutations (2010)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- Assunto: ALGORITMOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: ACM-SIAM
- Publisher place: Philadelphia
- Date published: 2010
- Source:
- Título: proceedings
- Conference titles: SODA10: ACM-SIAM Symposium on Discrete Algorithms
-
ABNT
HOPPEN, Carlos et al. Property testing and parameter testing for permutations. 2010, Anais.. Philadelphia: ACM-SIAM, 2010. Disponível em: https://dl.acm.org/citation.cfm?id=1873608. Acesso em: 28 fev. 2026. -
APA
Hoppen, C., Kohayakawa, Y., Moreira, C. G., & Sampaio, R. M. (2010). Property testing and parameter testing for permutations. In proceedings. Philadelphia: ACM-SIAM. Recuperado de https://dl.acm.org/citation.cfm?id=1873608 -
NLM
Hoppen C, Kohayakawa Y, Moreira CG, Sampaio RM. Property testing and parameter testing for permutations [Internet]. proceedings. 2010 ;[citado 2026 fev. 28 ] Available from: https://dl.acm.org/citation.cfm?id=1873608 -
Vancouver
Hoppen C, Kohayakawa Y, Moreira CG, Sampaio RM. Property testing and parameter testing for permutations [Internet]. proceedings. 2010 ;[citado 2026 fev. 28 ] Available from: https://dl.acm.org/citation.cfm?id=1873608 - Weak hypergraph regularity and linear hypergraphs
- The induced size-Ramsey number of cycles
- An extension of the blow-up lemma to arrangeable graphs
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- Regular pairs in sparse random graphs I
- Powers of Hamilton cycles in pseudorandom graphs
- An unstable hypergraph problem with a unique optimal solution
- Turán's extremal problem in random graphs: forbidding even cycles
- Special issue on Ramsey theory. [Editorial]
- An extension of the Erdős-Stone theorem
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
