Now showing items 1-2 of 2

    • Bounding the expected length of longest common subsequences and forests 

      Scheihing, R.; Navarro, G.; Gavaldà Mestre, Ricard; Baeza-Yates, R. (1998-09-01)
      Research report
      Open Access
      We present improvements to two techniques to find lower and upper bounds for the expected length of longest common subsequences and forests of two random sequences of the same length, over a fixed size, uniformly ...
    • Fringe analysis of synchronized parallel algorithms on 2--3 trees 

      Baeza-Yates, R.; Gabarró Vallès, Joaquim; Messeguer Peypoch, Xavier (1998-06-02)
      Research report
      Open Access
      We are interested in the fringe analysis of synchronized parallel insertion algorithms on 2--3 trees, namely the algorithm of W. Paul, U. Vishkin and H. Wagener~(PVW). This algorithm inserts k keys into a tree of size n ...