The following publications are possibly variants of this publication:
- Weak hypergraph regularity and linear hypergraphsYoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht. JCT, 100(2):151-160, 2010. [doi]
- An Algorithmic Regularity Lemma for HypergraphsAndrzej Czygrinow, Vojtech Rödl. SICOMP, 30(4):1041-1066, 2000. [doi]
- An algorithmic hypergraph regularity lemmaBrendan Nagle, Vojtech Rödl, Mathias Schacht. rsa, 52(2):301-353, 2018. [doi]
- An Algorithmic Hypergraph Regularity LemmaBrendan Nagle, Vojtech Rödl, Mathias Schacht. soda 2016: 1765-1773 [doi]
- Hypergraph regularity and quasi-randomnessBrendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht. soda 2009: 227-235 [doi]
- An Algorithmic Version of the Hypergraph Regularity MethodPenny E. Haxell, Brendan Nagle, Vojtech Rödl. SICOMP, 37(6):1728-1776, 2008. [doi]
- An Algorithmic Version of the Hypergraph Regularity MethodPenny E. Haxell, Brendan Nagle, Vojtech Rödl. focs 2005: 439-448 [doi]
- Regular Partitions of Hypergraphs: Regularity LemmasVojtech Rödl, Mathias Schacht. cpc, 16(6):833-885, 2007. [doi]