Ce Jin

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 49

Top Topics

Computational Complexity

Randomized Algorithm

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
Streaming Algorithms for Connectivity Augmentation. CoRR (2024)
Mingyang Deng, Ce Jin, Xiao Mao
Approximating Knapsack and Partition via Dense Subset Sums. SODA (2023)
Shyan Akmal, Ce Jin
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. CoRR (2023)
Ce Jin, Yinzhan Xu
Removing Additive Structure in 3SUM-Based Reductions. STOC (2023)
Ce Jin, Jakob Nogler
-mismatch Matching. SODA (2023)
Ce Jin, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
New Tools for Peak Memory Scheduling. CoRR (2023)
Mingyang Deng, Ce Jin, Xiao Mao
Approximating Knapsack and Partition via Dense Subset Sums. CoRR (2023)
Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. CoRR (2022)
Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. SODA (2022)
Ce Jin, Yinzhan Xu
Removing Additive Structure in 3SUM-Based Reductions. CoRR (2022)
Ce Jin, Jakob Nogler
Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching. CoRR (2022)
Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. ITCS (2022)
Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. FOCS (2022)
Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams
Constructive Separations and Their Consequences. CoRR (2022)
Shyan Akmal, Ce Jin
Near-Optimal Quantum Algorithms for String Problems. SODA (2022)
Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams
Constructive Separations and Their Consequences. FOCS (2022)
Ce Jin, Yinzhan Xu
Tight dynamic problem lower bounds from generalized BMM and OMv. STOC (2022)
Ce Jin, Yinzhan Xu
Tight Dynamic Problem Lower Bounds from Generalized BMM and OMv. CoRR (2022)
Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. CoRR (2021)
Shyan Akmal, Ce Jin
Faster Algorithms for Bounded Tree Edit Distance. CoRR (2021)
Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
Fast and Simple Modular Subset Sum. SOSA (2021)
Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams
Constructive Separations and Their Consequences. FOCS (2021)
Shyan Akmal, Ce Jin
Near-Optimal Quantum Algorithms for String Problems. CoRR (2021)
Ce Jin, Nikhil Vyas, Ryan Williams
Fast Low-Space Algorithms for Subset Sum. SODA (2021)
Ce Jin, Jelani Nelson, Kewen Wu
An Improved Sketching Algorithm for Edit Distance. STACS (2021)
Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Electron. Colloquium Comput. Complex. 28 (2021)
Shyan Akmal, Ce Jin
Faster Algorithms for Bounded Tree Edit Distance. ICALP (2021)
Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams
Constructive Separations and Their Consequences. Electron. Colloquium Comput. Complex. 28 (2021)
Mohsen Ghaffari, Ce Jin, Daan Nilis
A Massively Parallel Algorithm for Minimum Weight Vertex Cover. SPAA (2020)
Ce Jin, Nikhil Vyas, Ryan Williams
Fast Low-Space Algorithms for Subset Sum. CoRR (2020)
Lijie Chen, Ce Jin, R. Ryan Williams
Sharp threshold results for computational complexity. STOC (2020)
Mohsen Ghaffari, Christoph Grunau, Ce Jin
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. DISC (2020)
Lijie Chen, Ce Jin, R. Ryan Williams
Sharp Threshold Results for Computational Complexity. Electron. Colloquium Comput. Complex. 27 (2020)
Mohsen Ghaffari, Ce Jin, Daan Nilis
A Massively Parallel Algorithm for Minimum Weight Vertex Cover. CoRR (2020)
Mohsen Ghaffari, Christoph Grunau, Ce Jin
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. CoRR (2020)
Ce Jin, Jelani Nelson, Kewen Wu
An Improved Sketching Bound for Edit Distance. CoRR (2020)
Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
Fast and Simple Modular Subset Sum. CoRR (2020)
Ce Jin, Hongxun Wu
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. SOSA (2019)
Lijie Chen, Ce Jin, R. Ryan Williams
Hardness Magnification for all Sparse NP Languages. FOCS (2019)
Ran Duan, Ce Jin, Hongxun Wu
Faster Algorithms for All Pairs Non-decreasing Paths Problem. CoRR (2019)
Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu
Fast Modular Subset Sum using Linear Sketching. SODA (2019)
Ce Jin
An Improved FPTAS for 0-1 Knapsack. CoRR (2019)
Ce Jin
Simulating Random Walks on Graphs in the Streaming Model. ITCS (2019)
Lijie Chen, Ce Jin, Ryan Williams
Hardness Magnification for all Sparse NP Languages. Electron. Colloquium Comput. Complex. 26 (2019)
Kai Jin, Ce Jin, Zhaoquan Gu
Cooperation via Codes in Restricted Hat Guessing Games. AAMAS (2019)
Ce Jin
An Improved FPTAS for 0-1 Knapsack. ICALP (2019)
Ran Duan, Ce Jin, Hongxun Wu
Faster Algorithms for All Pairs Non-Decreasing Paths Problem. ICALP (2019)
Ce Jin, Hongxun Wu
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. CoRR (2018)
Ce Jin
Simulating Random Walks on Graphs in the Streaming Model. CoRR (2018)