External Links

    Journal: J. Comput. Syst. Sci.

    Volume 22, Issue 3

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