An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications to LIS
Name
3626183.3659974.pdf
Size
1.02 MB
Format
Adobe PDF
Checksum (MD5)
edfc15aca28661b78f453a3fc49462f1
Author(s)
Koo, Jaehyun
Date Issued
June 17, 2024
Publisher
ACM|SPAA '24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures
Citation
Koo, Jaehyun. 2024. "An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications to LIS."
Version
Final published version
Abstract
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 O(łog n)-round fully-scalable massively parallel algorithm for solving the exact longest increasing subsequence (LIS) problem. For a fully-scalable MPC regime, this result substantially improves the previously known algorithm of O(łog^4 n)-round complexity, and matches the best algorithm for computing the (1+ε)-approximation of LIS.
Description
SPAA ’24, June 17–21, 2024, Nantes, France
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3626183.3659974
