INTERNATIONAL CONFERENCE ON THEORETICAL COMPUTER SCIENCE

in honour of Professor Manuel Blum's 60^th Birthday April 20-24, 1998, City University of Hong Kong

VIDEOS OF INVITED TALKS (Video playback using free RealPlayer 5.0)

Click for 112Kbps version ( or for 28.8Kbps version)
Shift-Click for downloading 112Kbps version ( or for downloading 28.8Kbps version)
Click for overhead slides

Monday, 20 April 1998

9:00 am Welcome by Professor H K CHANG, President & University Professor on behalf of City University of Hong Kong

9:15 am Welcome by Professor Horace H S IP on behalf of Department of Computer Science & the Organizing Committee

9:30 am Shmuel WINOGRAD On Factoring Polynomials over GF(2ⁿ)

11:00 am Steven RUDICH Pseudorandomness Against Non-deterministic Adversaries

1:30 pm Charles BENNETT Quantum Information and Computation

2:45 pm Merrick FURST Graphplan : Fast Planning Through Planning Graph Analysis

6:15 pm Reception at City Top Restaurant, 9/F, Amenities Building, CityU

Tuesday, 21 April 1998

9:00 am Richard KARP Algorithms Operating on Random Structures: Three Recent Examples

10:30 am Ming LI The Incompressibility Argument

1:00 pm Vijay VAZIRANI The Steiner Tree Problem and its Generalizations

2:15 pm Silvio MICALI Computationally Sound Checkers for NP-Complete Problems

Wednesday, 22 April 1998

9:00 am Michael RABIN Efficient Deniable Authentication of Long Messages

10:30 am Umesh VAZIRANI Quantum Computation

Thursday, 23 April 1998

9:00 am Leonid LEVIN Some Results of Manuel Blum and their Seminal Role

10:30 am Avrim BLUM Approximating the Minimum Bandwidth

1:00 pm Frances YAO Context-Reduction Techniques for Data Compression

2:15 pm Allan BORODIN Adversarial (and non adversarial) Queuing Theory

Friday, 24 April 1998

9:00 am Andrew YAO How to Generate Random Objects

10:30 am Gary MILLER Graph Embeddings in Scientific Computation

1:00 pm Eric BACH Threshold Data Structures and Algebraic Coding Theory

Conference Photo (Dr Charles Bennett)
Photo Album

	Monday, 20 April 1998
9:00 am	Welcome by Professor H K CHANG, President & University Professor on behalf of City University of Hong Kong
9:15 am	Welcome by Professor Horace H S IP on behalf of Department of Computer Science & the Organizing Committee
9:30 am	Shmuel WINOGRAD On Factoring Polynomials over GF(2ⁿ)
11:00 am	Steven RUDICH Pseudorandomness Against Non-deterministic Adversaries
1:30 pm	Charles BENNETT Quantum Information and Computation
2:45 pm	Merrick FURST Graphplan : Fast Planning Through Planning Graph Analysis

	Tuesday, 21 April 1998
9:00 am	Richard KARP Algorithms Operating on Random Structures: Three Recent Examples
10:30 am	Ming LI The Incompressibility Argument
1:00 pm	Vijay VAZIRANI The Steiner Tree Problem and its Generalizations
2:15 pm	Silvio MICALI Computationally Sound Checkers for NP-Complete Problems

	Wednesday, 22 April 1998
9:00 am	Michael RABIN Efficient Deniable Authentication of Long Messages
10:30 am	Umesh VAZIRANI Quantum Computation

	Thursday, 23 April 1998
9:00 am	Leonid LEVIN Some Results of Manuel Blum and their Seminal Role
10:30 am	Avrim BLUM Approximating the Minimum Bandwidth
1:00 pm	Frances YAO Context-Reduction Techniques for Data Compression
2:15 pm	Allan BORODIN Adversarial (and non adversarial) Queuing Theory

	Friday, 24 April 1998
9:00 am	Andrew YAO How to Generate Random Objects
10:30 am	Gary MILLER Graph Embeddings in Scientific Computation
1:00 pm	Eric BACH Threshold Data Structures and Algebraic Coding Theory