ON THE COMPLEXITY OF BUILDING AN INTERVAL HEAP

Authors
DING YZ WEISS MA
Citation
Yz. Ding et Ma. Weiss, ON THE COMPLEXITY OF BUILDING AN INTERVAL HEAP, Information processing letters, 50(3), 1994, pp. 143-144
Citations number
3
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
50
Issue
3
Year of publication
1994
Pages
143 - 144
Database
ISI
SICI code
0020-0190(1994)50:3<143:OTCOBA>2.0.ZU;2-C
Abstract
We provide tight bounds of 2d log n + o(d log n), 3d2 log n + o(d2 log n), and 3/2d2n + o(d2n) on the number of comparisons used for inserti on, deletion, and construction of the n item d-dimensional interval he ap.