default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMagnus Bakke Botnan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Ulrich Bauer
, Magnus Bakke Botnan, Benedikt Fluhr:
Universal distances for extended persistence. J. Appl. Comput. Topol. 8(3): 475-530 (2024)- [j5]Magnus Bakke Botnan, Christian Hirsch:
On the consistency and asymptotic normality of multiparameter persistent Betti numbers. J. Appl. Comput. Topol. 8(6): 1465-1502 (2024) - [i13]Håvard Bakke Bjerkevik, Magnus Bakke Botnan:
Computing p-presentation distances is hard. CoRR abs/2403.07200 (2024) - 2023
- [c4]David Loiseaux, Luis Scoccola, Mathieu Carrière, Magnus Bakke Botnan, Steve Oudot:
Stable Vectorization of Multiparameter Persistent Homology using Signed Barcodes as Measures. NeurIPS 2023 - [i12]David Loiseaux, Luis Scoccola, Mathieu Carrière, Magnus Bakke Botnan, Steve Oudot:
Stable Vectorization of Multiparameter Persistent Homology using Signed Barcodes as Measures. CoRR abs/2306.03801 (2023) - 2022
- [j4]Magnus Bakke Botnan, Vadim Lebovici, Steve Oudot:
On Rectangle-Decomposable 2-Parameter Persistence Modules. Discret. Comput. Geom. 68(4): 1078-1101 (2022) - [c3]Magnus Bakke Botnan, Steffen Oppermann, Steve Oudot:
Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions. SoCG 2022: 19:1-19:18 - [i11]Magnus Bakke Botnan, Michael Lesnick:
An Introduction to Multiparameter Persistence. CoRR abs/2203.14289 (2022) - [i10]Magnus Bakke Botnan, Steffen Oppermann, Steve Oudot, Luis Scoccola:
On the bottleneck stability of rank decompositions of multi-parameter persistence modules. CoRR abs/2208.00300 (2022) - 2021
- [i9]Magnus Bakke Botnan, Steffen Oppermann, Steve Oudot:
Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions and Rank-Exact Resolutions. CoRR abs/2107.06800 (2021) - [i8]Ulrich Bauer, Magnus Bakke Botnan, Benedikt Fluhr:
Structure and Interleavings of Relative Interlevel Set Cohomology. CoRR abs/2108.09298 (2021) - 2020
- [j3]Håvard Bakke Bjerkevik, Magnus Bakke Botnan, Michael Kerber:
Computing the Interleaving Distance is NP-Hard. Found. Comput. Math. 20(5): 1237-1271 (2020) - [c2]Magnus Bakke Botnan, Vadim Lebovici, Steve Oudot:
On Rectangle-Decomposable 2-Parameter Persistence Modules. SoCG 2020: 22:1-22:16 - [i7]Magnus Bakke Botnan, Vadim Lebovici, Steve Oudot:
On rectangle-decomposable 2-parameter persistence modules. CoRR abs/2002.08894 (2020) - [i6]Magnus Bakke Botnan, Justin Curry, Elizabeth Munch:
A Relative Theory of Interleavings. CoRR abs/2004.14286 (2020) - [i5]Ulrich Bauer, Magnus Bakke Botnan, Benedikt Fluhr:
Universality of the Bottleneck Distance for Extended Persistence Diagrams. CoRR abs/2007.01834 (2020)
2010 – 2019
- 2018
- [c1]Håvard Bakke Bjerkevik, Magnus Bakke Botnan:
Computational Complexity of the Interleaving Distance. SoCG 2018: 13:1-13:15 - [i4]Håvard Bakke Bjerkevik, Magnus Bakke Botnan, Michael Kerber:
Computing the interleaving distance is NP-hard. CoRR abs/1811.09165 (2018) - 2017
- [i3]Håvard Bakke Bjerkevik, Magnus Bakke Botnan:
Computational Complexity of the Interleaving Distance. CoRR abs/1712.04281 (2017) - 2016
- [i2]Magnus Bakke Botnan, Michael Lesnick:
Algebraic Stability of Zigzag Persistence Modules. CoRR abs/1604.00655 (2016) - 2015
- [j2]Magnus Bakke Botnan, Gard Spreemann:
Approximating persistent homology in Euclidean space through collapses. Appl. Algebra Eng. Commun. Comput. 26(1-2): 73-101 (2015) - 2014
- [i1]Magnus Bakke Botnan, Gard Spreemann:
Approximating Persistent Homology in Euclidean Space Through Collapses. CoRR abs/1403.0533 (2014) - 2012
- [j1]Rongyue Zhang, Vasiliy Sachnev, Magnus Bakke Botnan, Hyoung Joong Kim, Jun Heo:
An Efficient Embedder for BCH Coding for Steganography. IEEE Trans. Inf. Theory 58(12): 7272-7279 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
