Ce Jin - RankMe

89 papers A* 30A 7B 1Journal 48Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation. SODA Mikkel Abrahamsen, Sujoy Bhore, Maike Buchin, Jacobus Conradi, Ce Jin, André Nusser, Carolin Rehs
2026	J	`jnl`	Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection. CoRR Bartlomiej Dudek, Nick Fischer, Geri Gokaj, Ce Jin, Marvin Künnemann, Xiao Mao, Mirza Redzic
2026	A*	`conf`	Improved Additive Approximation Algorithms for APSP. SODA Ce Jin, Yael Kirkpatrick, Michal Stawarz, Virginia Vassilevska Williams
2026	J	`jnl`	Memory Reallocation with Polylogarithmic Overhead. CoRR Ce Jin
2025	J	`jnl`	Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation. CoRR Mikkel Abrahamsen, Sujoy Bhore, Maike Buchin, Jacobus Conradi, Ce Jin, André Nusser, Carolin Rehs
2025	A*	`conf`	All-Pairs Shortest Paths with Few Weights per Node. STOC Amir Abboud, Nick Fischer, Ce Jin, Virginia Vassilevska Williams, Zoe Xi
2025	J	`jnl`	All-Pairs Shortest Paths with Few Weights per Node. CoRR Amir Abboud, Nick Fischer, Ce Jin, Virginia Vassilevska Williams, Zoe Xi
2025	A*	`conf`	Approximately Counting Knapsack Solutions in Subquadratic Time. SODA Weiming Feng, Ce Jin
2025	A*	`conf`	Beyond 2-Approximation for SODA Ce Jin, Yael Kirkpatrick, Virginia Vassilevska Williams, Nicole Wein
2025	J	`jnl`	Beyond 2-approximation for k-Center in Graphs. CoRR Ce Jin, Yael Kirkpatrick, Virginia Vassilevska Williams, Nicole Wein
2025	J	`jnl`	Improved Additive Approximation Algorithms for APSP. CoRR Ce Jin, Yael Kirkpatrick, Michal Stawarz, Virginia Vassilevska Williams
2025	A*	`conf`	Near-Optimal Property Testers for Pattern Matching. FOCS Ce Jin, Tomasz Kociumaka
2025	J	`jnl`	Near-Optimal Property Testers for Pattern Matching. CoRR Ce Jin, Tomasz Kociumaka
2025	A	`conf`	New Algorithms for Pigeonhole Equal Subset Sum. ESA Ce Jin, Ryan Williams, Stan Zhang
2025	A*	`conf`	New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching. SODA Nick Fischer, Ce Jin, Yinzhan Xu
2024	A*	`conf`	0-1 Knapsack in Nearly Quadratic Time. STOC Ce Jin
2024	A*	`conf`	A Faster Algorithm for Pigeonhole Equal Sums. ICALP Ce Jin, Hongxun Wu
2024	J	`jnl`	A Faster Algorithm for Pigeonhole Equal Sums. CoRR Ce Jin, Hongxun Wu
2024	A	`conf`	A VLSI Circuit Model Accounting for Wire Delay. ITCS Ce Jin, R. Ryan Williams, Nathaniel Young
2024	J	`jnl`	An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. Algorithmica Shyan Akmal, Ce Jin
2024	J	`jnl`	Approximately Counting Knapsack Solutions in Subquadratic Time. CoRR Weiming Feng, Ce Jin
2024	J	`jnl`	Constructive Separations and Their Consequences. TheoretiCS Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams
2024	A*	`conf`	Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation. SODA Alina Harbuzova, Ce Jin, Virginia Vassilevska Williams, Zixuan Xu
2024	—	`conf`	Listing 6-Cycles. SOSA Ce Jin, Virginia Vassilevska Williams, Renfei Zhou
2024	A*	`conf`	Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. SODA Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan
2024	J	`jnl`	New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching. CoRR Nick Fischer, Ce Jin, Yinzhan Xu
2024	J	`jnl`	Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and ACM Trans. Algorithms Ce Jin, Jakob Nogler
2024	A*	`conf`	Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. STOC Ce Jin, Yinzhan Xu
2024	J	`jnl`	Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. CoRR Ce Jin, Yinzhan Xu
2024	A*	`conf`	Streaming Algorithms for Connectivity Augmentation. ICALP Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
2024	J	`jnl`	Streaming Algorithms for Connectivity Augmentation. CoRR Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
2023	J	`jnl`	0-1 Knapsack in Nearly Quadratic Time. CoRR Ce Jin
2023	J	`jnl`	A VLSI Circuit Model Accounting For Wire Delay. Electron. Colloquium Comput. Complex. Ce Jin, Ryan Williams, Nathaniel Young
2023	A*	`conf`	An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. ICALP Shyan Akmal, Ce Jin
2023	J	`jnl`	An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. CoRR Shyan Akmal, Ce Jin
2023	A*	`conf`	Approximating Knapsack and Partition via Dense Subset Sums. SODA Mingyang Deng, Ce Jin, Xiao Mao
2023	J	`jnl`	Approximating Knapsack and Partition via Dense Subset Sums. CoRR Mingyang Deng, Ce Jin, Xiao Mao
2023	A*	`conf`	Faster Algorithms for Text-to-Pattern Hamming Distances. FOCS Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu
2023	J	`jnl`	Faster Algorithms for Text-to-Pattern Hamming Distances. CoRR Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu
2023	J	`jnl`	Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Algorithmica Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, R. Ryan Williams
2023	J	`jnl`	Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation. CoRR Alina Harbuzova, Ce Jin, Virginia Vassilevska Williams, Zixuan Xu
2023	J	`jnl`	Listing 6-Cycles. CoRR Ce Jin, Virginia Vassilevska Williams, Renfei Zhou
2023	J	`jnl`	Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. CoRR Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan
2023	J	`jnl`	Near-Optimal Quantum Algorithms for String Problems. Algorithmica Shyan Akmal, Ce Jin
2023	J	`jnl`	New Tools for Peak Memory Scheduling. CoRR Ce Jin, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
2023	A*	`conf`	Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and SODA Ce Jin, Jakob Nogler
2023	A*	`conf`	Removing Additive Structure in 3SUM-Based Reductions. STOC Ce Jin, Yinzhan Xu
2023	J	`jnl`	Solving Knapsack with Small Items via L0-Proximity. CoRR Ce Jin
2022	A*	`conf`	Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. FOCS Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein
2022	J	`jnl`	Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. CoRR Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein
2022	J	`jnl`	Constructive Separations and Their Consequences. CoRR Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams
2022	A	`conf`	Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. ITCS Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams
2022	A*	`conf`	Near-Optimal Quantum Algorithms for String Problems. SODA Shyan Akmal, Ce Jin
2022	J	`jnl`	Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching. CoRR Ce Jin, Jakob Nogler
2022	J	`jnl`	Removing Additive Structure in 3SUM-Based Reductions. CoRR Ce Jin, Yinzhan Xu
2022	J	`jnl`	Tight Dynamic Problem Lower Bounds from Generalized BMM and OMv. CoRR Ce Jin, Yinzhan Xu
2022	A*	`conf`	Tight dynamic problem lower bounds from generalized BMM and OMv. STOC Ce Jin, Yinzhan Xu
2022	A*	`conf`	Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. SODA Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu
2021	A	`conf`	An Improved Sketching Algorithm for Edit Distance. STACS Ce Jin, Jelani Nelson, Kewen Wu
2021	A*	`conf`	Constructive Separations and Their Consequences. FOCS Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams
2021	J	`jnl`	Constructive Separations and Their Consequences. Electron. Colloquium Comput. Complex. Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams
2021	A*	`conf`	Fast Low-Space Algorithms for Subset Sum. SODA Ce Jin, Nikhil Vyas, Ryan Williams
2021	—	`conf`	Fast and Simple Modular Subset Sum. SOSA Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
2021	A*	`conf`	Faster Algorithms for Bounded Tree Edit Distance. ICALP Shyan Akmal, Ce Jin
2021	J	`jnl`	Faster Algorithms for Bounded Tree Edit Distance. CoRR Shyan Akmal, Ce Jin
2021	J	`jnl`	Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Electron. Colloquium Comput. Complex. Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams
2021	J	`jnl`	Near-Optimal Quantum Algorithms for String Problems. CoRR Shyan Akmal, Ce Jin
2021	J	`jnl`	Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. CoRR Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu
2020	B	`conf`	A Massively Parallel Algorithm for Minimum Weight Vertex Cover. SPAA Mohsen Ghaffari, Ce Jin, Daan Nilis
2020	J	`jnl`	A Massively Parallel Algorithm for Minimum Weight Vertex Cover. CoRR Mohsen Ghaffari, Ce Jin, Daan Nilis
2020	J	`jnl`	An Improved Sketching Bound for Edit Distance. CoRR Ce Jin, Jelani Nelson, Kewen Wu
2020	J	`jnl`	Fast Low-Space Algorithms for Subset Sum. CoRR Ce Jin, Nikhil Vyas, Ryan Williams
2020	J	`jnl`	Fast and Simple Modular Subset Sum. CoRR Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
2020	A	`conf`	Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. DISC Mohsen Ghaffari, Christoph Grunau, Ce Jin
2020	J	`jnl`	Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. CoRR Mohsen Ghaffari, Christoph Grunau, Ce Jin
2020	J	`jnl`	Sharp Threshold Results for Computational Complexity. Electron. Colloquium Comput. Complex. Lijie Chen, Ce Jin, R. Ryan Williams
2020	A*	`conf`	Sharp threshold results for computational complexity. STOC Lijie Chen, Ce Jin, R. Ryan Williams
2019	—	`conf`	A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. SOSA Ce Jin, Hongxun Wu
2019	A*	`conf`	An Improved FPTAS for 0-1 Knapsack. ICALP Ce Jin
2019	J	`jnl`	An Improved FPTAS for 0-1 Knapsack. CoRR Ce Jin
2019	A	`conf`	Cooperation via Codes in Restricted Hat Guessing Games. AAMAS Kai Jin, Ce Jin, Zhaoquan Gu
2019	A*	`conf`	Fast Modular Subset Sum using Linear Sketching. SODA Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu
2019	A*	`conf`	Faster Algorithms for All Pairs Non-Decreasing Paths Problem. ICALP Ran Duan, Ce Jin, Hongxun Wu
2019	J	`jnl`	Faster Algorithms for All Pairs Non-decreasing Paths Problem. CoRR Ran Duan, Ce Jin, Hongxun Wu
2019	A*	`conf`	Hardness Magnification for all Sparse NP Languages. FOCS Lijie Chen, Ce Jin, R. Ryan Williams
2019	J	`jnl`	Hardness Magnification for all Sparse NP Languages. Electron. Colloquium Comput. Complex. Lijie Chen, Ce Jin, Ryan Williams
2019	A	`conf`	Simulating Random Walks on Graphs in the Streaming Model. ITCS Ce Jin
2018	J	`jnl`	A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. CoRR Ce Jin, Hongxun Wu
2018	J	`jnl`	Simulating Random Walks on Graphs in the Streaming Model. CoRR Ce Jin