Xref: utzoo sci.math:9249 comp.theory:177
Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!brutus.cs.uiuc.edu!psuvax1!callahan
From: callahan@cs.psu.edu (Paul B. Callahan)
Newsgroups: sci.math,comp.theory
Subject: Re: Parallel complexity reference needed
Message-ID: <Cf;&ny@cs.psu.edu>
Date: 11 Jan 90 20:01:41 GMT
References: <C0;5!x@cs.psu.edu>
Organization: Penn State University Computer Science
Lines: 13

In article <C0;5!x@cs.psu.edu> I wrote:
>I'm looking for a paper which examines the parallel complexity of 
>evaluating networks of comparator gates (the basic units of sorting
>networks). 

Thanks to all who responded.  I've gotten the primary reference, namely
"The complexity of circuit value and network stability" by Ernst W. Mayr
and Ashok Subramanian, as well as a great deal of additional information.  
(not bad considering I posted shortly before lunch today).

Paul Callahan
callahan@crabcake.cs.jhu.edu
callahan@psuvax1.cs.psu.edu