Magnus Bakke Botnan

Orcid: 0000-0002-7605-4422

According to our database1, Magnus Bakke Botnan authored at least 17 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the consistency and asymptotic normality of multiparameter persistent Betti numbers.
J. Appl. Comput. Topol., October, 2024

Universal distances for extended persistence.
J. Appl. Comput. Topol., September, 2024

Computing p-presentation distances is hard.
CoRR, 2024

2023
Stable Vectorization of Multiparameter Persistent Homology using Signed Barcodes as Measures.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
On Rectangle-Decomposable 2-Parameter Persistence Modules.
Discret. Comput. Geom., 2022

On the bottleneck stability of rank decompositions of multi-parameter persistence modules.
CoRR, 2022

An Introduction to Multiparameter Persistence.
CoRR, 2022

Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Structure and Interleavings of Relative Interlevel Set Cohomology.
CoRR, 2021

Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions and Rank-Exact Resolutions.
CoRR, 2021

2020
Computing the Interleaving Distance is NP-Hard.
Found. Comput. Math., 2020

Universality of the Bottleneck Distance for Extended Persistence Diagrams.
CoRR, 2020

A Relative Theory of Interleavings.
CoRR, 2020

2018
Computational Complexity of the Interleaving Distance.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2016
Algebraic Stability of Zigzag Persistence Modules.
CoRR, 2016

2015
Approximating persistent homology in Euclidean space through collapses.
Appl. Algebra Eng. Commun. Comput., 2015

2012
An Efficient Embedder for BCH Coding for Steganography.
IEEE Trans. Inf. Theory, 2012


  Loading...