This course aims at exploring advanced computation models, theory and advanced algorithm design and analysis techniques that have broad applicability in solving real-life problems in cross-disciplinary areas such as the Internet computing, Web search engines, data mining, bioinformatics, wireless mobile and sensor networks, dynamic resource management, distributed computing, and social networking. Topics include: Theory of NP-completeness; Equivalence of Machine Models; Lower Complexity Bounds; Randomized and Probabilistic Algorithms; Game-theoretic and Information-theoretic Models; Approximation and Optimization Techniques. Prerequisite: CSE 5311 or consent of instructor.