unige@cernvax.cern.ch (nicolas mayencourt) (04/06/91)
COURSE on
ALGORITHMS AND COMPLEXITY
CISM, Udine, Italy
June 17-21, 1991
The course is intended as a follow up uf the College on 'Fundamentals of
Computer Science' (May 6-June 14, 1991) carried out under the Project
'Applied Mathematics, and Informatics for Developing Countries' financed
by the Italian Ministery for Foreign Affairs and implemented through Unesco
by the International Center for Mechanical Sciences (CISM).
As such it will be largely devoted to researchers from developing countries,
in particular most participants in the previous College. However,
participation from developed countries is also welcome. A registration fee
of 300,000 Italian Liras will be charged in this case.
The course will focus on some recent issues which are at the borderline
between Computer Science, Mathematics and Operations Research. The notion
of algorithm is central to both theory and practice of Computer Science
and is strongly intertwined with the notion of complexity, that is, roughly
speaking, the amount of time and space resources required by an algorithm
as the size of input data grows. The development of new concepts and theories
has been so fast in the last twenty years that only a few topics can be
covered in a one week course. It has been decided to give emphasis to the
following themes: Combinatorial Optimization, Parallel Algorithms and
Computational Geometry.
Each theme will be delivered by one international expert on the basis of
ten lectures. This is the program:
COMBINATORIAL OPTIMIZATION (C. Papadimitriou, UC San Diego, California):
Computational Complexity, Complexity Classes, Complete Problems,
Approximation.
PARALLEL ALGORITHMS (G.A.P. Kindervater, Center for Mathematics and Computer
Science, Amsterdam, The Netherlands): Models, Complexity, Numerical Problems,
Combinatorics, Polylog Parallel Algorithms, Log Space Completeness,
NP-hard problems, Enumerative Methods.
COMPUTATIONAL GEOMETRY (L. Guibas, IBM Center, Palo Alto, California):
Design and Analysis of Geometrical Algorithms, Complexity in Classical
Geometry, Geometric Search Algorithms, Convex Hulls, Voronoi Diagrams,
Triangulation Algorithms, Intersection Algorithms, VLSI Design.
For more information contact:
Prof. Paolo Serafini
CISM
Piazza Garibaldi 18
I 33100 UDINE (Italy)
Tel. 39 432 294989 Fax 39 432 510755
272201 501523
297169 510882
295716
e-mail: SERAFINI@UDUNIV.CINECA.IT