research
∙
05/03/2022
Approximate Selection with Unreliable Comparisons in Optimal Expected Time
Given n elements, an integer k and a parameter ε, we study to select an ...
share
research
∙
02/14/2022
Fast algorithm for overcomplete order-3 tensor decomposition
We develop the first fast spectral algorithm to decompose a random third...
research
∙
11/04/2021
Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers
We develop machinery to design efficiently computable and consistent est...
research
∙
08/25/2020
Simple Topological Drawings of k-Planar Graphs
Every finite graph admits a simple (topological) drawing, that is, a dra...
research
∙
05/05/2018
On k Nearest Neighbor Queries in the Plane for General Distance Functions
We study k nearest neighbor queries in the plane for general (convex, pa...
research
∙
05/05/2018
A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons
We consider the approximate minimum selection problem in presence of ind...
research
∙
04/20/2018
Optimal Sorting with Persistent Comparison Errors
We consider the problem of sorting n elements in the case of persistent ...
research
∙
03/09/2018
