First Page | Meta Content | |
---|---|---|
Document Date: 2002-09-16 17:06:43Open Document File Size: 481,25 KBShare Result on FacebookCityStuttgart / Reading / Baltimore / /CompanyData Structures Ian Munro / /CountryGermany / Canada / /FacilityCarleton University / /IndustryTermlinear-time algorithms / heap algorithms / linear-time heap construction algorithm / min-max heap algorithms / balanced binary search trees / /OrganizationSchool of Computer Science / Carleton University / Ottawa / National Council of Canada / School of Comput / Association for Computing Machinery / /PersonAddison Wesley / Min-Max Heaps / Min-Max Heaps Create Insert DeleteMin / Mb-Heaps Heaps Create Insert DeleteMin / Min-Max Heap / Generalized Priority Queues / Max Heaps / Max Heap / /PositionEditor / Problems General / /ProvinceOrStateMaryland / Hawaii / Massachusetts / Ontario / /PublishedMediumthe Communications of the ACM / Communications of the ACM / /Technologyknown linear-time algorithms / An algorithm / linear-time heap construction algorithm / heap algorithms / J.W.J. Algorithm / min-max heap algorithms / R.W. Algorithm / /SocialTag |