Sometimes you produce algorithms that you believe should be useful, and then you might just go little further, and produce pseudocode or even code. You dont want to do this for all the theory results one produces, only for the ones you think this will be worth the effort. And then you do outreach: you have to take it to the applied communities that will care. Here are two examples.
- Count-Min Sketch. Many pieces of code exist for count-min sketch, but we thought it will be worthwhile to draw attention of many software professional. So, we wrote an expository article in IEEE Software recently, in a special theme of "Algorithms for Today's Practitioners", edited by Giuseppe Prencipe, University of Pisa, Cesare Zavattari, CrowdEngineering, Alessandro Tommasi, CrowdEngineering, and John Favaro, Intecs SpA.
- Approximating Fourier Transform. Over the past two decades, there have been several algorthms to approximate fourier representation of signals. I really liked this expository article, "A Tutorial on Fourier Sampling, How to apply it to problems" in IEEE Signal Processing Magazine, by Anna Gilbert, Martin Strauss and Joel Tropp who took our complicated algorithms and developed it into a workable psuedocode.
- Going beyond the above, there is a very nice, recent, related work by Haitham Hassanieh, Piotr Indyk ,Dina Katabi, and Eric Price in which they improve FFT for k-sparse signals. This is big. See their page on sFFT for details. This paper got a lot of press (eg., IEEE Spectrum news, authors promise code soon), deservedly.