Fundamentals of Computation Theory: 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009, Proceedings (Paperback)

Invited Lectures.- How to Guard the Guards Themselves.- Alternating Weighted Automata.- Contributions.- Maintaining Arrays of Contiguous Objects.- The k-Anonymity Problem Is Hard.- Independence Results for n-Ary Recursion Theorems.- Depletable Channels: Dynamics and Behaviour.- Noise-Resilient Group Testing: Limitations and Constructions.- Martingales on Trees and the Empire Chromatic Number of Random Trees.- Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity.- Combinatorial Queries and Updates on Partial Words.- The Longest Haplotype Reconstruction Problem Revisited.- Earliest Query Answering for Deterministic Nested Word Automata.- Multiway In-Place Merging.- On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs.- On Random Betweenness Constraints.- Directed Graphs of Entanglement Two.- Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies.- Computing Role Assignments of Chordal Graphs.- Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL.- Closure Operators for Order Structures.- Correcting Sorted Sequences in a Single Hop Radio Network.- A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs.- Small-Space Analogues of Valiant's Classes.- Small Weakly Universal Turing Machines.- Open Maps Bisimulations for Higher Dimensional Automata Models.- Decision Version of the Road Coloring Problem Is NP-Complete.- NP-Completeness of st-Orientations for Plane Graphs.- Equivalence of Deterministic Nested Word to Word Transducers.- Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space.- Energy Complexity and Depth of Threshold Circuits.- 1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs.