“Bulletin Board”

 School of Mathematics - February 19, 2001

A report on The First Summer School on Theoretical Aspects of Computer Science

Professor Charles Colbourn of University of Vermont has compiled the following report on "The First Summer School on Theoretical Aspects of Computer Science" held on July 2000, at IPM. This report has appeared in the Bulletin of Institute of Combinatorics and its Applications Vol. 31 (2001), 84-86.
Gallery of Pictures
http://math.ipm.ac.ir/conferences/2000/sotacs/

 
 Professor Charles Colbourn of University of Vermont has compiled the following report on "The First Summer School on Theoretical Aspects of Computer Science" held on July 2000, at IPM. This report has appeared in the Bulletin of Institute of Combinatorics and its Applications Vol. 31 (2001), 84-86.

First Summer School on
Theoretical Aspects of Computer Science,
Institute for Studies in Theoretical Physics and Mathematics
Tehran, Iran, 3-9 July 2000


The First Summer School on Theoretical Aspects of Computer Science was held at IPM in Tehran, I.R. Iran, from July 3 until July 9, 2000. The main organizers were Reza Khosrovshahi, Ali Shokoufandeh, and Amin Shokrollahi. The mathematical community in Iran has been very active. In recent years they have established a strong presence in combinatorics, especially in design theory and in graph theory. Building on these strengths, the workshop was designed to introduced a wide variety of topics with lectures from an international group of speakers. The main speakers were:

Charles Colbourn (Vermont, U.S.A.):
Multiple Access Communications using Combinatorial Designs.
Kazem Lellahi (Paris XIII, France):
Modeling Data and Objects: An Algebraic Viewpoint.
Miklos Santha (Paris-Sud, France):
Exact and Approximate Self-Testing.
Raimund Seidel (Saarlandes, Germany):
The Polygonal Reconstruction of Curves from Samples.
Ali Shokoufandeh (Drexel, U.S.A.):
Graph Theoretical Methods in Computer Vision.
Amin Shokrollahi (Bell Labs, U.S.A.):
An Introduction to Algorithmic Coding Theory.
Endre Szemeredi (Rutgers, U.S.A.):
Statistical Methods in Graph Embedding Problems.
Umesh Vazirani (Berkeley, U.S.A.):
Quantum Computation.
Vijay Vazirani (Georgia Tech, U.S.A.):
The Primal-Dual Schema Based Approximation Algorithms.

These invited lectures sparked numerous informal discussions, with a productive interaction between mathematicians and computer scientists. An impromptu lecture by Endre Szemeredi outside on the beautiful grounds of IPM was one of the many highlights. The excellent scientific program, together with the very pleasant setting and the flawless organization, made the workshop a resounding success. The international guests enjoyed excellent hospitality, with visits to museums, resturants, and bazaars. Opportunities to hike in nearby mountains, and to visit the lovely cities of Isfahan and Shiraz, rounded out the program.

If the success of the workshop indicates the future growth of mathematical computer science in Iran, then we can be confident that Iran will become a leader in research in this area. I am sure that all of the conference participants join me in thanking the conference organizers, the local organizer Majid Zamani, and their very capable assistants for making the workshop productive and enjoyable.

Charles J. Colbourn

Gallery of Pictures http://math.ipm.ac.ir/conferences/2000/sotacs/
 
 
back to top
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
scroll left or right