From - Tue Dec 2 01:44:25 1997 Received: from CS.Stanford.EDU (CS.Stanford.EDU [171.64.64.64]) by robotics.Stanford.EDU (8.8.7/8.8.7) with ESMTP id WAA02961 for ; Sun, 2 Nov 1997 22:32:06 -0800 (PST) Received: from listserv.nodak.edu (listserv.NoDak.edu [134.129.111.8]) by CS.Stanford.EDU (8.8.7/8.8.7) with ESMTP id WAA15224; Sun, 2 Nov 1997 22:32:42 -0800 (PST) Received: from listserv (134.129.111.8) by listserv.nodak.edu (LSMTP for Windows NT v1.1a) with SMTP id <0.E08EDBB0@listserv.nodak.edu>; Mon, 3 Nov 1997 0:31:51 -0600 Received: from LISTSERV.NODAK.EDU by LISTSERV.NODAK.EDU (LISTSERV-TCP/IP release 1.8c) with spool id 1153017 for THEORYNT@LISTSERV.NODAK.EDU; Mon, 3 Nov 1997 00:30:35 -0600 Received: from listserv (134.129.111.8) by listserv.nodak.edu (LSMTP for Windows NT v1.1a) with SMTP id <0.6DA1EDE0@listserv.nodak.edu>; Mon, 3 Nov 1997 0:28:38 -0600 Received: from LISTSERV.NODAK.EDU by LISTSERV.NODAK.EDU (LISTSERV-TCP/IP release 1.8c) with spool id 1152194 for THEORY-A@LISTSERV.NODAK.EDU; Mon, 3 Nov 1997 00:28:30 -0600 Received: from pollux.usc.edu by listserv.nodak.edu (LSMTP for Windows NT v1.1a) with SMTP id <0.32312170@listserv.nodak.edu>; Mon, 3 Nov 1997 0:05:29 -0600 Received: (from ierardi@localhost) by pollux.usc.edu (8.8.4/8.8.4/usc) id WAA00023 for theory-a@listserv.nodak.edu; Sun, 2 Nov 1997 22:05:26 -0800 (PST) Approved-By: Doug Ierardi Approved-By: Theory-A - TheoryNet World-Wide Events Message-ID: <199710221951.PAA01132@zayante.cs.dartmouth.edu> Date: Sun, 2 Nov 1997 22:05:26 PST Reply-To: thc@cs.dartmouth.edu Sender: TheoryNet List From: Thomas Cormen Subject: SPAA'98 Call for Papers Comments: To: THEORY-A@LISTSERV.NODAK.EDU To: THEORYNT@LISTSERV.NODAK.EDU Status: O X-Status: CALL FOR PAPERS Tenth Annual ACM Symposium on PARALLEL ALGORITHMS AND ARCHITECTURES (SPAA) June 28 - July 2, 1998 Puerto Vallarta, Mexico http://www.cs.dartmouth.edu/SPAA/ http://www.uni-paderborn.de/cs/SPAA/ The Tenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'98) is sponsored by the ACM Special Interest Groups for Algorithms Complexity Theory (SIGACT) and Computer Architecture (SIGARCH) and organized in cooperation with the European Association for Theoretical Computer Science. CONTRIBUTED PAPERS ------------------ Contributed papers are sought in the areas of parallel algorithms and architectures, at all levels of parallelism, from VLSI to instruction-level parallelism to SMPs to supercomputers. A major goal of SPAA is to foster communication and cooperation among the diverse communities involved in the theory and practice of parallel computing, including those involved in systems, algorithms, languages, and applications. Papers should present original, fundamental advances in parallel computing. The Symposium encourages papers that offer novel approaches to parallel computing, present new ideas in parallel algorithms or architectures (including novel algorithm implementations on real machines and innovative use of technology), present models for accounting for costs on parallel machines, or study the interaction of parallel algorithms, languages and architectures. Papers must not be submitted to any other conference with published proceedings. NEW THIS YEAR ------------- The Symposium especially encourages papers in PARALLEL I/O and PARALLEL DATABASES. SPAA'98 will be collocated with the Seventeenth ACM Symposium on Principles of Distributed Computing (PODC'98). The two conferences will both run June 28-July 2 with joint receptions, plenary sessions, and food breaks. SPAA'98 will also feature a "SPAA Revue" session, with invited presentations, posters, and demonstrations of current research. Further information on the conference, including workshops and details of local arrangements, can be found at the SPAA web pages (URLs are given above). SUBMISSIONS ----------- Authors are encouraged to submit their draft papers electronically. A detailed description of the electronic submission process can be found at the SPAA web pages. Alternatively, authors may send 14 double-sided hard copies of their draft paper to: Phillip B. Gibbons, SPAA'98 Program Chair Bell Laboratories, Room 2A-220 600 Mountain Avenue Murray Hill, NJ 07974-0636 The deadline for submissions is JANUARY 16, 1998. Inquiries may be addressed to Ms. Amy Axelrod (phone: (908) 582-4707; fax: (908) 582-1239; amya@research.bell-labs.com). Interested SPAA Revue participants should contact Eric Schwabe at schwabe@ece.nwu.edu by February 20, 1998. PAPER SUBMISSION FORMAT ----------------------- The cover page should include (1) title, (2) authors and affiliation, (3) e-mail address of the contact author, and (4) a brief abstract describing the work. The draft should include an introduction understandable to a nonspecialist including motivation and previous work and a technical exposition directed to a specialist. It should not exceed 10 printed pages in 11-point type or larger (excluding cover, figures, and references). More details may be supplied in a clearly marked appendix to be read at the discretion of the Program Committee. NOTIFICATION ------------ Authors will be sent notification of acceptance or rejection by e-mail on or before March 10, 1998. A camera-ready copy of each accepted paper, prepared according to ACM guidelines, must be received by April 7, 1998. Accepted papers will be allotted a 25-minute presentation at the conference. PROGRAM COMMITTEE ----------------- Greg Astfalk, Hewlett-Packard Thomas H. Cormen, Dartmouth Frank Dehne, Carleton Pierre Fraigniaud, CNRS U. Paris-Sud Joseph Ja'Ja', U. Maryland Daniel Lenoski, Silicon Graphics Kai Li, Princeton Yossi Matias, Bell Labs & Tel-Aviv F. Meyer auf der Heide, U. Paderborn Nir Shavit, Tel-Aviv & MIT Gerhard Weikum, U. Saarland Katherine Yelick, UC Berkeley CONFERENCE OFFICERS ------------------- Program Chair: Phillip B. Gibbons, Bell Labs Revue Chair: Eric J. Schwabe, Northwestern Local Arrangements: Ming-Yang Kao, Yale Conference General Chair: Gary L. Miller, CMU Conference Secretary: Thomas H. Cormen, Dartmouth Conference Treasurer: Eric J. Schwabe, Northwestern Webmaster: Reinhard Lueling, U. Paderborn