The Thirty-Fourth Annual ACM Symposium on Theory of Computing (STOC), sponsored by SIGACT (the ACM Special Interest Group on Algorithms and Computation Theory), will be held in Montréal, Québec, Canada, May 19- 2002.
STOC 2002 will be colocated with the IEEE conf on Computational Complexity to be held May 21-24, 2002.
Information about electronic submission of papers is available here.
Your submitted electronic manuscript should be printable by us on 8 1/2" x 11" paper. Proceedings templates are available online in Word, WordPerfect, FrameMaker and LaTex. and must be used. The ACM proceedings format specifications described here. Please adhere strictly to these specifications, or we may not be able to put your paper in the proceedings.
Please note: It is of particular importance that you leave sufficient space in the lower left corner of the first column on the first page to fill in the copyright information, which must be included in your paper. Do not use page numbers. Please contact Lisa Tolles-Efinger at Sheridan Printing (Phone: 1-908-213-8988 Email:firstname.lastname@example.org) for any issues concerning proceedings publication.
There is a 10-page maximum on your paper. If you wish to have additional pages, you may have up to 2 additional pages at a cost of $250 per page. Please make your check payable to the Sheridan Printing Company and send it with your copyright form to the Sheridan Printing Company (address below). If your electronically submitted paper exceeds 10 pages and by February 20 no check has arrived, your paper may not appear in the proceedings.
All accepted papers must be submitted in electronic form. The detailed instructions about electronic submission on the sigact server is available here. Also carefully read the Sheridan Printing Company’s additional instructions here.
LaTex users need to use type 1 fonts, for additional help see here. All authors must insert the ACM copyright statement and conference information on the bottom/left of the first page. This is covered in the instructions here.
All accepted papers must be submitted in electronic form. Detailed information about the process of electronic submission of accepted papers is available here. (Electronic submission of accepted papers should not be done before February 10, 2002.) Electronic submission of accepted papers may be done starting February 10, 2002 and must be completed by 5:59 pm EST February 20, 2002 to be included in the final proceedings.
The ACM Copyright Form is available online. The ACM copyright form must be signed. I caution you that ACM will not publish any paper that is not accompanied by a signed copyright form. In those cases where there is more than one author per paper, the first-named (assumed senior) author only must sign. Please note that the paper title must match exactly on the form and your submission, or ACM will demand a new signed form.
Please federal express or mail your signed hardcopy copyright form (and if needed, your check for additional pages, as described above) to:
Attention:STOC2002 Conference Proceedings
Sheridan Printing Company
1425 Third Avenue
Alpha, New Jersey, 08865-4695
so that it is received by us by no later than February 20, 2002. Alternatively, you can fax the ACM copyright form to 1-908-454-2554.
Note: The deadline of 5:59 pm EST February 20, 2002 for electronic submission of accepted papers and February 20, 2002 for reception of hardcopy copyright forms are firm deadlines.
A prize of $500 is given to the author(s) of the best student-authored paper (or split between more than one paper if there is a tie). A paper is eligible if all of its authors are full-time students at the time of submission. This must be indicated in the submission cover letter or (for electronic submissions) the registration process. Information on past winners is available.
The STOC2002 best student award is being given to Tim Roughgarden.
This information will be used to prioritize the awards. The awards will be announced shortly after the deadline. Late applications will not be accepted.
Registration information is not yet available.
Location information is not yet available.
Banquet information is not yet available.
Travel information is not yet available.
Created by Ian Parberry, November 13, 2000.
Last updated Sun Aug 5 14:54:22 CDT 2001