[Lecture Notes in Computer Science] Algorithms and Computation Volume 1969 || Undecidability Results for Monoids with Linear-Time Decidable Word Problems

✍ Scribed by Goos, Gerhard; Hartmanis, Juris; van Leeuwen, Jan; Lee, D. T.; Teng, Shang-Hua

• Book ID: 121079436
• Publisher: Springer Berlin Heidelberg
• Year: 2000
• Tongue: English
• Weight: 181 KB
• Edition: 1
• Category: Article
• ISBN: 3540409963
• DOI: 10.1007/3-540-40996-3_24

✦ Synopsis

The papers in this volume were selected for presentation at the Eleventh Annual International Symposium on Algorithms and Computation (ISAAC 2000), held on 18{20 December, 2000 at the Institute of Information Science, Academia Sinica, Taipei, Taiwan. Previous meetings were held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), and Chennai (1999). Submissions to the conference this year were conducted entirely electro- cally. Thanks to the excellent software developed by the Institute of Information Science, Academia Sinica, we were able to carry out virtually all communication via the World Wide Web. In response to the call for papers, a total of 87 extended abstracts were submitted from 25 countries. Each submitted paper was handled by at least three program committee members, with the assistance of a number of external reviewers, as indicated by the referee list found in the proceedings. There were many more acceptable papers than there was space available in the symposium program, which made the program committee’s task extremely di cult. Finally 46 papers were selected for presentation at the Symposium. In addition to these contributed papers, the conference also included two invited presentations by Dr. Jean-Daniel Boissonnat, INRIA Sophia-Antipolis, France and Professor Jin-Yi Cai, University of Wisconsin at Madison, Wisconsin, USA. It is expected that most of the accepted papers will appear in a more complete form in scienti c journals.