This is a (not limiting) list of future papers I’d like to read:
Synthesis: An Efficient Implementation of Fundamental Operating System Services (1992) (I already read this, but want to reread it. Maybe on a weekend if I’m feeling ambitious. Or a couple posts summarizing different parts)
- Fully Homomorphic Encryption over the Integers (I’ve tried this one a couple times, but never made it through.)
- The Homotopy Type Theory book (Thanks, mkaemmerer!)
- The Girard-Reynolds Isomorphism
- Cryptographic Obfuscation (blog post with good summary)
Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits – One of two recent articles exploiting a loophole in the previous impossibility proof, written up rather sensationally by Wired.
How to Use Indistinguishability Obfuscation: Deniable Encryption, and More – Looks like a followup to the above.
- The Road to Parallelism Leads Through Sequential Programming
- Most of the rest of PLDI 2014
- PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs
- GraphChi: Large-Scale Graph Computation on Just a PC
- KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs
- Approximating k-Median via Pseudo-Approximation
- Exposing Photo Manipulation with Inconsistent Shadows
Most of these are from trolling various recent conferences; in the process, I discovered Microsoft’s Academic Search, which among other things gives major journals and conferences by field. I’m not sure how I feel about the search itself, but it’s a great way to find the conferences I’d forgotten about and then troll their recent years for good papers.