External Links

    Journal: J. Comput. Syst. Sci.

    Volume 48, Issue 2

    203 -- 213Leong Kwan Li. Learning Fixed Point Patterns by Recurrent Networks
    214 -- 230Omer Berkman, Uzi Vishkin. Finding Level-Ancestors in Trees
    231 -- 254Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk. Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs
    255 -- 310Marco Cadoli, Maurizio Lenzerini. The Complexity of Propositional Closed World Reasoning and Circumscription
    311 -- 323Gyora M. Benedek, Alon Itai. Nonuniform Learnability
    324 -- 336Steven Homer, Luc Longpré. On Reductions of NP Sets to Sparse Sets
    337 -- 346Douglas R. Stinson. Combinatorial Techniques for Universal Hashing
    347 -- 356Kai-Yeung Siu, Amir Dembo, Thomas Kailath. On the Perceptron Learning Algorithm on Data with High Precision
    357 -- 381Alan L. Selman. A Taxonomy of Complexity Classes of Functions
    runs on