JCSS, Volume 48
Volume 48, Number 1, February 1994
- Guy E. Blelloch, James J. Little:
Parallel Solutions to Geometric Problems in the Scan Model of Computation. 90-115
Volume 48, Number 2, April 1994
- Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk:
Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs. 231-254 - Marco Cadoli, Maurizio Lenzerini:
The Complexity of Propositional Closed World Reasoning and Circumscription. 255-310 - Kai-Yeung Siu, Amir Dembo, Thomas Kailath:
On the Perceptron Learning Algorithm on Data with High Precision. 347-356
Volume 48, Number 3, June 1994
- Michael J. Kearns, Robert E. Schapire:
Efficient Distribution-Free Learning of Probabilistic Concepts. 464-497 - Christos H. Papadimitriou:
On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence. 498-532 - Michael L. Fredman, Dan E. Willard:
Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. 533-551