Theory and Applications of Models of Computation

by Agrawal, Manindra; Du, Ding-Zhu; Duan, Zhenhua; Li, Angsheng

• ISBN13: 9783540792277
• ISBN10: 3540792279
• Format: Paperback
• Copyright: 2008-05-01
• Publisher: Springer-Verlag New York Inc

Summary

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.

Table of Contents

Differential Privacy: A Survey of Results	p. 1
On the Complexity of Measurement in Classical Physics	p. 20
Quantum Walk Based Search Algorithms	p. 31
Propositional Projection Temporal Logic, Buchi Automata and [omega]-Regular Expressions	p. 47
Genome Rearrangement Algorithms for Unsigned Permutations with O(log n) Singletons	p. 59
On the Complexity of the Hidden Subgroup Problem	p. 70
An O*(3.52[superscript 3k]) Parameterized Algorithm for 3-Set Packing	p. 82
Indistinguishability and First-Order Logic	p. 94
Derandomizing Graph Tests for Homomorphism	p. 105
Definable Filters in the Structure of Bounded Turing Reductions	p. 110
Distance Constrained Labelings of Trees	p. 125
A Characterization of NC[superscript k] by First Order Functional Programs	p. 136
The Structure of Detour Degrees	p. 148
Hamiltonicity of Matching Composition Networks with Conditional Edge Faults	p. 160
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs	p. 170
Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity	p. 182
More on Weak Bisimilarity of Normed Basic Parallel Processes	p. 192
Extensions of Embeddings in the Computably Enumerable Degrees	p. 204
An Improved Parameterized Algorithm for a Generalized Matching Problem	p. 212
Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus	p. 223
Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences	p. 234
Ratio Based Stable In-Place Merging	p. 246
A Characterisation of the Relations Definable in Presburger Arithmetic	p. 258
Finding Minimum 3-Way Cuts in Hypergraphs	p. 270
Inapproximability of Maximum Weighted Edge Biclique and Its Applications	p. 282
Symbolic Algorithm Analysis of Rectangular Hybrid Systems	p. 294
On the OBDD Complexity of the Most Significant Bit of Integer Multiplication	p. 306
Logical Closure Properties of Prepositional Proof Systems	p. 318
Graphs of Linear Clique-Width at Most 3	p. 330
A Well-Mixed Function with Circuit Complexity 5n [plus or minus] o(n): Tightness of the Lachish-Raz-Type Bounds	p. 342
A Logic for Distributed Higher Order [pi]-Calculus	p. 351
Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs	p. 364
A Topological Study of Tilings	p. 375
A Denotational Semantics for Total Correctness of Sequential Exact Real Programs	p. 388
Weak Bisimulations for the Giry Monad (Extended Abstract)	p. 400
Approximating Border Length for DNA Microarray Synthesis	p. 410
On a Question of Frank Stephan	p. 423
A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF	p. 433
Improved Algorithms for Bicluster Editing	p. 445
Generation Complexity Versus Distinction Complexity	p. 457
Balancing Traffic Load Using One-Turn Rectilinear Routing	p. 467
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree	p. 479
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems	p. 490
A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable (Extended Abstract)	p. 502
Model Theoretic Complexity of Automatic Structures (Extended Abstract)	p. 514
A Separation between Divergence and Holevo Information for Ensembles	p. 520
Unary Automatic Graphs: An Algorithmic Perspective	p. 542
Search Space Reductions for Nearest-Neighbor Queries	p. 554
Total Degrees and Nonsplitting Properties of [Sigma][subscript 2][superscript 0] Enumeration Degrees	p. 568
s-Degrees within e-Degrees	p. 579
The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees	p. 588
Author Index	p. 597
Table of Contents provided by Blackwell. All Rights Reserved.