Course schedule

The table below gives the material covered in class, and points to the corresponding section in the text books.

Date Material Comments and References
Jan. 11 Administrative issues Syllabus handed
Jan. 13 Digital Trees, Lempel-Ziv Compression and other algorithms Sec. 1.1 and 1.2
Jan. 18 Probabilsitic Models and Stochastic Inequalities Sec. 2.2
Jan. 20 Types of Stochastic Convergence Sec. 2.2
Jan. 25 Mark Ward's Presentation
Jan. 27 Mark Ward's Presentation
.
Feb. 1 The First Moment method Sec. 4.1 Homework 1 due
Feb. 3 The Second Moment Method Sec. 4.1
Feb. 8 Applications of the first and second moment methods Sec. 4.2
Feb. 10 Applications of the first and second moment methods Sec. 4.2
Feb. 15 Azuma Inequality Sec. 5.3
Feb. 17 Large Deviations Sec. 5.3
Feb. 22 Applications of Large deviations Sec. 5.4; Homework 2 due
Feb. 24 Prof. Drmota's invited lecture
.
Mar. 1 Information Theory: Shannon and Renyi Entropy Sec. 6.1 and 6.2
Mar. 3 AEP and its applications Sec. 6.3
Mar. 8 Shannon Theorems Sec. 6.4
Mar. 10 Analysis of lempel-Ziv algorithms Sec. 6.5
Mar. 15 SPRING BREAK
Mar. 17 SPRING BREAK
Mar. 29 Generating Functions Sec. 7.1 and 7.2
Mar. 31 Presentation: Hetu Kamichetty A Random Graph Approach to NMR Resonance Assignment
Apr. 5 Presentation: Humayun Kahn Estimation of Entropy for video/images
Apr. 7 Presentation Mehmet Erean Nergiz Privacy-Preserving Data Mining
Apr. 11, Monday 2:30 in cs111 Presentation Muralikrishna Ramanathan Randomized Leader Election
Apr. 12 Presentation Sarvjeet Singh Managing uncertaitity in moving object database
Apr. 14 Presentation Jayesh Pandey Homework 3/take home exam strict deadline
Apr. 19 Presentation Filip Pizlo Astronomy
Apr. 22 Presentation Tomek Czajka
Apr. 26 Presentation Wei Jang Secure-distributed k-anonymity
Apr. 28 Presentation Mehmet Koyuturk and Hasan Metm Aktulga` Analysis of density & Conservation in Power Law Graphs