Volume 16, Number 1, February 1987

• 
  Shlomit S. Pinter, Yaron Wolfstahl: On mapping processes to processors in distributed systems. 1-15
• 
  Kristine Stougaard Thomsen: Inheritance on processes, exemplified on distributed termination detection. 17-52
• 
  Erik DeBenedictis: A multiprocessor using protocol-based programming primitives. 53-84

Volume 16, Number 2, April 1987

• 
  Ian T. Foster, Stephen Taylor: Flat Parlog: A basis for comparison. 87-125
• 
  Henk Meijer, Selim G. Akl: Optimal computation of prefix sums on a binary tree of processors. 127-136
• 
  Michael Wolfe, Utpal Banerjee: Data dependence and its application to parallel processing. 137-178

Volume 16, Number 3, June 1987

• 
  Adolfo Guzmán, Edward J. Krall, Patrick F. McGehearty, Nader Bagherzadeh: Performance of symbolic applications on a parallel architecture. 183-214
• 
  Richard M. Fujimoto, Hwa-chung Feng: A shared memory algorithm and proof for the generalized alternative construct in CSP. 215-241
• 
  Roger L. Wainwright: Deriving parallel computations from functional specifications: A seismic example on a hypercube. 243-260

Volume 16, Number 4, August 1987

• 
  Nissim Francez, Shmuel Katz: Fairness and the axioms of control predicates. 263-278
• 
  Frances E. Hunt: Experiments with applicative updating: Practical results. 279-303
• 
  Elizabeth Bradley, Robert H. Halstead Jr.: Simulating logic circuits: A multiprocessor application. 305-338

Volume 16, Number 5, October 1987

• 
  Ashok Samal, Tom Henderson: Parallel consistent labeling algorithms. 341-364
• 
  Charles Koelbel, Piyush Mehrotra, John Van Rosendale: Semi-automatic process partitioning for parallel computation. 365-382
• 
  Michael G. Main: Trace, failure and testing equivalences for communicating processes. 383-400
• 
  Andrew Davison: Blackboard systems in Polka. 401-424

Volume 16, Number 6, December 1987

• 
  John R. Gilbert, Earl Zmijewski: A parallel graph partitioning algorithm for a message-passing multiprocessor. 427-449
• 
  Pierpaolo Degano, Sergio Marchetti: Partial ordering models for concurrency can be defined operationally. 451-478
• 
  V. Nageshwara Rao, Vipin Kumar: Parallel depth first search. Part I. Implementation. 479-499
• 
  Vipin Kumar, V. Nageshwara Rao: Parallel depth first search. Part II. Analysis. 501-519
• 
  Gary Lindstrom: Sans pareil: Referees. 521-522

last updated on Sun May 26 04:55:47 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page