ptiwari@IBM.COM (Prasoon Tiwari) (11/30/89)
IBM-Cornell Workshop on Theory of Computing
November 29 to December 1, 1989
Location: Cornell University
Organizers:
Gianfranco Bilardi and Vijay Vazirani
Department of Computer Science, Cornell University
Prasoon Tiwari
Computer Science Principles, IBM Research
PROGRAM:
November 29, 1989
Reception at the Johnson Museum
Hosted by IBM
November 30, 1989
9:20 - Dexter Kozen: Welcome
9:25 - Ashok Chandra: Opening Remarks
9:30 - Gianfranco Bilardi: On area universal networks for VLSI
10:00 - Prabhakar Raghavan: Random walks, electric networks and
algorithmic applications
10:45 - Vijay V. Vazirani: A theory of alternating paths
and blossoms for proving correctness of the O(sqrt{V} E)
general graph matching algorithm
11:45 - LUNCH BREAK
13:45 - Ken Birman: Demonstration of ISIS
14:15 - Robert Constable and Chet Murthy: Demonstration of Nuprl
14:45 - LUNCH BREAK
15:00 - Richard Chang: On bounded queries to arbitrary NP sets.
15:30 - Prasoon Tiwari: On the decidability of sparse
univariate polynomial interpolation
16:30 - Ashok Chandra: Towards more realistic models of
parallel machines
(Departmental Colloquium in B17 Upson Hall)
Dinner: Thai Restaurant
December 1, 1989
9:00 - Stavros Cosmadakis: Expressiveness of recursive queries
9:45 - Samir Khuller: Efficient parallel algorithms for
disjoint paths in graphs
10:15 - Gabriel M. Kuper: Constraint query languages
11:00 - Dexter Kozen: Demonstration of ALEX -- An Alexical
Programming Language for Parallel Programming
11:30 - LUNCH BREAK
13:30 - Kieran Herley: Deterministic simulations of PRAMs
on bounded degree networks
14:15 - Desh Ranjan: Space bounded computations - new separation results
14:45 - Juris Hartmanis: Closing Remarks
All Talks in Room 5130 Upson Hall