Theory and Applications of Models of Computation

11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings

  • T. V. Gopal
  • Manindra Agrawal
  • Angsheng Li
  • S. Barry Cooper
Conference proceedings TAMC 2014

DOI: 10.1007/978-3-319-06089-7

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

Table of contents (28 papers)

  1. Front Matter
  2. A Roadmap for TAMC
    T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper
    Pages 1-6
  3. Contributed Papers

    1. A Tight Lower Bound Instance for k-means++ in Constant Dimension
      Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon
      Pages 7-22
    2. An Improved Upper-Bound for Rivest et al.’s Half-Lie Problem
      Bala Ravikumar, Duncan Innes
      Pages 23-38
    3. Reversibility of Elementary Cellular Automata under Fully Asynchronous Update
      Biswanath Sethi, Nazim Fatès, Sukanta Das
      Pages 39-49
    4. Finite State Incompressible Infinite Sequences
      Cristian S. Calude, Ludwig Staiger, Frank Stephan
      Pages 50-66
    5. Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games
      David Auger, Pierre Coucheney, Yann Strozecki
      Pages 67-85
    6. Complexity Information Flow in a Multi-threaded Imperative Language
      Jean-Yves Marion, Romain Péchoux
      Pages 124-140
    7. Generalized Finite Automata over Real and Complex Numbers
      Klaus Meer, Ameen Naif
      Pages 168-187
    8. Approximation Algorithms for the Weight-Reducible Knapsack Problem
      Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen
      Pages 203-215
    9. Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems
      Min Lu, Tian Liu, Weitian Tong, Guohui Lin, Ke Xu
      Pages 248-258
    10. A Dynamic Approach to Frequent Flyer Program
      Rajiv Veeraraghavan, Rakesh Kashyap, Archita Chopde, Swapan Bhattacharya
      Pages 271-279

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014, held in Chennai, India, in April 2014. The 27 revised full papers presented were carefully reviewed and selected from 112 submissions. The papers explore the algorithmic foundations, computational methods, and computing devices to meet today's and tomorrow's challenges of complexity, scalability, and sustainability, with wide-ranging impacts on everything from the design of biological systems to the understanding of economic markets and social networks.

Keywords

algorithmic game theory complexity modal and temporal logics model checking optimization oracles and decision trees security and privacy social networks stochastic games theorem proving and SAT solving

Editors and affiliations

  • T. V. Gopal
    • 1
  • Manindra Agrawal
    • 2
  • Angsheng Li
    • 3
  • S. Barry Cooper
    • 4
  1. 1.Department of Computer Science and Engineering, College of EngineeringAnna University, ChennaiChennaiIndia
  2. 2.Department of Computer Science and EngineeringIndian Institute of TechnologyKanpurIndia
  3. 3.State Key Laboratory of Computer Science, Institute of SoftwareChinese Academy of SciencesBeijingChina
  4. 4.School of MathematicsUniversity of LeedsLeedsUK

Bibliographic information

  • Copyright Information Springer International Publishing Switzerland 2014
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-06088-0
  • Online ISBN 978-3-319-06089-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349