Theory Seminar: Difference between revisions
Jump to navigation
Jump to search
imported>Etone No edit summary |
imported>Etone No edit summary |
||
| Line 6: | Line 6: | ||
|bgcolor="#A7C1F2" align="center"|'''Readings''' | |bgcolor="#A7C1F2" align="center"|'''Readings''' | ||
|- | |- | ||
|align="center"|1'''pm''', 2016/9/27<br> 计算机系楼 224 | |align="center"| | ||
|align="center"| | 1'''pm''', 2016/9/27<br> 计算机系楼 224 | ||
|align="center"| | |||
刘明谋 | |||
|| | |||
:Communication Complexity of Gap Hamming Distance. | |||
|| | |||
[https://arxiv.org/abs/1009.3460 Chakrabarti-Regev 2010], [http://web.cs.ucla.edu/~sherstov/pdf/hamming.pdf Sherstov's proof] | |||
|- | |- | ||
|align="center"|4:30'''pm''', 2016/9/23<br> 计算机系楼 224 | |align="center"| | ||
|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] | 4:30'''pm''', 2016/9/23<br> 计算机系楼 224 | ||
|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] | |||
|- | |- | ||
|align="center"|1'''pm''', 2016/9/20<br> 计算机系楼 224 | |align="center"| | ||
|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] | 1'''pm''', 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] | |||
|} | |} | ||
Revision as of 10:52, 23 September 2016
时间地点 Speakers Topics Readings 1pm, 2016/9/27
计算机系楼 224刘明谋
- Communication Complexity of Gap Hamming Distance.
4:30pm, 2016/9/23
计算机系楼 224张驰豪
（上海交通大学 & 香港中文大学）- Sparsest cut; Bourgain Theorem; Leighton-Rao algorithm.
1pm, 2016/9/20
计算机系楼 224张驰豪
（上海交通大学 & 香港中文大学）- Graph spectrum; Cheeger's Inequality; Fiedler's algorithm.