A. Lingas

activity

20242026

collaborators

4 papers

cs.DS2026

Multiplication of 0-1 matrices via clustering

Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas +1

We study applications of clustering (in particular, the $k$ -center clustering problem) in the design of efficient and practical algorithms for computing an approximate and the exac…

cs.DS2025

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…

cs.DS2025

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…

cs.DC2024

A Note on Solving Problems of Substantially Super-linear Complexity in $N^{o (1)}$ Rounds of the Congested Clique

Andrzej Lingas

We study the possibility of designing $N^{o (1)}$ -round protocols for problems of substantially super-linear polynomial-time (sequential) complexity on the congested clique with abo…

Multiplication of 0-1 matrices via clustering

Fast approximate ℓ-center clustering in high dimensional spaces

Approximate all-pairs Hamming distances and 0-1 matrix multiplication

A Note on Solving Problems of Substantially Super-linear Complexity in No(1) Rounds of the Congested Clique

Fast approximate $ℓ$ -center clustering in high dimensional spaces

A Note on Solving Problems of Substantially Super-linear Complexity in $N^{o (1)}$ Rounds of the Congested Clique