Yican Sun
Yican Sun
Home
Publications
Light
Dark
Automatic
Page not found
Perhaps you were looking for one of these?
Latest
Parameterized Inapproximability Hypothesis under ETH
Synthesizing Efficient Memoization Algorithms
Improved Hardness of Approximating k-Clique under ETH
Automated Tail Bound Analysis for Probabilistic Recurrence Relations
Constant Approximating Parameterized k-SetCover is W[2]-hard
On Lower Bounds of Approximating Parameterized k-Clique
Quantitative Analysis of Assertion Violations in Probabilistic Programs
Guiding Dynamic Programing via Structural Probability for Accelerating Programming by Example
TreeGen: A Tree-Based Transformer Architecture for Code Generation
Cite
×