JCSS, Volume 48
Volume 48, Number 1, February 1994
- Stephen J. Hegner: Unique Complements and Decomposition of Database Schemata. 9-57
- Guy E. Blelloch, James J. Little: Parallel Solutions to Geometric Problems in the Scan Model of Computation. 90-115
- Jarkko Kari: Reversibility and Surjectivity Problems of Cellular Automata. 149-182
Volume 48, Number 2, April 1994
- Leong Kwan Li: Learning Fixed Point Patterns by Recurrent Networks. 203-213
- 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
- Douglas R. Stinson: Combinatorial Techniques for Universal Hashing. 337-346
- Kai-Yeung Siu, Amir Dembo, Thomas Kailath: On the Perceptron Learning Algorithm on Data with High Precision. 347-356
- Alan L. Selman: A Taxonomy of Complexity Classes of Functions. 357-381
Volume 48, Number 3, June 1994
- C. Andrew Neff: Specified Precision Polynomial Root Isolation Is in NC. 429-463
- 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-12-08T180745 by the dblp team