Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!rutgers!sri-unix!hplabs!sdcrdcf!burdvax!psuvax1!parker
From: parker@psuvax1.UUCP (Bruce Parker)
Newsgroups: sci.math,comp.arch
Subject: Van Voorhis sorting network lower bound (query)
Message-ID: <2453@psuvax1.UUCP>
Date: Tue, 17-Mar-87 15:51:45 EST
Article-I.D.: psuvax1.2453
Posted: Tue Mar 17 15:51:45 1987
Date-Received: Fri, 20-Mar-87 01:12:53 EST
Organization: Pennsylvania State Univ.
Lines: 13
Xref: mnetor sci.math:747 comp.arch:609

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