 |
|
|
January 2005 |
Sun
|
Mon
|
Tue
|
Wed
|
Thu
|
Fri
|
Sat
|
|
26
|
27
|
28
|
29
|
30
|
31
|
1
|
|
2
|
3
|
4
|
5
|
6
|
7
|
8
|
|
9
|
10
|
11
4:15 p.m. - 5:45 p.m.
CS 201: Jon Postel Distinguished Lecture Series: "Foundational Proof-Carrying Code", ANDREW APPEL, Princeton University
|
12
|
13
|
14
|
15
|
|
16
|
17
|
18
4:15 p.m. - 5:45 p.m.
Townhall meeting
|
19
|
20
4:15 p.m. - 5:45 p.m.
CS201: FUSE: Lightweight Guaranteed Distributed Failure Notification, DEJAN KOSTIC, University of California San Diego
|
21
|
22
|
|
23
|
24
|
25
4:15 p.m. - 5:45 p.m.
CS201: Efficiency of Recursive and Superrecursive Algorithms, MARK BURGIN, UCLA
|
26
|
27
4:15 p.m. - 5:45 p.m.
CS201: Quality of Service for Voice over IP, DAVID ORAN
|
28
|
29
|
|
30
|
31
|
1
4:15 p.m. - 5:45 p.m.
CS201: How Fair is Your Queue, HANOCH LEVY, Tel-Aviv University
|
2
|
3
|
4
|
5
|
|
|