Reference health

Tables

https://doi.org/10.1007/3-540-62034-6_35
CiteStamped reference-health badge
12/12 checkable references clean · checked 2026-08-10

Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.

5 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

The 12 checked references that resolve
resolves10.1145/355588.365103
Algorithm 245: Treesort
resolves10.1109/SFCS.1989.63533
Space-efficient static trees and graphs
resolves10.1007/BF00288468
Generating binary trees of bounded height
resolves10.1137/0222058
Suffix Arrays: A New Method for On-Line String Searches
resolves10.1145/321479.321481
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
resolves10.1016/0022-0000(86)90043-7
An implicit data structure supporting insertion, deletion, and search in Olog2n) time
resolves10.1016/0022-0000(80)90037-9
Implicit data structures for fast search and update
resolves10.1016/B978-1-4832-3187-7.50017-9
THE CODING OF VARIOUS KINDS OF UNLABELED TREES
resolves10.1006/jagm.1993.1031
The Analysis of Heapsort
resolves10.1109/SWAT.1973.13
Linear pattern matching algorithms
resolves10.1145/512274.512284
Algorithm 230: Matrix Permutation
resolves10.1016/0304-3975(80)90073-0
Lexicographic generation of ordered trees
The 5 references without a DOI — listed, not checked
no DOI — not checkedA. Brodnik and J. I. Munro, Membership in Constant Time and Minimum Space, Proc. Algorithms — ESA '94, LNCS 855 (1994) 72–81.
no DOI — not checkedD. R. Clark, Compact Pat Trees, manuscript, University of Waterloo (1996).
no DOI — not checkedD. R. Clark and J. I. Munro, Succinct Representation of Trees, in preparation, University of Waterloo (1996).
no DOI — not checkedG. H. Gonnet, R. A. Baeza-Yates and T. Snider, Lexicographic Indices for Text: Inverted Files vs. Pat Trees, Tech. Rpt. OED-91-01, Centre for the New OED, University of Waterloo (1991).
no DOI — not checkedG. Jacobson, Succinct Data Structures, Tech. Rpt. CMU-CS-89-112, Carnegie Mellon University (1989).
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-08-10 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.1007/3-540-62034-6_35"><img src="https://citestamp.com/citestamped/10.1007/3-540-62034-6_35/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1007/3-540-62034-6_35/badge.svg)](https://citestamp.com/citestamped/10.1007/3-540-62034-6_35)