The document describes algorithms for merging two sorted sequences in parallel. It discusses merging algorithms for the CREW and EREW models of parallel computation. For the CREW model, it presents a parallel merging algorithm that uses binary search. For the EREW model, it presents an adaptive and cost-optimal parallel merging algorithm that recursively finds the median element to partition the sequences.