陳和麟 Chen, Ho-Lin
- Professor, Department of Electrical Engineering, National Taiwan University
- Ph.D. Stanford University (CS), 2007
- B.S. National Taiwan University (EE & Math), 2000
Major Research Areas
Research Summary
-- Molecular Computing
Many biological functions are controlled by complex molecular circuits. I am interested in understanding (1) how molecules can process information, carry out computation and perform various actions and (2) how to design and implement accurate and robust molecular circuits.
-- Algorithmic Game Theory
Algorithmic game theory is an area in the intersection of game theory and algorithm design, whose objective is to design algorithms in strategic environments. My research focus on (1) analyzing the efficiency of previously implemented systems with game theory notions, such as Price of Anarchy and (2) designing systems with better efficiency in strategic environments.
Ho-Lin Chen is an associate professor in the Department of Electrical Engineering at National Taiwan University. He received a B.S. in Electrical Engineering and Mathematics from National Taiwan University in 2000, and a Ph.D. in Computer Science from Stanford University in 2007. He was a postdoctoral researcher in Center for the Mathematics of Information at California Institute of Technology from 2007 to 2011. He was an assistant professor in National Taiwan University from 2011 to 2016. His research interests are algorithms with applications to molecular computation and algorithmic game theory..
Journal articles & book chapters
1. 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 , Vol. 86 , 485-504, Feb. 2024
2. Bo-Yuan Peng, Adrian Marotzke, Ming-Han Tsai, Bo-Yin Yang*, Ho-Lin Chen, “Streamlined NTRU Prime on FPGA” , Journal of Cryptographic Engineering , Vol. 13 , 167-186, Jun. 2023
3. Nadine Dabby, Alan Barr, Ho-Lin Chen, “Molecular System for an Exponentially Fast Growing Programmable Synthetic Polymer” , Scientific Reports , Vol. 13 , 11295-, Jul. 2023
4. Ho-Lin Chen, David Doty, Wyatt Reeves, David Soloveichik, “Rate independent Computation in Continuous Chemical Reaction Networks” , Journal of the ACM , Vol. 70(3) , 22:1-22:61, Jun. 2023
5. Chun-Hsiang Chan, Cheng-Yu Shih, Ho-Lin Chen, “On the Computational Power of Phosphate Transfer Reaction Networks” , New Generation Computing , Vol. 40(2) , 603-621, 2022
6. Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama, Chung-Shou Liao, “Tight competitive analyses of online car-sharing problems” , Theoretical Computer Science , Vol. 938 , 86-96, Nov. 2022
7. Yen-Ru Chin, Jui-Ting Tsai, Ho-Lin Chen, “A Minimal Requirement for Self-Assembly of Lines in Polylogarithmic Time” , Natural Computing , Vol. 17(4) , 743-757, Dec. 2018
8. Ho-Lin Chen and David Doty, “Parallelism and Time in Hierarchical Self-Assembly” , SIAM Journal on Computing , Vol. 46-2 , 661-709-, Mar. 2017
9. H.-L. Chen, R. Cummings, D. Doty, D. Soloveichik, “Speed faults in computation by chemical reaction networks” , Distributed Computing , Vol. 30(5) , 373-390, 2017
10. D. Doty, H.-L. Chen, J. Manuch, A. Rafiey, L. Stacho, “Pattern overlap implies runaway growth in hierarchical tile systems” , Journal on Computational Geometry , Vol. 7(2) , 3-18, 2016
11. H. Zhou, H. Chen and J. Bruck, “Synthesis of Stochastic Flow Networks” , IEEE Transactions on Computers , Vol. 63(5) , 1234-1247-, May 2014
12. H.-L. Chen, D. Doty, and D. Soloveichik., “ Deterministic Function Computation with Chemical Reaction Networks” , Natural Computing , Vol. 13(4) , 517-534-, Dec. 2014
13. H.-L. Chen, D. Doty, S. Seki, “Program Size and Temperature in Self-Assembly” , Algorithmica , Jan. 2014
14. H.-L. Chen, T. Roughgarden and G. Valiant, “Designing network protocols for good equilibria” , SIAM Journal on Computing , Vol. 39(5) , 1799-1832-, Jan. 2010
15. H.L. Chen and T. Roughgarden, “Network design with weighted players” , Theory of Computing Systems , Vol. 45 (2) , 302-324-, Aug. 2009
16. H.-L. Chen, H. Jabbari and A. Condon, “An O(n^5) Algorithm for MFE Prediction of Kissing Hairpins and 4-Chains in Nucleic Acids” , Journal of Computational Biology , Vol. 16 (6) , 803-815-, Jun. 2009
17. H.-L. Chen, R. Schulman, A. Goel and E. Winfree, “Reducing Facet Nucleation during Algorithmic Self-Assembly” , Nano Letters , Vol. 7 (9) , 2913-2919-, Sep. 2007
18. Z. Abrams, H.-L. Chen, L. Guibas, J. Liu, and F. Zhao, “Kinetically Stable Task Assignment for Networks of Microservers” , IEEE Information Processing for Sensor Networks , Jan. 2006
Conference & proceeding papers:
1. Y.-X. Lee and H.-L. Chen*, “On the Simulation Power of Surface Chemical Reaction Networks” , International Conference on Unconventional Computation and Natural Computation , Pohang, Republic of Korea , Jun. 2024
2. Y.-X. Lee and H.-L. Chen*, “Simulation Power of Freezing Surface Chemical Reaction Networks” , The 30th International Conference on DNA Computing and Molecular Programming (DNA30) , Baltimore, USA , Sep. 2024
3. J. Burman, H.-L. Chen, H.-P. Chen, D. Doty, T. Nowak, E. Serverson, C. Xu, “Time-Optimal Self-Stabilizing Leader Election in Population Protocols” , ACM Symposium on Principles of Distributed Computing (PODC) , Online , Aug. 2021
4. Y.-C. Liang, K.-Y. Lai, H.-L. Chen, K. Iwama, “Tight Competitive Analyses of Online Car-Sharing Problems” , The 32nd International Symposium on Algorithms and Computation (ISAAC) , Online and Fukuoka, Japan , Dec. 2021
5. S.-Y. Ko, H.-L. Chen, S.-W. Cheng*, W.-K. Hon, C.-S. Liao, “General Max-Min Fair Allocation” , The 27th International Computing and Combinatorics Conference (COCOON) , Online and Tainan, Taiwan , Oct. 2021
6. H.-P. Chen and H.-L. Chen*, “Self-Stabilizing Leader Election in Regular Graphs” , ACM Symposium on Principles of Distributed Computing (PODC) (PODC) , Online , Aug. 2020
7. C.-Y. Hou and H.-L. Chen*, “An Exponentially Growing Nubot System Without State Changes” , Unconventional Computation and Natural Computation , Tokyo, Japan , Jun. 2019
8. H.-P. Chen and H.-L. Chen*, “Self-Stabilizing Leader Election” , ACM Symposium on Principles of Distributed Computing (PODC) , Toronto, Canada , Aug. 2019
9. Y.-R. Chin, J.-T. Tsai, H.-L. Chen*, “A Minimal Requirement for Self-assembly of Lines in Polylogarithmic Time” , 23rd International Meeting on DNA Computing and Molecular Programming , Austin, Texas, USA , 2017
10. T.-L. Wang, C.-K. Yeh, H.-L. Chen*, “An Improved Tax Scheme for Selfish Routing” , International Symposium on Algorithms and Computation (ISAAC) , Sydney, Australia , 2016
11. H.-L. Chen, D. Doty, J. Maňuch, A. Rafiey, and L. Stacho, “Pattern overlap implies runaway growth in hierarchical tile systems” , 31st International Symposium on Computational Geometry , Eindhoven, the Netherlands , May 2015
12. H.-L. Chen, R. Cummings, D. Doty, and D. Soloveichik, “Speed faults in computation by chemical reaction networks” , 28th International Symposium on Distributed Computing (Best paper award) , Oct. 2014
13. H.-L. Chen, D. Doty, D. Holden, C. Thachuk, D. Woods, and C.-T. Yang, “Fast algorithmic self-assembly of simple shapes using random agitation” , 20th International Meeting on DNA Computing and Molecular Programming , Sep. 2014
14. H.-L. Chen, D. Doty, and D. Soloveichik, “Rate-independent computation in continuous chemical reaction networks” , 5th Innovations in Theoretical Computer Science Conference (ITCS) , Jan. 2014
15. N. Dabby and H.-L. Chen*, “Active Self-Assembly of Simple Units Using an Insertion Primitive” , ACM-SIAM Symposium on Discrete Algorithms , New Orleans, LA, USA , Jan. 2013
16. D. Woods, H.-L. Chen, S. Goodfriend, N. Dabby, E. Winfree, P. Yin, “Active Self-Assembly of Algorithmic Shapes and Patterns in Polylogarithmic Time” , ITCS 2013 , Berkeley, CA, USA , Jan. 2013
17. H.-L. Chen, D. Doty and D. Soloveichik, “Deterministic Function Computation with Chemical Reaction Networks” , 18th International Conference on DNA Computing and Molecular Programming , Aarhus, Denmark , Sep. 2012
18. H.-L. Chen and D. Doty, “Parallelism and Time in Hierarchical Self-Assembly” , ACM-SIAM Symposium on Discrete Algorithms , Jan. 2012
19. H.-L. Chen, D. Doty, and S. Seki, “Program Size and Temperature in Self-Assembly” , International Symposium on Algorithms and Computation (ISAAC) , Dec. 2011
20. H.-L. Chen and M.-Y. Kao, “Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-Assembly Systems” , International Conference on DNA Computing , Jan. 2010
21. H. Zhou, H.-L. Chen, and J. Bruck, “On the Synthesis of Stochastic Flow Networks” , IEEE International Symposium on Information Theory , Jan. 2010
22. H.-L. Chen, J. Marden and A. Wierman, “On the Impact of Heterogeneity and Back-End Scheduling in Load Balancing Designs” , INFOCOM , Jan. 2009
23. H.-L. Chen, A. De and A. Goel, “Towards Programmable Molecular Machines” , Fifth Annual Conference on Foundations of Nanoscience , Jan. 2008
24. H.-L. Chen, T. Roughgarden and G. Valiant, “Design Networks with Good Equilibria” , ACM-SIAM Symposium on Discrete Algorithms , Jan. 2008
25. H.-L. Chen, A. Goel and C. Luhrs, “Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly” , ACM-SIAM Symposium on Discrete Algorithms , Jan. 2008
26. H.-L. Chen, A. Goel, C. Luhrs and E. Winfree, “Self-Assembling Tile Systems that Heal from Small Fragments” , Thirteenth International Meeting on DNA Computing , Jan. 2007
27. H.-L. Chen and T. Roughgarden, “Network Design with Weighted Players” , Eighteenth ACM Symposium on Parallelism in Algorithms and Architectures , Jan. 2006
28. H.-L. Chen, A. Goel, R. Schulman and E. Winfree, “Error Correction for DNA Self-Assembly: Preventing Facet Nucleation” , Eleventh International Meeting on DNA Computing , Jan. 2005
29. H.-L. Chen and A. Goel, “Error Free Self-Assembly Using Error Prone Tiles” , Tenth International Meeting on DNA Computing , Jan. 2004
30. Z. Abrams and H.-L. Chen, “The Simplified Partial Digest Problem: Hardness and a Probabilistic Analysis” , Fourth Annual RECOMB Satellite Meeting on DNA Sequencing Technologies and Computation , Jan. 2004
31. H.-L. Chen, Q. Cheng, A. Goel, M. Huang and P. Moisset de Espanés, “Invadable Self-Assembly: Combining Robustness with Efficiency” , Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , Jan. 2004
32. H.-L. Chen, H.-I. Lu and H.-C. Yen, “On Maximum Symmetric Subgraphs” , 8th International Symposium on Graph Drawing , Jan. 2000
33. H.-L. Chen and H.-C. Yen, “Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations” , 7th International Symposium on Graph Drawing , Jan. 1999