Skip to main content
SpringerLink
Log in
Book cover

Theory and Applications of Models of Computation

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

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. T. V. Gopal

    1. Department of Computer Science and Engineering, College of Engineering, Anna University, Chennai, Chennai, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Manindra Agrawal

    1. Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Angsheng Li

    1. State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. S. Barry Cooper

    1. School of Mathematics, University of Leeds, Leeds, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: TAMC 2014.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (28 papers)

  1. Front Matter

    Download chapter PDF

  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. The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes

      • David Cattanéo, Simon Perdrix
      Pages 86-103

    7. On Representations of Abstract Systems with Partial Inputs and Outputs

      • Ievgen Ivanov
      Pages 104-123

    8. Complexity Information Flow in a Multi-threaded Imperative Language

      • Jean-Yves Marion, Romain Péchoux
      Pages 124-140

    9. A Personalized Privacy Preserving Method for Publishing Social Network Data

      • Jia Jiao, Peng Liu, Xianxian Li
      Pages 141-157

    10. A Bit-Encoding Phase Selection Strategy for Satisfiability Solvers

      • Jingchao Chen
      Pages 158-167

    11. Generalized Finite Automata over Real and Complex Numbers

      • Klaus Meer, Ameen Naif
      Pages 168-187

    12. An Incremental Algorithm for Computing Prime Implicates in Modal Logic

      • Manoj K. Raut
      Pages 188-202

    13. Approximation Algorithms for the Weight-Reducible Knapsack Problem

      • Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen
      Pages 203-215

    14. Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs

      • Matsuo Konagaya, Yota Otachi, Ryuhei Uehara
      Pages 216-228

    15. A Pseudo-Random Bit Generator Based on Three Chaotic Logistic Maps and IEEE 754-2008 Floating-Point Arithmetic

      • Michael François, David Defour, Pascal Berthomé
      Pages 229-247

    16. 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

    17. Efficient Algorithms for the Label Cut Problems

      • Peng Zhang
      Pages 259-270

    18. A Dynamic Approach to Frequent Flyer Program

      • Rajiv Veeraraghavan, Rakesh Kashyap, Archita Chopde, Swapan Bhattacharya
      Pages 271-279
Back to top

Other volumes

  1. Theory and Applications of Models of Computation

Keywords

About this book

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.

Editors and Affiliations

  • Department of Computer Science and Engineering, College of Engineering, Anna University, Chennai, Chennai, India

    T. V. Gopal

  • Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India

    Manindra Agrawal

  • State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China

    Angsheng Li

  • School of Mathematics, University of Leeds, Leeds, UK

    S. Barry Cooper

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation