Over the last two decades algebraic techniques have played a central role in computational complexity and in our understanding of randomness in computation. For instance, these methods have led to a better understanding (and better explicit constructions) of codes, expander graphs, extractors, and pseudorandom generators and also contributed to the design of efficient algorithms for computational problems in algebra. They also play an important role in efficient list decoding and also in PCPs. One of the aims of this workshop is to invite leading experts in this area and give state-of-the-art lectures on this topic.