Mathematical Foundations of Computer Science 2013 : 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings

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 se...

Full description

Saved in:
Bibliographic Details
Main Author: Chatterjee, Krishnendu
Other Authors: Sgall, Jirí (Publishing director)
Format: Livre numérique
Language:Anglais
Published: Berlin, Heidelberg : Springer Berlin Heidelberg [20..].
Cham : Springer Nature
Series:Theoretical Computer Science and General Issues 8087
Subjects:
Online Access:Accès sur la plateforme de l'éditeur
Accès sur la plateforme de l'éditeur (Springer)
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Note: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Mathematical Foundations of Computer Science 2013, 9783642403125
• Mathematical Foundations of Computer Science 2013, 9783642403149
LEADER 03890nam a22003617a 4500
001 947153
008 131018q2000 xxe ||| |||| 00| 0 eng d
009 PPN172429293
020 |a 9783642403132 
041 0 |a eng 
082 |a 005.1 
100 1 |a Chatterjee, Krishnendu. 
245 1 0 |a Mathematical Foundations of Computer Science 2013 :  |b 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings   |c edited by Krishnendu Chatterjee, Jirí Sgall. 
260 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Theoretical Computer Science and General Issues  |v 8087  |x 2512-2029 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a 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 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. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a 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. 
650 |a Actes de congrès 
700 1 |a Sgall, Jirí.  |4 pbd 
776 0 |t Mathematical Foundations of Computer Science 2013  |z 9783642403125 
776 0 |t Mathematical Foundations of Computer Science 2013  |z 9783642403149 
856 4 |q PDF  |u https://doi.org/10.1007/978-3-642-40313-2  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://doi.org/10.1007/978-3-642-40313-2  |z Accès sur la plateforme de l'éditeur (Springer) 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-8DNSDPKN-7  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747816018  |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/978-3-642-40313-2  |z Accès Université d'Orléans 
856 4 |5 180339901:750832452  |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/978-3-642-40313-2  |z Accès INSA CVL 
997 |0 947153  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/