Mia Persson

According to our database1, Mia Persson authored at least 21 papers between 2005 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases.
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><sup>2</sup>) Mechanical Operations.
Int. J. Unconv. Comput., 2020

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

2019
Clearing directed subgraphs by mobile agents: Variations on covering with paths.
J. Comput. Syst. Sci., 2019

Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2018
Extreme Witnesses and Their Applications.
Algorithmica, 2018

2017
Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model.
Proceedings of the Theory and Applications of Models of Computation, 2017

The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents).
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2015
Detecting monomials with k distinct variables.
Inf. Process. Lett., 2015

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

2014
Iterative merging heuristics for correlation clustering.
Int. J. Metaheuristics, 2014

2013
Towards More Efficient Infection and Fire Fighting.
Int. J. Found. Comput. Sci., 2013

Simple Iterative Heuristics for Correlation Clustering.
Proceedings of the Large-Scale Scientific Computing - 9th International Conference, 2013

Competitive Online Clique Clustering.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2008
Approximate clustering of incomplete fingerprints.
J. Discrete Algorithms, 2008

2007
On the Approximability of Maximum and Minimum Edge Clique Partition Problems.
Int. J. Found. Comput. Sci., 2007

2006
Approximation and Online Algorithms with Applications in Computational Biology and Computational Geometry.
PhD thesis, 2006

Competitive exploration of rectilinear polygons.
Theor. Comput. Sci., 2006

The Online Freeze-Tag Problem.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Minimum-Energy Broadcasting in Wireless Networks in the <i>d</i>-Dimensional Euclidean Space (The <i>alpha</i><=<i>d</i> Case).
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005
Approximate Clustering of Fingerprint Vectors with Missing Values.
Proceedings of the Theory of Computing 2005, 2005


  Loading...