Parallel Longest Increasing Subsequence and van Emde Boas Trees
This paper studies parallel algorithms for the longest increasing subsequence (LIS)
problem. Let n be the input size and k be the LIS length of the input. Sequentially, LIS is a …
problem. Let n be the input size and k be the LIS length of the input. Sequentially, LIS is a …
Parallel and (Nearly) Work-Efficient Dynamic Programming
The idea of dynamic programming (DP), proposed by Bellman in the 1950s, is one of the
most important algorithmic techniques. However, in parallel, many fundamental and …
most important algorithmic techniques. However, in parallel, many fundamental and …
Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications
P Gawrychowski, E Gorbachev… - arXiv preprint arXiv …, 2024 - arxiv.org
The task of min-plus matrix multiplication often arises in the context of distances in graphs
and is known to be fine-grained equivalent to the All-Pairs Shortest Path problem. The non …
and is known to be fine-grained equivalent to the All-Pairs Shortest Path problem. The non …
An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications to LIS
J Koo - Proceedings of the 36th ACM Symposium on …, 2024 - dl.acm.org
We present an O (1)-round fully-scalable deterministic massively parallel algorithm for
computing the min-plus matrix multiplication of unit-Monge matrices. We use this to derive a …
computing the min-plus matrix multiplication of unit-Monge matrices. We use this to derive a …