DMCA
The Soft Heap: An Approximate Priority Queue with Optimal Error Rate (2000)
Cached
Download Links
- [www.cs.princeton.edu]
- [www.link.cs.cmu.edu]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu]
- [www.cs.cmu.edu]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu]
- DBLP
Other Repositories/Bibliography
by
Bernard Chazelle
| Venue: | J. ACM |
| Citations: | 24 - 1 self |
BibTeX
@ARTICLE{Chazelle00thesoft,
author = {Bernard Chazelle},
title = {The Soft Heap: An Approximate Priority Queue with Optimal Error Rate},
journal = {J. ACM},
year = {2000},
volume = {47},
pages = {16}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat the logarithmic bound on the complexity of a heap in a comparison-based model.
