Description
Mathematical Foundations of Computer Science 2013, 2013
38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings
Theoretical Computer Science and General Issues Series
Coordinators: Chatterjee Krishnendu, Sgall Jirí
Language: EnglishSubjects for Mathematical Foundations of Computer Science 2013:
854 p. · 15.5x23.5 cm · Paperback
Description
/li>Contents
/li>Comment
/li>
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.
Fast conference proceedings
State-of-the-art report
Up to date results