Discrete Mathematics and Theoretical Computer Science 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings /
Συγγραφή απο Οργανισμό/Αρχή: | |
---|---|
Άλλοι συγγραφείς: | , , |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2003.
|
Έκδοση: | 1st ed. 2003. |
Σειρά: | Lecture Notes in Computer Science,
2731 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.