Property testing algorithms are ultra"-efficient algorithms that decide whether a given object (e.g., a graph) has a certain property (e.g., bipartiteness), or
An extensive and authoritative introduction to property testing, the study of super-fast algorithms for the structural analysis of large quantities of data in o
Paying witness to the author’s thirty-year career in science, these high-quality papers, some co-written with colleagues, reflect his professional range, cove
“Number Theory and Related Fields” collects contributions based on the proceedings of the "International Number Theory Conference in Memory of Alf van der P