Journals in DBLP

Theor. Comput. Sci.
2003, volume: 1, number: 303

1. Danièle Beauquier, Dimitri Grigoriev, Yuri Matiyasevich
   Biography of A.O. Slissenko. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:303, pp:3-5 [Journal]
   
2. André Arnold, Aymeric Vincent, Igor Walukiewicz
   Games for synthesis of controllers with partial observation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:303, pp:7-34 [Journal]
   
3. Alessandra Carbone, Misha Gromov
   Functional labels and syntactic entropy on DNA strings and proteins. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:303, pp:35-51 [Journal]
   
4. 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. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:303, pp:53-62 [Journal]
   
5. Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev
   On feasible cases of checking multi-agent systems behavior. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:303, pp:63-81 [Journal]
   
6. Dima Grigoriev, Edward A. Hirsch
   Algebraic proof systems over formulas. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:303, pp:83-102 [Journal]
   
7. Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto N. Afrati
   On temporal logic versus datalog. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:303, pp:103-133 [Journal]
   
8. Roman M. Kolpakov, Gregory Kucherov
   Finding approximate repetitions under Hamming distance. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:303, pp:135-156 [Journal]
   
9. Johann A. Makowsky, Julian Mariño
   Tree-width and the monadic quantifier hierarchy. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:303, pp:157-170 [Journal]
   
10. Larisa Maksimova
    Complexity of some problems in positive and related calculi. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:303, pp:171-185 [Journal]
    
11. Grigori Mints
    A termination proof for epsilon substitution using partial derivations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:303, pp:187-213 [Journal]
    
12. Damian Niwinski, Igor Walukiewicz
    A gap property of deterministic tree languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:303, pp:215-231 [Journal]
    
13. Alexander A. Razborov
    Resolution lower bounds for the weak functional pigeonhole principle. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:303, pp:233-243 [Journal]
    
14. Sergei Soloviev, Vladimir Orevkov
    On categorical equivalence of Gentzen-style derivations in IMLL. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:303, pp:245-260 [Journal]