Theory and Applications of Models of Computation

8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings

  • Mitsunori Ogihara
  • Jun Tarui
Conference proceedings TAMC 2011

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

Table of contents

  1. Front Matter
  2. Invited Talk 1

    1. Session 1A: General Algorithms

    2. Session 1B: Approximation I

      1. Richard Schmied, Claus Viehmann
        Pages 37-47
      2. Takehiro Ito, Erik D. Demaine
        Pages 58-69
    3. Session 2A: Graph Algorithms I

      1. Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo, Jianer Chen
        Pages 70-81
      2. Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Paweł Rza̧żewski
        Pages 82-93
    4. Session 2B: Complexity I

      1. Kozue Iwata, Shiro Ishiwata, Shin-ichi Nakano
        Pages 106-113
      2. Xue Chen, Guangda Hu, Xiaoming Sun
        Pages 124-132
    5. Session 3A: Optimization I

    6. Session 3B: Circuit Complexity

  3. Invited Talk 2

    1. Session 4A: Data Structures

      1. Francis Y. L. Chin, Henry C. M. Leung, S. M. Yiu
        Pages 172-183
      2. Ruben van der Zwaan, André Berger, Alexander Grigoriev
        Pages 184-194
      3. Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Satti Srinivasa Rao
        Pages 206-217
    2. Session 4B: Logic and Formal Language Theory

      1. Sanjay Jain, Frank Stephan, Jason Teutsch
        Pages 218-229
      2. Emmanuel Jeandel, Pascal Vanier
        Pages 230-239
      3. Chunlai Zhou
        Pages 240-251
      4. Jie Fu, Jeffrey Heinz, Herbert G. Tanner
        Pages 252-263
    3. Session 5A: Graph Algorithms II

      1. Pavel Klavík, Jan Kratochvíl, Tomáš Vyskočil
        Pages 276-285
    4. Session 5B: Approximation II

      1. Ernst Althaus, Joschka Kupilas, Rouven Naujoks
        Pages 308-319
      2. Joshua Brody, Kevin Matulef, Chenggang Wu
        Pages 320-331
    5. Session 6A: Games and Learning Theory

      1. Rūsiņš Freivalds, Thomas Zeugmann
        Pages 332-343
      2. Tobias Brunsch, Heiko Röglin
        Pages 344-352
      3. Tomáš Gavenčiak
        Pages 353-364
      4. Samir Datta, Nagarajan Krishnamurthy
        Pages 365-376
    6. Session 6B: Cryptography and Communication Complexity

      1. Maciej Liśkiewicz, Rüdiger Reischuk, Ulrich Wölfel
        Pages 390-402
    7. Session 7A: Optimization II

    8. Session 7B: Complexity II

      1. Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
        Pages 452-462
      2. Eva Jelínková
        Pages 463-470
      3. Ondřej Bílka, Bernard Lidický, Marek Tesař
        Pages 471-482
    9. Session 8A: Graph Algorithms III

      1. Atlas F. Cook IV, Chenglin Fan, Jun Luo
        Pages 495-504
      2. Alexander Langer, Peter Rossmanith, Somnath Sikdar
        Pages 505-516

About these proceedings


This book constitutes the refereed proceedings of the 8th International Conference on Theory and Applications of Models of Computation, TAMC 2011, held in Tokyo, Japan, in May 2011. The 51 revised full papers presented together with the abstracts of 2 invited talks were carefully reviewed and selected from 136 submissions. The papers address the three main themes of the conference which were computability, complexity, and algorithms and are organized in topical sections on general algorithms, approximation, graph algorithms, complexity, optimization, circuit complexity, data structures, logic and formal language theory, games and learning theory, and cryptography and communication complexity.


computational geometry energy complexity modal logic ontology probability logic

Editors and affiliations

  • Mitsunori Ogihara
    • 1
  • Jun Tarui
    • 2
  1. 1.Department of Computer ScienceUniversity of MiamiCoral GablesUSA
  2. 2.Department of Information and Communication EngineeringUniversity of Electro-CommTokyoJapan

Bibliographic information

Industry Sectors
Finance, Business & Banking
IT & Software
Consumer Packaged Goods