victor@WATSON.IBM.COM (Thomas Lengauer) (03/28/91)
Call for Participation
The Leonardo Fibonacci Institute for the Foundations of Computer Science
Course on the Algorithmics of Physical Circuit Design
Trento, Italy, July 8 - 12, 1991
Lecturers:
Prof. Thomas Lengauer, University of Paderborn, FRG
Prof. Lengauer received his Dr.rer.nat. in Mathematics from the Free
University of Berlin in 1976 and his Ph.D. in Computer Science from
Stanford University in 1979. He habilitated at the University of the
Saarland in 1984, and since then has been a full professor of Computer
Science at the University of Paderborn. His research interests include
algorithms and complexity as well as combinatorial optimization,
especially as it applies to science and technology. In the past years
he has worked, in particular, on algorithms for circuit layout.
Prof. Rolf Mohring, Technical University of Berlin, FRG
Prof. Mohring has been a full professor of Applied Mathematics and
Computer Science at the Technical University of Berlin since 1987. He
obtained his Dr.rer.nat. and habilitation in Mathematics in 1975 and
1982 at the Technical University of Aachen and has been an Associate
Professor at the Universities of Hildesheim and Bonn. His research
interests are in algorithmic graph theory, combinatorial optimization,
and software development for optimization oriented applications from
engineering and operations research, in particular in the areas of
circuit layout and scheduling.
Prof. Majid Sarrafzadeh, Northwestern University at Evanston, IL, U.S.A.
Prof. Sarrafzadeh received his B.S., M.S. and Ph.D. (1987), all from
the University of Illinois at Urbana-Champaign in the Electrical and
Computer Engineering Department. Since 1986 he has been an Assistant
Professor at the Department of Electrical Engineering and Computer
Science of Northwestern University. His research interests lie in the
areas of design and analysis of algorithms and computational
complexity, with emphasis in circuit layout.
Course Outline
The course is concerned with combinatorial algorithms for physical
circuit design and their mathematical foundations. Topics of the course
include circuit partitioning, placement and floorplanning, global
routing, detailed routing, and compaction. Solution methods for these
problem come from combinatorial optimization, algorithmic graph theory,
and computational geometry.
Course Structure and Applications
The course will be supplemented by guest lectures presented by leading
specialists visiting the Institute from both academia and industry. To
foster a congenial and productive atmosphere, attendance is limited to
approximately twenty or twenty five participants. Participants are
encouraged to talk about their own research. A select group of four to
six participants will stay on for additional three weeks (until Aug. 2)
and will conduct research in collaboration with the lecturers.
There are no fees for the course. Ten to fifteen scholarships will be
awarded to outstanding participants, covering local expenses (meals and
lodging). To apply, send a short resume and a cover letter stating
whether you wish to attend only the course or if you would like to
participate in the research experience. If you would like to be
considered for financial support, arrange for two letters of
recommendation to be sent directly, and indicate this in your cover
letter. Address the material to:
Prof. Thomas Lengauer,
Department of Computer Science and Mathematics (FB 17)
University of Paderborn
W-4790 Paderborn
FRG
Phone: +49-5251-60 2067/2066
Fax:+49-5251-60 3836
Telex: 936776 unipb d
Email: tl@uni-paderborn.de
Applications requesting financial support should be received by April
1, 1990, and notification of a decision will be sent by May, 1. Other
applications will be considered until June 10.
Trento is a pleasant historical town in the region of Trento--Alto
Adige, in the foothills of the Dolomite mountains and next to Lake
Garda, well-connected to Milan, Venice, and Austria.