The program of the mini-workshop

Authors:
Oded Goldreich
Affiliations:
Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel
Venue:
Property testing
Year:
2010

Citing 5
Cited 0

Tolerant property testing and distance approximation

Journal of Computer and System Sciences
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms

Theoretical Computer Science
Every minor-closed property of sparse graphs is testable

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximating the distance to properties in bounded-degree and general sparse graphs

ACM Transactions on Algorithms (TALG)
Testing Reed-Muller codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article provides an annotated version of the program of the mini-workshop on propoerty testing that took place in January 2010 in the Institute for Computer Science (ITCS) at Tsinghua University (Beijing). The mini-workshop brought together a couple of dozen of leading researchers in Property Testing and related areas.