Theoretical Computer Science, Volume 303

Number 303, Volume 1, 28 June 2003

• Danièle Beauquier, Dimitri Grigoriev, Yuri Matiyasevich:
  Biography of A.O. Slissenko. 3-5
  Electronic Edition (link) BibTeX
• André Arnold, Aymeric Vincent, Igor Walukiewicz:
  Games for synthesis of controllers with partial observation. 7-34
  Electronic Edition (link) BibTeX
• Alessandra Carbone, Misha Gromov:
  Functional labels and syntactic entropy on DNA strings and proteins. 35-51
  Electronic Edition (link) BibTeX
• Patrick Cégielski, François Heroult, Denis Richard:
  On the amplitude of intervals of natural numbers whose every element has a common prime divisor with at least an extremity. 53-62
  Electronic Edition (link) BibTeX
• Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev:
  On feasible cases of checking multi-agent systems behavior. 63-81
  Electronic Edition (link) BibTeX
• Dima Grigoriev, Edward A. Hirsch:
  Algebraic proof systems over formulas. 83-102
  Electronic Edition (link) BibTeX
• Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto N. Afrati:
  On temporal logic versus datalog. 103-133
  Electronic Edition (link) BibTeX
• Roman M. Kolpakov, Gregory Kucherov:
  Finding approximate repetitions under Hamming distance. 135-156
  Electronic Edition (link) BibTeX
• Johann A. Makowsky, Julian Mariño:
  Tree-width and the monadic quantifier hierarchy. 157-170
  Electronic Edition (link) BibTeX
• Larisa Maksimova:
  Complexity of some problems in positive and related calculi. 171-185
  Electronic Edition (link) BibTeX
• Grigori Mints:
  A termination proof for epsilon substitution using partial derivations. 187-213
  Electronic Edition (link) BibTeX
• Damian Niwinski, Igor Walukiewicz:
  A gap property of deterministic tree languages. 215-231
  Electronic Edition (link) BibTeX
• Alexander A. Razborov:
  Resolution lower bounds for the weak functional pigeonhole principle. 233-243
  Electronic Edition (link) BibTeX
• Sergei Soloviev, Vladimir Orevkov:
  On categorical equivalence of Gentzen-style derivations in IMLL. 245-260
  Electronic Edition (link) BibTeX

Number 303, Volume 2-3, 15 July 2003

• James Gary Propp:
  Generalized domino-shuffling. 267-301
  Electronic Edition (link) BibTeX
• Igor Pak:
  Tile invariants: new horizons. 303-331
  Electronic Edition (link) BibTeX
• Jean-Claude Fournier:
  Combinatorics of perfect matchings in plane bipartite graphs and application to tilings. 333-351
  Electronic Edition (link) BibTeX
• Nicolas Thiant:
  An O(n log n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded. 353-374
  Electronic Edition (link) BibTeX
• Sébastien Desreux:
  An algorithm to generate exactly once every tiling with lozenges of a domain. 375-408
  Electronic Edition (link) BibTeX
• Fumei Lam, Lior Pachter:
  Forcing numbers of stop signs. 409-416
  Electronic Edition (link) BibTeX
• Danièle Beauquier, Maurice Nivat:
  A codicity undecidable problem in the plane. 417-430
  Electronic Edition (link) BibTeX
• Olaf Delgado Friedrichs:
  Data structures and algorithms for tilings I. 431-445
  Electronic Edition (link) BibTeX
• Thomas L. Fitzkee, Kevin G. Hockett, E. Arthur Robinson Jr.:
  A weakly mixing tiling dynamical system with a smooth model. 447-462
  Electronic Edition (link) BibTeX
• Daniel Lenz:
  Hierarchical structures in Sturmian dynamical systems. 463-490
  Electronic Edition (link) BibTeX
• Christiane Frougny, Jean-Pierre Gazeau, Rudolf Krejcar:
  Additive and multiplicative properties of point sets based on beta-integers. 491-516
  Electronic Edition (link) BibTeX
• Krzysztof Lorys, Katarzyna E. Paluch:
  New approximation algorithm for RTILE problem. 517-537
  Electronic Edition (link) BibTeX
• Kari Eloranta:
  The bounded eight-vertex model. 539-552
  Electronic Edition (link) BibTeX