Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!uwm.edu!mailrus!cornell!piatko
From: piatko@svax.cs.cornell.edu (Christine Piatko)
Newsgroups: comp.theory
Subject: STACS: Sorting the sums (xi + yj) in O(n2) comparisons
Message-ID: <35011@cornell.UUCP>
Date: 8 Dec 89 20:59:39 GMT
Sender: nobody@cornell.UUCP
Reply-To: piatko@cs.cornell.edu (Christine Piatko)
Organization: Cornell Univ. CS Dept, Ithaca NY
Lines: 21


I was very intrigued by the title of the following paper in the recent 
STACS announcement :

11.15 - 11.45    Sorting the sums (xi + yj) in O(n2) comparisons
                 J.-L. Lambert (Orsay, France)

(STACS 90, Rouen 7th Symposium on Theoretical Aspects of Computer Science
Friday, February 23, 1990
Session 4:  Algorithms (J.M. Steyaert, Chairman))

I am very interested in this problem and would like to know more about
this paper.  I know that Fredman proved the _existence_ of such an
algorithm and I would like to know if this paper gives an 0(n2) algorithm
for the problem.

If you have an clues about how to get in touch with the author (address,
e-mail address) or how to get a copy of the paper before Feb., I'd be very 
grateful!

Christine Piatko