Algorithms for Concurrent Data Structures

Word clouds seem to be all the rage lately. Playing with some clouds for a recent talk, I found them to actually provide an interesting summary of research papers. For example, here's a word cloud for our PLDI'08 paper on derivation of highly-concurrent linearizable data structure algorithms.

Apart from the emphasis of terms like "true", this is a pretty decent summary of what's going on in the paper --- concurrent algorithms, linearizability, and a lot of dance around atomic blocks, restarts, and the pointers curr and pred.