Advertisement

© 2007

Theory and Applications of Models of Computation

4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007. Proceedings

  • Editors
  • Jin-Yi Cai
  • S. Barry Cooper
  • Hong Zhu
Conference proceedings TAMC 2007

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

Table of contents

  1. Contributed Papers

    1. Yong Li, Jun-Hai Yong
      Pages 440-449
    2. M. V. Panduranga Rao
      Pages 450-461
    3. Andrew C. C. Yao, Frances F. Yao, Yunlei Zhao
      Pages 462-473
    4. Andrew C. C. Yao, Frances F. Yao, Yunlei Zhao
      Pages 474-485
    5. Markus Hinkelmann, Andreas Jakoby, Peer Stechert
      Pages 486-498
    6. Takaaki Mizuki, Yoshinori Kugimoto, Hideaki Sone
      Pages 499-510
    7. Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai
      Pages 511-520
    8. Stuart A. Kurtz, Janos Simon
      Pages 542-553
    9. Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
      Pages 573-583
    10. Akifumi Kawaguchi, Hiroshi Nagamochi
      Pages 584-594
    11. Decheng Ding, Klaus Weihrauch, Yongcheng Wu
      Pages 595-604
    12. Xin Li, Tian Liu, Han Peng, Liyan Qian, Hongtao Sun, Jin Xu et al.
      Pages 624-631
    13. Giordano Fusco, Eric Bach
      Pages 632-645
    14. Wangsen Feng, Li’ang Zhang, Wanling Qu, Hanpin Wang
      Pages 646-658

About these proceedings

Keywords

algorithm algorithms complexity computability computability theory computer computer science logic algorithm analysis and problem complexity

Bibliographic information