CSE 6311: ADVANCED COMPUTATIONAL MODELS AND ALGORITHMS
Spring 2011, Tue 2-4:50PM at ERB 129
817 272 7595
gdas [AT) uta [DOT) edu
Wed 2-4pm or by appointment
saravanan DOT thirumuruganathan [AT) MAVS [dot) UTA [dot) edu
Monday 11-12, Tuesday 10-11 or by appointment
About this course
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. The course will consist of three parts: (a) the theory of NP-completeness, (b) approximation techniques to cope with intractability, and (c) randomized techniques.
CSE 5311 or consent of instructor
3 non-cumulative exams worth 1/3 weight each
Cormen, Leiserson, Rivest, Stein, Introduction to Algorithms, 3rd ed., MIT Press, 2009
Michael R. Garey, David S. Johnson: Computers and Intractability: A guide to the theory of NP-completeness, 1979
Piazza site for course has been created here.
It will be used for all public communications between the Instructor/TA and the members of the class. It can also be used by the list members for discussions on any/all topics related to this course. For instance, one can use it to discuss homework questions with other students in the class.
This website is the official page for all information to be conveyed to the class. Please keep an eye for any new announcement which is posted here.
While emailing the TA please add the words "CSE6311" to the subject. For example, if you are sending an email to set up an appointment, the subject would be "CSE6311: Requesting Appointment". Please follow this convention in order to ensure that your email does not get categorized as spam.