Journals in DBLP
Mark N. Wegman , Larry Carter New Hash Functions and Their Use in Authentication and Set Equality. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1981, v:22, n:3, pp:265-279 [Journal ] Gilles Brassard A Time-Luck Tradeoff in Relativized Cryptography. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1981, v:22, n:3, pp:280-311 [Journal ] Wolfgang J. Paul , Rüdiger Reischuk On Time versus Space II. (Turing Machines). [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1981, v:22, n:3, pp:312-327 [Journal ] Dexter Kozen Semantics of Probabilistic Programs. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1981, v:22, n:3, pp:328-350 [Journal ] Allan Borodin , Michael J. Fischer , David G. Kirkpatrick , Nancy A. Lynch , Martin Tompa A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1981, v:22, n:3, pp:351-364 [Journal ] Walter L. Ruzzo On Uniform Circuit Complexity. [Citation Graph (3, 0)][DBLP ] J. Comput. Syst. Sci., 1981, v:22, n:3, pp:365-383 [Journal ] Neil Immerman Number of Quantifiers is Better Than Number of Tape Cells. [Citation Graph (7, 0)][DBLP ] J. Comput. Syst. Sci., 1981, v:22, n:3, pp:384-406 [Journal ] Ofer Gabber , Zvi Galil Explicit Constructions of Linear-Sized Superconcentrators. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1981, v:22, n:3, pp:407-420 [Journal ] Janos Simon Division in Idealized Unit Cost RAMS. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1981, v:22, n:3, pp:421-441 [Journal ] Michael Machtey , Paul Young Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1981, v:22, n:3, pp:442-453 [Journal ] Nicholas Pippenger Computational Complexity of Algebraic Functions. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1981, v:22, n:3, pp:454-470 [Journal ]