Screen LibraryMathematical 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...
Saved in:
| Corporate Authors: | ; |
|---|---|
| Group Author: | ; |
| Published: |
Springer,
|
| Publisher Address: | Heidelberg : |
| Publication Dates: | [2013] |
| Literature type: | eBook |
| Language: | English |
| Series: |
Lecture notes in computer science,
8087 Advanced research in computing and software science |
| Subjects: | |
| Online Access: |
http://dx.doi.org/10.1007/978-3-642-40313-2 |
| Summary: |
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. |
| Carrier Form: | 1 online resource (xvi, 851 pages) : illustrations. |
| Bibliography: | Includes bibliographical references and index. |
| ISBN: |
9783642403132 (electronic bk.) 3642403131 (electronic bk.) |
| Index Number: | QA76 |
| CLC: | TP301.6-532 |
| Contents: |
Alternation Trading Proofs and Their Limitations / Bin Packing Games with Selfish Items / A Constructive Proof of the Topological Kruskal Theorem / Logical and Structural Approaches to the Graph Isomorphism Problem / Prior-Free Auctions of Digital Goods / Synthesis from Temporal Specifications: New Applications in Robotics and Model-Driven Development / Clustering on k-Edge-Colored Graphs / How to Pack Your Items When You Have to Buy Your Knapsack / Computing Behavioral Distances, Compositionally / Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions? / Rewriting Guarded Negation Queries / Parity Games and Propositional Proofs / Logic and Branching Automata / A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items / Determinacy and Rewriting of Top-Down and MSO Tree Transformations / On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing / Validity of Tree Pattern Queries with Respect to Schema Information / Auctions for Partial Heterogeneous Preferences / New Polynomial Cases of the Weighted Efficient Domination Problem / Bringing Order to Special Cases of Klee's Measure Problem / |