Nantilus
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...
Enregistré dans:
| Auteurs principaux : | , |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | Mathematical Foundations of Computer Science 2013 : 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings / edited by Krishnendu Chatterjee, Jirí Sgall. |
| Publié : |
Berlin, Heidelberg :
Springer Berlin Heidelberg
, [20..] Cham : Springer Nature |
| Collection : | Theoretical computer science and general issues (Online) ; 8087 |
| Accès en ligne : |
Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr |
| Note sur l'URL : | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex |
| Condition d'utilisation et de reproduction : | 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 |
| Sujets : | |
| Documents associés : | Autre format:
Mathematical Foundations of Computer Science 2013 Autre format: Mathematical Foundations of Computer Science 2013 |
- 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.