Graduate Programs
Graduate Home
Ph D Programs
Masters Degree
Ph D Program Requirements
Course Descriptions
Current Courses
Admissions
Current Graduate Students
Graduate Student Seminar
SIAM Chapter Seminar
Recent Graduates
Incoming Students

SIAM Chapter Seminar
Mor HarcholBalter Computer Science, Carnegie Mellon Title: Open Problems in Computer Science that Rely on Difficult Markov Chains Abstract: Many fundamental problems in computer science can be easily described via Markov chains. Examples include the analysis of cycle stealing, dispatching for server farms, timevarying load, affinity scheduling. Unfortunately, we do not know how to analyze these Markov chains, which are typically unbounded in one or more dimensions.In this very informal talk, I will first review Markov chains and will then show you examples of Markov chains which are (so far) intractable, as well as some we have solved. No prior knowledge is assumed  particularly none in Computer Science. Date: Thursday, September 4, 2014 Time: 5:30 pm Location: Wean Hall 8220 Submitted by: Gautam Iyer 