Scott M. Summers
According to our database1,
Scott M. Summers
authored at least 43 papers
between 2008 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Sequential non-determinism in tile self-assembly: a general framework and an application to efficient temperature-1 self-assembly of squares.
CoRR, 2024
Proceedings of the Unconventional Computation and Natural Computation, 2024
2023
Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D.
Theory Comput. Syst., October, 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
Theor. Comput. Sci., 2021
Theor. Comput. Sci., 2021
Proceedings of the Unconventional Computation and Natural Computation, 2021
2020
Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals.
Nat. Comput., 2020
2019
Proceedings of the DNA Computing and Molecular Programming - 25th International Conference, 2019
2018
Theor. Comput. Sci., 2018
Self-assembly of, and optimal encoding inside, thin rectangles at temperature-1 in 3D.
CoRR, 2018
2017
Algorithmica, 2017
2016
Algorithmica, 2016
2015
Proceedings of the DNA Computing and Molecular Programming - 21st International Conference, 2015
2014
Asynchronous signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient assembly of Shapes.
Int. J. Found. Comput. Sci., 2014
Proceedings of the Unconventional Computation and Natural Computation, 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 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
2012
Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming.
Algorithmica, 2012
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
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
Proceedings of the DNA Computing and Molecular Programming - 17th International Conference, 2011
2010
CoRR, 2010
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
2009
Proceedings of the Unconventional Computation, 8th International Conference, 2009
Proceedings of the DNA Computing and Molecular Programming, 15th International Conference, 2009
2008
Electron. Colloquium Comput. Complex., 2008
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008