Home
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
Browse issues
  • All
  • Author
  • Title
  • References
  • Full text
Between and
  • All
  • Author
  • Title
  • Date
  • References
  • Keywords
  • Full text
  • Previous
  • RAIRO. Theoretical Informatics and Applications
  • Volume 40 (2006)
  • no. 1
  • Next

Volume 40 (2006) no. 1

Table of contents


Series which are both max-plus and min-plus rational are unambiguous
Lombardy, Sylvain;   Mairesse, Jean
p. 1-14

On Christoffel classes
Borel, Jean-Pierre;   Reutenauer, Christophe  
p. 15-27

On a complete set of operations for factorizing codes
Felice, Clelia De
p. 29-52

Theories of orders on the set of words
Kuske, Dietrich  
p. 53-74

Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
Hemaspaandra, Edith; Rothe, Jörg; Spakowski, Holger
p. 75-91
  • Accessibility: not compliant
  • About
  • Help
  • Legal notice
  • Contact

Published by

Supported by

 

Partner of