BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-76-573
       ENTRY:: July 04, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: The stationary p-tree forest
        TYPE:: Technical Report
      AUTHOR:: Jonassen, Arne T.
        DATE:: October 1976
       PAGES:: 94
    ABSTRACT:: This paper contains a theoretical analysis of the conditions
               of a priority queue strategy after an infinite number of
               alternating insert/remove steps. Expected insertion time,
               expected length, etc. are found.
       NOTES:: [Adminitrivia V1/Prg/19950704]
         END:: STAN//CS-TR-76-573