------------------------------------------------------------------------ CALL FOR PAPERS 1991 ACM SYMPOSIUM ON THEORY OF COMPUTING The Twenty-Third Annual ACM Symposium on Theory of Computing (STOC), sponsored by the ACM Special Interest Group for Automata and Computability Theory, will be held in New Orleans, Louisiana, May 6-8, 1991. Papers presenting original research on theoretical aspects of computer science are sought. Typical but not exclusive topics of interest include: algorithms and data structures, automata and formal languages, computability and complexity, computational geometry, cryptography, databases, logics of programs, machine learning, parallel and distributed computation, robotics, semantics of programming languages, VLSI layout and design. ABSTRACT SUBMISSION: Authors are requested to send sixteen copies of a detailed abstract (not a full paper) by Nov. 7, 1990 to: Joseph Halpern STOC 91 Program Chair IBM Almaden Research Center, Dept. K53/802 650 Harry Rd. San Jose, CA 95120-6099 Authors from locations where access to reproduction facilities is severely limited may submit a single copy of their abstract. An abstract should start with a succinct statement of the problem, the results achieved, their significance and a comparison with previous work. This material should be understandable to nonspecialists. A technical exposition directed to the specialist should follow. The length, excluding cover page and bibliography, should not exceed 10 pages with roughly 35 lines/page (roughly 4500 words in total). If authors believe that more details are necessary to substantiate the main claims of the paper, they may include a clearly marked appendix that will be read at the discretion of the Program Committee. If available, an email address for the contact author should be included. An abstract deviating significantly from these guidelines risks rejection without consideration of its merits. An abstract must be received by Nov. 7 (or postmarked by Nov. 3 and sent airmail). This is a **FIRM** deadline. Simultaneous submission of the same abstract to STOC and to another conference with published proceedings is not allowed. NOTIFICATION: Authors will be notified of acceptance or rejection by a letter mailed on or before Jan. 22, 1991. A final copy of each accepted paper is required by March 4, 1991. Again this is a **FIRM** deadline. The copy may be either on special forms, which will be sent to the authors, or typeset as 8 1/2 X 11 pages. Each accepted paper will be presented at the Symposium. BEST STUDENT PAPER AWARD: This prize of $500 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 submission letter. The program committee may decline to make the award or may split it among several papers. COMMITTEE MEMBERS: The program committee consists of Baruch Awerbuch, Michael Ben-Or, Ashok Chandra, Joan Feigenbaum, Joachim von zur Gathen, Leonidas Guibas, Joseph Halpern, Leonard Pitt, Michael Saks, David Shmoys, Daniel Sleator, Eli Upfal, Umesh Vazirani, and Andrew Yao. Information about local arrangements can be obtained from either of the Conference co-Chairman: Cris Koutsougeras Computer Science Dept. Tulane University New Orleans, LA 70118 cris@rex.cs.tulane.edu Jeff Vitter Department of Computer Science Brown University Providence, Rhode Island 02912-1910 jsv@cs.brown.edu