34th ACM Symposium on Theory of Computing Montréal, Québec, Canada
May 19-21, 2002
Co-location with CCC 2002. The 17th Conference on Computational Complexity will be organized back to back with the 34rd Annual ACM Symposium on Theory of Computing (CCC 2002, May 21-24, 2002).
The 34th ACM Symposium on Theory of Computing (STOC2002), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory, will be held in Montreal, Canada, May 19-21, 2002. Typical, but not exclusive, topics of interest include algorithms and data structures, complexity theory, cryptography, computational algebra and geometry, algorithmic graph theory, applications of logic, machine learning, parallel and distributed computing, theoretical aspects of databases, information retrieval, and networks, computational biology, quantum computation and other alternative models of computation. STOC2002 is sponsored by SIGACT (ACM Special Interest Group on Algorithms and Computation Theory). It is co-located with the 17th Conference on Computational Complexity (Complexity 2002).
Pankaj Agarwal, Alan Borodin, Sam Buss, Shafi Goldwasser, Rao Kosaraju, Richard Ladner, Gary Miller, Michael Mitzenmacher, Satish Rao, John Reif (chair), Micha Sharir, Paul Spirakis, Mikkel Thorup, and Leslie Valiant.
John H. Reif, D223 LSRC Building, Department of Computer Science, Research Drive, Duke University, Box 90129, Durham, NC 27708-0129 USA.
Telephone: (919)-660-6568. E-mail: email@example.com.
Pierre McKenzie, Laboratoire d'informatique théorique et quantique, Département d'informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128 succursale Centre-ville, Montréal (Québec) H3C 3J7 Canada.
School of Computer Science, McGill University, 3480 University Street, McConnell
Eng. Bldg., Room 30, Montréal (Québec), H3A 2A7, Canada. Telephone (514) 398-7071