Fundamentals of Computation Theory: 15th International Symposium, FCT 2005, Lübeck, Gemany, August 17-20, 2005, ProceedingsMaciej Liskiewicz, Rüdiger Reischuk This volume is dedicated to the 15th Symposium on Fundamentals of Com- tation Theory FCT 2005, held in Lu ]beck, Germany, on August 17-20, 2005. The FCT symposium was established in 1977 as a biennial event for - searchers interested in all aspects of theoretical computer science, in particular in algorithms, complexity, and formal and logical methods. The previous FCT conferences were held in the following places: Poznan ́ (Poland, 1977), Wendisch- Rietz (Germany, 1979), Szeged (Hungary, 1981), Borgholm (Sweden, 1983), Cottbus(Germany,1985), Kazan(Russia,1987), Szeged(Hungary,1989), Gosen- Berlin (Germany, 1991), Szeged (Hungary, 1993), Dresden (Germany, 1995), Krak ́ ow (Poland, 1997), Iasi (Romania, 1999), Riga (Latvia, 2001) and Malmo ] (Sweden, 2003). The FCT conference seriesis coordinatedby a steering comm- tee. Its current members are B. Chlebus (Denver/Warsaw), Z. Esik (Szeged), M. Karpinski (Bonn), A. Lingas (Lund), M. Santha (Paris), E. Upfal (Providence) and I. Wegener (Dortmund). The call for papers for FCT 2005 sought contributions on original research in all aspects of theoretical computer science including design and analysis of algorithms, abstract data types, approximation algorithms, automata and formal languages, categorical and topological approaches, circuits, computational and structural complexity, circuit and proof theory, computational biology, com- tational geometry, computer systems theory, concurrency theory, cryptography, domain theory, distributed algorithms and computation, molecular computation, quantumcomputation and information, granular computation, probabilistic c- putation, learning theory, rewriting, semantics, logic in computer science, spe- ?cation, transformation and veri?cation, and algebraic aspects of computer s- ence. |
Contents
Invited Talks | 1 |
The Smoothed Analysis of Algorithms | 17 |
Circuits | 32 |
Automata I | 56 |
Complexity I | 75 |
Generic Density and Small Span Theorem | 92 |
A Faster and Simpler 2Approximation Algorithm for Block Sorting | 115 |
Translational Lemmas for Alternating TMs and PRAMs | 137 |
NonApproximability for the Multicriteria TSP12 | 329 |
Semantics | 341 |
A Selfdependency Constraint in the Simply Typed Lambda Calculus | 352 |
A Type System for Computationally Secure Information Flow | 365 |
Approximation Algorithms | 378 |
The Maximum Resource Bin Packing Problem | 397 |
Relations Between AverageCase and WorstCase Complexity | 422 |
Constant Time Generation of Linear Extensions | 445 |
Graphs and Complexity | 161 |
CliqueWidth for FourVertex Forbidden Subgraphs | 185 |
Simple Stochastic Games and PMatrix Generalized Linear | 209 |
Adaptive Zooming in Point Set Labeling | 233 |
Query Complexity | 245 |
Property Testing and the Branching Program Size of Boolean Functions | 258 |
Distributed Systems | 270 |
The Delayed kServer Problem | 281 |
Automata and Formal Languages | 293 |
Shrinking Multipushdown Automata | 305 |
Graph Algorithms | 317 |
An Explicit Solution to Posts Problem over the Reals | 467 |
The Complexity of Semilinear Problems in Succinct Representation | 479 |
Graph Algorithms | 491 |
An Improved Approximation Algorithm for TSP with Distances | 504 |
New Applications of Clique Separator Decomposition for the Maximum | 516 |
Automata II | 528 |
Tree Automata and Discrete Distributed Games | 540 |
Pattern Matching | 552 |
Fully Incremental LCS Computation | 563 |
| 575 | |
Other editions - View all
Common terms and phrases
abs-block acyclic subhypergraph approximation algorithm automata automaton Berlin Heidelberg 2005 biautomatic boolean c-nodes circuit clique clique-width complexity classes consider constant construct contains Corollary corresponding defined Definition deletion denote deterministic distributed dominating edge equivalent exists finite function gates given graph G Halting problem hierarchy homomorphism hyperedges hypergraph independent sets induced subgraph input integer k-server problem labels language least leftmost Lemma linear extension LNCS lower bound matching substrings matrix node notion NP-complete O(log obtain optimal oracle output P-matrix paper partition point path polynomial polynomial hierarchy polynomial-time Proc Proof properties Proposition prove PSPACE quantum quantum circuit qubits query query complexity random ratio recursive regular expression Reischuk Eds restriction Section semigroup sequence solution Springer-Verlag string structure subgraph subset symbol tape Theorem theory tree treewidth Turing machine undirected graph variables vertex vertices


