1. Extremal problems on set systems;Frankl;Random Structures Algorithms,2002
2. W.T. Gowers, Hypergraph regularity and the multidimensional Szemerédi theorem, preprint.
3. Quasirandomness, counting and regularity for 3-uniform hypergraphs;Gowers;Combin. Probab. Comput.,2006
4. Integer and fractional packings in dense 3-uniform hypergraphs;Haxell;Random Structures Algorithms,2003
5. Y. Kohayakawa, B. Nagle, V. Rödl, Efficient testing of hypergraphs (extended abstract), Automata, languages and programming, Lecture Notes in Computer Science, vol. 2380, Springer, Berlin, 2002, pp. 1017–1028.