Re: parallel search

Article View: fj.mail-lists.parallel

Article #260

Back to fj.mail-lists.parallel Previous Next

#260

From: Magnus Selhammar
Date: Wed, 09 Sep 1992 15:13

17 lines
940 bytes

In article <1992Sep3.123256.14501@hubcap.clemson.edu>, sarnath@sybil.cs.buffalo.edu (Ramnath Sarnath) writes:
|> 
|> I am looking for references to Parallel search algorithms on 
|> ordered/partially ordered structures.
|> 
|> I would appreciate any pointers.
|> 
|> sarnath
|> 

I am also looking for search algoritms, even though my interest
is in almost ordered structures.
What surprises me is that it's so difficult to find such
methods on searching. Yes, the field is new, but it's a very
general problem that should interest many persons.

Magnus Selhammar

Technical Details

Message-ID: <315252@nttlab.ntt.JP>

Path: arc1-ca.pugleaf.net!sparky!uunet!sun-barr!sh.wide!wnoc-snd-ss2!akiu!hakata!kyu-cs!lab!nttlab!daemon

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!sun-barr!sh.wide!wnoc-snd-ss2!akiu!hakata!kyu-cs!lab!nttlab!daemon
From: magnus@solaris.astro.uu.se (Magnus Selhammar)
Newsgroups: fj.mail-lists.parallel
Subject: Re: parallel search
Message-ID: <315252@nttlab.ntt.JP>
Date: 9 Sep 92 15:13:57 GMT
Sender: daemon@nttlab.ntt.JP
Distribution: fj
Lines: 17
Approved: news@nttlab.ntt