Annual ACM Symposium on
Theory of Computing (STOC),
Special Interest Group on Algorithms and
will be held in
Crete, Greece, July 6-8, 2001,
(July 8-12) and
SPAA 2001 (July 4-6).
STOC 01 will be organized by the
Computer Technology Institute (CTI).
Registration, accommodation, and travel
information is now available.
Travel information for STOC 01
is now available here.
supports student travel to STOC. For STOC 2001 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 2001. Preference will be
given to students who are STOC authors. To apply send the following
by March 15, 2001:
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
The full program is now available in text format.
The 2000 A. M. Turing Award was given to
Professor Andrew Chih-Chih Yao
in recognition of his fundamental contributions to the theory of
computation, including the complexity-based theory of pseudorandom
number generation, cryptography, and communication complexity.
Professor Yao will deliver his Turing Award Lecture at the
conference on July 8.
There will be two other Keynote Speakers for both Conferences.
Both talks will be given on Sunday, July 8.
Prof. Christos Papadimitriou
The Greek Computer Society [GCS] and the Council of the Computer Technology
Institute (CTI), unanimously decided to deliver to
Prof. Christos Papadimitriou an award for the most influential contribution
to the Foundations of Computing
done by a scientist of Greek origin.
Prof. Boris Trakhtenbrot
The 80th birthday of Prof. Boris Trakhtenbrot and his very important
contribution to Formal Languages and Automata
will be honoured. Prof. Boris Trakhtenbrot will give a talk titled "Automata
and Circuits: Facets of Continuous Time".
The 2001 Gödel Prize
will be awarded in a joint STOC-ICALP
session at the conference to
S. Arora, U. Feige, S. Goldwasser, C. Lund, L. Lovasz,
R. Motwani, S. Safra, M. Sudan, M. Szegedy
for the three papers
"Approximating Clique is almost NP-complete";
"A New Characterization of NP";
"Proof Verification and Intractability of Approximation Problems".
Professor Uriel Feige will give a talk titled
"Reflections on the PCP theorem and its consequences".
The Program Committee Chair is
The full committee consists of:
Ronald Fagin (IBM Almaden)
Joan Feigenbaum (Yale)
Leonidas Guibas (Stanford)
Russell Impagliazzo (UCSD)
Sampath Kannan (University of Pennsylvania)
Elias Koutsoupias (UCLA)
Ming Li (UCSB)
Kurt Mehlhorn (Max-Planck-Institute)
S. Muthukrishnan (AT\&T Labs)
Noam Nisan (Hebrew University)
Christos Papadimitriou (Berkeley)
Prabhakar Raghavan (Verity)
Peter Shor (AT&T Labs)
Eva Tardos (Cornell)
Lisa Zhang (Bell Labs)
Mihalis Yannakakis (Bell Labs), Chair
C. Bouras, CTI and University of Patras
S. Bozapalidis, Aristotle University of Thessaloniki
R. Efstathiadou, CTI
C. Kaklamanis, CTI and University of Patras
M. Mavronicolas, University of Cyprus
C. Nikolaou, University of Crete and ICS-FORTH
CTI and University of Patras,
email@example.com (Publicity Co-Chair)
- Ian Parberry, University of North Texas, (Publicity Co-Chair)
Paul G. Spirakis,
CTI and University of Patras,
A. Tsakalidis, CTI and University of Patras
S. Zachos, National Technical University of Athens
CTI and University of Patras