Andrzej Lingas

Lund University — Sweden

Computer Science · Physical Sciences

28h-index2.6kcitations320works0.22yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(125), Advanced Graph Theory Research(124), Computational Geometry and Mesh Generation(116), Optimization and Search Problems(45), Algorithms and Data Compression(36)

Publications320 total

Approximate All-Pairs Hamming Distances and 0–1 Matrix Multiplication
Lecture notes in computer science·2026
Fast approximate $\ell$-center clustering in high dimensional spaces
arXiv (Cornell University)·2025Open Access
A Note on Solving Problems of Substantially Super-linear Complexity in No(1) Rounds of the Congested Clique
Parallel Processing Letters·2025Open Access
Deterministic protocols for Voronoi diagrams and triangulations of planar point sets on the congested clique
Theoretical Computer Science·2025· 1 citedOpen Access
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="normal">min</mml:mi><mml:mo></mml:mo><mml:mo>,</mml:mo><mml:mo linebreak="badbreak" linebreakstyle="after">+</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math> matrix and vector products for inputs decomposable into few monotone subsequences
Theoretical Computer Science·2025Open Access
Efficient assignment of identities in anonymous populations
Information and Computation·2025· 2 citedOpen Access
Multiplication of 0-1 Matrices via Clustering
Lecture notes in computer science·2025
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs
SSRN Electronic Journal·2025Open Access
The Voronoi Diagram of Weakly Smooth Planar Point Sets in $$O(\log n)$$ Deterministic Rounds on the Congested Clique
Lecture notes in computer science·2025
Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
arXiv (Cornell University)·2024Open Access
A Note on Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds of the Congested Clique
arXiv (Cornell University)·2024Open Access
The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
arXiv (Cornell University)·2024Open Access
Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
Lecture notes in computer science·2024
Finding Small Complete Subgraphs Efficiently
SSRN Electronic Journal·2024Open Access
A Note on Solving Problems of Substantially Super-Linear Complexity in $N^{O(1)}$ Rounds of the Congested Clique
SSRN Electronic Journal·2024Open Access
Efficient Assignment of Identities in Anonymous Populations
SSRN Electronic Journal·2024Open Access
$$(\min ,+)$$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences
Lecture notes in computer science·2023· 1 cited
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products
International Journal of Foundations of Computer Science·2023· 2 citedOpen Access
$(\min,+)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences
arXiv (Cornell University)·2023Open Access
Perpetual maintenance of machines with different urgency requirements
Journal of Computer and System Sciences·2023· 9 citedOpen Access
page 1 of 16Next →

Frequent Co-authors

Leszek Gąsieniec(7), Artur Czumaj(7), Christos Levcopoulos(6), Jesper Jansson(5), Mirosław Kowaluk(5), Eva-Marta Lundell(5), Hristo Djidjev(4), Jörg-Rüdiger Sack(3), Rolf Klein(3), Klaus Jansen(2), Marek Karpiński(2), Anna Adamaszek(2), Anders Dessmark(2), Peter Floderus(2), Fedor V. Fomin(1), Anna Östlin(1), Malin Christersson(1), Eike Seidel(1), Bogdan S. Chlebus(1), Aris Pagourtzis(1)