04552nam 2200613Ia 450 991048373400332120200520144314.03-642-03409-810.1007/978-3-642-03409-1(CKB)1000000000784726(SSID)ssj0000317848(PQKBManifestationID)11254905(PQKBTitleCode)TC0000317848(PQKBWorkID)10293998(PQKB)11561409(DE-He213)978-3-642-03409-1(MiAaPQ)EBC3064587(PPN)139954945(EXLCZ)99100000000078472620070817d2009 uy 0engurnn|008mamaatxtccrFundamentals of computation theory 17th international symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009 : proceedings /Miroslaw Kutylowsky, Witold Charatonik, Maciej Gebala (eds.)1st ed. 2009.Berlin ;Heidelberg Springerc20091 online resource (XIII, 357 p.) Lecture notes in computer science ;5699Bibliographic Level Mode of Issuance: Monograph3-642-03408-X Includes bibliographical references and index.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.This book constitutes the refereed proceedings of the 17th International Symposium Fundamentals of Computation Theory, FCT 2009, held in Wroclaw, Poland in August 2009. The 29 revised full papers were carefully reviewed and selected from 67 submissions. The papers address all current topics in computation theory such as automata and formal languages, design and analysis of algorithms, computational and structural complexity, semantics, logic, algebra and categories in computer science, circuits and networks, learning theory, specification and verification, parallel and distributed systems, concurrency theory, cryptography and cryptograhic protocols, approximation and randomized algorithms, computational geometry, quantum computation and information, bio-inspired computation.Lecture notes in computer science ;5699.Machine theoryCongressesComputational complexityCongressesMachine theoryComputational complexity004n/aDAT 542fstubSS 4800rvkKutylowsky Miroslaw1751572Charatonik Witold1751573Gebala Maciej1075274FCT 2009MiAaPQMiAaPQMiAaPQBOOK9910483734003321Fundamentals of computation theory4186562UNINA