THEORYNT@YKTVMX.BITNET (03/02/90)
Dear friends and collegues: I propose to organise a Theoretical Computer Science Olympiad (henceforth TCS Olympiad) around November 1990. The topics covered are Graph Theory, Combinatorics, Mathematical Logic, Automata, Languages and computation theory, Design and analysis of algorithms, formal development of programs and correctness proofs(Dijkstra Gries Feijen Type problems and solutions). Standard topics covered in an undergraduate curriculum are sufficient to begin with. One can contemplate Olympiads at different levels if there is sufficient response at various levels. Comments, suggestions and volunteers are most welcome. We have some models tried out informally which gave us some insight and it turned to be positive and encouraging. My strong feeling is that under TCS now we have enough mathematically matured and well defined topics with lots of medium sized and clever problems created and solved in the recent past. Such a competition would surely bring the hidden potentials in the young TCS community to the limelight. Also i wish to organise the same with participation from all over the world with exam conducted in a distributed manner!!!. The support from EACTCS and ACM etc will be sought after finalising the details of the project. My Address for hard mail: DR.C.PANDU RANGAN, DEPT OF COMPUTER SCIENCE AND ENGENEERING, INDIAN INSTITUTE OF TECHNOLOGY, MADRAS- 600 036, INDIA. e-mail:: uunet!shakti!shiva!rangan TELEX: 41-21062 IITM IN I prefer hard mail as for as possible. If i receive a good responce i shall periodically post on theory net the summary.