JCSS, Volume 30
Volume 30, Number 1, February 1985
E. Allen Emerson, Joseph Y. Halpern: Decision Procedures and Expressiveness in the Temporal Logic of Branching Time. 1-24- John H. Reif, A. Prasad Sistla: A Multiprocess Network Logic with Temporal and Spatial Modalities. 41-53
- Norishige Chiba, Takao Nishizeki, Shigenobu Abe, Takao Ozawa: A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees. 54-76
- Marek Chrobak: Variations on the Technique of Duris and Galil. 77-85
- Joost Engelfriet: Hierarchies of Hyper-AFLs. 86-115
- Allan Borodin, John E. Hopcroft: Routing, Merging, and Sorting on Parallel Models of Computation. 130-145
Volume 30, Number 2, April 1985
- Patrick W. Dymond, Martin Tompa: Speedups of Deterministic Machines by Synchronous Parallel Machines. 149-161
- Dexter Kozen: A Probabilistic PDL. 162-178
- Harold N. Gabow, Robert Endre Tarjan: A Linear-Time Algorithm for a Special Case of Disjoint Set Union. 209-221
- Ashok K. Chandra, Steven Fortune, Richard J. Lipton: Unbounded Fan-In Circuits and Associative Functions. 222-234
- Arjen K. Lenstra: Factoring Multivariate Polynomials over Finite Fields. 235-248
Volume 30, Number 3, June 1985
- Jakob Gonczarowski, Eliahu Shamir: Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style. 249-273
- Antonio Bahamonde: Cost Functors and Optimal Realization. 274-290
- Ferng-Ching Lin, I-Chen Wu: Area-Period Tradeoffs for Multiplication of Rectangular Matrices. 329-342
- Paliath Narendran, Colm Ó'Dúnlaing, Heinrich Rolletschek: Complexity of Certain Decision Problems about Congruential Languages. 343-358
- William M. Kantor: Sylow's Theorem in Polynomial Time. 359-394
- Ronald V. Book, Timothy J. Long, Alan L. Selman: Qualitative Relativizations of Complexity Classes. 395-413
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team