From - Tue Dec 2 01:59:19 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 JAA16513; Tue, 25 Nov 1997 09:54:58 -0800 (PST) Received: from listserv-mail.surfnet.nl (listserv-mail.surfnet.nl [192.87.5.141]) by CS.Stanford.EDU (8.8.7/8.8.7) with ESMTP id JAA05219; Tue, 25 Nov 1997 09:55:42 -0800 (PST) Received: from listserv-mail (192.87.5.141) by listserv-mail.surfnet.nl (LSMTP for Windows NT v1.1a) with SMTP id <0.F95077E0@listserv-mail.surfnet.nl>; Tue, 25 Nov 1997 18:50:18 +0100 Received: from NIC.SURFNET.NL by NIC.SURFNET.NL (LISTSERV-TCP/IP release 1.8c) with spool id 5715 for DMA-LIST@NIC.SURFNET.NL; Tue, 25 Nov 1997 18:55:48 +0100 Received: from HEARN (NJE origin SMTP@HEARN) by HEARN.NIC.SURFNET.NL (LMail V1.2c/1.8c) with BSMTP id 5888; Tue, 25 Nov 1997 18:55:48 +0100 Received: from utmfu6.math.utwente.nl by HEARN.nic.SURFnet.nl (IBM VM SMTP V2R2) with TCP; Tue, 25 Nov 97 18:55:45 +0100 Received: from utmfu0.math.utwente.nl (utmou1.math.utwente.nl) by utmfu6.math.utwente.nl with ESMTP (1.40.112.8/16.2) id AA019510461; Tue, 25 Nov 1997 18:54:22 +0100 Received: by utmfu0.math.utwente.nl ($Revision: 1.36.108.11 $/16.2) id AA042950460; Tue, 25 Nov 1997 18:54:20 +0100 Mailer: Elm [revision: 66.36.1.1] Approved-By: DMANET Message-ID: <199711251754.AA042950460@utmfu0.math.utwente.nl> Date: Tue, 25 Nov 1997 18:54:19 MET Reply-To: longpre@cs.utep.edu Sender: DMANET From: DMANET Subject: Computational Complexity 98, Call for papers To: DMA-LIST@NIC.SURFNET.NL Status: O X-Status: Below is an ASCII version of the call for papers for Computational Complexity 98. For a .tex, .dvi, .html, .ps version, look at the website for our conference: http://cs.utep.edu/longpre/complexity.html ----------------------------------------------------- CALL FOR PAPERS COMPUTATIONAL COMPLEXITY Thirteenth Annual IEEE Conference June 15-18, 1998 University at Buffalo Buffalo, NY, USA The conference seeks original research papers in **all** areas of complexity theory. Possible topics include: * Structure of complexity classes * Communication complexity * Resource-bounded reducibilities * Theory of relativizations * Interactive proof systems * Complexity and logic * Computational randomness * Kolmogorov complexity * Circuits and other concrete * Cryptographic complexity computational models * Complexity and learning * Proof complexity * Quantum computation We encourage electronic submissions to the conference. See below for details. To submit a paper through regular channels, send ten copies of an extended abstract to the program committee chair: Joan Feigenbaum, Email: jf@research.att.com AT&T Labs - Research Phone: 973 360 8442 Room C203 180 Park Avenue Florham Park, NJ 07932, USA A submission must be received by **December 5th, 1997** for consideration. Joint submissions to other conferences are **not** permitted. Authors of accepted papers are expected to present their work at the conference. The program committee will determine time allocations for presentations (between 15 and 45 minutes). Both short papers containing important results and area surveys are welcome. Conference proceedings will be published by the IEEE Computer Society. PROGRAM COMMITTEE Joan Feigenbaum (chair), AT&T Labs - Research Richard Beigel, Lehigh Univ. Stephen Fenner, U. Southern Maine Judy Goldsmith, U. Kentucky Martin Kummer, U. of Chemnitz Elvira Mayordomo, U. Zaragoza Moni Naor, Weizman Inst. Steven Rudich, Carnegie Mellon Univ. Dan Spielman, MIT Alan Selman, Univ. at Buffalo CONFERENCE COMMITTEE Eric Allender (chair), Rutgers Univ. Richard Beigel, Lehigh Univ. Jin-Yi Cai, Univ. at Buffalo Anne Condon, U. Wisconsin Lance Fortnow, U. Chicago Steven Homer, Boston Univ. Luc Longpre, U. of Texas at El Paso Jacobo Toran, U. of Ulm Avi Wigderson, The Hebrew Univ. IMPORTANT DATES Submissions Due: Dec. 5, 1997 Notification: Feb. 16, 1998 LOCAL ARRANGEMENTS Ken Regan E-mail: regan@cs.buffalo.edu SPONSORS The conference is sponsored by the IEEE Computer Society Technical Committee for Mathematical Foundations of Computing in cooperation with ACM SIGACT and EATCS. FOR MORE INFORMATION Get more information through the complexity web page: http://cs.utep.edu/longpre/complexity.html You may also contact the publicity chair: Luc Longpr\'{e}; Computer Science Department, University of Texas at El Paso, El Paso, TX 79968, USA; E-mail: longpre@cs.utep.edu. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ COMPUTATIONAL COMPLEXITY: ADDITIONAL DETAILS ELECTRONIC SUBMISSIONS We encourage electronic submissions to the conference. Please check the instructions through WWW at URL: http://sigact.csci.unt.edu/~compl98/Complexity98.html or send an e-mail message to compl98@sigact.csci.unt.edu with HELP as subject header. OTHER SUBMISSIONS In the cover letter of your submission, please give the full postal address of the corresponding author. Also, include this author's email address, fax number, and telephone number if these are available. SUBMISSION GUIDELINES The conference has imposed a **firm** limitation of ten pages (in 11 point or larger fonts) on submissions. The ten-page limit *excludes*: the cover page, bibliography, and technical appendices. Submissions deviating from these guidelines risk summary rejection. In your abstract: (i) explain what the paper's major contributions are, (ii) convey why these contributions are interesting, and (iii) tell how these contributions relate to prior work. Use appendices to substantiate your major technical results. Authors who have severely limited access to reproduction facilities may submit a single copy of their abstract. BEST STUDENT PAPER AWARD This award will be given to the best paper written solely by one or more students. An abstract is eligible if all authors are full-time students at the time of submission. This should be indicated in the electronic submission or cover letter. The program committee may decline to make the award or may split it among several papers. FINAL COPIES The deadline for final copies will be communicated to authors of accepted papers. PAST PROCEEDINGS Past proceedings of recent Structures/Complexity conferences can be ordered from: IEEE Computer Society Press Phone: +1 714-821-6657 (or toll Customer Service Center free in NA 800-272-6657) 10662 Los Vaqueros Circle FAX: +1 714-821-4010 P.O. Box 3014 Los Alamitos, CA 90720-1264 USA CONFERENCE ABSTRACTS In conjunction with the conference, contributed short research abstracts will be collected and will be made available a few days before the conference. Attendance at the conference is *not* required to submit an abstract. For more details, contact the abstracts editor: William Gasarch E-mail: gasarch@cs.umd.edu. Dept. of Computer Science Univ. of Maryland College Park, MD 20742 USA. THE CONFERENCE SITE The conference will be on the campus of University at Buffalo. The local arrangements are by Ken Regan. His address is: Ken Regan E-mail: regan@cs.buffalo.edu University at Buffalo Department of Computer Science 226 Bell Hall Buffalo, NY 14260 USA. -- ****************************************************** Contributions to be spread via DMANET are submitted to DMANET@math.utwente.nl Replies to a message carried on DMANET should NOT be addressed to DMANET but to the original sender. The original sender, however, is invited to prepare an update of the replies received and to communicate it via DMANET. DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)