Min-Max Fine Heaps

Simple item page
dc.creatorNath, Suman Kumar
dc.creatorChowdhury, Rezaul Alam
dc.creatorKaykobad, M.
dc.date2000-07-31
dc.date.accessioned2026-07-07T03:16:25Z
dc.date.available2026-07-07T03:16:25Z
dc.descriptionIn this paper we present a new data structure for double ended priority queue, called min-max fine heap, which combines the techniques used in fine heap and traditional min-max heap. The standard operations on this proposed structure are also presented, and their analysis indicates that the new structure outperforms the traditional one.
dc.description6 pages, pdf file
dc.identifierhttps://arxiv.org/abs/cs/0007043
dc.identifierhttp://arxiv.org/abs/cs/0007043
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30348
dc.subjectData Structures and Algorithms
dc.subjectE.1
dc.titleMin-Max Fine Heaps
dc.typetext

Files

Collections

arXiv