6 citations · 7 across the 2 of their papers we have counts for
8 papers
Approximate Selection with Unreliable Comparisons in Optimal Expected Time
Shengyu Huang, Chih-Hung Liu, Daniel Rutschman
Given elements, an integer and a parameter , we study to select an element with rank in using unreliable comparisons where th…
Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers
Tommaso d'Orsi, Chih-Hung Liu, Rajai Nasser +3
We develop machinery to design efficiently computable and consistent estimators, achieving estimation error approaching zero as the number of observations grows, when facing an obl…
Simple Topological Drawings of -Planar Graphs
Michael Hoffmann, Chih-Hung Liu, Meghana M. Reddy +1
Every finite graph admits a \emph{simple (topological) drawing}, that is, a drawing where every pair of edges intersects in at most one point. However, in combination with other re…
Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
Chih-Hung Liu
We study the k nearest neighbors problem in the plane for general, convex, pairwise disjoint sites of constant description complexity such as line segments, disks, and quadrilatera…
Approximate Minimum Selection with Unreliable Comparisons in Optimal Expected Time
Stefano Leucci, Chih-Hung Liu
We consider the \emph{approximate minimum selection} problem in presence of \emph{independent random comparison faults}. This problem asks to select one of the smallest element…
Optimal Sorting with Persistent Comparison Errors
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu +1
We consider the problem of sorting elements in the case of \emph{persistent} comparison errors. In this model (Braverman and Mossel, SODA'08), each comparison between two eleme…