Discrete Mathematics and Theoretical Computer Science

4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings

316 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

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.

• Reihe: Lecture Notes in Computer Science
• Themen: Lexika Forschung und Information, allgemein Kodierungstheorie und Verschlüsselung (Kryptologie)
• ISBN: 9783540405054
• Sprache: Englisch
• Erscheinungsdatum: 27.06.2003
• Größe: 235 x 155 mm
• Verlag: Springer
• Herausgegeben von: Michael J. Dinneen, Cristian S. Calude, Vincent Vajnovszki