default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJun-Ting Hsieh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c16]Sitan Chen, Jaume de Dios Pont, Jun-Ting Hsieh, Hsin-Yuan Huang, Jane Lange, Jerry Li:
Predicting quantum channels over general product distributions. COLT 2025: 986-1007- [c15]Mitali Bafna
, Jun-Ting Hsieh, Pravesh K. Kothari:
Rounding Large Independent Sets on Expanders. STOC 2025: 631-642 - [c14]Jun-Ting Hsieh, Ting-Chun Lin, Sidhanth Mohanty, Ryan O'Donnell, Rachel Yun Zhang:
Explicit Two-Sided Vertex Expanders beyond the Spectral Barrier. STOC 2025: 833-842 - [i25]Jun-Ting Hsieh, Alexander Lubotzky, Sidhanth Mohanty, Assaf Reiner, Rachel Yun Zhang:
Explicit Lossless Vertex Expanders. CoRR abs/2504.15087 (2025) - [i24]Rares-Darius Buhai, Jun-Ting Hsieh, Aayush Jain, Pravesh K. Kothari:
The Quasi-Polynomial Low-Degree Conjecture is False. CoRR abs/2505.17360 (2025) - [i23]Arpon Basu, Jun-Ting Hsieh, Andrew D. Lin, Peter Manohar:
Solving Random Planted CSPs below the nk/2} Threshold. CoRR abs/2507.10833 (2025) - [i22]Jun-Ting Hsieh:
Coloring 3-Colorable Graphs with Low Threshold Rank. CoRR abs/2508.03093 (2025) - [i21]Jun-Ting Hsieh, Daniel Z. Lee, Sidhanth Mohanty, Aaron Putterman, Rachel Yun Zhang:
Sparsifying Cayley Graphs on Every Group. CoRR abs/2508.08078 (2025) - 2024
- [c13]Venkatesan Guruswami, Jun-Ting Hsieh, Prasad Raghavendra:
Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the √n Dimension Threshold. FOCS 2024: 930-948 - [c12]Jun-Ting Hsieh, Pravesh K. Kothari, Lucas Pesenti, Luca Trevisan:
New SDP Roundings and Certifiable Approximation for Cubic Optimization. SODA 2024: 2337-2362 - [c11]Jun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, Pedro Paredes:
Explicit Two-Sided Unique-Neighbor Expanders. STOC 2024: 788-799 - [i20]Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty, David Munhá Correia, Benny Sudakov:
Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs. CoRR abs/2401.11590 (2024) - [i19]Venkatesan Guruswami, Jun-Ting Hsieh, Prasad Raghavendra:
Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the √n Dimension Threshold. CoRR abs/2405.05373 (2024) - [i18]Mitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari:
Rounding Large Independent Sets on Expanders. CoRR abs/2405.10238 (2024) - [i17]Sitan Chen, Jaume de Dios Pont, Jun-Ting Hsieh, Hsin-Yuan Huang, Jane Lange, Jerry Li:
Predicting quantum channels over general product distributions. CoRR abs/2409.03684 (2024) - [i16]Jun-Ting Hsieh, Ting-Chun Lin, Sidhanth Mohanty, Ryan O'Donnell, Rachel Yun Zhang:
Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier. CoRR abs/2411.11627 (2024) - [i15]Arpon Basu, Jun-Ting Hsieh, Pravesh K. Kothari, Andrew D. Lin:
Improved Lower Bounds for all Odd-Query Locally Decodable Codes. CoRR abs/2411.14361 (2024) - [i14]Arpon Basu, Jun-Ting Hsieh, Pravesh Kothari, Andrew D. Lin:
Improved Lower Bounds for all Odd-Query Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c10]Venkatesan Guruswami, Jun-Ting Hsieh, Pravesh K. Kothari, Peter Manohar:
Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold. FOCS 2023: 307-327 - [c9]Jun-Ting Hsieh, Pravesh K. Kothari:
Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm. ICALP 2023: 77:1-77:7 - [c8]Jun-Ting Hsieh, Pravesh K. Kothari, Aaron Potechin, Jeff Xu:
Ellipsoid Fitting up to a Constant. ICALP 2023: 78:1-78:20 - [c7]Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty:
A simple and sharper proof of the hypergraph Moore bound. SODA 2023: 2324-2344 - [i13]Jun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, Pedro Paredes:
Explicit two-sided unique-neighbor expanders. CoRR abs/2302.01212 (2023) - [i12]Jun-Ting Hsieh, Pravesh K. Kothari, Aaron Potechin, Jeff Xu:
Ellipsoid Fitting Up to a Constant. CoRR abs/2307.05954 (2023) - [i11]Venkatesan Guruswami, Jun-Ting Hsieh, Pravesh K. Kothari, Peter Manohar:
Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold. CoRR abs/2309.16897 (2023) - [i10]Jun-Ting Hsieh, Pravesh K. Kothari, Lucas Pesenti, Luca Trevisan:
New SDP Roundings and Certifiable Approximation for Cubic Optimization. CoRR abs/2310.00393 (2023) - 2022
- [c6]Jun-Ting Hsieh, Sidhanth Mohanty, Jeff Xu:
Certifying Solution Geometry in Random CSPs: Counts, Clusters and Balance. CCC 2022: 11:1-11:18 - [c5]Mitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari, Jeff Xu:
Polynomial-Time Power-Sum Decomposition of Polynomials. FOCS 2022: 956-967 - [c4]Jun-Ting Hsieh, Pravesh K. Kothari:
Algorithmic Thresholds for Refuting Random Polynomial Systems. SODA 2022: 1154-1203 - [i9]Jun-Ting Hsieh, Pravesh K. Kothari:
Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm. CoRR abs/2206.09204 (2022) - [i8]Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty:
A simple and sharper proof of the hypergraph Moore bound. CoRR abs/2207.10850 (2022) - [i7]Mitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari, Jeff Xu:
Polynomial-Time Power-Sum Decomposition of Polynomials. CoRR abs/2208.00122 (2022) - 2021
- [i6]Jun-Ting Hsieh, Sidhanth Mohanty, Jeff Xu:
Certifying solution geometry in random CSPs: counts, clusters and balance. CoRR abs/2106.12710 (2021) - [i5]Jun-Ting Hsieh, Pravesh K. Kothari:
Algorithmic Thresholds for Refuting Random Polynomial Systems. CoRR abs/2110.08677 (2021)
2010 – 2019
- 2019
- [c3]Jun-Ting Hsieh, Shengjia Zhao, Stephan Eismann, Lucia Mirabella, Stefano Ermon:
Learning Neural PDE Solvers with Convergence Guarantees. ICLR (Poster) 2019 - [i4]Jun-Ting Hsieh, Shengjia Zhao, Stephan Eismann, Lucia Mirabella, Stefano Ermon:
Learning Neural PDE Solvers with Convergence Guarantees. CoRR abs/1906.01200 (2019) - 2018
- [c2]Zelun Luo, Jun-Ting Hsieh, Lu Jiang, Juan Carlos Niebles, Li Fei-Fei:
Graph Distillation for Action Detection with Privileged Modalities. ECCV (14) 2018: 174-192 - [c1]Jun-Ting Hsieh, Bingbin Liu, De-An Huang, Li Fei-Fei, Juan Carlos Niebles:
Learning to Decompose and Disentangle Representations for Video Prediction. NeurIPS 2018: 515-524 - [i3]Jun-Ting Hsieh, Bingbin Liu, De-An Huang, Li Fei-Fei, Juan Carlos Niebles:
Learning to Decompose and Disentangle Representations for Video Prediction. CoRR abs/1806.04166 (2018) - [i2]David Xue, Anin Sayana, Evan Darke, Kelly Shen, Jun-Ting Hsieh, Zelun Luo, Li-Jia Li, N. Lance Downing, Arnold Milstein, Li Fei-Fei:
Vision-Based Gait Analysis for Senior Care. CoRR abs/1812.00169 (2018) - 2017
- [i1]Zelun Luo, Lu Jiang, Jun-Ting Hsieh, Juan Carlos Niebles, Li Fei-Fei:
Graph Distillation for Action Detection with Privileged Information. CoRR abs/1712.00108 (2017)
Coauthor Index
aka: Pravesh K. Kothari
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 2025-11-04 00:47 CET 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:
