Fundamentals of computation theory. 14th international symposium, FCT 2003, Malmö, Sweden, August 12--15, 2003. Proceedings (Q1416070)

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 0969.00084). Indexed articles: \textit{Asano, Takao}, An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT., 2-14 [Zbl 1278.68353] \textit{Coja-Oghlan, Amin; Goerdt, Andreas; Lanka, André; Schädlich, Frank}, Certifying unsatisfiability of random \(2k\)-SAT formulas using approximation techniques., 15-26 [Zbl 1278.68105] \textit{Chlebík, Miroslav; Chlebíková, Janka}, Inapproximability results for bounded variants of optimization problems., 27-38 [Zbl 1278.68098] \textit{Angel, Eric; Bampis, Evripidis; Gourvès, Laurent}, Approximating the Pareto curve with local search for the bicriteria TSP\((1,2)\) problem (extended abstract), 39-48 [Zbl 1278.90323] \textit{Mastrolilli, Monaldo}, Scheduling to minimize max flow time: offline and online algorithms., 49-60 [Zbl 1278.90166] \textit{Bodlaender, Hans; Brandstädt, Andreas; Kratsch, Dieter; Rao, Michaël; Spinrad, Jeremy}, Linear time algorithms for some NP-complete problems on \((P_{5}, \mathrm{gem})\)-free graphs (extended abstract), 61-72 [Zbl 1278.68103] \textit{Fomin, Fedor V.; Heggernes, Pinar; Telle, Jan Arne}, Graph searching, elimination trees, and a generalization of bandwidth., 73-85 [Zbl 1278.68231] \textit{Gudmundsson, Joachim}, Constructing sparse \(t\)-spanners with small separators., 86-97 [Zbl 1278.68233] \textit{Cieliebak, Mark; Eidenbenz, Stephan; Pagourtzis, Aris}, Composing equipotent teams., 98-108 [Zbl 1278.68104] \textit{Damgård, Ivan Bjerre; Frandsen, Gudmund Skovbjerg}, Efficient algorithms for GCD and cubic residuosity in the ring of Eisenstein integers., 109-117 [Zbl 1278.11110] \textit{Damgård, Ivan Bjerre; Frandsen, Gudmund Skovbjerg}, An extended quadratic Frobenius primality test with average and worst case error estimates., 118-131 [Zbl 1278.11108] \textit{Kik, Marcin}, Periodic multisorting comparator networks., 132-143 [Zbl 1278.68084] \textit{Stachowiak, Grzegorz}, Fast periodic correction networks., 144-156 [Zbl 1278.68086] \textit{Arpe, Jan; Jakoby, Andreas; Liśkiewicz, Maciej}, One-way communication complexity of symmetric Boolean functions., 158-170 [Zbl 1278.68101] \textit{Hansen, Kristoffer Arnsfelt; Miltersen, Peter Bro; Vinay, V.}, Circuits on cylinders., 171-182 [Zbl 1278.68093] \textit{Damaschke, Peter}, Fast perfect phylogeny haplotype inference., 183-194 [Zbl 1278.92034] \textit{Gramm, Jens; Guo, Jiong; Niedermeier, Rolf}, On exact and approximation algorithms for distinguishing substring selection., 195-209 [Zbl 1278.68351] \textit{Evans, Patricia A.; Smith, Andrew D.}, Complexity of approximating closest substring problems., 210-221 [Zbl 1278.68350] \textit{Zhu, Binhai}, On Lawson's oriented walk in random Delaunay triangulations., 222-233 [Zbl 1278.68323] \textit{Hammar, Mikael; Nilsson, Bengt J.; Persson, Mia}, Competitive exploration of rectilinear polygons., 234-245 [Zbl 1278.68312] \textit{Aleksandrov, Lyudmil; Maheshwari, Anil; Sack, Jörg-Rüdiger}, An improved approximation algorithm for computing geometric shortest paths., 246-257 [Zbl 1278.68306] \textit{Sun, Zheng; Reif, John H.}, Adaptive and compact discretization for weighted region optimal path finding., 258-270 [Zbl 1278.68320] \textit{Reif, John H.; Sun, Zheng}, On boundaries of highly visible spaces and applications., 271-283 [Zbl 1278.68316] \textit{Păun, Gheorghe}, Membrane computing., 284-295 [Zbl 1278.68094] \textit{Ablayev, Farid; Gainutdinova, Aida}, Classical simulation complexity of quantum machines., 296-302 [Zbl 1278.68090] \textit{Antunes, Luís; Fortnow, Lance; Vinodchandran, N. V.}, Using depth to capture average-case complexity., 303-310 [Zbl 1278.68091] \textit{Lipton, Richard J.; Viglas, Anastasios}, Non-uniform depth of polynomial time and space simulations., 311-320 [Zbl 1278.68096] \textit{Kutrib, Martin}, Dimension- and time-hierarchies for small time bounds., 321-332 [Zbl 1278.68095] \textit{Moser, Philippe}, Baire's categories on small complexity classes., 333-342 [Zbl 1278.68097] \textit{Berstel, Jean; Boasson, Luc; Carton, Olivier; Petazzoni, Bruno; Pin, Jean-Éric}, Operations preserving recognizable languages., 343-354 [Zbl 1278.68131] \textit{Halava, Vesa; Harju, Tero; Hoogeboom, Hendrik Jan; Latteux, Michel}, Languages defined by generalized equality sets., 355-363 [Zbl 1278.68134] \textit{Bugliesi, Michele; Ceccato, Ambra; Rossi, Sabina}, Context-sensitive equivalences for non-interference based protocol analysis., 364-375 [Zbl 1278.94043] \textit{Kuich, Werner; Wagner, Klaus W.}, On the exponentiation of languages., 376-386 [Zbl 1278.68136] \textit{Pech, Christian}, Kleene's theorem for weighted tree-automata., 387-399 [Zbl 1278.68138] \textit{Tantau, Till}, Weak cardinality theorems for first-order logic (extended abstract), 400-411 [Zbl 1278.03078] \textit{Fokkink, Wan; Glabbeek, Rob van; Wind, Paulien de}, Compositionality of Hennessy-Milner logic through structural operational semantics., 412-422 [Zbl 1278.68169] \textit{Szałas, Andrzej}, On a logical approach to estimating computational complexity of potentially intractable problems., 423-431 [Zbl 1278.68100]