JACM   2000
Wall of Fame | Most Viewed JACM-2000 Paper
131views more  JACM 2000»
9 years 3 months ago
The soft heap: an approximate priority queue with optimal error rate
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...
Bernard Chazelle
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source131
2Download preprint from source119
3Download preprint from source119
4Download preprint from source86
5Download preprint from source81
6Download preprint from source77
7Download preprint from source73
8Download preprint from source57
9Download preprint from source56
10Download preprint from source55
11Download preprint from source50