Academia.eduAcademia.edu

Outline

Mathematical Foundations of Computer Science 2008

2008, Springer eBooks

https://doi.org/10.1007/978-3-540-85238-4

Abstract
sparkles

AI

The symposium on Mathematical Foundations of Computer Science (MFCS) has been a long-standing platform for researchers in theoretical computer science, held in alternating locations since 1972. The 2008 event, organized by the Faculty of Mathematics and Computer Science at Nicolaus Copernicus University in Toruń, Poland, showcases a diverse range of findings and methodologies in areas such as graph algorithms, logic, and query optimization, emphasizing the critical interplay between theory and application in computer science.

References (3)

  1. Iterative Compression and Exact Algorithms . . . . . . . . . . . . . . . . . . . . . . . . 335
  2. Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, and Saket Saurabh Complexity and Limiting Ratio of Boolean Functions over Implication . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 347 Hervé Fournier, Danièle Gardy, Antoine Genitrini, and Bernhard Gittenberger Succinctness of Regular Expressions with Interleaving, Intersection and Counting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 363 Wouter Gelade Nilpotency and Limit Sets of Cellular Automata . . . . . . . . . . . . . . . . . . . . . 375 Pierre Guillon and Gaétan Richard A Note on k-Colorability of P 5 -Free Graphs . . . . . . . . . . . . . . . . . . . . . . . . . 387 Chính T. Hoàng, Marcin Kamiński, Vadim Lozin, Joe Sawada, and Xiao Shu Combinatorial Bounds and Algorithmic Aspects of Image Matching Under Projective Transformations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 395 Christian Hundt and Maciej Liśkiewicz Lower Bounds for Syntactically Multilinear Algebraic Branching Programs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 407 Maurice J. Jansen Periodicity and Immortality in Reversible Computing . . . . . . . . . . . . . . . . . 419 Jarkko Kari and Nicolas Ollinger
  3. Step-Out Ring Signatures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 431 Marek Klonowski, Lukasz Krzywiecki, Miros law Kuty lowski, and Anna Lauks The Height of Factorization Forests . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 443 Manfred Kufleitner Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 455 Meena Mahajan and B.V. Raghavendra Rao Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 467 Bodo Manthey and Till Tantau From λ-Calculus to Universal Algebra and Back . . . . . . . . . . . . . . . . . . . . . 479 Giulio Manzonetto and Antonino Salibra