TITLE (tentative): ITCS mini-workshop on Property Testing
DATE: JANUARY 8-10
ORGANIZER Co-Chair: Prof. Oded Goldreich
Prof. Amy Yuexuan Wang
Property Testing is the study of super-fast (randomized) algorithms for approximate decision making. These algorithms are given direct access to items of a huge data set, and determine whether this data set has some predetermined (global) property or is far from having this property. Remarkably, this approximate decision is made by accessing a small portion of the data set. Property Testing has been a subject of intensive research in the last couple of decades, with hundreds of studies conducted in it and in closely related areas. Indeed, Property Testing is closely related to Probabilistically Checkable Proofs (PCPs), and is related to Coding Theory, Combinatorics, Statistics, Computational Learning Theory, Computational Geometry, and more. The mini-workshop, hosted by the Institute for Theoretical Computer Science (ITCS) at Tsinghua University (Beijing), aims to bring together a couple of dozen of leading international researchers in Property Testing and related areas.
Invited Attendees (confirmed):
Noga Alon (Tel Aviv University)
Eli Ben-Sasso (Technion)
Eric Blais (CMU)
Avrim Blum (CMU)
Victor Chen (Tsinghua University)
Artur Czumaj (Warwick)
Oded Goldreich (Weizmann)
Prahladh Harsha (UT, Austin)
Tali Kaufman (MIT)
Swastik Kopparty (MIT)
Michael Krivelevich (Tel Aviv University)
Ilan Newman (Haifa University)
Krzysztof Onak (MIT)
Sofya Raskhodnikova (Pennsylvania State University)
Ronitt Rubinfeld (MIT)
Shubhangi Saraf (MIT)
Rocco Servedio (Columbia University)
Asaf Shapira (Tel Aviv University)
Christian Sohler (TU Dortmund)
Madhu Sudan (MIT)