Available Stabilizing Heaps

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

This 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.
10 pages

Keywords

Distributed, Parallel, and Cluster Computing, Data Structures and Algorithms, C.2.4; D.1.3; D.3.3; E.2; C.4

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30483

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0011046
 http://arxiv.org/abs/cs/0011046

Collections

arXiv