Tristan Stérin

Orcid: 0000-0002-2649-3718

According to our database1, Tristan Stérin authored at least 13 papers between 2019 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Putnam 2025 Problems in Rocq using Opus 4.6 and Rocq-MCP.
CoRR, March, 2026


2025
Determination of the fifth Busy Beaver value.
CoRR, September, 2025

Turing machines deciders, part I.
CoRR, April, 2025

2024
Hardness of Busy Beaver Value BB(15).
Proceedings of the Reachability Problems - 18th International Conference, 2024

2021
On the hardness of knowing busy beaver values BB(15) and BB(5, 4).
CoRR, 2021

Small Tile Sets That Compute While Solving Mazes.
Proceedings of the 27th International Conference on DNA Computing and Molecular Programming, 2021

2020
Limitations on counting in Boolean circuits and self-assembly.
CoRR, 2020

scadnano: A browser-based, easily scriptable tool for designing DNA nanostructures.
CoRR, 2020

The Collatz Process Embeds a Base Conversion Algorithm.
Proceedings of the Reachability Problems - 14th International Conference, 2020

Binary Expression of Ancestors in the Collatz Graph.
Proceedings of the Reachability Problems - 14th International Conference, 2020

scadnano: A Browser-Based, Scriptable Tool for Designing DNA Nanostructures.
Proceedings of the 26th International Conference on DNA Computing and Molecular Programming, 2020

2019
First Occurrence of Parity Vectors and the Regular Structure of k-Span Predecessor Sets in the Collatz Graph.
CoRR, 2019


  Loading...