A Note on Deleting the Maximum Element in Nested S-Heaps

Kohei NOSHITA; Yoshinobu NAKATANI

Copy

Kohei NOSHITA, Yoshinobu NAKATANI, "A Note on Deleting the Maximum Element in Nested S-Heaps" in IEICE TRANSACTIONS on transactions, vol. E73-E, no. 10, pp. 1725-1726, October 1990, doi: .
Abstract: This note shows a new implicit data structure, called a set of nested s-heaps, for deleting the maximum value of n elements in 2 long n comparisons. Nested s-heaps can be used to improve the efficiency of Smoothsort.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e73-e_10_1725/_p

Copy

@ARTICLE{e73-e_10_1725,
author={Kohei NOSHITA, Yoshinobu NAKATANI, },
journal={IEICE TRANSACTIONS on transactions},
title={A Note on Deleting the Maximum Element in Nested S-Heaps},
year={1990},
volume={E73-E},
number={10},
pages={1725-1726},
abstract={This note shows a new implicit data structure, called a set of nested s-heaps, for deleting the maximum value of n elements in 2 long n comparisons. Nested s-heaps can be used to improve the efficiency of Smoothsort.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - A Note on Deleting the Maximum Element in Nested S-Heaps
T2 - IEICE TRANSACTIONS on transactions
SP - 1725
EP - 1726
AU - Kohei NOSHITA
AU - Yoshinobu NAKATANI
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 10
JA - IEICE TRANSACTIONS on transactions
Y1 - October 1990
AB - This note shows a new implicit data structure, called a set of nested s-heaps, for deleting the maximum value of n elements in 2 long n comparisons. Nested s-heaps can be used to improve the efficiency of Smoothsort.
ER -