Last year, I wrote a post about a so-called LVar data structure that, upon closer inspection, turned out not to be an LVar at all. In that post, I proposed a way to fix the problem, but the fix seemed to be at the expense of another desirable property of the data structure. In this post, I return to that example, but this time, I’ll explain how we can have our cake and eat it, too!
For the last few months, as I’ve been getting ready to finish up grad school, I’ve also spent a lot of time working on figuring out what I’m going to do once I’m done. Many conversations, emails, interviews, and iterations of my job talk1 later, I’m very happy to report that my job search has come to a successful conclusion!
Update (June 14, 2017): Updated with rejections from 2016!
Update (December 1, 2015): I’ve updated this post with a few more recent rejections!
The other day Peter Alvaro made a list of “fond memories of rejection”. People with tons of publications aren’t getting rejected any less often than the rest of us are; they’re making more attempts.
My co-authors Aaron Todd, Sam Tobin-Hochstadt, Ryan Newton, and I have just finished up the camera-ready version of our new paper, “Taming the Parallel Effect Zoo: Extensible Deterministic Parallelism with LVish”, which will appear at PLDI 2014 in Edinburgh this June. In addition to having the paper accepted, we were happy to learn a few weeks ago that our submission passed the PLDI artifact evaluation process.