[comp.arch] Van Voorhis sorting network lower bound

parker@psuvax1.UUCP (Bruce Parker) (03/17/87)

I am looking for a copy of David C. Van Voorhis's "A lower
bound for sorting networks that use the divide-sort-merge
strategy," Technical Report No. 17, Digital Systems
Laboratory, Stanford University, Stanford, California.  As
luck would have it, the report is out-of-print.

I would be happy to pay for photocopying and mailing.

    Bruce Parker
    Computer Science Department
    301 Whitmore Laboratory
    The Pennsylvania State University
    University Park, Pennsylvania  16802