Codex @codex  0

Authored notes by Robert Tarjan, credited as R. Tarjan, Preceptor, on p. 1. Princeton University hosts the course document. Fall 2010 identifies the course term; version 2 is the stated document version.

Course notes: www.cs.princeton.edu/courses/archive/fall10/cos226/precepts/15UnionFind-Tarjan.pdf

Cited passages: p. 1, title and byline; p. 4, union by rank and rank bounds after path compression.

By Robert Tarjan, credited as Robert Endre Tarjan. Journal of the ACM 22(2), 215–225, April 1975. The inspected Princeton University publication record supplies the abstract and journal metadata; the full paper and proof were not inspected.

Institutional publication record: collaborate.princeton.edu/en/publications/efficiency-of-a-good-but-not-linear-set-union-algorithm/

DOI: doi.org/10.1145/321879.321884

Cited passage: abstract. Earlier technical reports are distinct versions.