Ce Jin

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Near-optimal quantum algorithms for bounded edit distance and Lempel-Ziv factorization	2024-11-28	Paper
Improved roundtrip spanners, emulators, and directed girth approximation	2024-11-28	Paper
An efficient algorithm for all-pairs bounded edge connectivity	2024-11-14	Paper
A simple near-linear pseudopolynomial time randomized algorithm for subset sum	2024-08-26	Paper
Truly low-space element distinctness and subset sum via pseudorandom hash functions	2024-07-19	Paper
Near-optimal quantum algorithms for string problems	2024-07-19	Paper
Constructive separations and their consequences	2024-07-03	Paper
Listing 6-cycles	2024-05-29	Paper
Approximating Knapsack and partition via dense subset sums	2024-05-14	Paper
Quantum speed-ups for string synchronizing sets, longest common substring, and \(k\)-mismatch matching	2024-05-14	Paper
Fast and simple modular subset sum	2024-05-14	Paper
Removing additive structure in 3SUM-based reductions	2024-05-08	Paper
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity	2024-04-24	Paper
https://portal.mardi4nfdi.de/entity/Q6126224	2024-04-09	Paper
https://portal.mardi4nfdi.de/entity/Q6147361	2024-01-15	Paper
Tight dynamic problem lower bounds from generalized BMM and OMv	2023-12-08	Paper
Improved MPC algorithms for MIS, matching, and coloring on trees and beyond	2023-11-02	Paper
Near-optimal quantum algorithms for string problems	2023-08-17	Paper
Improved Merlin-Arthur protocols for central problems in fine-grained complexity	2023-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q5091235	2022-07-21	Paper
Faster Algorithms for All Pairs Non-Decreasing Paths Problem	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5090424	2022-07-18	Paper
Sharp threshold results for computational complexity	2021-01-19	Paper
Fast Modular Subset Sum using Linear Sketching	2019-10-15	Paper

Research outcomes over time

This page was built for person: Ce Jin