Seguir
Ce Jin
Título
Citado por
Citado por
Ano
Hardness Magnification for all Sparse NP Languages
L Chen, C Jin, R Williams
Symposium on Foundations of Computer Science (FOCS), 2019
392019
An Improved FPTAS for 0-1 Knapsack
C Jin
ICALP 2019, 2019
362019
Near-optimal quantum algorithms for string problems
S Akmal, C Jin
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
292022
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum
C Jin, H Wu
2nd Symposium on Simplicity in Algorithms (SOSA 2019), 2018
272018
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond
M Ghaffari, C Grunau, C Jin
DISC 2020, 2020
262020
Sharp threshold results for computational complexity
L Chen, C Jin, RR Williams
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
232020
Removing Additive Structure in 3SUM-Based Reductions
C Jin, Y Xu
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 405-418, 2023
192023
Fast Modular Subset Sum using Linear Sketching
K Axiotis, A Backurs, C Jin, C Tzamos, H Wu
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
192019
Approximating Knapsack and Partition via Dense Subset Sums
M Deng, C Jin, X Mao
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
182023
A Massively Parallel Algorithm for Minimum Weight Vertex Cover
M Ghaffari, C Jin, D Nilis
SPAA 2020, 2020
162020
Simulating Random Walks on Graphs in the Streaming Model
C Jin
10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2018
152018
Tight dynamic problem lower bounds from generalized bmm and omv
C Jin, Y Xu
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
142022
Fast Low-Space Algorithms for Subset Sum
C Jin, N Vyas, R Williams
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
142021
Fast and Simple Modular Subset Sum∗
K Axiotis, A Backurs, K Bringmann, C Jin, V Nakos, C Tzamos, H Wu
Symposium on Simplicity in Algorithms (SOSA), 57-67, 2021
122021
Faster Algorithms for Bounded Tree Edit Distance
S Akmal, C Jin
ICALP 2021, 2021
102021
0-1 knapsack in nearly quadratic time
C Jin
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 271-282, 2024
92024
Faster Algorithms for All Pairs Non-decreasing Paths Problem
R Duan, C Jin, H Wu
ICALP 2019, 2019
92019
Constructive separations and their consequences
L Chen, C Jin, R Santhanam, R Williams
TheoretiCS 3, 2024
82024
Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching
C Jin, J Nogler
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
82023
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions∗
L Chen, C Jin, RR Williams, H Wu
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
82022
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20