(*) I’m not entirely sure what metric I’m using to determine “indirect interest” but rest assured, once I know, I’ll let you know. There also might be some additions to the above list once I’ve seen the actual papers.

BONUS! Comments from the chair… The PC chair, Yuval Rabani, discusses the selection process. Other posts on the selected papers include this and that and can be found here and there.

Also, following on from my post about the PODS accepted papers, I wanted to note that the best paper was awarded to [Kane, Nelson, Woodruff] for their data streams paper on “An Optimal Algorithm for the Distinct Elements Problem.” Congrats!

BONUS! A Challenge… So you’re done with your FOCS submission? Well, don’t dawdle, there are plenty of deadlines over the next week to keep you occupied. Who needs sleep?

I also like the look of the PODS tutorial on “Information Complexity” that will be presented by T. S. Jayram. This is one of the most important techniques for proving stream and communication lower bounds. Check out the abstract here.

UPDATE: “An Optimal Algorithm for the Distinct Elements Problem” received the PODS Best Paper Award. Congrats!

[FWIW, I also had a paper accepted but it was on differential privacy rather than data streams. Perhaps I should add “secrecy” as a semi-suitable synonym to subjoin to the blog’s “streams, sketches, samples, sensing” tagline. Or would that be silly?]