Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChih-Hung Liu 0001
Person information
- affiliation: ETH Zürich, Switzerland
- affiliation (former): Academia Sinica, Taipei, Taiwan
- affiliation (former): University of Bonn, Department of Computer Science, Germany
- affiliation (PhD 2009): National Taiwan University, Graduate Institute of Electronics Engineering, Taipei, Taiwan
Other persons with the same name
- Chih-Hung Liu 0002 — National Pingtung University of Science and Technology, Department of Management Information Systems, Taiwan
- Chih-Hung Liu 0003 — National Chiayi University, Department of Foreign Languages, Taiwan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Hongjie Chen, Jingqiu Ding, Tommaso d'Orsi, Yiding Hua, Chih-Hung Liu, David Steurer:
Private graphon estimation via sum-of-squares. CoRR abs/2403.12213 (2024)- 2023
- [c25]Shengyu Huang, Chih-Hung Liu, Daniel Rutschmann:
Approximate Selection with Unreliable Comparisons in Optimal Expected Time. STACS 2023: 37:1-37:23 - 2022
- [j15]Stefano Leucci, Chih-Hung Liu
:
Approximate Minimum Selection with Unreliable Comparisons. Algorithmica 84(1): 60-84 (2022) - [j14]Chih-Hung Liu:
Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions. SIAM J. Comput. 51(3): 723-765 (2022) - [c24]Jingqiu Ding, Tommaso d'Orsi, Chih-Hung Liu, David Steurer, Stefan Tiegel:
Fast algorithm for overcomplete order-3 tensor decomposition. COLT 2022: 3741-3799 - [i10]Jingqiu Ding, Tommaso d'Orsi, Chih-Hung Liu, Stefan Tiegel, David Steurer:
Fast algorithm for overcomplete order-3 tensor decomposition. CoRR abs/2202.06442 (2022) - [i9]Shengyu Huang, Chih-Hung Liu, Daniel Rutschmann:
Approximate Selection with Unreliable Comparisons in Optimal Expected Time. CoRR abs/2205.01448 (2022) - 2021
- [b1]Chih-Hung Liu:
Proximity in the plane for general distance functions. Karlsruhe University, Germany, 2021 - [c23]Tommaso d'Orsi, Chih-Hung Liu, Rajai Nasser, Gleb Novikov, David Steurer, Stefan Tiegel:
Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers. NeurIPS 2021: 25427-25438 - [i8]Tommaso d'Orsi, Chih-Hung Liu, Rajai Nasser, Gleb Novikov, David Steurer, Stefan Tiegel:
Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers. CoRR abs/2111.02966 (2021) - 2020
- [j13]Chih-Hung Liu:
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon. Algorithmica 82(4): 915-937 (2020) - [j12]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Dislocation with Persistent Errors in Subquadratic Time. Theory Comput. Syst. 64(3): 508-521 (2020) - [c22]Michael Hoffmann, Chih-Hung Liu, Meghana M. Reddy, Csaba D. Tóth:
Simple Topological Drawings of k-Planar Graphs. GD 2020: 390-402 - [c21]Chih-Hung Liu:
Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions. SODA 2020: 2842-2859 - [i7]Michael Hoffmann, Chih-Hung Liu, Meghana M. Reddy, Csaba D. Tóth:
Simple Topological Drawings of k-Planar Graphs. CoRR abs/2008.10794 (2020)
2010 – 2019
- 2019
- [j11]Cecilia Bohler, Rolf Klein, Chih-Hung Liu:
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams. Algorithmica 81(6): 2317-2345 (2019) - [c20]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Sorting with Persistent Comparison Errors. ESA 2019: 49:1-49:14 - [c19]Stefano Leucci, Chih-Hung Liu, Simon Meierhans:
Resilient Dictionaries for Randomly Unreliable Memory. ESA 2019: 70:1-70:16 - [c18]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti:
Dual-Mode Greedy Algorithms Can Save Energy. ISAAC 2019: 64:1-64:18 - 2018
- [j10]Chih-Hung Liu, Sandro Montanari:
Minimizing the Diameter of a Spanning Tree for Imprecise Points. Algorithmica 80(2): 801-826 (2018) - [j9]Cecilia Bohler, Rolf Klein, Andrzej Lingas, Chih-Hung Liu:
Forest-like abstract Voronoi diagrams in linear time. Comput. Geom. 68: 134-145 (2018) - [c17]Chih-Hung Liu:
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon. SoCG 2018: 58:1-58:14 - [c16]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Dislocation with Persistent Errors in Subquadratic Time. STACS 2018: 36:1-36:13 - [i6]Chih-Hung Liu:
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram in a Simple Polygon. CoRR abs/1803.03526 (2018) - [i5]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Sorting with Persistent Comparison Errors. CoRR abs/1804.07575 (2018) - [i4]Stefano Leucci, Chih-Hung Liu:
A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons. CoRR abs/1805.02033 (2018) - [i3]Chih-Hung Liu:
On k Nearest Neighbor Queries in the Plane for General Distance Functions. CoRR abs/1805.02066 (2018) - 2017
- [j8]Cecilia Bohler, Rolf Klein, Chih-Hung Liu:
Abstract Voronoi Diagrams from Closed Bisecting Curves. Int. J. Comput. Geom. Appl. 27(3): 221-240 (2017) - [c15]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Sorting with Recurrent Comparison Errors. ISAAC 2017: 38:1-38:12 - [i2]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Sorting with Recurrent Comparison Errors. CoRR abs/1709.07249 (2017) - 2016
- [j7]Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi:
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams. Comput. Geom. 59: 26-38 (2016) - [c14]Cecilia Bohler, Rolf Klein, Chih-Hung Liu:
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams. SoCG 2016: 21:1-21:15 - 2015
- [j6]Chih-Hung Liu, Evanthia Papadopoulou, Der-Tsai Lee:
The k-Nearest-Neighbor Voronoi Diagram Revisited. Algorithmica 71(2): 429-449 (2015) - [j5]Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi:
On the complexity of higher order abstract Voronoi diagrams. Comput. Geom. 48(8): 539-551 (2015) - [c13]Chih-Hung Liu, Sandro Montanari:
Minimizing the Diameter of a Spanning Tree for Imprecise Points. ISAAC 2015: 381-392 - 2014
- [j4]Chih-Hung Liu, Chun-Xun Lin, I-Che Chen, D. T. Lee, Ting-Chi Wang:
Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(12): 1928-1941 (2014) - [c12]Cecilia Bohler, Rolf Klein, Chih-Hung Liu:
Forest-Like Abstract Voronoi Diagrams in Linear Time. CCCG 2014 - [c11]Chun-Xun Lin, Chih-Hung Liu, I-Che Chen, D. T. Lee, Tsung-Yi Ho:
An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips. DAC 2014: 141:1-141:6 - [c10]Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi:
A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams. ISAAC 2014: 27-37 - 2013
- [c9]Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi:
On the Complexity of Higher Order Abstract Voronoi Diagrams. ICALP (1) 2013: 208-219 - [c8]Chih-Hung Liu, D. T. Lee:
Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes. SODA 2013: 1633-1645 - 2012
- [j3]Chih-Hung Liu, Sy-Yen Kuo, D. T. Lee, Chun-Syun Lin, Jung-Hung Weng, Shih-Yi Yuan:
Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 31(7): 1050-1060 (2012) - [c7]Chih-Hung Liu, I-Che Chen, D. T. Lee:
An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction. DAC 2012: 613-622 - [c6]Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner:
Higher Order City Voronoi Diagrams. SWAT 2012: 59-70 - [i1]Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner:
Higher Order City Voronoi Diagrams. CoRR abs/1204.4374 (2012) - 2011
- [c5]Chih-Hung Liu, Evanthia Papadopoulou, D. T. Lee:
An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram. ESA 2011: 70-81
2000 – 2009
- 2009
- [j2]Chih-Hung Liu, Shih-Yi Yuan, Sy-Yen Kuo, Szu-Chi Wang:
High-performance obstacle-avoiding rectilinear steiner tree construction. ACM Trans. Design Autom. Electr. Syst. 14(3): 45:1-45:29 (2009) - [c4]Chih-Hung Liu, Shih-Yi Yuan, Sy-Yen Kuo, Yao-Hsin Chou:
An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction. DAC 2009: 314-319 - [c3]Chih-Hung Liu, Shih-Yi Yuan, Sy-Yen Kuo, Jung-Hung Weng:
Obstacle-avoiding rectilinear Steiner tree construction based on Steiner point selection. ICCAD 2009: 26-32 - 2008
- [j1]Chih-Hung Liu, Hung-Yi Liu, Chung-Wei Lin, Szu-Jui Chou, Yao-Wen Chang, Sy-Yen Kuo, Shih-Yi Yuan, Yu-Wei Chen:
An Efficient Graph-Based Algorithm for ESD Current Path Analysis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(8): 1363-1375 (2008) - [c2]Chih-Hung Liu, Yao-Hsin Chou, Shih-Yi Yuan, Sy-Yen Kuo:
Efficient multilayer routing based on obstacle-avoiding preferred direction steiner tree. ISPD 2008: 118-125 - 2006
- [c1]Hung-Yi Liu, Chung-Wei Lin, Szu-Jui Chou, Wei-Ting Tu, Chih-Hung Liu, Yao-Wen Chang, Sy-Yen Kuo:
Current path analysis for electrostatic discharge protection. ICCAD 2006: 510-515
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-04-25 02:16 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:
