Theory Seminar: Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
imported>Etone
No edit summary
imported>Etone
No edit summary
Line 8: Line 8:
|bgcolor="#A7C1F2" align="center"|'''Topics'''
|bgcolor="#A7C1F2" align="center"|'''Topics'''
|bgcolor="#A7C1F2" align="center"|'''Readings'''
|bgcolor="#A7C1F2" align="center"|'''Readings'''
|-
|align="center"|
4:30'''pm''',  2016/10/14<br>
|align="center"|
宋仁杰
||
:Approximate Counting via Correlation Decay.
||
[http://dimacs.rutgers.edu/~dror/pubs/ind_from_tree.pdf Weitz's paper]
|-
|-
|align="center"|
|align="center"|

Revision as of 09:23, 29 September 2016

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

4:30pm, 2016/10/14

宋仁杰

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