JCSS, Volume 25

Volume 25, Number 1, August 1982

• Mihalis Yannakakis, Christos H. Papadimitriou:
  Algebraic Dependencies. 2-41
  
• Eugene M. Luks:
  Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time. 42-65
  
• Michael O. Rabin:
  N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable. 66-75
  
• Neil Immerman:
  Upper and Lower Bounds for First Order Expressibility. 76-98
  
• Ashok K. Chandra, David Harel:
  Structure and Complexity of Relational Queries. 99-128
  

Volume 25, Number 2, October 1982

• Stephen R. Mahaney:
  Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis. 130-143
  
• David Harel, Dexter Kozen, Rohit Parikh:
  Process Logic: Expressiveness, Decidability, Completeness. 144-170
  
• Philippe Flajolet, Andrew M. Odlyzko:
  The Average Height of Binary Trees and Other Simple Trees. 171-213
  
• Jon Louis Bentley, Donna J. Brown:
  A General Class of Resource Tradeoffs. 214-238
  
• Gérard P. Huet, Jean-Marie Hullot:
  Proofs by Induction in Equational Theories with Constructors. 239-266
  

Volume 25, Number 3, December 1982

• Jan A. Bergstra, J. V. Tucker:
  Expressiveness and the Completeness of Hoare's Logic. 267-284
  
• Takumi Kasai, Raymond E. Miller:
  Homomorphisms between Models of Parallel Computation. 285-331
  
• Christoph M. Hoffmann:
  Subcomplete Generalizations of Graph Isomorphism. 332-359
  
• Wolfgang Thomas:
  Classifying Regular Events in Symbolic Logic. 360-376
  
• Werner Kuich:
  An Algebraic Characterization of Some Principal Regulated Rational Cones. 377-401
  
• Mordechai Ben-Ari, Joseph Y. Halpern, Amir Pnueli:
  Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness. 402-417
  
• Joost Engelfriet, Sven Skyum:
  The Copying Power of One-State Tree Transducers. 418-435
  

Last update Sat May 25 20:41:19 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page