External Links

    Journal: J. Comput. Syst. Sci.

    Volume 49, Issue 1

    1 -- 17Seinosuke Toda. Simple Characterizations of P(#P) and Complete Problems
    18 -- 23Tadakazu Sato. Group Structured Linear Cellular Automata over Zm
    24 -- 39Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, Pankaj Rohatgi. The Random Oracle Hypothesis Is False
    40 -- 56Takashi Hattori. Time-Extraction for Temporal Logic-Logic Programming and Local Process Time
    57 -- 82Egon Wanke. The Complexity of Connectivity Problems on Context-Free Graph Languages
    83 -- 95Nicholas Pippenger. Symmetry in Self-Correcting Cellular Automata
    96 -- 107Sanjay Jain, Arun Sharma. Characterizing Language Identification by Standardizing Operations
    108 -- 132Vijay V. Raghavan. Bounded Degree Graph Inference from Walks
    133 -- 147Emanuela Fachini, Angelo Monti. A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata
    runs on