THE 1996 OBERWOLFACH MEETINGS ON COMPLEXITY THEORY
LACONIC and PERSONAL IMPRESSIONS OF ODED GOLDREICH

I was most happy to see the "triumph parade" 
of the PCP approach in obtaining tight inapproxmablity results,
thus fulfilling the prophecy (see 1994 meeting) even
earlier than I anticipated. The highlight of this line
of research was provided by Johan's presentation of his
(then recent) max3SAT result. 

According to my recall, other highlights of the meeting included
-- Sanjeev's presentation of his Euclidean TSP algorithm. 
-- Shafi's presentation of property testing (outside the algebraic domain).
-- Mike Saks's survey of the study of probabilistic log-space. 
-- Madhu's presentation of list decoding for Reed-Solomon codes.
-- Avi's presentation of a full derandomization of BPP.

[written: May 2006]