A Symposium to Celebrate Juris Hartmanis as he Retires
Saturday, May 5, 2001
Call Auditorium, Cornell University 9 AM to 5 PM
Schedule of Events
9:00 - 9:15 Dexter Kozen: Welcome
9:15 - 9:30 Dean Robert Constable: Introduction
9:30 - 10:15 Jin-Yi Cai: Some Conjectures by Hartmanis
10:15 - 10: 30 Dr. Ruzena Bajcsy: National Science Foundation
10:30 - 10:45 Break
10:45 - 11:30 Allan Borodin: Incremental Priority Algorithms
11:30 - 12:15 Dan Rosenkrantz: Sequential Dynamical Systems
12:15 - 12:35 Professor Bob Constable: Formal Complexity Classes: An Approach to Automating Computational Complexity Analysis
12:30 - 2:00 Lunch
2:00 - 2:45 Janos Simon: The Multiple Fiber Conjecture
2:45 - 3:30 Neil Immerman: The Solvability of the Halting Problem
3:30 - 4:00 Break
4:00 - 4:45 Richard Stearns: Resource Bounds and Subproblem Independence
4:45 - 5:45 Lane Hemaspaandra: Computational Politics: Elections and Complexity