Mathematical Foundations of Computer Science 2008: 33rd International Symposium, Mfcs 2008, Torun, Poland, August 25-29, 2008, Proceedings

ISBN-13: 9783540852377 / Angielski / Miękka / 2008 / 626 str.

Edward Ochmanski

Opis

The symposia on Mathematical Foundations of Computer Science, generally known under the acronym MFCS, have been organized alternately in Poland, the Czech Republic and Slovakia since 1972. They have a well-established tradition and inter- tional recognition as an event bringing together researchers in all branches of theore- cal computer science. The previous meetings took place in Jab?onna 1972, trbske Pleso 1973; Jadwisin 1974, Marianske Lazn ?, 1975, Gda ?sk 1976, Tatranska Lomnica 1977, Zakopane 1978, Olomouc 1979, Rydzyna 1980, trbske Pleso 1981, Prague 1984, Bratislava 1986, Karlovy Vary 1988, Por ?bka-Kozubnik 1989, Banska Bystrica 1990, Kazimierz Dolny 1991, Prague 1992, Gda ?sk 1993, Ko ice 1994, Prague 1995, Krakow 1996, Bratislava 1997, Brno 1998, Szklarska Por ?ba 1999, Bratislava 2000, Marianske Lazn ? 2001, Otwock 2002, Bratislava 2003, Prague 2004, Gda ?sk 2005, Stara Lesna 2006 and ?esky Krumlov 2007. The 33rd Symposium on Mathematical Foundations of Computer Science was org- ized during August 25-29, 2008 by the Faculty of Mathematics and Computer Science of Nicolaus Copernicus University (Uniwersytet Miko?aja Kopernika, UMK) in Toru ?, a medieval Polish town, the birthplace of Nicolaus Copernicus. We gratefully ackno- edge the support received from UMK. This volume contains 5 invited and 45 contributed papers, which were presented at the Symposium. We would like to thank the authors of the invited papers; they accepted our invitations and delivered lectures, sharing with us their insights on their research areas.

Spis treści

Invited Papers.- One Useful Logic That Defines Its Own Truth.- On Synchronous and Asynchronous Interaction in Distributed Systems.- A Robust Class of Regular Languages.- Deterministic Models of Communication Faults.- Algebraic Graph Algorithms.- Contributed Papers.- Question/Answer Games on Towers and Pyramids.- The Maximum Independent Set Problem in Planar Graphs.- When Ignorance Helps: Graphical Multicast Cost Sharing Games.- Shortest Synchronizing Strings for Huffman Codes.- Optimizing Conjunctive Queries over Trees Using Schema Information.- Clustering with Partial Information.- Reoptimization of the Metric Deadline TSP.- On the Shortest Linear Straight-Line Program for Computing Linear Forms.- Flip Algorithm for Segment Triangulations.- Computing Sharp 2-Factors in Claw-Free Graphs.- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem.- Positional Strategies for Higher-Order Pushdown Parity Games.- Arthur and Merlin as Oracles.- A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems.- Regional Languages and Tiling: A Unifying Approach to Picture Grammars.- On a Special Class of Primitive Words.- Complexity of Data Tree Patterns over XML Documents.- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs.- Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems.- Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control.- Reversal-Bounded Counter Machines Revisited.- Iterative Compression and Exact Algorithms.- Complexity and Limiting Ratio of Boolean Functions over Implication.- Succinctness of Regular Expressions with Interleaving, Intersection and Counting.- Nilpotency and Limit Sets of Cellular Automata.- A Note on k-Colorability of P 5-Free Graphs.- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations.- Lower Bounds for Syntactically Multilinear Algebraic Branching Programs.- Periodicity and Immortality in Reversible Computing.- Step-Out Ring Signatures.- The Height of Factorization Forests.- Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae.- Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise.- From ?-Calculus to Universal Algebra and Back.- A Complete Axiomatic System for a Process-Based Spatial Logic.- Voronoi Games on Cycle Graphs.- Colouring Random Empire Trees.- A Random Oracle Does Not Help Extract the Mutual Information.- Approximating Independent Set and Coloring in Random Uniform Hypergraphs.- A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach.- Directed Percolation Arising in Stochastic Cellular Automata Analysis.- Resolution Width and Cutting Plane Rank Are Incomparable.- On the Decidability of Bounded Valuedness for Transducers.- Monadic Second Order Logic on Graphs with Local Cardinality Constraints.- Short Proofs of Strong Normalization.

Blurb

This book constitutes the refereed proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008, held in Torun, Poland, in August 2008.

The 45 revised full papers presented together with 5 invited lectures were carefully reviewed and selected from 119 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithmic game theory, algorithms and data structures, artificial intelligence, automata and formal languages, bioinformatics, complexity, concurrency and petrinets, cryptography and security, logic and formal specifications, models of computations, parallel and distributed computing, semantics and verification.