000 04936nam a22006135i 4500
001 978-3-642-03409-1
003 DE-He213
005 20240423125812.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642034091
_9978-3-642-03409-1
024 7 _a10.1007/978-3-642-03409-1
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aFundamentals of Computation Theory
_h[electronic resource] :
_b17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009, Proceedings /
_cedited by Miroslaw Kutylowski, Maciej Gebala, Witold Charatonik.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aXIII, 357 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5699
505 0 _aInvited 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.
520 _aThis 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.
650 0 _aComputer programming.
650 0 _aCompilers (Computer programs).
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aMachine theory.
650 1 4 _aProgramming Techniques.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aKutylowski, Miroslaw.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aGebala, Maciej.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aCharatonik, Witold.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642034084
776 0 8 _iPrinted edition:
_z9783642034107
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5699
856 4 0 _uhttps://doi.org/10.1007/978-3-642-03409-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c181853
_d181853