3 papers
cs.DC2026
Rectangular Matrix Multiplication in the Low-Bandwidth Model
Chetan Gupta, Jukka Suomela, Hossein Vahidi
We study rectangular matrix multiplication in the low-bandwidth model of distributed computing. There are computers; initially the input matrices are distributed evenly between…
cs.DC2023
Fast Dynamic Programming in Trees in the MPC Model
Chetan Gupta, Rustam Latypov, Yannic Maus +6
We present a deterministic algorithm for solving a wide range of dynamic programming problems in trees in rounds in the massively parallel computation model (MPC), with…
cs.CC2018
Complexity of Computing the Anti-Ramsey Numbers for Paths
Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani +3
The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erd\" os, Simonovits and S\' os. For given graphs and the \emph{anti-Ramsey number}…