Mia Persson

According to our database, Mia Persson authored at least 26 papers between 2003 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

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

Miroslaw Kowaluk, Andrzej Lingas, Mia Persson

CoRR, April, 2025

Multiplication of 0-1 Matrices via Clustering.

Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas, Mia Persson

Proceedings of the Frontiers of Algorithmics - 19th International Joint Conference, 2025

2023

Improved Lower Bounds for Monotone q-Multilinear Boolean Circuits.

Andrzej Lingas, Mia Persson

CoRR, 2023

$(\min ,+)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences.

Andrzej Lingas, Mia Persson

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs.

Andrzej Lingas, Mia Persson, Dzmitry Sledneu

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases.

Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson

J. Comput. Syst. Sci., 2021

2020

Computing the Boolean Product of Two <i>n</i> × <i>n</i> Boolean Matrices Using <i>O</i>(<i>n</i>²) Mechanical Operations.

Andrzej Lingas, Mia Persson

Int. J. Unconv. Comput., 2020

Computing the Boolean product of two n\times n Boolean matrices using O(n^2) mechanical operation.

Andrzej Lingas, Mia Persson

CoRR, 2020

2019

Clearing directed subgraphs by mobile agents: Variations on covering with paths.

Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski

J. Comput. Syst. Sci., 2019

Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases.

Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2017

Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model.

Andrzej Lingas, Mia Persson, Dzmitry Sledneu

Proceedings of the Theory and Applications of Models of Computation, 2017

The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents).

Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbanska, Pawel Zylinski

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2015

Extreme Witnesses and Their Applications.

Andrzej Lingas, Mia Persson

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Iterative merging heuristics for correlation clustering.

Andrzej Lingas, Mia Persson, Dzmitry Sledneu

Int. J. Metaheuristics, 2014

2013

Detecting Monomials with k Distinct Variables.

Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu

Electron. Colloquium Comput. Complex., 2013

Simple Iterative Heuristics for Correlation Clustering.

Andrzej Lingas, Mia Persson

Proceedings of the Large-Scale Scientific Computing - 9th International Conference, 2013

Competitive Online Clique Clustering.

Aleksander Fabijan, Bengt J. Nilsson, Mia Persson

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows.

Andrzej Lingas, Mia Persson

Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

2011

Towards More Efficient Infection and Fire Fighting.

Peter Floderus, Andrzej Lingas, Mia Persson

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2008

Approximate clustering of incomplete fingerprints.

Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson

J. Discrete Algorithms, 2008

2006

Approximation and Online Algorithms with Applications in Computational Biology and Computational Geometry.

Mia Persson

PhD thesis, 2006

The Online Freeze-Tag Problem.

Mikael Hammar, Bengt J. Nilsson, Mia Persson

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

On the Approximability of Maximum and Minimum Edge Clique Partition Problems.

Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson

Proceedings of the Theory of Computing 2006, 2006

Minimum-Energy Broadcasting in Wireless Networks in the <i>d</i>-Dimensional Euclidean Space (The <i>alpha</i><=<i>d</i> Case).

Andrzej Lingas, Mia Persson, Martin Wahlen

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005

Approximate Clustering of Fingerprint Vectors with Missing Values.

Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson

Proceedings of the Theory of Computing 2005, 2005

2003

Competitive Exploration of Rectilinear Polygons.

Mikael Hammar, Bengt J. Nilsson, Mia Persson

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003