Ce Jin

According to our database, Ce Jin authored at least 37 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

An Efficient Algorithm for All-Pairs Bounded Edge Connectivity.

Shyan Akmal, Ce Jin

Algorithmica, May, 2024

Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More.

Ce Jin, Yinzhan Xu

CoRR, 2024

A Faster Algorithm for Pigeonhole Equal Sums.

Ce Jin, Hongxun Wu

CoRR, 2024

Streaming Algorithms for Connectivity Augmentation.

Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian

CoRR, 2024

Listing 6-Cycles.

Ce Jin, Virginia Vassilevska Williams, Renfei Zhou

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation.

Alina Harbuzova, Ce Jin, Virginia Vassilevska Williams, Zixuan Xu

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization.

Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Near-Optimal Quantum Algorithms for String Problems.

Shyan Akmal, Ce Jin

Algorithmica, August, 2023

Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity.

Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, R. Ryan Williams

Algorithmica, August, 2023

A VLSI Circuit Model Accounting For Wire Delay.

Ce Jin, Ryan Williams, Nathaniel Young

Electron. Colloquium Comput. Complex., 2023

New Tools for Peak Memory Scheduling.

Ce Jin, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang

CoRR, 2023

0-1 Knapsack in Nearly Quadratic Time.

Ce Jin

CoRR, 2023

Solving Knapsack with Small Items via L0-Proximity.

Ce Jin

CoRR, 2023

Removing Additive Structure in 3SUM-Based Reductions.

Ce Jin, Yinzhan Xu

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and <i>k</i>-mismatch Matching.

Ce Jin, Jakob Nogler

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Approximating Knapsack and Partition via Dense Subset Sums.

Mingyang Deng, Ce Jin, Xiao Mao

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Faster Algorithms for Text-to-Pattern Hamming Distances.

Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching.

Ce Jin, Jakob Nogler

CoRR, 2022

Tight dynamic problem lower bounds from generalized BMM and OMv.

Ce Jin, Yinzhan Xu

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions.

Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles.

Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Constructive Separations and Their Consequences.

Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams

Electron. Colloquium Comput. Complex., 2021

An Improved Sketching Algorithm for Edit Distance.

Ce Jin, Jelani Nelson, Kewen Wu

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Fast and Simple Modular Subset Sum.

Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Fast Low-Space Algorithms for Subset Sum.

Ce Jin, Nikhil Vyas, Ryan Williams

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Faster Algorithms for Bounded Tree Edit Distance.

Shyan Akmal, Ce Jin

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Sharp Threshold Results for Computational Complexity.

Lijie Chen, Ce Jin, R. Ryan Williams

Electron. Colloquium Comput. Complex., 2020

An Improved Sketching Bound for Edit Distance.

Ce Jin, Jelani Nelson, Kewen Wu

CoRR, 2020

Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond.

Mohsen Ghaffari, Christoph Grunau, Ce Jin

Proceedings of the 34th International Symposium on Distributed Computing, 2020

A Massively Parallel Algorithm for Minimum Weight Vertex Cover.

Mohsen Ghaffari, Ce Jin, Daan Nilis

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019

Hardness Magnification for all Sparse NP Languages.

Lijie Chen, Ce Jin, Ryan Williams

Electron. Colloquium Comput. Complex., 2019

A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum.

Ce Jin, Hongxun Wu

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Fast Modular Subset Sum using Linear Sketching.

Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Simulating Random Walks on Graphs in the Streaming Model.

Ce Jin

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

An Improved FPTAS for 0-1 Knapsack.

Ce Jin

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Faster Algorithms for All Pairs Non-Decreasing Paths Problem.

Ran Duan, Ce Jin, Hongxun Wu

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Cooperation via Codes in Restricted Hat Guessing Games.

Kai Jin, Ce Jin, Zhaoquan Gu

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019