2000/11/30 by Ted Herman, Herman, Ted, Toshimitsu Masuzawa +1
Computer Science · #C.2.4 #C.4 #D.1.3 #D.3.3 #Data Structures and Algorithms (cs.DS) #Distributed #Distributed systems and fault tolerance #E.2 #FOS: Computer and information sciences #Logic, programming, and type systems #Parallel #and Cluster Computing (cs.DC) #cs.DC #cs.DS #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.cs/0011046
10 pages
arxiv created 2000/11/30 · openalex publication_date 2000/11/30 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.