1. and The algorithmic aspects of the Regularity Lemma, Proc. 33rd IEEE FOCS, IEEE, Pittsburgh, 1992, pp. 473-481;
2. The Algorithmic Aspects of the Regularity Lemma
3. and Efficient testing of large graphs, Proc 40th Annu Symp Foundations of Computer Science (FOCS), IEEE, New York, 1999, 656-666;
4. Efficient Testing of Large Graphs
5. and Regular languages are testable with a constant number of queries, Proc 40th Annu Symp Foundations of Computer Science (FOCS), IEEE, New York, 1999, 645-655;