Available Stabilizing Heaps

Simple item page
dc.creatorHerman, Ted
dc.creatorMasuzawa, Toshimitsu
dc.date2000-11-30
dc.date.accessioned2026-07-07T03:16:47Z
dc.date.available2026-07-07T03:16:47Z
dc.descriptionThis paper describes a heap construction that supports insert and delete operations in arbitrary (possibly illegitimate) states. After any sequence of at most O(m) heap operations, the heap state is guarantee to be legitimate, where m is the initial number of items in the heap. The response from each operation is consistent with its effect on the data structure, even for illegitimate states. The time complexity of each operation is O(lg K) where K is the capacity of the data structure; when the heap's state is legitimate the time complexity is O(lg n) for n equal to the number items in the heap.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/cs/0011046
dc.identifierhttp://arxiv.org/abs/cs/0011046
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30483
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectData Structures and Algorithms
dc.subjectC.2.4; D.1.3; D.3.3; E.2; C.4
dc.titleAvailable Stabilizing Heaps
dc.typetext

Files

Collections

arXiv