JCSS, Volume 41

Volume 41, Number 1, August 1990

Selected Papers of PODS 1987

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

Selected Papers of PODS 1987

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

Regular Articles

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

Selected Papers of the 3rd Annual Conference on Structure in Complexity Theory, June 14-17, 1988

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