default search action
Ho-Lin Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Sheng-Yen Ko, Ho-Lin Chen, Siu-Wing Cheng
, Wing-Kai Hon, Chung-Shou Liao:
Polynomial-time Combinatorial Algorithm for General Max-Min Fair Allocation. Algorithmica 86(2): 485-504 (2024) - [c31]Yi-Xuan Lee, Ho-Lin Chen:
On the Simulation Power of Surface Chemical Reaction Networks. UCNC 2024: 148-162 - [i14]Yi-Xuan Lee, Ho-Lin Chen:
On the Simulation Power of Surface Chemical Reaction Networks. CoRR abs/2406.08497 (2024) - 2023
- [j16]Ho-Lin Chen
Rate-independent Computation in Continuous Chemical Reaction Networks. J. ACM 70(3): 22:1-22:61 (2023) - [j15]Bo-Yuan Peng
Streamlined NTRU Prime on FPGA. J. Cryptogr. Eng. 13(2): 167-186 (2023) - [e1]Ho-Lin Chen
29th International Conference on DNA Computing and Molecular Programming, DNA 2023, September 11-15, 2023, Tohoku University, Sendai, Japan. LIPIcs 276, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-297-6 [contents] - 2022
- [j14]Chun-Hsiang Chan, Cheng-Yu Shih, Ho-Lin Chen
On the Computational Power of Phosphate Transfer Reaction Networks. New Gener. Comput. 40(2): 603-621 (2022) - [j13]Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama, Chung-Shou Liao:
Tight competitive analyses of online car-sharing problems. Theor. Comput. Sci. 938: 86-96 (2022) - 2021
- [j12]Chia-Hao Chiu, Yun-Cheng Tsai
Long text to image converter for financial reports. Int. J. Data Min. Model. Manag. 13(3): 211-230 (2021) - [c30]Sheng-Yen Ko, Ho-Lin Chen, Siu-Wing Cheng, Wing-Kai Hon, Chung-Shou Liao:
General Max-Min Fair Allocation. COCOON 2021: 63-75 - [c29]Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama:
Tight Competitive Analyses of Online Car-Sharing Problems. ISAAC 2021: 50:1-50:14 - [c28]Janna Burman, Ho-Lin Chen, Hsueh-Ping Chen, David Doty
Time-Optimal Self-Stabilizing Leader Election in Population Protocols. PODC 2021: 33-44 - [i13]Kuan-Yun Lai, Ya-Chun Liang, Ho-Lin Chen, Kazuo Iwama, Chung-Shou Liao:
Randomized Scheduling for the Online Car-sharing Problem. CoRR abs/2103.07367 (2021) - [i12]Ho-Lin Chen, David Doty, David Soloveichik, Wyatt Reeves:
Rate-Independent Computation in Continuous Chemical Reaction Networks. CoRR abs/2107.13681 (2021) - [i11]Bo-Yuan Peng, Adrian Marotzke, Ming-Han Tsai, Bo-Yin Yang, Ho-Lin Chen:
Streamlined NTRU Prime on FPGA. IACR Cryptol. ePrint Arch. 2021: 1444 (2021) - 2020
- [c27]Hsueh-Ping Chen, Ho-Lin Chen:
Self-Stabilizing Leader Election in Regular Graphs. PODC 2020: 210-217
2010 – 2019
- 2019
- [c26]Hsueh-Ping Chen, Ho-Lin Chen:
Self-Stabilizing Leader Election. PODC 2019: 53-59 - [c25]Ho-Lin Chen:
On the Complexity of Self-assembly Tasks. UCNC 2019: 1-4 - [c24]Chun-Ying Hou, Ho-Lin Chen:
An Exponentially Growing Nubot System Without State Changes. UCNC 2019: 122-135 - [i10]Janna Burman, Ho-Lin Chen, Hsueh-Ping Chen, David Doty, Thomas Nowak, Eric E. Severson, Chuan Xu:
Time-Optimal Self-Stabilizing Leader Election in Population Protocols. CoRR abs/1907.06068 (2019) - 2018
- [j11]Yen-Ru Chin, Jui-Ting Tsai, Ho-Lin Chen
A minimal requirement for self-assembly of lines in polylogarithmic time. Nat. Comput. 17(4): 743-757 (2018) - 2017
- [j10]Ho-Lin Chen
Speed faults in computation by chemical reaction networks. Distributed Comput. 30(5): 373-390 (2017) - [j9]Ho-Lin Chen, David Doty
Parallelism and Time in Hierarchical Self-Assembly. SIAM J. Comput. 46(2): 661-709 (2017) - [c23]Yen-Ru Chin, Jui-Ting Tsai, Ho-Lin Chen:
A Minimal Requirement for Self-assembly of Lines in Polylogarithmic Time. DNA 2017: 139-154 - 2016
- [j8]David Doty, Ho-Lin Chen, Ján Manuch, Arash Rafiey, Ladislav Stacho:
Pattern overlap implies runaway growth in hierarchical tile systems. J. Comput. Geom. 7(2): 3-18 (2016) - [c22]Te-Li Wang, Chih-Kuan Yeh, Ho-Lin Chen:
An Improved Tax Scheme for Selfish Routing. ISAAC 2016: 61:1-61:12 - [r1]Ho-Lin Chen:
Robustness in Self-Assembly. Encyclopedia of Algorithms 2016: 1865-1868 - 2015
- [j7]Ho-Lin Chen
Program Size and Temperature in Self-Assembly. Algorithmica 72(3): 884-899 (2015) - [c21]Ho-Lin Chen, David Doty
Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems. SoCG 2015: 360-373 - 2014
- [j6]Ho-Lin Chen
Deterministic function computation with chemical reaction networks. Nat. Comput. 13(4): 517-534 (2014) - [j5]Hongchao Zhou, Ho-Lin Chen
Synthesis of Stochastic Flow Networks. IEEE Trans. Computers 63(5): 1234-1247 (2014) - [c20]Ho-Lin Chen, David Doty, Dhiraj Holden, Chris Thachuk, Damien Woods, Chun-Tao Yang:
Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation. DNA 2014: 20-36 - [c19]Ho-Lin Chen
Rate-independent computation in continuous chemical reaction networks. ITCS 2014: 313-326 - [c18]Ho-Lin Chen, Rachel Cummings, David Doty, David Soloveichik:
Speed Faults in Computation by Chemical Reaction Networks. DISC 2014: 16-30 - [i9]Ho-Lin Chen, David Doty, Dhiraj Holden, Chris Thachuk, Damien Woods, Chun-Tao Yang:
Fast algorithmic self-assembly of simple shapes using random agitation. CoRR abs/1409.4828 (2014) - [i8]Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho:
Pattern overlap implies runaway growth in hierarchical tile systems. CoRR abs/1411.6672 (2014) - 2013
- [c17]Damien Woods, Ho-Lin Chen
Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. ITCS 2013: 353-354 - [c16]Nadine Dabby, Ho-Lin Chen:
Active Self-Assembly of Simple Units Using an Insertion Primitive. SODA 2013: 1526-1536 - [i7]Damien Woods, Ho-Lin Chen, Scott Goodfriend, Nadine Dabby, Erik Winfree, Peng Yin:
Active Self-Assembly of Algorithmic Shapes and Patterns in Polylogarithmic Time. CoRR abs/1301.2626 (2013) - 2012
- [c15]Ho-Lin Chen
Deterministic Function Computation with Chemical Reaction Networks. DNA 2012: 25-42 - [c14]Ho-Lin Chen, David Doty:
Parallelism and time in hierarchical self-assembly. SODA 2012: 1163-1182 - [i6]Ho-Lin Chen, David Doty, David Soloveichik:
Deterministic Function Computation with Chemical Reaction Networks. CoRR abs/1204.4176 (2012) - [i5]Hongchao Zhou, Ho-Lin Chen, Jehoshua Bruck:
Synthesis of Stochastic Flow Networks. CoRR abs/1209.0724 (2012) - [i4]Ho-Lin Chen, Ming-Yang Kao:
Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-Assembly Systems. CoRR abs/1210.5786 (2012) - 2011
- [c13]Ho-Lin Chen
Program Size and Temperature in Self-Assembly. ISAAC 2011: 445-453 - [i3]Ho-Lin Chen, David Doty:
Parallelism and Time in Hierarchical Self-Assembly. CoRR abs/1104.5226 (2011) - 2010
- [j4]Ho-Lin Chen
Designing Network Protocols for Good Equilibria. SIAM J. Comput. 39(5): 1799-1832 (2010) - [c12]Ho-Lin Chen
Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems. DNA 2010: 13-24 - [c11]Hongchao Zhou, Ho-Lin Chen
On the synthesis of stochastic flow networks. ISIT 2010: 1330-1334 - [i2]Ho-Lin Chen, David Doty, Shinnosuke Seki, David Soloveichik:
Parallelism, Program Size, Time, and Temperature in Self-Assembly. CoRR abs/1011.3493 (2010) - [i1]Ho-Lin Chen, David Doty, Shinnosuke Seki, David Soloveichik:
Parallelism, Program Size, Time, and Temperature in Self-Assembly. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j3]Ho-Lin Chen
An O(n5) Algorithm for MFE Prediction of Kissing Hairpins and 4-Chains in Nucleic Acids. J. Comput. Biol. 16(6): 803-815 (2009) - [j2]Ho-Lin Chen
Network Design with Weighted Players. Theory Comput. Syst. 45(2): 302-324 (2009) - [c10]Ho-Lin Chen
On the Impact of Heterogeneity and Back-End Scheduling in Load Balancing Designs. INFOCOM 2009: 2267-2275 - 2008
- [j1]Ho-Lin Chen
The effect of local scheduling in load balancing designs. SIGMETRICS Perform. Evaluation Rev. 36(2): 110-112 (2008) - [c9]Ho-Lin Chen, Ashish Goel, Chris Luhrs:
Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly. SODA 2008: 409-418 - [c8]Ho-Lin Chen, Tim Roughgarden, Gregory Valiant:
Designing networks with good equilibria. SODA 2008: 854-863 - 2007
- [b1]Ho-Lin Chen:
Robust self-assembly. Stanford University, USA, 2007 - 2006
- [c7]Zoë Abrams, Ho-Lin Chen
Kinetically stable task assignment for networks of microservers. IPSN 2006: 93-101 - [c6]Ho-Lin Chen, Tim Roughgarden:
Network design with weighted players. SPAA 2006: 29-38 - 2004
- [c5]Ho-Lin Chen, Ashish Goel:
Error Free Self-assembly Using Error Prone Tiles. DNA 2004: 62-75 - [c4]Ho-Lin Chen, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, Pablo Moisset de Espanés:
Invadable self-assembly: combining robustness with efficiency. SODA 2004: 890-899 - 2002
- [c3]Ho-Lin Chen, Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen:
Some Applications of Orderly Spanning Trees in Graph Drawing. GD 2002: 332-343 - 2000
- [c2]Ho-Lin Chen, Hsueh-I Lu, Hsu-Chun Yen:
On Maximum Symmetric Subgraphs. GD 2000: 372-383
1990 – 1999
- 1999
- [c1]Ho-Lin Chen, Hsu-Chun Yen:
Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations. GD 1999: 416-417
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 19:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: