For the theory course(CS6505- Computability, Algorithms, and Complexity) at Gatech I along with couple of my friends prepared a cheat sheet covering the topics of NFA, Turning Machines, Turing Reducibility, Data structures( Fibonacci Heaps ), Algorithms ( Dynamic programming, Divide and Conquer, Matching algorithms etc. I am sharing the .tex and pdf file in case its useful for someone. Please feel free to download and modify for your use.
TEX & PDF
TEX & PDF
