STOC
ACM Symposium on Theory of Computing
The Annual ACM Symposium on Theory of Computing (STOC),
sponsored by
SIGACT
(the ACM
Special Interest Group on Algorithms and
Computation Theory), is traditionally held annually in April-May.
Papers presenting
original research on theoretical aspects of computer science are
sought. Typical, but not exclusive, topics of interest include
algorithmic graph theory, algorithms and data structures, applications
of logic, biological computing, computational biology, complexity
theory, cryptography, computational algebra, computational geometry,
machine learning, parallel and distributed computation, and
probabilistic computation.
Contents
STOC is traditionally held in a different location each year.
If you wish to host a future STOC, you are invited to present your case in
a public forum at
the business meeting during the next STOC.
Please contact the SIGACT Chair
and the SIGACT Site Coordinator
in advance if you plan to do this.
If you wish to submit a STOC paper, please see
the Instructions for Authors.
According to SIGACT
policy, abstract material which has been
previously published in another conference proceedings or journal (or
which is scheduled for publication prior to STOC) will not be
considered for acceptance at STOC. In addition, SIGACT policy does
not allow simultaneous submissions of the same (or essentially the
same) abstract material to another conference with a published
proceedings.
A prize of $500 will be 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.
SIGACT
supports student travel to STOC. For STOC 2008 a total of $12,000
of Student Travel Awards will be made. These awards are for needy students
to help cover expenses related to attending STOC 2006. Preference will be
given to students who are STOC authors. To apply send the following
information to
secretary.sigact@sigact.acm.org
by March 21, 2008:
-
Title of paper, if you are an author
-
Will you be presenting the paper?
-
A detailed expense list, in US dollars
-
Other travel funds that are available to you
-
(optional) Statement from your advisor on availablity of funds
This information will be used to prioritize the awards. The awards will
be announced shortly after the deadline. Late applications will not be
accepted.
You should receive an email acknowledging your application within 3 days. If not, please follow up directly with the sigact secretary at cole at nyu dot edu.
Developing Country Travel Awards: SIGACT supports travel of faculty and
researchers from developing countries to STOC. Developing Country Travel
Awards will be made each year up to a total of $5,000. These awards are for
needy faculty and researchers to help cover expenses related to attending STOC.
Applicants should be STOC authors or co-authors, or be contributing to the
conference in some other way. To apply send the information outline
above(Student Travel Award)
under items 1 throught 4 (item 5 is not required) to
secretary.sigact@sigact.acm.org
by March 21, 2008. If you are applying for a Developing Country Travel Award
please explicitly mention in your application that you are applying for this
award and not the regular award.
You should receive an email acknowledging your application within 3 days. If not, please follow up directly with the sigact secretary at cole at nyu dot edu.
The annual SIGACT business meeting
is traditionally held during one evening of the STOC conference.
Attendance is open to all members of the theoretical computer science
community. SIGACT prizes,
including the Gödel Prize,
ACM-SIGACT
Distinguished Service Prize, and the
Danny Lewin Best Student
Paper Award
are traditionally awarded at the Business Meeting.
STOC proceedings may be
purchased online
from the ACM e-store.
Some information about past STOCs
(including dates, locations, and number of attendees) is available.
Created by
Ian Parberry,
March 23, 1999.
Last updated
Fri Feb 15 14:05:42 CST 2002