2nd CFP: ISAAC 2002

Pat Morin morin at cs.carleton.ca
Wed May 15 09:56:03 PDT 2002

   Thirteenth International Symposium on Algorithms and Computation
                              ISAAC 2002 
                           Vancouver, Canada
                          November 21-23, 2002

The 13th Annual International Symposium on Algorithms and Computation
(ISAAC 2002) will be held in Vancouver, Canada on November 21-23, 2002
at the Delta Pinnacle Hotel, with a reception on the evening of
November 20. ISAAC 2002 is coupled with FOCS 2002 which will be held
at the same location from November 16-19. This is the first time that
ISAAC has ventured into North America.

The main themes for ISAAC 2002 are:

o Algorithms and Data Structures, 
o Computational Complexity
o Computational Geometry, 
o Approximation Algorithms,
o Randomized Algorithms, 
o Graph Drawing and Graph Algorithms,
o Combinatorial Optimization, 
o Computational Biology, 
o Computational Finance, 
o Cryptography, 
o Parallel and Distributed Computing.  


Authors are invited to submit papers presenting original and
unpublished research results on the symposium themes listed
above. Papers in applied areas with a strong foundational emphasis are
also welcome. Submissions should not exceed 12 pages using 11 point or
larger font.  Authors who feel that more details are necessary may
include a clearly marked appendix which will be read at the discretion
of the Program Committee. Selected papers from the conference will be
invited for submission to a special issue of Theory of Computing

Submissions to the symposium this year will only be conducted
electronically either by e-mail or web.  Hard-copy submissions will
not be accepted. Details on the submission procedure are outlined in
the website: http://www.cs.carleton.ca/isaac2002. Any inquiries should
be directed to isaac2002 at cs.carleton.ca.

For an accepted paper to be included in the proceedings, at least one
of the authors must commit to presenting the paper at the
symposium. Accepted papers will be published in Lecture Notes in
Computer Science, Springer-Verlag.


o Binay Bhattacharya, Simon Fraser, Canada
o Prosenjit Bose, Carleton University, Canada
o Arvind Gupta, Simon Fraser University, Canada
o Tiko Kameda, Simon Fraser University, Canada


o Prosenjit Bose, Chair, Carleton University, Canada
o Tetsuo Asano, JAIST, Japan
o Binay Bhattacharya, Simon Fraser Univ., Canada
o Hans Bodlaender, Utrecht University, Pays Bas
o Rudolf Fleischer, HKUST, Hong Kong
o Naveen Garg, IIT Delhi, India
o Arvind Gupta, Simon Fraser University, Canada
o Wen-Lian Hsu, Academia Sinica, Taiwan
o David Kirkpatrick, Univ. British Columbia, Canada
o Danny Krizanc, Wesleyan University, USA
o Ming Li, University of Waterloo, Canada
o Michael Molloy, University of Toronto, Canada
o Pat Morin, Carleton University, Canada
o Ian Munro, University of Waterloo, Canada
o Lata Narayanan, Concordia University, Canada
o Rajeev Raman, University of Leicester, UK
o Sunil Shende, Rutgers University, USA
o Hisao Tamaki, Meiji University, Japan
o Roberto Tamassia, Brown Univeristy, USA
o Denis Therien, McGill University, Canada
o Takeshi Tokuyama, Tohoku University, Japan


o Submission Deadline: June 3, 2002
o Notification: July 22, 2002
o Deadline for Proceedings: August 9, 2002


o Luc Devroye, McGill University, Canada
o Janos Pach, New York University, USA
o Nicholas Pippenger, Univ. British Columbia, Canada

The compgeom mailing lists: see
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.

More information about the Compgeom-announce mailing list