Theory and Applications of Models of Computation 5th International Conference, TAMC 2008, Xi’an, China, April 25-29, 2008. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Agrawal, Manindra (Επιμελητής έκδοσης), Du, Dingzhu (Επιμελητής έκδοσης), Duan, Zhenhua (Επιμελητής έκδοσης), Li, Angsheng (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Lecture Notes in Computer Science, 4978
• Θέματα: Computer science.; Computers.; Algorithms.; Computer science > Mathematics.; Bioinformatics.; Computer Science.; Theory of Computation.; Algorithm Analysis and Problem Complexity.; Computation by Abstract Devices.; Computing Methodologies.; Mathematics of Computing.; Computational Biology/Bioinformatics.

 This book constitutes the refereed proceedings of the 5th International Conference on Theory and Applications of Models of Computation, TAMC 2008, held in Xi'an, China in April 2008. The 48 revised full papers presented together with 2 invited talks and 1 plenary lecture were carefully reviewed and selected from 192 submissions. The papers address current issues of all major areas in computer science, mathematics (especially logic) and the physical sciences - computation, algorithms, complexity and computability theory in particular. With this crossdisciplinary character the conference is given a special flavor and distinction. 

 Plenary Lectures -- Differential Privacy: A Survey of Results -- Special Session Lectures -- On the Complexity of Measurement in Classical Physics -- Quantum Walk Based Search Algorithms -- Contributed Lectures -- Propositional Projection Temporal Logic, B chi Automata and ?-Regular Expressions -- Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons -- On the Complexity of the Hidden Subgroup Problem -- An O *(3.523k ) Parameterized Algorithm for 3-Set Packing -- Indistinguishability and First-Order Logic -- Derandomizing Graph Tests for Homomorphism -- Definable Filters in the Structure of Bounded Turing Reductions -- Distance Constrained Labelings of Trees -- A Characterization of NC k by First Order Functional Programs -- The Structure of Detour Degrees -- Hamiltonicity of Matching Composition Networks with Conditional Edge Faults -- Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs -- Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity -- More on Weak Bisimilarity of Normed Basic Parallel Processes -- Extensions of Embeddings in the Computably Enumerable Degrees -- An Improved Parameterized Algorithm for a Generalized Matching Problem -- Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus -- Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences -- Ratio Based Stable In-Place Merging -- A Characterisation of the Relations Definable in Presburger Arithmetic -- Finding Minimum 3-Way Cuts in Hypergraphs -- Inapproximability of Maximum Weighted Edge Biclique and Its Applications -- Symbolic Algorithm Analysis of Rectangular Hybrid Systems -- On the OBDD Complexity of the Most Significant Bit of Integer Multiplication -- Logical Closure Properties of Propositional Proof Systems -- Graphs of Linear Clique-Width at Most 3 -- A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds -- A Logic for Distributed Higher Order ?-Calculus -- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs -- A Topological Study of Tilings -- A Denotational Semantics for Total Correctness of Sequential Exact Real Programs -- Weak Bisimulations for the Giry Monad (Extended Abstract) -- Approximating Border Length for DNA Microarray Synthesis -- On a Question of Frank Stephan -- A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF -- Improved Algorithms for Bicluster Editing -- Generation Complexity Versus Distinction Complexity -- Balancing Traffic Load Using One-Turn Rectilinear Routing -- A Moderately Exponential Time Algorithm for Full Degree Spanning Tree -- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems -- A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable -- Model Theoretic Complexity of Automatic Structures (Extended Abstract) -- A Separation between Divergence and Holevo Information for Ensembles -- Unary Automatic Graphs: An Algorithmic Perspective -- Search Space Reductions for Nearest-Neighbor Queries -- Total Degrees and Nonsplitting Properties of Enumeration Degrees -- s-Degrees within e-Degrees -- The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees.