Seventh Annual International Symposium on Algorithms And Computation

--- ISAAC '96 Call for Papers ---
Seventh Annual International Symposium on Algorithms and Computation
Osaka, Japan, December 16--18, 1996

The Seventh Annual International Symposium on Algorithms and Computation (ISAAC) will be held in Osaka, Japan, December 16--18, 1996. The symposium is intended to provide a forum for researchers working in algorithms and the theory of computation. Papers presenting original research in the areas of design and analysis of algorithms, computational complexity, and theory of computation are sought. Typical, but not exclusive, topics of interest include:

Authors should send 15 copies (in English) of an extended abstract before May 15, 1996, to the Program Committee Co-Chair:
Satoru Miyano,
Human Genome Center, Institute of Medical Science, University of Tokyo, 4-6-1 Shirokanedai, Minato-ku, Tokyo 108 Japan (e-mail:

An abstract should start with the title of the paper, each author's name, affiliation, and e-mail address, and a one-paragraph summary of the results. The length of the extended abstract should not exceed ten (10) letter-sized pages (using 11 point or larger font, with ample margins all around). More details may be given in appendix but any material beyond the 10-page limit may be ignored at the discretion of the Program Committee.

Authors will be notified of acceptance or rejection by July 30, 1996. The proceedings are accepted in principle for publication in the Springer-Verlag Lecture Notes in Computer Science series.

Symposium Chairs:

Tetsuo Asano
Yoshihide Igarashi

Invited Speakers:

M. Atallah (Purdue U., USA),
J. S. Turner (Washington U., USA)

Program Committee:

S. Miyano (Co-Chair; Japan) S. Suri (Co-Chair; USA) T. Akutsu (Japan) V. Chandru (India) D. Dobkin (USA) D.-Z. Du (USA) H. ElGindy (Australia) M. Golin (Hong Kong) T. Hirata (Japan) D. Kirkpatrick (Canada) A. K. Lenstra (USA) M. Ogihara (USA) W. Rytter (Poland) M. Sharir (Israel) A. Srinivasan (Singapore)

This conference is supported by

Osaka Electro-Communication University, Special Interest Group on Algorithms, Information Processing Society of Japan, Technical Group on Computation, IEICE of Japan

Takeshi Tokuyama
Tokyo Research Laboratory IBM Japan
Shimotsuruma, Yamato, 242 JAPAN