Yican Sun

Orcid: 0000-0002-0370-1676

According to our database1, Yican Sun authored at least 15 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH.
Electron. Colloquium Comput. Complex., 2024

Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

ASAC: A Benchmark for Algorithm Synthesis.
Proceedings of the Companion Proceedings of the 32nd ACM International Conference on the Foundations of Software Engineering, 2024

Proving Functional Program Equivalence via Directed Lemma Synthesis.
Proceedings of the Formal Methods - 26th International Symposium, 2024

2023
Synthesizing Efficient Memoization Algorithms.
Proc. ACM Program. Lang., October, 2023

Parameterized Inapproximability Hypothesis under ETH.
Electron. Colloquium Comput. Complex., 2023

Constant Approximating Parameterized <i>k</i>-SETCOVER is W[2]-hard.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Improved Hardness of Approximating k-Clique under ETH.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Automated Tail Bound Analysis for Probabilistic Recurrence Relations.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
Constant Approximating Parameterized k-SetCover is W[2]-hard.
CoRR, 2022

On Lower Bounds of Approximating Parameterized k-Clique.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Quantitative analysis of assertion violations in probabilistic programs.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

2020
Guiding dynamic programing via structural probability for accelerating programming by example.
Proc. ACM Program. Lang., 2020

Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations.
CoRR, 2020

TreeGen: A Tree-Based Transformer Architecture for Code Generation.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020


  Loading...