Dynamic ordered sets with exponential search trees¶
Andersson, A., & Thorup, M. (2007). Dynamic ordered sets with exponential search trees. ACM.
Cited by¶
2 citations across 1 artifact.
Domain-specific¶
- Exponential tree
- The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
- … between constitutive identity and a convenient observable transfers from A canonical example satisfies the full defining rule of Exponential tree with assumptions and conventions explicit. to A careful use of Exponential tree tests the constitutive rule and nearest confusable rather than relying on the label alone..
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:2bab1f4bf18e · see in the full table