Theory Seminar: Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
imported>Etone
imported>Etone
Line 8: Line 8:
|-
|-
|2016/9/23<br> 计算机系楼 224
|2016/9/23<br> 计算机系楼 224
|align="center"|[http://basics.sjtu.edu.cn/~chzhang/ 张驰豪]<br>(上海交通大学 & 香港中文大学)|| Sparsest cut; Leighton-Rao algorithm. || Luca Trevisan's notes: [https://people.eecs.berkeley.edu/~luca/expanders2016/lecture09.pdf 1], [https://people.eecs.berkeley.edu/~luca/expanders2016/lecture10.pdf 2]
|align="center"|[http://basics.sjtu.edu.cn/~chzhang/ 张驰豪]<br>(上海交通大学 & 香港中文大学)|| Sparsest cut; Bourgain Theorem; Leighton-Rao algorithm. || Luca Trevisan's notes: [https://people.eecs.berkeley.edu/~luca/expanders2016/lecture09.pdf 1], [https://people.eecs.berkeley.edu/~luca/expanders2016/lecture10.pdf 2]
|-
|-
|2016/9/20<br> 计算机系楼 224
|2016/9/20<br> 计算机系楼 224
|align="center"|[http://basics.sjtu.edu.cn/~chzhang/ 张驰豪]<br>(上海交通大学 & 香港中文大学)|| Graph spectrum; Cheeger's Inequality; Fiedler's algorithm. || Luca Trevisan's notes: [https://people.eecs.berkeley.edu/~luca/expanders2016/lecture00.pdf 1], [https://people.eecs.berkeley.edu/~luca/expanders2016/lecture02.pdf 2], [https://people.eecs.berkeley.edu/~luca/expanders2016/lecture03.pdf 3], [https://people.eecs.berkeley.edu/~luca/expanders2016/lecture04.pdf 4]
|align="center"|[http://basics.sjtu.edu.cn/~chzhang/ 张驰豪]<br>(上海交通大学 & 香港中文大学)|| Graph spectrum; Cheeger's Inequality; Fiedler's algorithm. || Luca Trevisan's notes: [https://people.eecs.berkeley.edu/~luca/expanders2016/lecture00.pdf 1], [https://people.eecs.berkeley.edu/~luca/expanders2016/lecture02.pdf 2], [https://people.eecs.berkeley.edu/~luca/expanders2016/lecture03.pdf 3], [https://people.eecs.berkeley.edu/~luca/expanders2016/lecture04.pdf 4]
|}
|}

Revision as of 05:53, 23 September 2016

Schedule

时间地点 Speakers Topics Readings
2016/9/23
计算机系楼 224
张驰豪
(上海交通大学 & 香港中文大学)
Sparsest cut; Bourgain Theorem; Leighton-Rao algorithm. Luca Trevisan's notes: 1, 2
2016/9/20
计算机系楼 224
张驰豪
(上海交通大学 & 香港中文大学)
Graph spectrum; Cheeger's Inequality; Fiedler's algorithm. Luca Trevisan's notes: 1, 2, 3, 4