Min-Max Fine Heaps
<|reference_start|>Min-Max Fine Heaps: In 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.<|reference_end|>
@article{nath2000min-max,
    title={Min-Max Fine Heaps},
    author={Suman Kumar Nath, Rezaul Alam Chowdhury, M. Kaykobad},
    journal={arXiv preprint arXiv:cs/0007043},
    year={2000},
    archivePrefix={arXiv},
    eprint={cs/0007043},
    primaryClass={cs.DS}
}