Next Article in Journal
Autonomous Population Regulation Using a Multi-Agent System in a Prey–Predator Model That Integrates Cellular Automata and the African Buffalo Optimization Metaheuristic
Next Article in Special Issue
Editorial: Special Issue on Efficient Data Structures
Previous Article in Journal
Parameter Estimation, Robust Controller Design and Performance Analysis for an Electric Power Steering System
Previous Article in Special Issue
Space-Efficient Fully Dynamic DFS in Undirected Graphs
Article

A Selectable Sloppy Heap

Department of Computer Science, University of Wisconsin—Milwaukee, Milwaukee, WI 53201, USA
Algorithms 2019, 12(3), 58; https://doi.org/10.3390/a12030058
Received: 20 November 2018 / Revised: 14 February 2019 / Accepted: 28 February 2019 / Published: 6 March 2019
(This article belongs to the Special Issue Efficient Data Structures)
We study the selection problem, namely that of computing the ith order statistic of n given elements. Here we offer a data structure called selectable sloppy heap that handles a dynamic version in which upon request (i) a new element is inserted or (ii) an element of a prescribed quantile group is deleted from the data structure. Each operation is executed in constant time—and is thus independent of n (the number of elements stored in the data structure)—provided that the number of quantile groups is fixed. This is the first result of this kind accommodating both insertion and deletion in constant time. As such, our data structure outperforms the soft heap data structure of Chazelle (which only offers constant amortized complexity for a fixed error rate 0 < ε 1 / 2 ) in applications such as dynamic percentile maintenance. The design demonstrates how slowing down a certain computation can speed up the data structure. The method described here is likely to have further impact in the field of data structure design in extending asymptotic amortized upper bounds to same formula asymptotic worst-case bounds. View Full-Text
Keywords: dynamic quantile maintenance; approximate selection; ith order statistic; mediocre element; tournament; online algorithm dynamic quantile maintenance; approximate selection; ith order statistic; mediocre element; tournament; online algorithm
MDPI and ACS Style

Dumitrescu, A. A Selectable Sloppy Heap. Algorithms 2019, 12, 58. https://doi.org/10.3390/a12030058

AMA Style

Dumitrescu A. A Selectable Sloppy Heap. Algorithms. 2019; 12(3):58. https://doi.org/10.3390/a12030058

Chicago/Turabian Style

Dumitrescu, Adrian. 2019. "A Selectable Sloppy Heap" Algorithms 12, no. 3: 58. https://doi.org/10.3390/a12030058

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop