ISAAC'96: Final Call for Papers (ASCII)
danny chen
Final Call for Papers
Seventh Annual International Symposium on Algorithms and Computation
ISAAC '96
Osaka, Japan
December 16--18, 1996
The Seventh Annual International Symposium on Algorithms and Computation
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:
Algorithms and Data Structures
Automata and Formal Languages
Combinatorial Optimization
Computational Geometry
Cryptography and Complexity Theory
Genome Science
Learning Theory
Parallel and Distributed Algorithms
Probabilistic Algorithms
Authors should send 15 copies (in English) of an extended abstract before
May 15, 1996, to the Program Committee Co-Chair:
Satoru Miyano, (e-mail: miy...@ims.u-tokyo.ac.jp)
Human Genome Center, Institute of Medical Science,
University of Tokyo,
4-6-1 Shirokanedai, Minato-ku, Tokyo 108 Japan
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 extended abstract should provide sufficient detail to
allow the Program Committee to evaluate its validity, quality, and
relevance to the symposium. 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.
Special Issue of Mathematical Systems Theory: A special issue of
this journal (which will be renamed as Theory of Computing Systems)
will be dedicated to the symposium. Selected participants will be
invited to submit their full papers for possible publication in the
journal. The invited papers will be subject to the normal refereeing
process of Mathematical Systems Theory.
Best Paper Award: This award will be given to the best paper that is
selected by the Program Committee. The Program Committee may decline
to make the award, or may split it among several papers.
Symposium Chairs:
Tetsuo Asano (Osaka Electro-Comm. U., Japan),
Yoshihide Igarashi (Gunma U., Japan)
Invited Speakers:
M. Atallah (Purdue U., USA),
J. S. Turner (Washington U., USA)
Program Committee:
S. Miyano (Co-Chair; U. of Tokyo, Japan)
S. Suri (Co-Chair; Washington U., USA
T. Akutsu (Gunma, Japan)
V. Chandru (Ind. Inst. Sci., India)
D. Dobkin (Princeton, USA)
D.-Z. Du (Minnesota, USA)
H. ElGindy (Newcastle, Australia)
M. Golin (HK UST, Hong Kong)
T. Hirata (Nagoya, Japan)
D. Kirkpatrick (UBC, Canada)
A. K. Lenstra (Bellcore, USA)
M. Ogihara (Rochester, USA)
W. Rytter (Warsaw, Poland)
M. Sharir (Tel Aviv, Israel)
A. Srinivasan (Nat. U. Singapore, Singapore)