Quantum computers pose a significant threat to blockchain technology's security, which
heavily relies on public-key cryptography and hash functions. The cryptographic algorithms …

In this paper, we present new randomized algorithms that improve the complexity of the
classic (Δ+ 1)-coloring problem, and its generalization (Δ+ 1)-list-coloring, in three well …

We present an algorithm for approximating the edit distance between two strings of length n
in time n 1+ ε, for any, up to a constant factor. Our result completes a research direction set …

We study quantum algorithms for several fundamental string problems, including Longest
Common Substring, Lexicographically Minimal String Rotation, and Longest Square …

We introduce a method for “sparsifying” distributed algorithms and exhibit how it leads to
improvements that go past known barriers in two algorithmic settings of large-scale graph …

Identifying the connected components of a graph, apart from being a fundamental problem
with countless applications, is a key primitive for many other algorithms. In this paper, we …

We present the first conditional hardness results for massively parallel algorithms for some
central graph problems including (approximating) maximum matching, vertex cover …

We provide a simple new randomized contraction approach to the global minimum cut
problem for simple undirected graphs. The contractions exploit 2-out edge sampling from …

Longest common substring (LCS), longest palindrome substring (LPS), and Ulam distance
(UL) are three fundamental string problems that can be classically solved in near linear time …

Constant-Factor Approximation of Near-Linear Edit Distance in Near-Linear Time Page 1
Constant-Factor Approximation of Near-Linear Edit Distance in Near-Linear Time Joshua …