Re:What papers should everyone read? - Theoretical Computer ...
by Jun8 on Tuesday May 24, 2011 @02:59PM
(#2581088)
This is a great list. I would add:
* The stable marriage problem (D. Gale and L. S. Shapley: "College Admissions and the Stability of Marriage", American Mathematical Monthly 69, 9-14, 1962.), http://en.wikipedia.org/wiki/Stable_marriage_problem
* The stable marriage problem (D. Gale and L. S. Shapley: "College Admissions and the Stability of Marriage", American Mathematical Monthly 69, 9-14, 1962.), http://en.wikipedia.org/wiki/Stable_marriage_problem
* Knuth's Dancing Links algorithm http://www-cs-faculty.stanford.edu/~uno/papers/dancing-color...