000 03824nam a22005775i 4500
001 978-3-642-40313-2
003 DE-He213
005 20200421112541.0
007 cr nn 008mamaa
008 130816s2013 gw | s |||| 0|eng d
020 _a9783642403132
_9978-3-642-40313-2
024 7 _a10.1007/978-3-642-40313-2
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aMathematical Foundations of Computer Science 2013
_h[electronic resource] :
_b38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings /
_cedited by Krishnendu Chatterjee, Jir�i Sgall.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXVI, 854 p. 92 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8087
505 0 _aAlternation 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 Klee's 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.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aAlgorithms.
650 0 _aMathematical logic.
650 0 _aNumerical analysis.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aNumeric Computing.
650 2 4 _aData Structures.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aMath Applications in Computer Science.
700 1 _aChatterjee, Krishnendu.
_eeditor.
700 1 _aSgall, Jir�i.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642403125
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8087
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-40313-2
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c58283
_d58283