BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-87-1157
       ENTRY:: April 24, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Network Implementation of the DTEP Algorithm
        TYPE:: Technical Report
      AUTHOR:: Mayr, E. W.
      AUTHOR:: Plaxton, C. G.
        DATE:: May 1987
       PAGES:: 26
    ABSTRACT:: The dynamic tree expression problem (DTEP) was defined in
               [Ma87]. In this paper, efficient implementations of the DTEP
               algorithm are developed for the hypercube, butterfly, perfect
               shuffle and multidimensional mesh of trees families of
               networks.
       NOTES:: [Adminitrivia V1/Prg/19950424]
         END:: STAN//CS-TR-87-1157