Theory and Applications of Models of Computation

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

Editors:

ISBN: 978-3-319-06088-0 (Print) 978-3-319-06089-7 (Online)

Table of contents (28 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-6

    A Roadmap for TAMC

  3. Contributed Papers

    1. No Access

      Book Chapter

      Pages 7-22

      A Tight Lower Bound Instance for k-means++ in Constant Dimension

    2. No Access

      Book Chapter

      Pages 23-38

      An Improved Upper-Bound for Rivest et al.’s Half-Lie Problem

    3. No Access

      Book Chapter

      Pages 39-49

      Reversibility of Elementary Cellular Automata under Fully Asynchronous Update

    4. No Access

      Book Chapter

      Pages 50-66

      Finite State Incompressible Infinite Sequences

    5. No Access

      Book Chapter

      Pages 67-85

      Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games

    6. No Access

      Book Chapter

      Pages 86-103

      The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes

    7. No Access

      Book Chapter

      Pages 104-123

      On Representations of Abstract Systems with Partial Inputs and Outputs

    8. No Access

      Book Chapter

      Pages 124-140

      Complexity Information Flow in a Multi-threaded Imperative Language

    9. No Access

      Book Chapter

      Pages 141-157

      A Personalized Privacy Preserving Method for Publishing Social Network Data

    10. No Access

      Book Chapter

      Pages 158-167

      A Bit-Encoding Phase Selection Strategy for Satisfiability Solvers

    11. No Access

      Book Chapter

      Pages 168-187

      Generalized Finite Automata over Real and Complex Numbers

    12. No Access

      Book Chapter

      Pages 188-202

      An Incremental Algorithm for Computing Prime Implicates in Modal Logic

    13. No Access

      Book Chapter

      Pages 203-215

      Approximation Algorithms for the Weight-Reducible Knapsack Problem

    14. No Access

      Book Chapter

      Pages 216-228

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

    15. No Access

      Book Chapter

      Pages 229-247

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

    16. No Access

      Book Chapter

      Pages 248-258

      Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems

    17. No Access

      Book Chapter

      Pages 259-270

      Efficient Algorithms for the Label Cut Problems

    18. No Access

      Book Chapter

      Pages 271-279

      A Dynamic Approach to Frequent Flyer Program

    19. No Access

      Book Chapter

      Pages 280-299

      A Categorical Treatment of Malicious Behavioral Obfuscation

previous Page of 2