Atjaunināt sīkdatņu piekrišanu

Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings 2013 ed. [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 854 pages, height x width: 235x155 mm, weight: 1306 g, 92 Illustrations, black and white; XVI, 854 p. 92 illus., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 8087
  • Izdošanas datums: 08-Aug-2013
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642403123
  • ISBN-13: 9783642403125
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 854 pages, height x width: 235x155 mm, weight: 1306 g, 92 Illustrations, black and white; XVI, 854 p. 92 illus., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 8087
  • Izdošanas datums: 08-Aug-2013
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642403123
  • ISBN-13: 9783642403125
This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.
Alternation Trading Proofs and Their Limitations.- Bin Packing Games
with Selfish Items.- A Constructive Proof of the Topological Kruskal
Theorem.- Prior-Free Auctions of Digital Goods.- Clustering on k-Edge-Colored
Graphs.- How to Pack Your Items When You Have to Buy Your Knapsack.-Computing
Behavioral Distances, Compositionally.- Rewriting Guarded Negation Queries.-
Parity Games and Propositional Proofs.- Bringing Order to Special Cases of
Klees Measure Problem.- Learning Reductions to Sparse Sets.- Probabilistic
Automata with Isolated Cut-Points.- On Stochastic Games with Multiple
Objectives.- Paradigms for Parameterized Enumeration.- Noninterference with
Local Policies.- Ordering Metro Lines by Block Crossings.- Meta-kernelization
with Structural Parameters.- Polynomial Threshold Functions and Boolean
Threshold Circuits.- Detecting Regularities on Grammar-Compressed Strings.-
An Unusual Temporal Logic.