Journals in DBLP

J. Comput. Syst. Sci.
1984, volume: 29, number: 1

1. Luc Devroye
   Exponential Bounds for the Running Time of a Selection Algorithm. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1984, v:29, n:1, pp:1-7 [Journal]
   
2. David A. Plaisted
   Complete Problems in the First-Order Predicate Calculus. [Citation Graph (4, 0)][DBLP]
   J. Comput. Syst. Sci., 1984, v:29, n:1, pp:8-35 [Journal]
   
3. Kokichi Sugihara
   An n log n Algorithm for Determining the Congruity of Polyhedra. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1984, v:29, n:1, pp:36-47 [Journal]
   
4. Jan K. Pachl
   Finding Pseudoperipheral Nodes in Graphs. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1984, v:29, n:1, pp:48-53 [Journal]
   
5. Michel Latteux, Grzegorz Rozenberg
   Commutative One-Counter Languages are Regular. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1984, v:29, n:1, pp:54-57 [Journal]
   
6. Tsong Yueh Chen
   On the Fixpoints of Nondeterministic Recursive Definitions. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1984, v:29, n:1, pp:58-79 [Journal]
   
7. Fred Kröger
   A Generalized Nexttime Operator in Temporal Logic. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1984, v:29, n:1, pp:80-98 [Journal]
   
8. Douglas R. Troeger
   Weak Equivalence in a Class of Structured Program Schemes. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1984, v:29, n:1, pp:99-117 [Journal]
   
9. Walter J. Savitch, Patrick W. Dymond
   Consistency in Nondeterministic Storage. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1984, v:29, n:1, pp:118-132 [Journal]