International Journal of Parallel Programming, Volume 8

Volume 8, Number 1, February 1979

• Julius T. Tou:
  Zoom-thresholding technique for boundary determination. 3-8
  
• H. I. Epstein, B. F. Caviness:
  A structure theorem for the elementary functions and its application to the identity problem. 9-37
  
• C. C. Gotlieb, Antonio L. Furtado:
  Data schemata based on directed graphs. 39-73
  
• Belur V. Dasarathy, A. L. Lakshminarasimhan:
  Learning under a VEDIC teacher. 75-88
  

Volume 8, Number 2, April 1979

• Fred J. Maryanski, Michael G. Thomason:
  Properties of stochastic syntax-directed translation schemata. 89-110
  
• A. G. Ivakhnenko:
  Development of models of optimal complexity using self-organization theory. 111-127
  
• Arie P. Schinnar:
  Generalized inverse solutions of multiattribute accounting problems. 129-139
  
• Robert L. Cannon:
  Notes on canonical label languages. 141-148
  
• Steven A. Vere:
  Composition of relational productions for plans and programs. 149-179
  

Volume 8, Number 3, June 1979

• H. P. Edmundson, Immanuel I. Tung:
  The notion of a probabilistic cellular acceptor. 181-208
  
• André Thayse:
  Encoding of parallel program schemata by vector addition systems. 209-218
  
• Ben Shneiderman, Richard E. Mayer:
  Syntactic/semantic interactions in programmer behavior: A model and experimental results. 219-238
  
• Belur V. Sheela, Belur V. Dasarathy:
  OPAL: A new algorithm for optimal partitioning and learning in non parametric unsupervised environments. 239-253
  

Volume 8, Number 4, August 1979

• A. V. Anisimov, Donald E. Knuth:
  Inhomogeneous sorting. 255-260
  
• Ronald Alter, Johnson M. Hart:
  Enumerating syntactical graphs and lattices of derivations. 261-277
  
• Sabah S. Al-Fedaghi, Y. H. Chin:
  Algorithmic approach to the consecutive retrieval property. 279-301
  
• Supachai Tangwongsan, K. S. Fu:
  An application of learning to robotic planning. 303-333
  
• Karel Culik II, Derek Wood:
  Doubly deterministic tabled OL systems. 335-347
  

Volume 8, Number 5, October 1979

• Gyula A. Magó:
  A network of microprocessors to execute reduction languages, part I. 349-385
  
• Elaine J. Weyuker:
  The applicability of program schema results to programs. 387-403
  
• Andrzej Proskurowski:
  Minimum dominating cycles in 2-trees. 405-417
  
• David R. Stoutemyer:
  Computer algebra for the calculus of variations, the maximum principle, and automatic control. 419-434
  

Volume 8, Number 6, December 1979

• Gyula A. Magó:
  A network of microprocessors to execute reduction languages, part II. 435-471
  
• Hikyoo Koh, Henry Y. H. Chuang:
  Finding a minimal set of base paths of a program. 473-488
  
• Yves Kodratoff:
  A class of functions synthesized from a finite number of examples and a lisp program scheme. 489-521
  
• Gregor von Bochmann:
  Semantic equivalence of covering attribute grammars. 523-539
  
• Julius T. Tou:
  Dynoc - A dynamic optimal cluster-seeking technique. 541-547
  

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