4. DMTCS 2003: Dijon, France

Invited Papers

• Gregory J. Chaitin:
  Two Philosophical Applications of Algorithmic Information Theory. 1-10
  
• Cunsheng Ding, Jin Yuan:
  Covering and Secret Sharing with Linear Codes. 11-25
  
• Bjarni V. Halldórsson, Vineet Bafna, Nathan Edwards, Ross Lippert, Shibu Yooseph, Sorin Istrail:
  Combinatorial Problems Arising in SNP and Haplotype Analysis. 26-47
  
• Maurice Margenstern:
  Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey. 48-72
  
• Timothy Walsh:
  Generating Gray Codes in O(1) Worst-Case Time per Word. 73-88
  

Contributed Papers

• Sammani D. Abdullahi, Martin E. Dyer, Les G. Proll:
  Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems. 89-96
  
• Klaus Ambos-Spies, Edgar Busse:
  Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata. 97-108
  
• Marian Alexandru Baroni:
  On the Order Dual of a Riesz Space. 109-117
  
• Symeon Bozapalidis, Antonios Kalampakas:
  A Finite Complete Set of Equations Generating Graphs. 118-128
  
• Alberto Del Lungo, Andrea Frosini, Simone Rinaldi:
  ECO Method and the Exhaustive Generation of Convex Polyominoes. 129-140
  
• Catalin Dima:
  Regular Expressions with Timed Dominoes. 141-154
  
• Olivier Finkel:
  On Infinitary Rational Relations and Borel Sets. 155-167
  
• Frédéric Gardi:
  Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems. 168-180
  
• André Große, Harald Hempel:
  On Functions and Relations. 181-192
  
• Mustapha Kchikech, Olivier Togni:
  Paths Coloring Algorithms in Mesh Networks. 193-202
  
• Bakhadyr Khoussainov:
  Finite State Strategies in One Player McNaughton Games. 203-214
  
• Mark Korenblit, Vadim E. Levit:
  On Algebraic Expressions of Series-Parallel and Fibonacci Graphs. 215-224
  
• Sven Kosub:
  Boolean NP-Partitions and Projective Closure. 225-236
  
• Vadim E. Levit, Eugen Mandrescu:
  On Unimodality of Independence Polynomials of Some Well-Covered Trees. 237-256
  
• Val Pinciu:
  A Coloring Algorithm for Finding Connected Guards in Art Galleries. 257-264
  
• K. Subramani:
  An Analysis of Quantified Linear Programs. 265-277
  
• Etsuji Tomita, Tomokazu Seki:
  An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique. 278-289
  
• Xizhong Zheng, George Barmpalias:
  On the Monotonic Computability of Semi-computable Real Numbers. 290-300
  

Last update Sat May 25 02:44:32 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page