A Unifying Property for Distribution-Sensitive Priority Queues

Elmasry, Amr; Farzan, Arash; Iacono, John

doi:10.1007/978-3-642-25011-8_17

Cited by 4 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is worth noting that our priority queue supports the stronger definition of the working-set and the queueish properties, in which the elements deleted are not accounted for in the time bounds. Our recent result about the asymptotic equivalence of the working-set bound and the unified bound [7] implies that our priority queue also satisfies the static-optimality, static-finger, and unified bounds. We defined the notion of time fingers, which encapsulates the working-set and the queueish properties.…”

Section: Discussionmentioning

confidence: 77%

“…Informally, the working-set property implies that the elements that have been recently operated on are faster to operate on compared to the elements that have not been accessed in the recent past. The unified bound [14] indicates an apparently, but not indeed [7], stronger property. The unified bound is the minimum per operation among the static-finger, static-optimality, and working-set bounds.…”

Section: Introductionmentioning

confidence: 95%

“…Iacono [11] observed that the working-set property implies the static-optimality and static-finger properties. We have recently proved the implication of the unified bound from the working-set bound [7], indicating that both bounds are asymptotically equivalent. That is, whereas Iacono [11] showed that the working-set property guarantees the minimum of the three bounds, we [7] showed that it even guarantees the minimum per operation of those bounds.…”

Section: Introductionmentioning

confidence: 97%

See 2 more Smart Citations

A priority queue with the time-finger property

Elmasry

Farzan

Iacono

2012

Journal of Discrete Algorithms

Self Cite

View full text Add to dashboard Cite

We present a priority queue that supports insert in worst-case constant time, and deletemin, access-min, delete, and decrease of an element x in worst-case O (log(min{w x , q x })) time, where w x (respectively, q x ) is the number of elements that were accessed after (respectively, before) the last access to x and are still in the priority queue at the time when the corresponding operation is performed. (An access to an element is accounted for by any priority-queue operation that involves this element.) Our priority queue then has both the working-set and the queueish properties; and, more strongly, it satisfies these properties in the worst-case sense. From the results in Iacono (2001) [11] and Elmasry et al. (2011) [7], our priority queue also satisfies the static-finger, static-optimality, and unified bounds. Moreover, we modify our priority queue to realize a new unifying property -the time-finger property -which encapsulates both the working-set and the queueish properties.

show abstract

Section: Discussionmentioning

confidence: 77%

Section: Introductionmentioning

confidence: 95%

Section: Introductionmentioning

confidence: 97%

See 1 more Smart Citation

A priority queue with the time-finger property

Elmasry

Farzan

Iacono

2012

Journal of Discrete Algorithms

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, the notion of allowing the finger by which temporal distance is mea sured to be selected in advance is relatively new; prior to this thesis, this prob lem has only been studied in the context of priority queues. Elmasry et al [37] developed a priority queue that supports a constant number of temporal fingers.…”

Section: Introductionmentioning

confidence: 99%

Exploiting non-uniform query distributions in data structuring problems

Howat¹

View full text Add to dashboard Cite

The author has granted a non exclusive license allowing Library and Archives Canada to reproduce, publish, archive, preserve, conserve, communicate to the public by telecommunication or on the Internet, loan, distrbute and sell theses worldwide, for commercial or non commercial purposes, in microform, paper, electronic and/or any other formats. AVIS: L'auteur a accorde une licence non exclusive permettant a la Bibliotheque et Archives Canada de reproduire, publier, archiver, sauvegarder, conserver, transmettre au public par telecommunication ou par I'lnternet, preter, distribuer et vendre des theses partout dans le monde, a des fins commerciales ou autres, sur support microforme, papier, electronique et/ou autres formats. Bien que ces formulaires aient inclus dans la pagination, il n'y aura aucun contenu manquant.

show abstract