Theory Seminar: Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
VisualWikitext
imported>Etone
No edit summary
imported>Etone
No edit summary
(5 intermediate revisions by the same user not shown)
Line 1: Line 1:
* 这是南京大学理论计算机科学的讨论班主页。
* 本讨论班是open seminar，欢迎各方向的老师、研究生、以及本科生来参加。
:{|border="2" width="100%" cellspacing="4" cellpadding="3" rules="all" style="margin:1em 1em 1em 0; border:solid 1px #AAAAAA; border-collapse:collapse;empty-cells:show;"
:{|border="2" width="100%" cellspacing="4" cellpadding="3" rules="all" style="margin:1em 1em 1em 0; border:solid 1px #AAAAAA; border-collapse:collapse;empty-cells:show;"
|-
|-
Line 6: Line 9:
|bgcolor="#A7C1F2" align="center"|'''Readings'''
|bgcolor="#A7C1F2" align="center"|'''Readings'''
|-
|-
|align="center"|1'''pm''',  2016/9/27<br> 计算机系楼 224
|align="center"|
|align="center"|[http://basics.sjtu.edu.cn/~chzhang/ 刘明谋|| 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]
4:30'''pm''',  2016/10/14<br> 计算机系楼 224
|align="center"|
宋仁杰
||
:Approximate Counting via Correlation Decay.  
||  
[http://dimacs.rutgers.edu/~dror/pubs/ind_from_tree.pdf Weitz's paper]
|-
|-
|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]
1'''pm''',  2016/9/27<br> 计算机系楼 224
|align="center"|
刘明谋
||
:Communication Complexity of Gap Hamming Distance.  
||  
[http://web.cs.ucla.edu/~sherstov/pdf/hamming.pdf Sherstov's simplified proof]
[https://arxiv.org/pdf/1009.3460v3.pdf Chakrabarti-Regev 2010]
|-
|-
|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]
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"|
[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 02:48, 11 October 2016

  • 这是南京大学理论计算机科学的讨论班主页。
  • 本讨论班是open seminar，欢迎各方向的老师、研究生、以及本科生来参加。
时间地点 Speakers Topics Readings

4:30pm, 2016/10/14
计算机系楼 224

宋仁杰

Approximate Counting via Correlation Decay.

Weitz's paper

1pm, 2016/9/27
计算机系楼 224

刘明谋

Communication Complexity of Gap Hamming Distance.

Sherstov's simplified proof Chakrabarti-Regev 2010

4:30pm, 2016/9/23
计算机系楼 224

张驰豪
（上海交通大学 & 香港中文大学）

Sparsest cut; Bourgain Theorem; Leighton-Rao algorithm.

Luca Trevisan's notes: 1, 2

1pm, 2016/9/20
计算机系楼 224

张驰豪
（上海交通大学 & 香港中文大学）

Graph spectrum; Cheeger's Inequality; Fiedler's algorithm.

Luca Trevisan's notes: 1, 2, 3, 4

Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=Theory_Seminar&oldid=6861"