A Selectable Sloppy Heap
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 d...
Main Author: | Adrian Dumitrescu |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-03-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/12/3/58 |
Similar Items
-
Mediocrity Madness: the Destructive Effects of Antonio Salieri’s Narcissistic Personality Disorder in Amadeus
by: Ivonne Muliawati Harsono
Published: (2017-01-01) -
Mediocrity Madness: the Destructive Effects of Antonio Salieri’s Narcissistic Personality Disorder in Amadeus
by: Ivonne Muliawati Harsono
Published: (2018-01-01) -
Cyclic Brunn–Minkowski inequalities for general width and chord-integrals
by: Linmei Yu, et al.
Published: (2019-07-01) -
A Survey of Approximate Quantile Computation on Large-Scale Data
by: Zhiwei Chen, et al.
Published: (2020-01-01) -
Riqueza científica e ensino pobre
by: Raymundo de Lima
Published: (2009-06-01)