[comp.theory] STACS: Sorting the sums

piatko@svax.cs.cornell.edu (Christine Piatko) (12/09/89)

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