Difference between revisions of "高级算法 (Fall 2019)"

Instructor

Email yinyt@nju.edu.cn chaodong@nju.edu.cn
office 计算机系 804
Class
Class meetings Wednesday, 10am-12pm

Office hours Wednesday, 4pm-6pm
804
Textbooks
Motwani and Raghavan.
Randomized Algorithms.
Cambridge Univ Press, 1995.
Vazirani.
Approximation Algorithms.
Springer-Verlag, 2001.
v · d · e

This is the webpage for the Advanced Algorithms class of fall 2019. Students who take this class should check this page periodically for content updates and new announcements.

Announcement

• 由于学校网络中心没有开放外网对Mathoid端口的访问权，因此目前讲义只能在校内访问时正常显示数学公式。
• (2019/9/6) 第一课的lecture notes和slides已经发布。

Course info

• email: yinyt@nju.edu.cn
• Teaching Assistant: 凤维明，夏瑞
• Class meeting: Wednesday 10am-12pm, 仙I-108.
• Office hour: Wednesday 4pm-6pm, 计算机系 804.

Syllabus

先修课程 Prerequisites

• 必须：离散数学，概率论，线性代数。
• 推荐：算法设计与分析。

Course materials

• 课程成绩：本课程将会有若干次作业和一次期末考试。最终成绩将由平时作业成绩 (≥ 60%) 和期末考试成绩 (≤ 40%) 综合得出。
• 迟交：如果有特殊的理由，无法按时完成作业，请提前联系授课老师，给出正当理由。否则迟交的作业将不被接受。

Assignments

• Problem Set 1 due on 2019/10/08, before 23:59, submitted to njuadvalg@163.com.

Lecture Notes

1. Min-Cut and Max-Cut (slides)
Probability basics
2. Fingerprinting (slides)
Finite field basics
3. Hashing and Sketching (slides)
Basic tail inequalities
4. Balls into bins (slides)
5. Concentration of measure (slides)
6. Dimension Reduction and Locality-Sensitive Hashing