STOC 2003
STOC 2003
The Thirty-Fifth
Annual ACM Symposium on
Theory of Computing (STOC),
sponsored by
SIGACT
(the ACM
Special Interest Group on Algorithms and
Computation Theory),
will be held June 9-11 in
San Diego, California,
as part of the 2003 Federated Computing
Research Conference,
which runs June 7-14, 2003.
Contents
Call for papers in
html
txt
format.
Detailed instructions for the electronic submissions are available at
here.
Submissions are closed.
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.
Starting this STOC 2003, the
program committee may designate up to three papers accepted to the
conference as STOC Best Papers. Rules for the award(s) can be found at
http://sigact.acm.org/prizes/bestpaper.
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 2003 a total of $10,000
of Student Travel Awards will be made. These awards are for needy students
to help cover expenses related to attending STOC 2002. Preference will be
given to students who are STOC authors. To apply send the following
information to
secretary@sigact.acm.org
by March 15, 2003:
-
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.
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.acm.org
by April 15, 2003. 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. This award is beginning in 2003 on a trial
basis and may be discontinued.
Here is a
list of accepted papers.
and a
schedule.
The conference will be held at the
Town and Country Resort and
Convention Center in Mission Valley, the heart of San Diego.
A block of 3800 rooms has been reserved, at $128 single occupancy,
$148 double occupancy.
See under FCRC.
Banquet information is not yet available.
See under FCRC.
Program Committee Members:
- Sanjeev Arora (Princeton U.)
- Avrim Blum (CMU)
- David Eppstein (UC Irvine)
- Uriel Feige (Weizmann I.)
- Michel Goemans (MIT) (chair)
- Johan Håstad (KTH)
- Sanjeev Khanna (U Penn)
- Samir Khuller (U. Maryland, College Park)
- Ashwin Nayak (MSRI and U. Waterloo)
- Rafail Ostrovsky (Telcordia)
- Guenter Rote (FU Berlin)
- Leonard Schulman (CalTech)
- Gregory Sorkin (IBM)
- Aravind Srinivasan (U. Maryland, College Park)
- Luca Trevisan (UC Berkeley)
- Santosh Vempala (MIT)
Program Chair:
Michel X. Goemans
Massachusetts Institute of Technology
Room 2-351
Cambridge, MA 02139, USA.
Telephone: 617-253-2688.
E-mail: goemans@math.mit.edu.
Created by
Ian Parberry,
May 1, 2002.
Last updated by
Wolfgang W. Bein,
May 17, 2002