 Okay, so welcome everyone to the workshop on Beyond Worst Case Analysis. Let me just start with some very brief opening remarks, both about sort of theory at Stanford in general and then about this workshop in particular. So the 2011 to 2012 school year is going to, we're going to have a special year on theoretical computer science at Stanford. So this workshop is effectively the kickoff event. The intended plan is to have two more workshops throughout the school year, one on expanders and related topics in the winter, one on social networks in the spring. We also have a new colloquium series once a quarter devoted to theoretical computer science and we have a couple of sort of great sabbatical visitors that we have here this year as well. So just heads up, keep an eye out, there'll be lots more activities in theoretical computer science at Stanford this coming school year. So about this workshop in particular, so sort of the idea first emerged in a graduate class I taught a couple of years ago on this same topic and as I was sort of pointing through the literature across all different subfields of algorithms, I noticed basically two things. First of all, that there was a lot of interest in thinking about alternatives to worst case analysis, both to explain the behavior of algorithms in practice and to design new algorithms and so on, including by leading researchers in the field, that was the first thing. The second thing is somehow this work didn't seem to have gained the traction or the momentum to emerge as a really high priority sort of research agenda within the algorithms community. So at this workshop, I'm sure we'll have, we're pretty much guaranteed to have some great speakers by the leaders in the field, I hope maybe also this contributes to some of that momentum of really making some qualitative progress on this topic in the next few years. So with that, I'll see you in the next lecture. Thank you. Thank you. Bye. Bye. Bye. Bye. Bye. Bye.