First Occurrence of Parity Vectors and the Regular Structure of k-Span Predecessor Sets in the Collatz Graph. - Tristan Stérin (CoRR, 2019)

scadnano: A Browser-Based, Scriptable Tool for Designing DNA Nanostructures. - David Doty; Benjamin L. Lee; Tristan Stérin (DNA, 2020)

Binary Expression of Ancestors in the Collatz Graph. - Tristan Stérin (RP, 2020)

The Collatz Process Embeds a Base Conversion Algorithm. - Tristan Stérin; Damien Woods (RP, 2020)

scadnano: A browser-based, easily scriptable tool for designing DNA nanostructures. - David Doty; Benjamin L. Lee; Tristan Stérin (CoRR, 2020)

Limitations on counting in Boolean circuits and self-assembly. - Tristan Stérin; Damien Woods (CoRR, 2020)

Small Tile Sets That Compute While Solving Mazes. - Matthew Cook; Tristan Stérin; Damien Woods (DNA, 2021)

On the hardness of knowing busy beaver values BB(15) and BB(5, 4). - Tristan Stérin; Damien Woods (CoRR, 2021)

Hardness of Busy Beaver Value BB(15). - Tristan Stérin; Damien Woods (RP, 2024)

Turing machines deciders, part I. - The bbchallenge Collaboration; Justin Blanchard; Konrad Deka; Nathan Fenner; Tony Guilfoyle; Iijil; Maja Kadziolka; Pavel Kropitz; Shawn Ligocki; Pascal Michel; Mateusz Nasciszewski; Tristan Stérin (CoRR, 2025)