THE 1992 OBERWOLFACH MEETINGS ON COMPLEXITY THEORY LACONIC and PERSONAL IMPRESSIONS OF ODED GOLDREICH This was the first time I participated in the Oberwolfach meeting on Complexity Theory. I enjoyed myself tremendously and even obtained a direct gain: The talk of Pudlak (reporting on his communication protocol with Rodl) inspired me to think on Private Information Retrieval (PIR), because their protocol yields such a non-trivial PIR. In addition to falling in love with the location, enjoying meeting friends, and learning new things, I enjoyed listening to presentations of works that I did know and liked. Examples include the FGLSS connection (presented by Shafi), the hitting set for combinatorial rectangles (presented by Mike Luby), and the log^{3/2} space algorithm for UCONN (presented by Avi). [written: May 2006]