Approximating Edit Distance in Truly Subquadratic Time: Quantum and
MapReduce

v1v2 (latest)

Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce

11 April 2018

Mahdi Boroujeni

Mohammad Ghodsi

Mohammadtaghi Hajiaghayi

Saeed Seddighin

ArXiv (abs)PDF HTML

Papers citing "Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce"

7 / 7 papers shown

Title
Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model Kishore Kothapalli Shreyas Pai Sriram V. Pemmaraju 80 8 0 26 Sep 2020
Massively Parallel Algorithms for Distance Approximation and Spanners Amartya Shankha Biswas Michal Dory M. Ghaffari Slobodan Mitrović Yasamin Nazari 97 20 0 02 Mar 2020
Equivalence Classes and Conditional Hardness in Massively Parallel Computations Danupon Nanongkai Michele Scquizzato 63 18 0 07 Jan 2020
New lower bounds for Massively Parallel Computation from query complexity Moses Charikar Weiyun Ma Li-Yang Tan 39 1 0 05 Jan 2020
Near-Optimal Massively Parallel Graph Connectivity Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki Vahab Mirrokni 75 52 0 11 Oct 2019
Faster Algorithms for Edge Connectivity via Random $2$ -Out Contractions M. Ghaffari Krzysztof Nowicki M. Thorup 162 50 0 02 Sep 2019
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation M. Ghaffari Jara Uitto 64 103 0 17 Jul 2018