External Links

    Journal: J. Comput. Syst. Sci.

    Volume 39, Issue 3

    250 -- 281Klaus Ambos-Spies. Honest Polynomial Time Reducibilities and the P = ? NP Problem
    282 -- 298Jim Kadin. P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP
    299 -- 322Lane A. Hemachandra. The Strong Exponential Hierarchy Collapses
    323 -- 342Raymond Greenlaw. Ordered Vertex Removal and Subgraph Problems
    343 -- 375Pierre America, Jan J. M. M. Rutten. Solving Reflexive Domain Equations in a Category of Complete Metric Spaces
    376 -- 387A. G. Robinson, A. J. Goldman. The Set Coincidence Game: Complexity, Attainability, and Symmetric Strategies

    Volume 39, Issue 2

    126 -- 152Leonidas J. Guibas, John Hershberger. Optimal Shortest Path Queries in a Simple Polygon
    153 -- 165N. Dadoun, David G. Kirkpatrick. Parallel Construction of Subdivision Hierarchies
    166 -- 204Joseph C. Culberson, Robert A. Reckhow. Orthogonally Convex Coverings of Orthogonal Polygons without Holes
    205 -- 219Paul Chew. There are Planar Graphs Almost as Good as the Complete Graph
    220 -- 235Subhash Suri. Computing Geodesic Furthest Neighbors in Simple Polygons
    236 -- 247Kokichi Sugihara. On Finite-Precision Representations of Geometric Objects

    Volume 39, Issue 1

    2 -- 20Moon-Jung Chung, Bala Ravikumar. Strong Nondeterministic Turing Reduction - A Technique for Proving Intractability
    21 -- 50Martín Abadi, Joan Feigenbaum, Joe Kilian. On Hiding Information from an Oracle
    51 -- 83Daniel Leivant. Descriptive Characterizations of Computational Complexity
    84 -- 100Uwe Schöning. Probabilistic Complexity Classes and Lowness
    101 -- 124Eric Allender. Some Consequences of the Existence of Pseudorandom Generators
    runs on