<?xml version="1.0"?>
<dblpperson name="Lung-Tien Liu" pid="01/387" n="20">
<person key="homepages/01/387" mdate="2009-06-09">
<author pid="01/387">Lung-Tien Liu</author>
</person>
<r><inproceedings key="conf/ispd/YaoCCCLS05" mdate="2025-01-29">
<author pid="20/6738-4">Bo Yao 0004</author>
<author pid="28/3046-1">Hongyu Chen 0001</author>
<author pid="c/ChungKuanCheng">Chung-Kuan Cheng</author>
<author pid="30/1790">Nan-Chi Chou</author>
<author pid="01/387">Lung-Tien Liu</author>
<author pid="s/PeterSuaris">Peter Suaris</author>
<title>Unified quadratic programming approach for mixed mode placement.</title>
<pages>193-199</pages>
<year>2005</year>
<crossref>conf/ispd/2005</crossref>
<booktitle>ISPD</booktitle>
<ee>https://doi.org/10.1145/1055137.1055178</ee>
<url>db/conf/ispd/ispd2005.html#YaoCCCLS05</url>
</inproceedings>
</r>
<r><article key="journals/tcbb/RaphaelLV04" mdate="2023-04-03">
<author pid="23/3243">Benjamin J. Raphael</author>
<author pid="01/387">Lung-Tien Liu</author>
<author pid="v/GeorgeVarghese">George Varghese</author>
<title>A Uniform Projection Method for Motif Discovery in DNA Sequences.</title>
<pages>91-94</pages>
<year>2004</year>
<volume>1</volume>
<journal>IEEE ACM Trans. Comput. Biol. Bioinform.</journal>
<number>2</number>
<ee>https://doi.org/10.1109/TCBB.2004.14</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/TCBB.2004.14</ee>
<ee>https://dl.acm.org/doi/10.1109/TCBB.2004.14</ee>
<ee>https://www.wikidata.org/entity/Q46688193</ee>
<url>db/journals/tcbb/tcbb1.html#RaphaelLV04</url>
</article>
</r>
<r><inproceedings key="conf/fpga/SuarisLDC04" mdate="2018-11-06">
<author pid="s/PeterSuaris">Peter Suaris</author>
<author pid="01/387">Lung-Tien Liu</author>
<author pid="24/4591">Yuzheng Ding</author>
<author pid="30/1790">Nan-Chi Chou</author>
<title>Incremental physical resynthesis for timing optimization.</title>
<pages>99-108</pages>
<year>2004</year>
<crossref>conf/fpga/2004</crossref>
<booktitle>FPGA</booktitle>
<ee>https://doi.org/10.1145/968280.968296</ee>
<url>db/conf/fpga/fpga2004.html#SuarisLDC04</url>
</inproceedings>
</r>
<r><inproceedings key="conf/dac/LiLLC96" mdate="2018-11-06">
<author pid="71/5930">Jianmin Li</author>
<author pid="94/1334">John Lillis</author>
<author pid="01/387">Lung-Tien Liu</author>
<author pid="c/ChungKuanCheng">Chung-Kuan Cheng</author>
<title>New Spectral Linear Placement and Clustering Approach.</title>
<pages>88-93</pages>
<year>1996</year>
<crossref>conf/dac/1996</crossref>
<booktitle>DAC</booktitle>
<ee>https://doi.org/10.1145/240518.240536</ee>
<url>db/conf/dac/dac96.html#LiLLC96</url>
</inproceedings>
</r>
<r><inproceedings key="conf/dac/KuoLC96" mdate="2018-11-06">
<author pid="71/1813">Ming-Ter Kuo</author>
<author pid="01/387">Lung-Tien Liu</author>
<author pid="c/ChungKuanCheng">Chung-Kuan Cheng</author>
<title>Network Partitioning into Tree Hierarchies.</title>
<pages>477-482</pages>
<year>1996</year>
<crossref>conf/dac/1996</crossref>
<booktitle>DAC</booktitle>
<ee>https://doi.org/10.1145/240518.240609</ee>
<url>db/conf/dac/dac96.html#KuoLC96</url>
</inproceedings>
</r>
<r><article key="journals/tcad/LiuKCH95" mdate="2020-09-24">
<author pid="01/387">Lung-Tien Liu</author>
<author pid="71/1813">Ming-Ter Kuo</author>
<author pid="c/ChungKuanCheng">Chung-Kuan Cheng</author>
<author pid="h/TCHu">T. C. Hu</author>
<title>A replication cut for two-way partitioning.</title>
<pages>623-630</pages>
<year>1995</year>
<volume>14</volume>
<journal>IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.</journal>
<number>5</number>
<ee>https://doi.org/10.1109/43.384426</ee>
<url>db/journals/tcad/tcad14.html#LiuKCH95</url>
</article>
</r>
<r><article key="journals/tcad/ChouLCDL95" mdate="2020-09-24">
<author pid="30/1790">Nan-Chi Chou</author>
<author pid="01/387">Lung-Tien Liu</author>
<author pid="c/ChungKuanCheng">Chung-Kuan Cheng</author>
<author pid="28/3489">Wei-Jin Dai</author>
<author pid="49/5910">Rodney Lindelof</author>
<title>Local ratio cut and set covering partitioning for huge logic emulation systems.</title>
<pages>1085-1092</pages>
<year>1995</year>
<volume>14</volume>
<journal>IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.</journal>
<number>9</number>
<ee>https://doi.org/10.1109/43.406710</ee>
<url>db/journals/tcad/tcad14.html#ChouLCDL95</url>
</article>
</r>
<r><inproceedings key="conf/dac/LiuKCH95" mdate="2017-03-16">
<author pid="01/387">Lung-Tien Liu</author>
<author pid="71/1813">Ming-Ter Kuo</author>
<author pid="c/ChungKuanCheng">Chung-Kuan Cheng</author>
<author pid="h/TCHu">T. C. Hu</author>
<title>Performance-Driven Partitioning Using a Replication Graph Approach.</title>
<pages>206-210</pages>
<year>1995</year>
<crossref>conf/dac/1995</crossref>
<booktitle>DAC</booktitle>
<url>db/conf/dac/dac95.html#LiuKCH95</url>
</inproceedings>
</r>
<r><inproceedings key="conf/iccad/LiuKHC95" mdate="2023-03-24">
<author pid="01/387">Lung-Tien Liu</author>
<author pid="71/1813">Ming-Ter Kuo</author>
<author pid="44/6927">Shih-Chen Huang</author>
<author pid="c/ChungKuanCheng">Chung-Kuan Cheng</author>
<title>A gradient method on the initial partition of Fiduccia-Mattheyses algorithm.</title>
<pages>229-234</pages>
<year>1995</year>
<crossref>conf/iccad/1995</crossref>
<booktitle>ICCAD</booktitle>
<ee>https://doi.org/10.1109/ICCAD.1995.480017</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/ICCAD.1995.480017</ee>
<ee>https://dl.acm.org/citation.cfm?id=224885</ee>
<url>db/conf/iccad/iccad1995.html#LiuKHC95</url>
</inproceedings>
</r>
<r><inproceedings key="conf/iscas/KuoLC95" mdate="2017-05-26">
<author pid="71/1813">Ming-Ter Kuo</author>
<author pid="01/387">Lung-Tien Liu</author>
<author pid="c/ChungKuanCheng">Chung-Kuan Cheng</author>
<title>Finite State Machine Decomposition for I/O Minimization.</title>
<pages>1061-1064</pages>
<year>1995</year>
<crossref>conf/iscas/1995</crossref>
<booktitle>ISCAS</booktitle>
<url>db/conf/iscas/iscas1995-2.html#KuoLC95</url>
<ee>https://doi.org/10.1109/ISCAS.1995.520329</ee>
</inproceedings>
</r>
<r><article key="journals/tvlsi/YehLCHAL94" mdate="2020-03-11">
<author pid="y/ChingweiYeh">Chingwei Yeh</author>
<author pid="01/387">Lung-Tien Liu</author>
<author pid="c/ChungKuanCheng">Chung-Kuan Cheng</author>
<author pid="h/TCHu">T. C. Hu</author>
<author pid="48/3398">S. Ahmed</author>
<author pid="26/3148">M. Liddel</author>
<title>Block-oriented programmable design with switching network interconnect.</title>
<pages>45-53</pages>
<year>1994</year>
<volume>2</volume>
<journal>IEEE Trans. Very Large Scale Integr. Syst.</journal>
<number>1</number>
<ee>https://doi.org/10.1109/92.273149</ee>
<url>db/journals/tvlsi/tvlsi2.html#YehLCHAL94</url>
</article>
</r>
<r><inproceedings key="conf/dac/ChouLCDL94" mdate="2018-11-06">
<author pid="30/1790">Nan-Chi Chou</author>
<author pid="01/387">Lung-Tien Liu</author>
<author pid="c/ChungKuanCheng">Chung-Kuan Cheng</author>
<author pid="28/3489">Wei-Jin Dai</author>
<author pid="49/5910">Rodney Lindelof</author>
<title>Circuit Partitioning for Huge Logic Emulation Systems.</title>
<pages>244-249</pages>
<year>1994</year>
<crossref>conf/dac/1994</crossref>
<booktitle>DAC</booktitle>
<ee>https://doi.org/10.1145/196244.196365</ee>
<url>db/conf/dac/dac94.html#ChouLCDL94</url>
</inproceedings>
</r>
<r><inproceedings key="conf/dac/LiuSC94" mdate="2018-11-06">
<author pid="01/387">Lung-Tien Liu</author>
<author pid="22/119">Minshine Shih</author>
<author pid="c/ChungKuanCheng">Chung-Kuan Cheng</author>
<title>Data Flow Partitioning for Clock Period and Latency Minimization.</title>
<pages>658-663</pages>
<year>1994</year>
<crossref>conf/dac/1994</crossref>
<booktitle>DAC</booktitle>
<ee>https://doi.org/10.1145/196244.196605</ee>
<url>db/conf/dac/dac94.html#LiuSC94</url>
</inproceedings>
</r>
<r><article key="journals/ipl/LiuCL93" mdate="2017-05-26">
<author pid="01/387">Lung-Tien Liu</author>
<author pid="98/6029">Gen-Huey Chen</author>
<author pid="l/KweiJayLin">Kwei-Jay Lin</author>
<title>An Algorithm for Coalescing Operations with Precedence Constraints in Real-Time Systems.</title>
<pages>129-133</pages>
<year>1993</year>
<volume>46</volume>
<journal>Inf. Process. Lett.</journal>
<number>3</number>
<url>db/journals/ipl/ipl46.html#LiuCL93</url>
<ee>https://doi.org/10.1016/0020-0190(93)90058-H</ee>
</article>
</r>
<r><inproceedings key="conf/iccad/LiuSCCK93" mdate="2023-03-24">
<author pid="01/387">Lung-Tien Liu</author>
<author pid="22/119">Minshine Shih</author>
<author pid="30/1790">Nan-Chi Chou</author>
<author pid="c/ChungKuanCheng">Chung-Kuan Cheng</author>
<author pid="05/3756">Walter H. Ku</author>
<title>Performance-driven partitioning using retiming and replication.</title>
<pages>296-299</pages>
<year>1993</year>
<crossref>conf/iccad/1993</crossref>
<booktitle>ICCAD</booktitle>
<ee>https://doi.org/10.1109/ICCAD.1993.580072</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/ICCAD.1993.580072</ee>
<ee>https://dl.acm.org/citation.cfm?id=259844</ee>
<url>db/conf/iccad/iccad1993.html#LiuSCCK93</url>
</inproceedings>
</r>
<r><article key="journals/jc/LiuCL92" mdate="2021-02-16">
<author pid="01/387">Lung-Tien Liu</author>
<author pid="98/6029">Gen-Huey Chen</author>
<author pid="33/5730">Ching-Sung Lu</author>
<title>On the complexity of generating synchronizable test sequences.</title>
<pages>434-450</pages>
<year>1992</year>
<volume>8</volume>
<journal>J. Complex.</journal>
<number>4</number>
<ee type="oa">https://doi.org/10.1016/0885-064X(92)90006-W</ee>
<url>db/journals/jc/jc8.html#LiuCL92</url>
</article>
</r>
<r><article key="journals/bit/LiuCW91" mdate="2021-06-22">
<author pid="01/387">Lung-Tien Liu</author>
<author pid="98/6029">Gen-Huey Chen</author>
<author pid="19/3218">Yue-Li Wang</author>
<title>A Note on Optimal Multiway Split Trees.</title>
<pages>220-229</pages>
<year>1991</year>
<volume>31</volume>
<journal>BIT</journal>
<number>2</number>
<url>db/journals/bit/bit31.html#LiuCW91</url>
<ee>https://doi.org/10.1007/BF01931282</ee>
</article>
</r>
<r><article key="journals/ijcm/ChenL91" mdate="2019-05-15">
<author pid="98/6029">Gen-Huey Chen</author>
<author pid="01/387">Lung-Tien Liu</author>
<title>Optimal multiway generalized split trees.</title>
<pages>39-47</pages>
<year>1991</year>
<volume>41</volume>
<journal>Int. J. Comput. Math.</journal>
<number>1-2</number>
<ee>https://doi.org/10.1080/00207169108804024</ee>
<url>db/journals/ijcm/ijcm41.html#ChenL91</url>
</article>
</r>
<r><article key="journals/ipl/ChenYL88" mdate="2017-05-26">
<author pid="98/6029">Gen-Huey Chen</author>
<author pid="02/1193">M. S. Yu</author>
<author pid="01/387">Lung-Tien Liu</author>
<title>Two Algorithms for Constructing a Binary Tree from its Traversals.</title>
<pages>297-299</pages>
<year>1988</year>
<volume>28</volume>
<journal>Inf. Process. Lett.</journal>
<number>6</number>
<url>db/journals/ipl/ipl28.html#ChenYL88</url>
<ee>https://doi.org/10.1016/0020-0190(88)90177-9</ee>
</article>
</r>
<r><inproceedings key="conf/compsac/ChenYL88" mdate="2017-05-21">
<author pid="98/6029">Gen-Huey Chen</author>
<author pid="02/1193">M. S. Yu</author>
<author pid="01/387">Lung-Tien Liu</author>
<title>Nonrecursive algorithms for reconstructing a binary tree from its traversals.</title>
<pages>490-492</pages>
<year>1988</year>
<booktitle>COMPSAC</booktitle>
<ee>https://doi.org/10.1109/CMPSAC.1988.17225</ee>
<crossref>conf/compsac/1988</crossref>
<url>db/conf/compsac/compsac1988.html#ChenYL88</url>
</inproceedings>
</r>
<coauthors n="25" nc="2">
<co c="0"><na f="a/Ahmed:S=" pid="48/3398">S. Ahmed</na></co>
<co c="0"><na f="c/Chen:Gen=Huey" pid="98/6029">Gen-Huey Chen</na></co>
<co c="0"><na f="c/Chen_0001:Hongyu" pid="28/3046-1">Hongyu Chen 0001</na></co>
<co c="0"><na f="c/Cheng:Chung=Kuan" pid="c/ChungKuanCheng">Chung-Kuan Cheng</na></co>
<co c="0"><na f="c/Chou:Nan=Chi" pid="30/1790">Nan-Chi Chou</na></co>
<co c="0"><na f="d/Dai:Wei=Jin" pid="28/3489">Wei-Jin Dai</na></co>
<co c="0"><na f="d/Ding:Yuzheng" pid="24/4591">Yuzheng Ding</na></co>
<co c="0"><na f="h/Hu:T=_C=" pid="h/TCHu">T. C. Hu</na></co>
<co c="0"><na f="h/Huang:Shih=Chen" pid="44/6927">Shih-Chen Huang</na></co>
<co c="0"><na f="k/Ku:Walter_H=" pid="05/3756">Walter H. Ku</na></co>
<co c="0"><na f="k/Kuo:Ming=Ter" pid="71/1813">Ming-Ter Kuo</na></co>
<co c="0"><na f="l/Li:Jianmin" pid="71/5930">Jianmin Li</na></co>
<co c="0"><na f="l/Liddel:M=" pid="26/3148">M. Liddel</na></co>
<co c="0"><na f="l/Lillis:John" pid="94/1334">John Lillis</na></co>
<co c="0"><na f="l/Lin:Kwei=Jay" pid="l/KweiJayLin">Kwei-Jay Lin</na></co>
<co c="0"><na f="l/Lindelof:Rodney" pid="49/5910">Rodney Lindelof</na></co>
<co c="0"><na f="l/Lu:Ching=Sung" pid="33/5730">Ching-Sung Lu</na></co>
<co c="1"><na f="r/Raphael:Benjamin_J=" pid="23/3243">Benjamin J. Raphael</na></co>
<co c="0"><na f="s/Shih:Minshine" pid="22/119">Minshine Shih</na></co>
<co c="0"><na f="s/Suaris:Peter" pid="s/PeterSuaris">Peter Suaris</na></co>
<co c="1"><na f="v/Varghese:George" pid="v/GeorgeVarghese">George Varghese</na></co>
<co c="0"><na f="w/Wang:Yue=Li" pid="19/3218">Yue-Li Wang</na></co>
<co c="0"><na f="y/Yao_0004:Bo" pid="20/6738-4">Bo Yao 0004</na></co>
<co c="0"><na f="y/Yeh:Chingwei" pid="y/ChingweiYeh">Chingwei Yeh</na></co>
<co c="0"><na f="y/Yu:M=_S=" pid="02/1193">M. S. Yu</na></co>
</coauthors>
</dblpperson>

