Theory and Applications of Models of Computation

6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings

  • Jianer Chen
  • S. Barry Cooper
Conference proceedings TAMC 2009

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5532)

Table of contents

  1. Front Matter
  2. Plenary Talks

  3. Invited Special Session: Models of Computation

    1. Alessandra Carbone, Linda Dib
      Pages 6-17
    2. S. Barry Cooper
      Pages 18-28
    3. Andrea Sorbi
      Pages 29-38
  4. Invited Special Session: Algorithms and Complexity

  5. Contributed Papers

    1. Faisal N. Abu-Khzam
      Pages 81-87
    2. Klaus Ambos-Spies, Thorsten Kräling
      Pages 88-97
    3. Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
      Pages 98-107
    4. Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes
      Pages 108-117
    5. Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu
      Pages 118-127
    6. Jasper Berendsen, Taolue Chen, David N. Jansen
      Pages 128-137
    7. Jin-Yi Cai, Pinyan Lu, Mingji Xia
      Pages 138-149
    8. Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
      Pages 150-157
    9. Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng
      Pages 158-167

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 6th International Conference on Theory and Applications of Models of Computation, TAMC 2009, held in Changsha, China in May 2009.

The 39 full papers presented together with 7 invited papers as well as 3 plenary talks were selected from 86 submissions. The papers address the three main themes of the conference which were Computability, Complexity, and Algorithms. The conference aimed to bring together researchers with interests in theoretical computer science, algorithmic mathematics, and applications to the physical sciences.

Keywords

algebra algorithm algorithms automata complexity computability computer science constraints distributed systems exponential time logic models of computation path counting tree topology undecidability

Editors and affiliations

  • Jianer Chen
    • 1
  • S. Barry Cooper
    • 2
  1. 1.Department of Computer Science and EngineeringTexas A&M UniversityTexasUSA
  2. 2.School of MathematicsUniversity of LeedsU.K.

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-02017-9
  • Copyright Information Springer Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-02016-2
  • Online ISBN 978-3-642-02017-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book