Tristan Stérin

According to our database, Tristan Stérin authored at least 9 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Hardness of Busy Beaver Value BB(15).

Tristan Stérin, Damien Woods

Proceedings of the Reachability Problems - 18th International Conference, 2024

2021

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

Tristan Stérin, Damien Woods

CoRR, 2021

Small Tile Sets That Compute While Solving Mazes.

Matthew Cook, Tristan Stérin, Damien Woods

Proceedings of the 27th International Conference on DNA Computing and Molecular Programming, 2021

2020

Limitations on counting in Boolean circuits and self-assembly.

Tristan Stérin, Damien Woods

CoRR, 2020

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

David Doty, Benjamin L. Lee, Tristan Stérin

CoRR, 2020

The Collatz Process Embeds a Base Conversion Algorithm.

Tristan Stérin, Damien Woods

Proceedings of the Reachability Problems - 14th International Conference, 2020

Binary Expression of Ancestors in the Collatz Graph.

Tristan Stérin

Proceedings of the Reachability Problems - 14th International Conference, 2020

scadnano: A Browser-Based, Scriptable Tool for Designing DNA Nanostructures.

David Doty, Benjamin L. Lee, Tristan Stérin

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.

Tristan Stérin

CoRR, 2019