WebDiarios de Motocicleta

Consider a doubly-ended queue with 1000 elements. Alice and Bob take turns to remove an element from either end of the queue. The player who...

Prelude: A while back I posted an introduction to communication complexity , in which I showed how to obtain deterministic lower bounds by ...

Richard Lipton has a new blog . Noam Nisan has a new blog . Does TCS have too many blogs for its own sake? No doubt about that. My Google ...

From my colleagues among Israeli faculty, I hear strange tales about dealing with people who want to be your PhD students. It seems so many ...

As you know, I am teaching Computability and Complexity at Berkeley. Here is the midterm I gave today. It may be fun for my younger readers...

Through an unexpected turn of events, I am teaching CS 172 at Berkeley. This is the standard course on Finite Automata, Regular Grammars, T...

Sorry for not blogging. It's not that I've been busy -- it's more like incredibly busy. Anyway, the FOCS 2009 call for papers  s...