Mia Persson (Former)

1 – 10 of 22

show: 10
|
sort: year (new to old)

News feed Embed this list Save this search Mark all Export

Cancel

Embed this list

copy and paste the html snippet below into your own page:

<iframe src="https://lup.lub.lu.se/search/person/3943870c-4ad9-4d0a-80ca-5bdd51eebd22?embed=1&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

« previous
1
2
3
next »

2026
Mark Approximate All-Pairs Hamming Distances and 0–1 Matrix Multiplication
Kowaluk, Mirosław ; Lingas, Andrzej ^LU and Persson, Mia ^LU (2026) 3rd International Conference on Applied Algorithms, ICAA 2026 In Lecture Notes in Computer Science 16423 LNCS. p.38-49
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Fast Approximate ℓ-Center Clustering in High-Dimensional Spaces
Kowaluk, Mirosław ; Lingas, Andrzej ^LU and Persson, Mia ^LU (2026) In Algorithms 19(3).
- Contribution to journal › Article
2025
Mark Multiplication of 0-1 Matrices via Clustering
Jansson, Jesper ; Kowaluk, Mirosław ; Lingas, Andrzej ^LU and Persson, Mia ^LU (2025) 19th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom, IJTCS-FAW 2025 In Lecture Notes in Computer Science 15828 LNCS. p.92-102
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2024
Mark (min, + ) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences
Lingas, Andrzej ^LU and Persson, Mia ^LU (2024) 29th International Computing and Combinatorics Conference, COCOON 2023 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 14423 LNCS. p.55-68
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2022
Mark An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs
Lingas, Andrzej ^LU ; Persson, Mia ^LU and Sledneu, Dzmitry (2022) 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13179 LNCS. p.140-151
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2021
Mark Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases
Gasieniec, Leszek ; Jansson, Jesper ^LU ; Levcopoulos, Christos ^LU ; Lingas, Andrzej ^LU and Persson, Mia ^LU (2021) In Journal of Computer and System Sciences 118. p.108-118
- Contribution to journal › Article
2020
Mark Computing the boolean product of two n × n boolean matrices using o(N²) mechanical operations
Lingas, Andrzej ^LU and Persson, Mia ^LU (2020) In International Journal of Unconventional Computing 15(3). p.225-236
- Contribution to journal › Article
2019
Mark Clearing directed subgraphs by mobile agents : Variations on covering with paths
Dereniowski, Dariusz ; Lingas, Andrzej ^LU ; Osula, Dorota ; Persson, Mia ^LU and Żyliński, Paweł (2019) In Journal of Computer and System Sciences 102. p.57-68
- Contribution to journal › Article
Mark Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases
Gasieniec, Leszek ; Jansson, Jesper ^LU ; Levcopoulos, Christos ^LU ; Lingas, Andrzej ^LU and Persson, Mia ^LU (2019) In Lecture Notes in Computer Science 11458. p.156-169
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2018
Mark Extreme Witnesses and Their Applications
Lingas, Andrzej ^LU and Persson, Mia ^LU (2018) In Algorithmica 80(12). p.3943-3957
- Contribution to journal › Article

« previous
1
2
3
next »