Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Chennai,

Theory and Applications of Models of Computation

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

Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (Eds.)

2014, XIV, 423 p. 75 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$69.99

(net) price for USA

ISBN 978-3-319-06089-7

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$95.00

(net) price for USA

ISBN 978-3-319-06088-0

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

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.

Content Level » Research

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

Related subjects » Security and Cryptology - Theoretical Computer Science

Table of contents 

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.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Theory of Computation.