Pointer algorithm
Open-knowledge reference entry
In computer science, a pointer algorithm (sometimes called a pointer machine, or a reference machine; see the article
Pointer machine for a close but non-identical concept) is a type of algorithm that manages a linked data structure.
This concept is used as a model for lower-bound proofs and specific restrictions on the linked data structure and on the algorithm's access to the structure vary.
This model has been used extensively with problems related to the disjoint-set data structure. Thus,
Tarjan and La Poutré used this model to prove lower bounds on the amortized complexity of a disjoint-set data structure (La Poutré also addressed the interval split-find problem). Blum used this model to prove a lower bound on the single operation worst-case time of disjoint set data structure. Blum and Rochow proved a worst-case lower bound for the interval union-find problem.
Example
In Tarjan's lower bound for the disjoint set union problem, the assumptions on the algorithm are:
The algorithm maintains a linked structure of nodes.
Each element of the problem is associated with a node.
Each set is represented by a node.
The nodes of each set constitute a distinct connected component in the structure (this property is called separability).
“Pointer algorithm” enters the record as open-knowledge reference entry. Crown Archives preserves that source wording while asking what Pointer, algorithm and Open-knowledge can confirm, complicate or overturn.
Why this record matters
“Pointer algorithm” is worth following because a concise public description often conceals a longer documentary argument. Here, Pointer, algorithm and Open-knowledge provides the most credible route into that argument.
Named sources, stable identifiers and responsible institutions provide the strongest route from overview to verifiable evidence. The source revision retrieved here is dated Oct 15, 2025. The linked authority identifier is Q134975316. None of the 0 selected statements returned an explicit reference.
A concise general-reference account can conceal disagreements about scope, terminology or the weight assigned to individual sources. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Pointer algorithm”, its source revision and the description used here.
- Expand the search: follow Pointer algorithm primary sources, Pointer algorithm archive and Pointer research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Pointer algorithm”?
- Which cited source is closest to the event, object or claim?
- Which institution is responsible for the underlying evidence?
Search terms from this dossier
This entry incorporates text from “Pointer algorithm” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.