Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!mailrus!iuvax!rawlins
From: rawlins@iuvax.cs.indiana.edu (Gregory J. E. Rawlins)
Newsgroups: comp.theory
Subject: Re: Repost of "Revised Heapsort" requested
Message-ID: <30602@iuvax.cs.indiana.edu>
Date: 1 Dec 89 10:07:56 GMT
References: <3704@eagle.wesleyan.edu> <118@bohra.cpg.oz> <74578@tut.cis.ohio-state.edu> <34735@cornell.UUCP>
Reply-To: rawlins@iuvax.cs.indiana.edu (Gregory J. E. Rawlins)
Organization: Dept. of Computer Science, Indiana University
Lines: 13

In article <34735@cornell.UUCP> stefan@svax.cs.cornell.edu (Kjartan Stefansson) writes:
[four articles and requests]

I don't know why this keeps coming up, i don't remember heapsort being
discussed in this newsgroup in the recent past. Anyway, beside the Gonnet
and Munro paper (SIAM J. Comp. 15,964-971) you may want to look for Svante
Carlsson's 1986 thesis _Heaps_, Doctoral Dissertiation, Department of Computer
Science, Lund University, Lund, Sweden. Also, Svante, Ian, and Patricio
Poblete have a paper in SWAT on constant time implicit heap insertion
(Carlsson, Munro, and Poblete, ``An Implicit Binomial Queue with Constant
Insertion Time,'' First Scandinavian Workshop on Algorithm Theory,
Halmstad, Sweden, Springer-Verlag LNCS 318.
	gregory.


Brought to you by Super Global Mega Corp .com