Tim Wylie

According to our database1, Tim Wylie authored at least 59 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Verification and computation in restricted Tile Automata.
Nat. Comput., June, 2024

Intrinsic Universality in Seeded Active Tile Self-Assembly.
CoRR, 2024

A Simple Proof that Ricochet Robots is PSPACE-Complete.
CoRR, 2024

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

Computing Threshold Circuits with Bimolecular Void Reactions in Step Chemical Reaction Networks.
Proceedings of the Unconventional Computation and Natural Computation, 2024

Row Shifting as a Puzzle Mechanic in Generalized Connect Four.
Proceedings of the IEEE Conference on Games, 2024

2023
Building squares with optimal state complexity in restricted active self-assembly.
J. Comput. Syst. Sci., December, 2023

Unique Assembly Verification in Two-Handed Self-Assembly.
Algorithmica, August, 2023

Complexity of verification in self-assembly with prebuilt assemblies.
J. Comput. Syst. Sci., 2023

Complexity of Reconfiguration in Surface Chemical Reaction Networks.
CoRR, 2023

Simulation of Multiple Stages in Single Bin Active Tile Self-assembly.
Proceedings of the Unconventional Computation and Natural Computation, 2023

Uniform Robot Relocation Is Hard in only Two Directions Even Without Obstacles.
Proceedings of the Unconventional Computation and Natural Computation, 2023

Covert Computation in the Abstract Tile-Assembly Model.
Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

Complexity of Reconfiguration in Surface Chemical Reaction Networks.
Proceedings of the 29th International Conference on DNA Computing and Molecular Programming, 2023

Reconfiguration of Linear Surface Chemical Reaction Networks with Bounded State Change.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022
Reachability in Restricted Chemical Reaction Networks.
CoRR, 2022

2021
Fast reconfiguration of robot swarms with uniform control signals.
Nat. Comput., 2021

Covert Computation in Self-Assembled Circuits.
Algorithmica, 2021

The Complexity of Multiple Handed Self-assembly.
Proceedings of the Unconventional Computation and Natural Computation, 2021

Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Hardness of Reconfiguring Robot Swarms with Uniform External Control in Limited Directions.
J. Inf. Process., 2020

Hierarchical Shape Construction and Complexity for Slidable Polyominoes under Uniform External Forces.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Signal Passing Self-Assembly Simulates Tile Automata.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Building Patterned Shapes in Robot Swarms with Uniform Control Signals.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

Relocating Units in Robot Swarms with Uniform Control Signals is PSPACE-Complete.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
Verification in staged tile self-assembly.
Nat. Comput., 2019

Self-assembly of shapes at constant scale using repulsive forces.
Nat. Comput., 2019

Optimal staged self-assembly of linear assemblies.
Nat. Comput., 2019

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

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

Full Tilt: Universal Constructors for General Shapes with Uniform External Forces.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Discrete Planar Map Matching.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
Optimal Staged Self-Assembly of General Shapes.
Algorithmica, 2018

Self-Assembly of Any Shape with Constant Tile Types using High Temperature.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Freezing Simulates Non-freezing Tile Automata.
Proceedings of the DNA Computing and Molecular Programming - 24th International Conference, 2018

2017
Concentration independent random number generation in tile self-assembly.
Theor. Comput. Sci., 2017

Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Complexities for High-Temperature Two-Handed Tile Self-assembly.
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.
J. Comb. Optim., 2016

An Interesting Gadget for Chain Pair Simplification.
CoRR, 2016

2015
Whole genome SNP genotype piecemeal imputation.
BMC Bioinform., 2015

On visualization techniques for solar data mining.
Astron. Comput., 2015

On the Chain Pair Simplification Problem.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly.
Proceedings of the DNA Computing and Molecular Programming - 21st International Conference, 2015

2014
Following a curve with the discrete Fréchet distance.
Theor. Comput. Sci., 2014

Intermittent Map Matching with the Discrete Fréchet Distance.
CoRR, 2014

On the Chain Pair Simplification Problem.
CoRR, 2014

Mitigating the Curse of Dimensionality for Exact kNN Retrieval.
Proceedings of the Twenty-Seventh International Florida Artificial Intelligence Research Society Conference, 2014

Approximating High-Dimensional Range Queries with kNN Indexing Techniques.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013
Protein Chain Pair Simplification under the Discrete Fréchet Distance.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Cluster Analysis for Optimal Indexing.
Proceedings of the Twenty-Sixth International Florida Artificial Intelligence Research Society Conference, 2013

Discretely Following a Curve.
Proceedings of the Combinatorial Optimization and Applications, 2013

A Comprehensive Study of iDistance Partitioning Strategies for kNN Queries and High-Dimensional Data Indexing.
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.
Proceedings of the Advances in Databases and Information Systems, 2013

Spatiotemporal Co-occurrence Rules.
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.
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.
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

Spatio-temporal Co-occurrence Pattern Mining in Data Sets with Evolving Regions.
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.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011


  Loading...