Scott M. Summers

According to our database1, Scott M. Summers authored at least 44 papers between 2007 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Proving new directed tile complexity lower bounds at temperature 1 by folding between 2D and just-barely 3D self-assembly.
Nat. Comput., March, 2025

2024
Sequential non-determinism in tile self-assembly: a general framework and an application to efficient temperature-1 self-assembly of squares.
CoRR, 2024

Self-assembly of Patterns in the Abstract Tile Assembly Model.
Proceedings of the Unconventional Computation and Natural Computation, 2024

2023
Tight Bounds on the Directed Tile Complexity of a Just-Barely 3D 2 ˟ N Rectangle at Temperature 1.
Proceedings of the Unconventional Computation and Natural Computation, 2023

2021
Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D.
Theor. Comput. Sci., 2021

On the effects of hierarchical self-assembly for reducing program-size complexity.
Theor. Comput. Sci., 2021

Fractal Dimension of Assemblies in the Abstract Tile Assembly Model.
Proceedings of the Unconventional Computation and Natural Computation, 2021

Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D.
Proceedings of the 27th International Conference on DNA Computing and Molecular Programming, 2021

2019
New Bounds on the Tile Complexity of Thin Rectangles at Temperature-1.
Proceedings of the DNA Computing and Molecular Programming - 25th International Conference, 2019

2018
Self-assembly of, and optimal encoding inside, thin rectangles at temperature-1 in 3D.
CoRR, 2018

Hierarchical Growth Is Necessary and (Sometimes) Sufficient to Self-assemble Discrete Self-similar Fractals.
Proceedings of the DNA Computing and Molecular Programming - 24th International Conference, 2018

2017
Scaled pier fractals do not strictly self-assemble.
Nat. Comput., 2017

Optimal Program-Size Complexity for Self-Assembled Squares at Temperature 1 in 3D.
Algorithmica, 2017

2016
Temperature Programming in Self-Assembly.
Encyclopedia of Algorithms, 2016

Resiliency to Multiple Nucleation in Temperature-1 Self-Assembly.
Proceedings of the DNA Computing and Molecular Programming - 22nd International Conference, 2016

2015
Optimal Program-Size Complexity for Self-Assembly at Temperature 1 in 3D.
Proceedings of the DNA Computing and Molecular Programming - 21st International Conference, 2015

Optimal Self-assembly of Finite Shapes at Temperature 1 in 3D.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Asynchronous signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient assembly of Shapes.
Int. J. Found. Comput. Sci., 2014

Scaled Tree Fractals Do not Strictly Self-assemble.
Proceedings of the Unconventional Computation and Natural Computation, 2014

Intrinsic universality in tile self-assembly requires cooperation.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

The Power of Duples (in Self-Assembly): It's Not So Hip to Be Square.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013
Asynchronous Signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient Assembly of Shapes.
Proceedings of the Unconventional Computation and Natural Computation, 2013

Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

The Two-Handed Tile Assembly Model Is Not Intrinsically Universal.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Two Hands Are Better Than One (up to constant factors)
CoRR, 2012

Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming.
Algorithmica, 2012

Identifying Shapes Using Self-assembly.
Algorithmica, 2012

The Tile Assembly Model is Intrinsically Universal.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Self-assembly of infinite structures: A survey.
Theor. Comput. Sci., 2011

Limitations of self-assembly at temperature 1.
Theor. Comput. Sci., 2011

Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract).
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue.
Proceedings of the DNA Computing and Molecular Programming - 17th International Conference, 2011

2010
Self-Assembly of Arbitrary Shapes with RNA and DNA tiles (extended abstract)
CoRR, 2010

Intrinsic Universality in Self-Assembly.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Identifying Shapes Using Self-assembly - (Extended Abstract).
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009
Random Number Selection in Self-assembly.
Proceedings of the Unconventional Computation, 8th International Conference, 2009

Limitations of Self-assembly at Temperature One.
Proceedings of the DNA Computing and Molecular Programming, 15th International Conference, 2009

2008
Self-Assembly of Infinite Structures
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

Limitations of Self-Assembly at Temperature One (extended abstract)
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

Self-assembly of Decidable Sets.
Proceedings of the Unconventional Computing, 7th International Conference, 2008

Self-assembly of Discrete Self-similar Fractals.
Proceedings of the DNA Computing, 14th International Meeting on DNA Computing, 2008

Computability and Complexity in Self-assembly.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Strict Self-assembly of Discrete Sierpinski Triangles.
Proceedings of the Computation and Logic in the Real World, 2007


  Loading...