CSE 736 - Markov Chains: Foundations and Applications
Spring 2003

[ Home | Topics | Presentation Schedule | Links ]

[ General Info | Description | Objectives | Topics | Course Load | Prerequisites ]

Instructor: Dr. Hung Q. Ngo
	Office: 239 Bell Hall 
	Office Hours: Thursdays 1:00-3:00pm
	Phone: 645-3180 x 160 
	Email: hungngo@cse.buffalo.edu 

Website: http://www.cse.buffalo.edu/~hungngo/classes/MarkovChains_Spring03/

Grading: to be done on an S/N (or S/U) basis only.

Time and place: Mondays 2pm-3:20pm and Tuesdays 7pm-8:20pm. Bell 242.


I shall spend roughly half of the semester presenting the foundations of Markov Chains, both discrete and continuous. An introductory course on probability theory is recommended, but not absolutely required. I shall provide reading materials on basic probability theory.

At the second half, each member of the class presents a paper or a topic which uses Markov chains. They should be in one of two areas: queueing theory and randomized algorithms.

Also, each class member prepares scribe note for at least one lecture. The LATEX template shall be provided. Part of the grading is based on how much effort I have to spend modifying the scribe note. All notes shall be shared to the class.

A list of recommended papers and topics shall also be provided.


Topics (tentative):

Course Load: