Theory and Applications of Models of Computation 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings / [electronic resource] :
edited by T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper.
- Cham : Springer International Publishing, 2014.
- 1 online resource (XIV, 423 p. 75 ill.)
- Lecture Notes in Computer Science, 8402 0302-9743 ; .
A Roadmap for TAMC -- A tight lower bound instance for k-means++ in constant dimension -- An improved Upper-bound for Rivest et al.'s Half-lie Problem -- Reversibility of Elementary Cellular Automata Under Fully Asynchronous Update -- Finite State Incompressible Infinite Sequences -- Finding optimal strategies of almost acyclic Simple Stochastic Games -- The Parameterized Complexity of Domination-type Problems and Application to Linear Codes -- On representations of abstract systems with partial inputs and outputs -- Complexity Information Flow in a Multi-threaded Imperative Language -- An Incremental Algorithm for Computing Prime Implicates in Modal Logic -- Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-like Set Systems -- space complexity of optimization problems in planar graphs -- Fine Tuning Decomposition Theorem for Maximum Weight Bipartite Matching -- Intersection Dimension of Bipartite Graphs -- On the Parameterized Complexity for Token Jumping on Graphs -- More on Universality of Spiking Neural P Systems with Anti-Spikes -- Modular Form Approach to Solving Lattice Problems.