JCSS, Volume 41

Volume 41, Number 1, August 1990

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

Volume 41, Number 2, October 1990

• Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan: Bounds on the Propagation of Selection into Logic Programs. 157-180
• Serge Abiteboul, Victor Vianu: Procedural Languages for Database Queries and Updates. 181-229

• Manuel E. Bermudez, Karl M. Schimpf: Practical Arbitrary Lookahead LR Parsing. 230-250
• Lane A. Hemachandra, Steven Rudich: On the Complexity of Ranking. 251-271

Volume 41, Number 3, December 1990

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