LEADER 04544nam  22007935  450 
001 996465710303316
005 20230405223955.0
010   $a3-642-40313-1
024 7 $a10.1007/978-3-642-40313-2
035   $a(CKB)3710000000015910
035   $a(SSID)ssj0000988208
035   $a(PQKBManifestationID)11584619
035   $a(PQKBTitleCode)TC0000988208
035   $a(PQKBWorkID)10949063
035   $a(PQKB)10162704
035   $a(DE-He213)978-3-642-40313-2
035   $a(MiAaPQ)EBC3093141
035   $a(PPN)172429293
035   $a(EXLCZ)993710000000015910
100   $a20130816d2013      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aMathematical Foundations of Computer Science 2013$b[electronic resource] $e38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings /$fedited by Krishnendu Chatterjee, Jirí Sgall
205   $a1st ed. 2013.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013.
215   $a1 online resource (XVI, 854 p. 92 illus.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8087
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-40312-3 
327   $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.
330   $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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8087
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aNumerical analysis
606   $aArtificial intelligence?Data processing
606   $aMachine theory
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aNumerical Analysis
606   $aData Science
606   $aFormal Languages and Automata Theory
606   $aMathematical Applications in Computer Science
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aNumerical analysis.
615  0$aArtificial intelligence?Data processing.
615  0$aMachine theory.
615 14$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aNumerical Analysis.
615 24$aData Science.
615 24$aFormal Languages and Automata Theory.
615 24$aMathematical Applications in Computer Science.
676   $a004.0151
702   $aChatterjee$b Krishnendu$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aSgall$b Jirí$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996465710303316
996   $aMathematical Foundations of Computer Science 2013$92829866
997   $aUNISA