Discrete Mathematics and Theoretical Computer Science 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Calude, Cristian S. (Editor, http://id.loc.gov/vocabulary/relators/edt), Dinneen, Michael J. (Editor, http://id.loc.gov/vocabulary/relators/edt), Vajnovszki, Vincent (Editor, http://id.loc.gov/vocabulary/relators/edt)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Edition: 1st ed. 2003.
• Series: Lecture Notes in Computer Science, 2731
• Subjects: Computer programming.; Algorithms.; Data structures (Computer science).; Coding theory.; Information theory.; Computers.; Computer science-Mathematics.; Programming Techniques.; Algorithm Analysis and Problem Complexity.; Data Structures.; Coding and Information Theory.; Theory of Computation.; Discrete Mathematics in Computer Science.

Table of Contents:

• Invited Papers
• Two Philosophical Applications of Algorithmic Information Theory
• Covering and Secret Sharing with Linear Codes
• Combinatorial Problems Arising in SNP and Haplotype Analysis
• Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey
• Generating Gray Codes in O(1) Worst-Case Time per Word
• Contributed Papers
• Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems
• Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata
• On the Order Dual of a Riesz Space
• A Finite Complete Set of Equations Generating Graphs
• ECO Method and the Exhaustive Generation of Convex Polyominoes
• Regular Expressions with Timed Dominoes
• On Infinitary Rational Relations and Borel Sets
• Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems
• On Functions and Relations
• Paths Coloring Algorithms in Mesh Networks
• Finite State Strategies in One Player McNaughton Games
• On Algebraic Expressions of Series-Parallel and Fibonacci Graphs
• Boolean NP-Partitions and Projective Closure
• On Unimodality of Independence Polynomials of Some Well-Covered Trees
• A Coloring Algorithm for Finding Connected Guards in Art Galleries
• An Analysis of Quantified Linear Programs
• An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique
• On the Monotonic Computability of Semi-computable Real Numbers.