This book is rooted in the thesis that complexity theory is extremely rich in conceptual
content, and that this contents should be explicitly communicated in expositions and courses …

Praise for the Third Edition “Researchers of any kind of extremal combinatorics or theoretical
computer science will welcome the new edition of this book.”-MAA Reviews Maintaining a …

Discovering the conditions under which an optimization algorithm or search heuristic will
succeed or fail is critical for understanding the strengths and weaknesses of different …

We consider sequences of graphs (Gn) and define various notions of convergence related to
these sequences:“left convergence” defined in terms of the densities of homomorphisms …

Property testing is concerned with the design of super-fast algorithms for the structural
analysis of large quantities of data. The aim is to unveil global features of the data, such as …

The area of property testing tries to design algorithms that can efficiently handle very large
amounts of data: given a large object that either has a certain property or is somehow" far" …

The problem of characterizing all the testable graph properties is considered by many to be
the most important open problem in the area of property testing. Our main result in this paper …

We introduce the notion of a Canonical Tester for a class of properties on distributions, that
is, a tester strong and general enough that" a distribution property in the class is testable if …

Property testing algorithms are" ultra"-efficient algorithms that decide whether a given object
(eg, a graph) has a certain property (eg, bipartiteness), or is significantly different from any …

Sublinear Time Algorithms Page 1 Copyright © by SIAM. Unauthorized reproduction of this article
is prohibited. SIAM J. DISCRETE MATH. c 2011 Society for Industrial and Applied Mathematics …