Computing and Combinatorics

9th Annual International Conference, COCOON 2003 Big Sky, MT, USA, July 25–28, 2003 Proceedings

  • Tandy Warnow
  • Binhai Zhu

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

Table of contents

  1. Front Matter
    Pages I-XIII
  2. Invited Lecture

    1. Joel Spencer
      Pages 1-2
  3. Computational Geometry I

    1. Sergei Bespamyatnikh
      Pages 20-29
    2. Jinhui Xu, Yang Yang, Zhiyong Lin
      Pages 40-49
  4. Computational Biology I

    1. Yong Gao, Junfeng Wu, Robert Niewiadomski, Yang Wang, Zhi-Zhong Chen, Guohui Lin
      Pages 57-67
    2. Wei Fu, Wing-Kai Hon, Wing-Kin Sung
      Pages 80-89
  5. Computational/Complexity Theory I

    1. E. Fischer, J. A. Makowsky
      Pages 90-101
  6. Graph Theory/Algorithms I

    1. Yen Hung Chen, Chin Lung Lu, Chuan Yi Tang
      Pages 122-129
    2. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
      Pages 130-138
    3. Huaming Zhang, Xin He
      Pages 139-148
  7. Automata/Petri Net Theory

    1. Hsu-Chun Yen, Lien-Po Yu
      Pages 149-158
    2. Pierluigi San Pietro, Zhe Dang
      Pages 159-171
  8. Graph Theory/Algorithms II

    1. Xiao Zhou, Yuki Matsuo, Takao Nishizeki
      Pages 172-181

About these proceedings

Keywords

Automat algorithms automata complexity complexity theory computational geometry distributed computing petri net

Editors and affiliations

  • Tandy Warnow
    • 1
  • Binhai Zhu
    • 2
  1. 1.Department of Computer ScienceUniversity of Texas at AustinAustinUSA
  2. 2.Department of Computer ScienceMontana State UniversityBozemanUSA

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45071-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-40534-4
  • Online ISBN 978-3-540-45071-9
  • Series Print ISSN 0302-9743
  • About this book