Journals in DBLP

J. Comput. Syst. Sci.
1982, volume: 24, number: 2

1. Anton Nijholt
   The Equivalence Problem for LL- and LR-Regular Grammars. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1982, v:24, n:2, pp:149-161 [Journal]
   
2. Michael Rodeh
   Finding the Median Distributively. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1982, v:24, n:2, pp:162-166 [Journal]
   
3. J. Albert, Karel Culik II
   Tree Correspondence Problems. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1982, v:24, n:2, pp:167-179 [Journal]
   
4. Jerry Goldman, Steven Homer
   Quadratic Automata. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1982, v:24, n:2, pp:180-196 [Journal]
   
5. Greg N. Frederickson, Donald B. Johnson
   The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns. [Citation Graph (1, 0)][DBLP]
   J. Comput. Syst. Sci., 1982, v:24, n:2, pp:197-208 [Journal]
   
6. Joseph JáJá
   The Computational Complexity of a Set of Quadratic Functions. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1982, v:24, n:2, pp:209-223 [Journal]
   
7. Timothy J. Long
   A Note on Sparse Oracles for NP. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1982, v:24, n:2, pp:224-232 [Journal]
   
8. Kosaburo Hashiguchi
   Limitedness Theorem on Finite Automata with Distance Functions. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1982, v:24, n:2, pp:233-244 [Journal]