WebDiarios de Motocicleta

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...

Claire Mathieu 's SODA and Michael Mitzenmacher 's STOC asked for paper abstracts to be submitted one week in advance of the deadlin...

A while ago (2003), I proposed the following problem in the Romanian national olympiad: You are given an alphabet of n letters, and the fre...

A long long time ago, when we took our first computers course, we learned that computers represent things in bits, not in base 10, since bit...

'Tis the season to be doing succinct data structures. [P]  My FOCS'08 paper  demonstrated how to use recursion to achieve better red...

The Berkeley Algorithmists ' Meeting will continue on Tuesday at 3:30pm . Scheduling. There have been enough calls to change the time ...