home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!olivea!tekbspa!denny
- From: pacull@lse.epfl.ch (Francois PACULL)
- Newsgroups: news.announce.conferences
- Subject: 7th Int. Work. on Distributed Algorithms (WDAG-93)
- Message-ID: <BzotGq.32B@tss.com>
- Date: 23 Dec 92 01:00:26 GMT
- Expires: Tue, 13 Apr 1993 07:00:00 GMT
- Sender: denny@tss.com (Denny Page)
- Organization: Laboratoire de Systemes d'Exploitation - E P F Lausanne - CH
- Lines: 82
- Approved: denny@tss.com
-
-
- *****************************************************************
- * CALL FOR PAPERS *
- * 7th International Workshop on *
- * DISTRIBUTED ALGORITHMS *
- * (WDAG-7) *
- * Lausanne, Switzerland, September 27-29, 1993 *
- *****************************************************************
-
- Following the successful Workshops on Distributed Algorithms
- in Ottawa (1985), Amsterdam (1987), Nice (1989), Bari (1990),
- Delphi (1991) and Haifa (1992), the Seventh Int. Workshop on
- Distributed Algorithms will be held in Switzerland in 1993.
-
- The workshop covers the entire 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 workshop will be held in Zinal (Valais), a village located in
- the Swiss Alps (alt. 1600 m / 5300 ft) at approximately 180 km
- from Geneva Airport (easily reached by train+bus).
-
- Papers are solicited describing original results in all areas
- of distributed algorithms and their applications, including, but
- not restricted to:
-
- - Distributed algorithms for control and communication
- - Fault-tolerant distributed algorithms
- - Network protocols
- - Algorithms for managing replicated data
- - Protocols for real-time distributed systems
- - Issues in asynchrony, synchrony and real-time
- - Mechanisms for security in distributed systems
- - Techniques for the design and analysis of distributed systems
- - Distributed database techniques
- - Distributed combinatorial and optimization algorithms
- - Distributed graph algorithms
-
- Intended contributors are invited to submit 13 copies of an
- extended abstract or full paper to either of the Program Committee
- co-chairmen. Submissions must not exceed 15 pages with roughly 35
- lines/page. Submissions not conforming with these guidelines may
- not be considered. Please include a 150 word abstract, 5 keywords,
- and address, e-mail address, fax/telephone number of the contact
- author.
-
- Proceedings will be published in the series Lectures Notes in
- Computer Science of Springer-Verlag. There is a limit of 15 pages
- for a paper in the proceedings.
-
- Important dates:
- Submission of papers: April 13, 1993
- Acceptance notification: June 4, 1993
- Camera-ready version: July 10, 1993
-
- Program Committee:
- D. Dolev (Hebrew Univ and IBM Almaden)
- M. Herlihy (DEC CRL)
- G. Le Lann (INRIA, Paris)
- K. Marzullo (Cornell Univ and UC San Diego)
- F. Mattern (Univ of Saarland)
- M. Merritt (AT&T)
- M. Raynal (IRISA, Rennes)
- A. Schiper (chair, EPF Lausanne and Cornell Univ)
- P. Spirakis (CTI and Patras Univ)
- J. van Leeuwen (Univ of Utrecht)
- J. Welch (Texas A&M Univ)
- S. Zaks (Technion, Haifa)
-
- Local Arrangements Chair: A. Sandoz
-
- For further information contact either A.Schiper (chair)
- or A.Sandoz (local arrangement chair) at:
-
- Department d'Informatique
- Ecole Polytechnique Federale
- 1015 Lausanne, Switzerland
-
-
- email: wdag@lse.epfl.ch
- fax: +41-21-693-3909
- tel: +1-607-255-1051 (A.Schiper)
- tel: +41-21-693-5269 (A.Sandoz)
-