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

Two major results have dominated my recall of the meeting:
-- Omer's log-space algorithm for UCONN
-- Irit's new approach to the proof of the PCP Theorem

Additional research directions that attracted my attention include
-- the (re-)emerging study of multiple-source extractors
   (see talks by Avi, Ronen, and Boaz).
-- an interesting approach to improving the known upper-bounds
   on Matrix Multiplication (presented by Chris).
-- the notion of Holo-algorithms, introduced by Les.

[written: May 2006]