Journals in DBLP

J. Comput. Syst. Sci.
1981, volume: 22, number: 1

1. Shlomo Moran
   Some Results on Relativized Deterministic and Nondeterministic Time Hierarchies. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1981, v:22, n:1, pp:1-8 [Journal]
   
2. Tsuyoshi Nakamura
   Regularity and Firing Sequences of Computation Graphs. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1981, v:22, n:1, pp:9-28 [Journal]
   
3. Stephen J. Willson
   Growth Patterns of Ordered Cellular Automata. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1981, v:22, n:1, pp:29-41 [Journal]
   
4. Keijo Ruohonen
   The Decidability of the D0L-DT0L Equivalence Problem. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1981, v:22, n:1, pp:42-52 [Journal]
   
5. Paul Chew, Michael Machtey
   A Note on Structure and Looking Back Applied to the Complexity of Computable Functions. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1981, v:22, n:1, pp:53-59 [Journal]
   
6. Tatsuo Ohtsuki, Hajimu Mori, Toshinobu Kashiwabara, Toshio Fujisawa
   On Minimal Augmentation of a Graph to Obtain an Interval Graph. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1981, v:22, n:1, pp:60-97 [Journal]
   
7. Robert Melville
   An Improved Simulation Result for Ink-Bounded Turing Machines. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1981, v:22, n:1, pp:98-105 [Journal]