Journals in DBLP

J. Comput. Syst. Sci.
1996, volume: 53, number: 1

1. Narayan Vikas
   An O(n) Algorithm for Abelian p-Group Isomorphism and an O(n log n) Algorithm for Abelian Group Isomorphism. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:1, pp:1-9 [Journal]
   
2. Jeffrey Shallit, Yuri Breitbart
   Automaticity I: Properties of a Measure of Descriptional Complexity. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:1, pp:10-25 [Journal]
   
3. Ganesh Baliga, John Case
   Learnability: Admissible, Co-Finite, and Hypersimple Languages. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:1, pp:26-32 [Journal]
   
4. Frank Drewes
   Language Theoretic and Algorithmic Properties of d-dimensional Collages and Patterns in a Grid. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:1, pp:33-66 [Journal]
   
5. Shlomo Moran, Gadi Taubenfeld, Irit Yadin
   Concurrent Counting. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:1, pp:61-78 [Journal]
   
6. Detlef Sieling
   New Lower Bounds and Hierarchy Results for Restricted Branching Programs. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:1, pp:79-87 [Journal]
   
7. Steffen Lange, Thomas Zeugmann
   Incremental Learning from Positive Data. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:1, pp:88-103 [Journal]
   
8. Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski
   Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:1, pp:104-111 [Journal]
   
9. Feng Gao
   Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:1, pp:112-128 [Journal]
   
10. Harold N. Gabow, Ying Xu
    Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:1, pp:129-147 [Journal]
    
11. Paul F. Dietz
    A Space Efficient Variant of Path Copying for Partially Persistent Sorted Sets. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:1, pp:148-152 [Journal]