Ho-Lin Chen

Orcid: 0000-0002-6171-9962

According to our database1, Ho-Lin Chen authored at least 45 papers between 1999 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Parameterized Streaming Algorithms for Topological Sorting.
Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

2024
Polynomial-time Combinatorial Algorithm for General Max-Min Fair Allocation.
Algorithmica, February, 2024

On the Simulation Power of Surface Chemical Reaction Networks.
Proceedings of the Unconventional Computation and Natural Computation, 2024

2023
Streamlined NTRU Prime on FPGA.
J. Cryptogr. Eng., June, 2023

Rate-independent Computation in Continuous Chemical Reaction Networks.
J. ACM, June, 2023

2022
Tight competitive analyses of online car-sharing problems.
Theor. Comput. Sci., 2022

On the Computational Power of Phosphate Transfer Reaction Networks.
New Gener. Comput., 2022

2021
Long text to image converter for financial reports.
Int. J. Data Min. Model. Manag., 2021

Randomized Scheduling for the Online Car-sharing Problem.
CoRR, 2021

Time-Optimal Self-Stabilizing Leader Election in Population Protocols.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Tight Competitive Analyses of Online Car-Sharing Problems.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

General Max-Min Fair Allocation.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Self-Stabilizing Leader Election in Regular Graphs.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

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

2017
A Minimal Requirement for Self-assembly of Lines in Polylogarithmic Time.
Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

2016
Robustness in Self-Assembly.
Encyclopedia of Algorithms, 2016

An Improved Tax Scheme for Selfish Routing.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015
Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Speed Faults in Computation by Chemical Reaction Networks.
Proceedings of the Distributed Computing - 28th International Symposium, 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

2012
Parallelism and time in hierarchical self-assembly.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Deterministic Function Computation with Chemical Reaction Networks.
Proceedings of the DNA Computing and Molecular Programming - 18th International Conference, 2012

2011
Program Size and Temperature in Self-Assembly.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Designing Network Protocols for Good Equilibria.
SIAM J. Comput., 2010

Parallelism, Program Size, Time, and Temperature in Self-Assembly.
Electron. Colloquium Comput. Complex., 2010

On the synthesis of stochastic flow networks.
Proceedings of the IEEE International Symposium on Information Theory, 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
An <i>O</i>(<i>n</i><sup>5</sup>) Algorithm for MFE Prediction of Kissing Hairpins and 4-Chains in Nucleic Acids.
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

2007
Robust self-assembly.
PhD thesis, 2007

2006
Network design with weighted players.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 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


  Loading...