THE 1994 OBERWOLFACH MEETINGS ON COMPLEXITY THEORY LACONIC and PERSONAL IMPRESSIONS OF ODED GOLDREICH My own focus in this meeting was on the emerging "second generation" of PCP constructs and the question of whether (as prophecized) it could yield to tight inapproximablity results. This theme was most clearly represented by Mihir's talk, but was also in the background of the talks of Martin and Madhu. In addition, there was the intriguing application of PCP to CS-proos (Silvio). Of course, there were many other unrelated topics. One highlight was the randomized log-space algorithm for non-connectivity of undirected graphs (i.e., showing that SL = coSL), presented by Noam. At the end of this meeting I was asked to replace Volker Strassen on the organization team. One can hardly communicate how excited and frightened I was to step into the legendary shoes of Volker. [written: May 2006]