New York, NYUSA 10017
April 9, 2014
I spent a couple weeks diving into diffing algorithm papers, which was a lot of fun. I particularly liked the line "Common subsequences, edit scripts, traces, and paths from (0,0) to (N,M) in the edit graph are all isomorphic formalisms" in the famous Myer's paper on diffing. My favorite computer science papers are ones which unify and synthesize a lot of seemingly disparate problem domains.
I love papers but I'm not gonna make a big fuss about it yaknow?