Now showing items 1-2 of 2

    • Analysis of Hoare's FIND algorithm with median-of-three partition 

      Kirschenhofer, P; Martínez Parra, Conrado; Prodinger, H (1995-02)
      Research report
      Open Access
      Hoare's Find algorithm can be used to select the jth element out of a file of n elements. It bears a remarkable similarity to Quicksort; in each pass of the algorithm, a pivot element is used to split the file into two ...
    • Partial match queries in relaxed multidimensional search trees 

      Martínez Parra, Conrado; Pahnholzer, A; Prodinger, H (1998-10)
      Research report
      Open Access
      Partial match queries arise frequently in the context of large databases, where each record contains a distinct multidimensional key, that is, the key of each record is a K-tuple of values. The components of a key are ...