FemaleScienceProfessor tells an Evil Reviewer story.
The CRA blog tells us that DARPA is back, in terms of funding university research. Ed Lazowska has related posts here and here at the CCC blog.
If you think deciding authorship is complicated normally, what about for Polymath projects?
For my last lecture in Algorithms and Data Structures, I try to show something that I, at least, think is amazing: maximal palindromes can be found in linear time. (pp. 197-198 of Gusfield's book Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology).
But this year, I didn't miss enough lectures during the semester. So I still have one more lecture -- a good excuse to finally add a brief discussion of Bubblesearch (randomized greedy) and maybe also Human-Guided Tabu Search into the class.