[comp.theory] CFP - Workshop on Distributed Algorithms

sam@cs.cornell.edu (Sam Toueg) (03/21/91)

		5th INTERNATIONAL WORKSHOP
       			   ON
		DISTRIBUTED ALGORITHMS (WDAG-5)

		     Delphi, Greece
		  October 7 to 9, 1991

Following the successful Workshops on Distributed Algorithms
in Ottawa (1985), Amsterdam (1987), Nice (1989), and Bari (1990)
the Fifth Workshop on Distributed Algorithms will be
held in Delphi, Greece (where the oracle comes from).
The workshop covers the area of distributed algorithms.
It provides a forum for the presentation of new research results
and the identification of future research directions in this area.
The formal sessions will be held in the Delphi Conference Center,
a modern, well-equipped facility.

Papers are solicited describing original results in all areas
of distributed algorithms and their applications, including,
but not restricted to:

- distributed combinatorial algorithms
- distributed graph algorithms
- distributed optimization algorithms
- distributed data structures
- fault-tolerant distributed algorithms
- protocols for real-time distributed systems
- mechanisms for safety and security in distributed systems
- distributed database techniques
- replica control protocols
- distributed algorithms for control and communication
- design of network protocols
- communication complexity
- distributed algorithms for machine learning
- techniques for the design and analysis of distributed algorithms

Intended contributors are invited to submit 15 copies of a full
paper to the Program Committee secretary, at the following address:

Workshop on Distributed Algorithms (WDAG-5)
   attn. Mrs Lena Gourdoupi
   Computer Technology Institute (CTI)
   P.O. Box 1122
   26110 Patras
   GREECE

Submissions must not exceed 12 pages with roughly 35 lines/page
(approximately 5500 words in total), and must arrive before May 22, 1991.
Submissions not conforming with these guidelines may not be considered.
When possible, please include the authors' FAX and/or telephone numbers,
and e-mail addresses. The authors will be notified
of acceptance or rejection by July 15, 1991. Proceedings will be
published in the series Lectures Notes in Computer Science of
Springer-Verlag.
A copy of the final version of each accepted paper is due September 1, 1991,
in camera ready form.

PROGRAM COMMITTEE

Y. Afek		(Tel Aviv U. and ATT Bell Labs)
D. Dolev	(Hebrew U. and IBM Almaden)
C. Dwork	(IBM Almaden)
V. Hadzilacos	(U. of Toronto)
A. Itai		(Technion U.)
S. Kutten	(IBM Yorktown)
J. van Leeuwen	(U. of Utrecht)
F. Mattern	(U. of Kaiserslautern)
B. Sanders	(ETH Zurich)
N. Santoro	(Carleton U. and U. of Bari)
P. Spirakis	(program committee co-chair, CTI & Patras U.)
S. Toueg	(program committee co-chair, Cornell U.)
P.M.B. Vitanyi	(CWI and U. Amsterdam)
M. Yung		(IBM Yorktown)
S. Zaks		(Technion U.)

LOCAL ARRANGEMENTS CHAIRMAN

L. Kirousis (CTI & Patras U.)

For further information contact either program co-chairman:

Prof. Paul Spirakis
Computer Technology Institute
Patras University
P.O. BOX 1122
26110 Patras
GREECE
tel: +30-61-991650
fax: +30-61-991909
email: spirakis@grpatvx1.bitnet

Prof. Sam Toueg
Department of Computer Science
4106 Upson Hall
Cornell University
14853 Ithaca, New York
U.S.A.
tel: +01-607-2559197
fax: +01-607-2554428
email: sam@cs.cornell.edu

or the local arrangements chairman:

Prof. Lefteris Kirousis
Computer Technology Institute
Patras University
P.O. BOX 1122
26110 Patras
GREECE
tel: +30-61-991650
fax: +30-61-991909
email: kirousis@grpatvx1.bitnet

IMPORTANT NOTE:
This year, WDAG will be followed by an ALCOM Day on Distributed
Computing. ALCOM stands for the project ALGORITHMS and COMPLEXITY of
the ESPRIT BASIC RESEARCH ACTIONS (No. 3072) of the EC. The ALCOM Day
will take place on October 10, 1991, in the same place (Delphi),
and will consist of a series of lectures by invited speakers.
WDAG participants are welcome to attend and participate in the discussions.