BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-87-1156
       ENTRY:: April 24, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: The Dynamic Tree Expression Problem
        TYPE:: Technical Report
      AUTHOR:: Mayr, Ernst W.
        DATE:: May 1987
       PAGES:: 24
    ABSTRACT:: Presented is a uniform method for obtaining efficient
               parallel algorithms for a rather large class of problems. The
               method is based on a logic programming model, and it derives
               its efficiency form fast parallel routines for the evaluation
               of expression trees.
       NOTES:: [Adminitrivia V1/Prg/19950424]
         END:: STAN//CS-TR-87-1156