Tomorrow, April 23, I’ll be giving a talk on external memory algorithms.

So, you are invited to watch me rattle off some things on external algorithms for directed graphs. In particular, I’ll (sort-of) be presenting the algorithm I discovered last summer for determining whether or not a directed graph contains cycles. It’s going to be directed towards a general audience, so don’t worry if you’ve absolutely no idea what a directed graph is (which is why I’ll sort-of be presenting it, since it’s too much to present the whole thing to a general audience). Or what an acyclic graph is. Don’t worry, I’ll explain this stuff.

Drop by the Classroom building, room 202 at 2:40pm to give it a listen.

PS. I might as well pimp the associated paper as well. Check out Topological sorting and testing acyclicity in external memory, though the talk I’m giving tomorrow will be about a fifth of that paper.