# Ho-Lin Chen

According to our database

Collaborative distances:

^{1}, Ho-Lin Chen authored at least 31 papers between 1999 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

An Exponentially Growing Nubot System Without State Changes.

Proceedings of the Unconventional Computation and Natural Computation, 2019

On the Complexity of Self-assembly Tasks.

Proceedings of the Unconventional Computation and Natural Computation, 2019

Self-Stabilizing Leader Election.

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018

A minimal requirement for self-assembly of lines in polylogarithmic time.

Nat. Comput., 2018

2017

Parallelism and Time in Hierarchical Self-Assembly.

SIAM J. Comput., 2017

Speed faults in computation by chemical reaction networks.

Distributed Comput., 2017

2016

Robustness in Self-Assembly.

Encyclopedia of Algorithms, 2016

Pattern overlap implies runaway growth in hierarchical tile systems.

JoCG, 2016

An Improved Tax Scheme for Selfish Routing.

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

Program Size and Temperature in Self-Assembly.

Algorithmica, 2015

2014

Synthesis of Stochastic Flow Networks.

IEEE Trans. Computers, 2014

Deterministic function computation with chemical reaction networks.

Nat. Comput., 2014

Rate-independent computation in continuous chemical reaction networks.

Proceedings of the Innovations in Theoretical Computer Science, 2014

Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation.

Proceedings of the DNA Computing and Molecular Programming - 20th International Conference, 2014

2013

Active Self-Assembly of Simple Units Using an Insertion Primitive.

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Active self-assembly of algorithmic shapes and patterns in polylogarithmic time.

Proceedings of the Innovations in Theoretical Computer Science, 2013

2010

Designing Network Protocols for Good Equilibria.

SIAM J. Comput., 2010

Parallelism, Program Size, Time, and Temperature in Self-Assembly.

Electronic Colloquium on Computational Complexity (ECCC), 2010

Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems.

Proceedings of the DNA Computing and Molecular Programming - 16th International Conference, 2010

2009

Network Design with Weighted Players.

Theory Comput. Syst., 2009

J. Comput. Biol., 2009

On the Impact of Heterogeneity and Back-End Scheduling in Load Balancing Designs.

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

The effect of local scheduling in load balancing designs.

SIGMETRICS Perform. Evaluation Rev., 2008

Designing networks with good equilibria.

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly.

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2006

Kinetically stable task assignment for networks of microservers.

Proceedings of the Fifth International Conference on Information Processing in Sensor Networks, 2006

2004

Invadable self-assembly: combining robustness with efficiency.

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Error Free Self-assembly Using Error Prone Tiles.

Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

2002

Some Applications of Orderly Spanning Trees in Graph Drawing.

Proceedings of the Graph Drawing, 10th International Symposium, 2002

2000

On Maximum Symmetric Subgraphs.

Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999

Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations.

Proceedings of the Graph Drawing, 7th International Symposium, 1999