Tim Wylie

Angel A. Cantu

CoRR, 2024

Computing Threshold Circuits with Void Reactions in Step Chemical Reaction Networks.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Building squares with optimal state complexity in restricted active self-assembly.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., December, 2023

Unique Assembly Verification in Two-Handed Self-Assembly.

[BibT_eX]

[DOI]

Algorithmica, August, 2023

Complexity of verification in self-assembly with prebuilt assemblies.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2023

Complexity of Reconfiguration in Surface Chemical Reaction Networks.

[BibT_eX]

[DOI]

CoRR, 2023

Simulation of Multiple Stages in Single Bin Active Tile Self-assembly.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2023

Uniform Robot Relocation Is Hard in only Two Directions Even Without Obstacles.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2023

Covert Computation in the Abstract Tile-Assembly Model.

[BibT_eX]

[DOI]

Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

Complexity of Reconfiguration in Surface Chemical Reaction Networks.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on DNA Computing and Molecular Programming, 2023

2022

Reachability in Restricted Chemical Reaction Networks.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Fast reconfiguration of robot swarms with uniform control signals.

[BibT_eX]

[DOI]

Nat. Comput., 2021

Covert Computation in Self-Assembled Circuits.

[BibT_eX]

[DOI]

Algorithmica, 2021

The Complexity of Multiple Handed Self-assembly.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2021

Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Hardness of Reconfiguring Robot Swarms with Uniform External Control in Limited Directions.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

Hierarchical Shape Construction and Complexity for Slidable Polyominoes under Uniform External Forces.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Signal Passing Self-Assembly Simulates Tile Automata.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Verification and Computation in Restricted Tile Automata.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on DNA Computing and Molecular Programming, 2020

Building Patterned Shapes in Robot Swarms with Uniform Control Signals.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

Relocating Units in Robot Swarms with Uniform Control Signals is PSPACE-Complete.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Verification in staged tile self-assembly.

[BibT_eX]

[DOI]

Andrew Winslow

Nat. Comput., 2019

Self-assembly of shapes at constant scale using repulsive forces.

[BibT_eX]

[DOI]

Austin Luchsinger

Nat. Comput., 2019

Optimal staged self-assembly of linear assemblies.

[BibT_eX]

[DOI]

Nat. Comput., 2019

Full Tilt: Universal Constructors for General Shapes with Uniform External Forces.

[BibT_eX]

[DOI]

CoRR, 2019

Nearly Constant Tile Complexity for any Shape in Two-Handed Tile Assembly.

[BibT_eX]

[DOI]

Andrew Winslow

Algorithmica, 2019

Full Tilt: Universal Constructors for General Shapes with Uniform External Forces.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Discrete Planar Map Matching.

[BibT_eX]

Bin Fu

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Optimal Staged Self-Assembly of General Shapes.

[BibT_eX]

[DOI]

Algorithmica, 2018

Self-Assembly of Any Shape with Constant Tile Types using High Temperature.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Freezing Simulates Non-freezing Tile Automata.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming - 24th International Conference, 2018

2017

Concentration independent random number generation in tile self-assembly.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Complexities for High-Temperature Two-Handed Tile Self-assembly.

[BibT_eX]

[DOI]

Andrew Winslow

Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

2016

Enabling high-dimensional range queries using kNN indexing techniques: approaches and empirical results.

[BibT_eX]

[DOI]

Michael A. Schuh

J. Comb. Optim., 2016

An Interesting Gadget for Chain Pair Simplification.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Whole genome SNP genotype piecemeal imputation.

[BibT_eX]

[DOI]

BMC Bioinform., 2015

On visualization techniques for solar data mining.

[BibT_eX]

[DOI]

Karthik Ganesan Pillai

Astron. Comput., 2015

On the Chain Pair Simplification Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming - 21st International Conference, 2015

2014

Following a curve with the discrete Fréchet distance.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Intermittent Map Matching with the Discrete Fréchet Distance.

[BibT_eX]

[DOI]

CoRR, 2014

On the Chain Pair Simplification Problem.

[BibT_eX]

[DOI]

CoRR, 2014

Mitigating the Curse of Dimensionality for Exact kNN Retrieval.

[BibT_eX]

[DOI]

Michael A. Schuh

Proceedings of the Twenty-Seventh International Florida Artificial Intelligence Research Society Conference, 2014

Approximating High-Dimensional Range Queries with kNN Indexing Techniques.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013

Protein Chain Pair Simplification under the Discrete Fréchet Distance.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Cluster Analysis for Optimal Indexing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Florida Artificial Intelligence Research Society Conference, 2013

Discretely Following a Curve.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2013

A Comprehensive Study of iDistance Partitioning Strategies for kNN Queries and High-Dimensional Data Indexing.

[BibT_eX]

[DOI]

Proceedings of the Big Data - 29th British National Conference on Databases, 2013

Improving the Performance of High-Dimensional kNN Retrieval through Localized Dataspace Segmentation and Hybrid Indexing.

[BibT_eX]

[DOI]

Michael A. Schuh

Proceedings of the Advances in Databases and Information Systems, 2013

Spatiotemporal Co-occurrence Rules.

[BibT_eX]

[DOI]

Karthik Ganesan Pillai

Proceedings of the New Trends in Databases and Information Systems, 2013

When Too Similar Is Bad: A Practical Example of the Solar Dynamics Observatory Content-Based Image-Retrieval System.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Databases and Information Systems, 2013

2012

A Polynomial Time Solution for Protein Chain Pair Simplification under the Discrete Fréchet Distance.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

Spatio-temporal Co-occurrence Pattern Mining in Data Sets with Evolving Regions.

[BibT_eX]

[DOI]

Karthik Ganesan Pillai

Proceedings of the 12th IEEE International Conference on Data Mining Workshops, 2012

2011

A Practical Solution for Aligning and Simplifying Pairs of Protein Backbones under the Discrete Fréchet Distance.

[BibT_eX]

[DOI]

Jun Luo