Brief Introduction

The Lecturer will describe some fascinating topics from the subject area called Theoretical Computer Science (TCS). TCS is the study of efficient algorithms and the mathematical structures surrounding the existence of such algorithms. TCS is a vast area, and due to the available time The Lecturer will only be able to give a select sample of many beautiful results. But hope that this sample will give students a taste of TCS, its intellectual vigor and its mathematical depth.

Time

2017-07-10 ~ 2017-07-13   10:05 - 11:45 , 15:25 - 17:05

Lecturers

Jin-Yi Cai,UW-Madison,USA

Venue

T5, Shanghai University of Finance & Economics

Application and Registration

Program

• Some Efficient Algorithms.
• Some Theorems on Matchings and Coverings
• Randomization in Algorithms
• A Randomized Algorithm for MAXCUT
• Randomized Complexity Classes
• Random Walks
• Expanders
• Random Walk on an Expander
• Explicit Construction of Expanders

And other topics

Attachments

Lecture notes

Contact Us

Huili Liang

Directions to ITCS

View Direction Page