ck@rex.cs.tulane.edu (Cris Koutsougeras) (10/24/90)
This is a final reminder for the STOC-91 submission deadline.
------------------------------------------------------------------------
CALL FOR PAPERS
1991 ACM SYMPOSIUM ON
THEORY OF COMPUTING
May 6-8, 1991
New Orleans, Louisiana
The Twenty-Third Annual ACM Symposium on Theory of Computing
(STOC), sponsored by the ACM special Interest Group for Auto-
mata 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. Typi-
cal but not exclusive topics of interest include: algorithms
and data structures, automata and formal languages, computa-
bility 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 location where access to reproduction facilities
is severely limited may submit a single copy of their
abstract. An abstract should start with a succint 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, exclud-
ing 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 substan-
tiate the main claims of the paper, they may include a clear-
ly 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 sig-
nificantly from these guidelines risks rejection without con-
sideration 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 sub-
mission of the same abstract to STOC and to another confer-
ence with published proceedings is not allowed.
NOTIFICATION: Authors will be notified of acceptance or re-
jection by a letter mailed on or before Jan. 22, 1991. A fi-
nal copy of each accepted paper is required by March 4, 1991.
Again this is a FIRM deadline. The copy may be either on spe-
cial 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.00 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 sub-
mission letter. The program committee 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, Leo-
nard Pitt, Michael Saks, David Shmoys, Daniel Sleator, Eli
Upfal, Umesh Vazirani, and Andrew Yao.
Information about local arrangements can be obtained from ei-
ther 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