DIMACS Workshop on Property Testing
March 30 - April 2, 2009
DIMACS Center, CoRE Building, Rutgers University
- Organizers:
- Ilan Newman, Haifa University, ilan at cs.haifa.ac.il
- Miklos Simonovits, Alfréd Rényi Institute of Mathematics, miki at renyi.hu
- Mario Szegedy, Rutgers University, szegedy at cs.rutgers.edu
Presented under the auspices of the Special
Focus on Hardness of Approximation.
This workshop is jointly sponosored by Princeton University and the Center for Computational Intractability.
Slides:
- Artur Czumaj, University of Warwick
Testing Continuous Distributions
- Ilias Diakonikolas, Columbia University
Testing by Implicit Learning
- Elena Grigorescu, MIT
Succinct representation of codes with applications
to testing
- Tali Kaufman, MIT
Sparse Random Linear Codes are Locally Decodable and Testable
- Michael Krivelevich, Tel Aviv University
Property Testing in Sparse and General Graphs
- Laci Lovasz, Eötvös Loránd University, Budapest
Mathematical problems of very large networks
- Arie Matsliah
Tester for Nearly-Sortedness and its Applications
in Databases
- Ronitt Rubinfeld, MIT
Testing properties of distributions
- Michael Saks, Rutgers University
Distributed (Local) Monotonicity Reconstruction
- Christian Sohler, University of Dortmund
Testing Expansion in Bounded Degree Graphs
- Madhu Sudan, MIT CSAIL
Algebraic Property Testing: A Survey
- Van Vu, Rutgers University
Random matrices: The distribution of the
smallest singular values-an approach via testing
- Avi Wigderson, IAS
New Direct Product Code Testers, and PCPs
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on April 30, 2009.