External Links

    Journal: J. Comput. Syst. Sci.

    Volume 37, Issue 3

    269 -- 291Tat-hung Chan. Pushdown Automata with Reversal-Bounded Counters
    292 -- 311Errol L. Lloyd, Mary Lou Soffa. On Locating Minimum Feedback Vertex Sets
    312 -- 323Uwe Schöning. Graph Isomorphism is in the Low Hierarchy
    324 -- 336Mary G. O Connor. An Unpredictability Approach to Finite-State Randomness
    337 -- 348Greg N. Frederickson. Distributed Algorithms for Selection in Sets
    349 -- 366Rodney R. Howell, Louis E. Rosier. Completeness Results for Conflict-Free Vector Replacement Systems
    367 -- 394Kai Salomaa. Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems
    395 -- 399Nicholas Pippenger. Correction to Computational Complexity of Algebraic Functions

    Volume 37, Issue 2

    118 -- 129Noga Alon, Wolfgang Maass. Meanders and Their Applications in Lower Bounds Arguments
    130 -- 143Prabhakar Raghavan. Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs
    144 -- 155Marek Chrobak, Ming Li. k+1 Heads Are Better than k for PDAs
    156 -- 189Gilles Brassard, David Chaum, Claude Crépeau. Minimum Disclosure Proofs of Knowledge
    190 -- 246Philip N. Klein, John H. Reif. An Efficient Parallel Algorithm for Planarity
    247 -- 268Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer. Collapsing Degrees

    Volume 37, Issue 1

    2 -- 13Christos H. Papadimitriou, David Wolfe. The Complexity of Facets Resolved
    14 -- 38Lefteris M. Kirousis, Christos H. Papadimitriou. The Complexity of Recognizing Polyhedral Scenes
    39 -- 62Eugene M. Luks, Pierre McKenzie. Parallel Algorithms for Solvable Permutation Groups
    63 -- 78Gad M. Landau, Uzi Vishkin. Fast String Matching with k Differences
    79 -- 100David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis. How Easy is Local Search?
    101 -- 116Ming Li. Simulating Two Pushdown Stores by One Tape in O(n^1.5 sqrt(log n)) Time
    runs on