MFCS 2000 25th International Symposium on Mathematical Foundations of Computer Science August 28 - September 1, 2000 Bratislava, Slovak Republic, Europe

Algorithmic Foundations of Communication Networks

(Attached Workshop)

• Workshop coordinator: Marios Mavronicolas
• Contact address: mavronic@turing.cs.ucy.ac.cy
• Date: August 27, 2000

Research in the technology and applications of communication networks is nowadays experiencing a tremendous amount of interest, activity and development. A precise understanding of the capabilities and limitations of algorithms for solving the central problems that arise in this context is a necessary prerequisite for the achievement of rigorous progress by this intensive research activity. This special issue will cover some of the most exciting, recent developments in the young field of communication algorithmics, with the aim to collect together fruitful results, which are likely to spawn new significant research, and significant directions, along with their open problems and issues that need to be adressed, that are expected to structure the field in the few years ahead.

Tentative Program    ( August 27, Sunday )

Morning Session

• Paul Spirakis, University of Patras and CTI: "Frequency Allocation Algorithms and Radiocoloring"
• Pierre Fraigniaud, LRI, France: "Compact Routing versus Broadcasting"
• Shmuel Zaks, The Technion, Israel: "Design Issues in ATM and Optical Networks"

Afternoon Session

• Peter Ruzicka, Comenius University: "Algorithmic Developments in Interval Routing"
• Christos Kaklamanis, University of Patras and CTI: "Wavelength Routing in Optical Networks"
• David Peleg, The Weizmann Institute: "Distance Labeling Schemes for Graphs"

Back to MFCS 2000 Home Page