External Links

    Journal: J. Comput. Syst. Sci.

    Volume 41, Issue 3

    274 -- 306David A. Mix Barrington, Neil Immerman, Howard Straubing. On Uniformity within NC¹
    307 -- 320Jack H. Lutz. Pseudorandom Sources for BPP
    321 -- 366Juichi Shinoda, Theodore A. Slaman. On the Theory of the PTIME Degrees of the Recursive Sets
    367 -- 388José L. Balcázar. Self-Reducibility
    389 -- 401Luc Longpré, Paul Young. Cook Reducibility is Faster than Karp Reduciblity in NP
    402 -- 429Bernd Halstenberg, Rüdiger Reischuk. Relations between Communication Complexity Classes
    430 -- 467Leonard Pitt, Manfred K. Warmuth. Prediction-Preserving Reducibility

    Volume 41, Issue 2

    157 -- 180Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan. Bounds on the Propagation of Selection into Logic Programs
    181 -- 229Serge Abiteboul, Victor Vianu. Procedural Languages for Database Queries and Updates
    230 -- 250Manuel E. Bermudez, Karl M. Schimpf. Practical Arbitrary Lookahead LR Parsing
    251 -- 271Lane A. Hemachandra, Steven Rudich. On the Complexity of Ranking

    Volume 41, Issue 1

    2 -- 24Rina Dechter. Decomposing a Relation into a Tree of Binary Relations
    25 -- 43Paolo Atzeni, Maria Cristina De Bernardis. A New Interpretation for Null Values in the Weak Instance Model
    44 -- 64Gabriel M. Kuper. Logic Programming with Sets
    65 -- 156Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl. Commutativity-Based Locking for Nested Transactions
    runs on