SODA accepts...

The list of accepted papers for SODA has been posted. Stream papers include:

• The Streaming Complexity of Cycle Counting, Sorting By Reversals, and Other Problems [Verbin, Yu]
• Efficient Sketches for the Set Query Problem [Price]
• Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Low Error [Jayram, Woodruff]
• Streaming k-means on Well-Clusterable Data [Braverman, Meyerson, Shindler, Ostrovsky, Roytman, Tagiku]

If your paper ended up on the list of excepted papers, remember that the STACS deadline is this Friday. And there’s always STOC.