Jun-Ting Hsieh

Available identifiers

Publication	Date of Publication	Type
New SDP roundings and certifiable approximation for cubic optimization	2024-11-28	Paper
Approximating max-cut on bounded degree graphs: tighter analysis of the FKL algorithm	2024-11-14	Paper
Ellipsoid fitting up to a constant	2024-11-14	Paper
Algorithmic thresholds for refuting random polynomial systems	2024-07-19	Paper
Certifying solution geometry in random CSPs: counts, clusters and balance	2024-07-05	Paper
Ellipsoid Fitting Up to a Constant	2023-07-12	Paper
A simple and sharper proof of the hypergraph Moore bound	2022-07-21	Paper
Explicit two-sided unique-neighbor expanders	N/A	Paper
Learning Neural PDE Solvers with Convergence Guarantees	N/A	Paper
Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs	N/A	Paper
Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the $\sqrt{n}$ Dimension Threshold	N/A	Paper

This page was built for person: Jun-Ting Hsieh