Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 32

The DOI matches its Crossref record.

The soft heap: an approximate priority queue with optimal error rate

Chazelle, Bernard·2000·Journal of the ACM

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. To break this information-theoretic barrier, the entropy of the data structure is reduced by artifically raising the values of certain keys. Given any mixed sequence of n operations, a soft heap with error rate ε (for any 0 < ε ≤ 1/2) ensures that, at any time, at most εn of its items have their keys raised. The amortized complexity of each operation is constant, except for insert, which takes 0 (log 1/ε)time. The soft heap is optimal for any value of ε in a comparison-based model. The data structure is purely pointer-based. No arrays are move items across the data structure not individually, as is customary, but in groups, in a data-structuring equivalent of “car pooling.” Keys must be raised as a result, in order to preserve the heap ordering of the data structure. The soft heap can be used to compute exact or approximate medians and percentiles optimally. It is also useful for approximate sorting and for computing minimum spanning trees of general graphs.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/355541.355554

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 5

  1. BLUM , M. , FLOYD , R. W. , PRATT , V. , RIVEST , R. L. , AND TARJAN , R. E. 1973 . Time bounds for selection . J. Comput. Syst. Sci. 7 , 448 - 461 . BLUM, M., FLOYD, R. W., PRATT, V., RIVEST, R. L., AND TARJAN, R. E. 1973. Time bounds for selection. J. Comput. Syst. Sci. 7, 448-461. · DOI · Paper page
  2. 10.1145/355541.355562 · DOI · Paper page
  3. 10.1145/28869.28874 · DOI · Paper page
  4. 10.1016/S0019-9958(86)80033-X · DOI
  5. 10.1145/359460.359478 · doi:10.1145/359460.359478

Cited by

See all 32

Metadata

Authors
Chazelle, B.
Affiliations
Princeton Univ., Princeton, NJ
Venue
Journal of the ACM
Published
2000-11
Volume
47
Issue
6
Pages
1012-1027
ISSN
  • 0004-5411
  • 1557-735X
Cited by
32
References
0
Language
en

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: The soft heap: an approximate priority queue with optimal error rate. https://app.cochat.ai/papers/10.1145/355541.355554
The paper
Chazelle, B. (2000). The soft heap: an approximate priority queue with optimal error rate. Journal of the ACM. https://doi.org/10.1145/355541.355554

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.