5 papers
Fast approximate -center clustering in high dimensional spaces
Mirosław Kowaluk, Andrzej Lingas, Mia Persson
We study the design of efficient approximation algorithms for the -center clustering and minimum-diameter -clustering problems in high dimensional Euclidean and Hamming…
Approximate all-pairs Hamming distances and 0-1 matrix multiplication
Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
Arslan showed that computing all-pairs Hamming distances is easily reducible to arithmetic 0-1 matrix multiplication (IPL 2018). We provide a reverse, linear-time reduction of arit…
Multiplication of 0-1 matrices via clustering
Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas +1
We study applications of clustering (in particular, the -center clustering problem) in the design of efficient and practical algorithms for computing an approximate and the exac…
Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
Andrzej Lingas
We present a protocol for the Boolean matrix product of two Boolean matrices on the congested clique designed for the situation when the rows of the first matrix or the…
A Note on Solving Problems of Substantially Super-linear Complexity in Rounds of the Congested Clique
Andrzej Lingas
We study the possibility of designing -round protocols for problems of substantially super-linear polynomial-time (sequential) complexity on the congested clique with abo…