Journals in DBLP

Inf. Comput.
2003, volume: 187, number: 1

1. Peter V. Homeier, David F. Martin
   Secure mechanical verification of mutually recursive procedures. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2003, v:187, n:1, pp:1-19 [Journal]
   
2. Lefteris M. Kirousis, Phokion G. Kolaitis
   The complexity of minimal satisfiability problems. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2003, v:187, n:1, pp:20-39 [Journal]
   
3. Juhani Karhumäki, Leonid P. Lisovik
   A simple undecidable problem: the inclusion problem for finite substitutions on ab*c. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2003, v:187, n:1, pp:40-48 [Journal]
   
4. Jack H. Lutz
   The dimensions of individual strings and sequences. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2003, v:187, n:1, pp:49-79 [Journal]
   
5. Dietrich Kuske
   Regular sets of infinite message sequence charts. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2003, v:187, n:1, pp:80-109 [Journal]
   
6. Takashi Mihara
   Splitting information securely with entanglement. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2003, v:187, n:1, pp:110-122 [Journal]
   
7. Hubert Comon, Florent Jacquemard
   Ground reducibility is EXPTIME-complete. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2003, v:187, n:1, pp:123-153 [Journal]