BibTeX records: Håvard Bakke Bjerkevik

download as .bib file

@article{DBLP:journals/corr/abs-2403-07200,
  author       = {H{\aa}vard Bakke Bjerkevik and
                  Magnus Bakke Botnan},
  title        = {Computing p-presentation distances is hard},
  journal      = {CoRR},
  volume       = {abs/2403.07200},
  year         = {2024},
  url          = {https://doi.org/10.48550/arXiv.2403.07200},
  doi          = {10.48550/ARXIV.2403.07200},
  eprinttype    = {arXiv},
  eprint       = {2403.07200},
  timestamp    = {Thu, 04 Apr 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2403-07200.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/compgeom/Bjerkevik22,
  author       = {H{\aa}vard Bakke Bjerkevik},
  editor       = {Xavier Goaoc and
                  Michael Kerber},
  title        = {Tighter Bounds for Reconstruction from {\(\epsilon\)}-Samples},
  booktitle    = {38th International Symposium on Computational Geometry, SoCG 2022,
                  June 7-10, 2022, Berlin, Germany},
  series       = {LIPIcs},
  volume       = {224},
  pages        = {9:1--9:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2022.9},
  doi          = {10.4230/LIPICS.SOCG.2022.9},
  timestamp    = {Wed, 01 Jun 2022 16:45:26 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/Bjerkevik22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/compgeom/BauerBF22,
  author       = {Ulrich Bauer and
                  H{\aa}vard Bakke Bjerkevik and
                  Benedikt Fluhr},
  editor       = {Xavier Goaoc and
                  Michael Kerber},
  title        = {Quasi-Universality of Reeb Graph Distances},
  booktitle    = {38th International Symposium on Computational Geometry, SoCG 2022,
                  June 7-10, 2022, Berlin, Germany},
  series       = {LIPIcs},
  volume       = {224},
  pages        = {14:1--14:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2022.14},
  doi          = {10.4230/LIPICS.SOCG.2022.14},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/compgeom/BauerBF22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcg/Bjerkevik21,
  author       = {H{\aa}vard Bakke Bjerkevik},
  title        = {On the Stability of Interval Decomposable Persistence Modules},
  journal      = {Discret. Comput. Geom.},
  volume       = {66},
  number       = {1},
  pages        = {92--121},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00454-021-00298-0},
  doi          = {10.1007/S00454-021-00298-0},
  timestamp    = {Tue, 13 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcg/Bjerkevik21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2106-13589,
  author       = {H{\aa}vard Bakke Bjerkevik and
                  Michael Lesnick},
  title        = {{\unicode{120001}}\({}^{\mbox{p}}\)-Distances on Multiparameter Persistence
                  Modules},
  journal      = {CoRR},
  volume       = {abs/2106.13589},
  year         = {2021},
  url          = {https://arxiv.org/abs/2106.13589},
  eprinttype    = {arXiv},
  eprint       = {2106.13589},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2106-13589.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2111-10303,
  author       = {H{\aa}vard Bakke Bjerkevik and
                  Michael Kerber},
  title        = {Asymptotic Improvements on the Exact Matching Distance for 2-parameter
                  Persistence},
  journal      = {CoRR},
  volume       = {abs/2111.10303},
  year         = {2021},
  url          = {https://arxiv.org/abs/2111.10303},
  eprinttype    = {arXiv},
  eprint       = {2111.10303},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2111-10303.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2112-00720,
  author       = {Ulrich Bauer and
                  H{\aa}vard Bakke Bjerkevik and
                  Benedikt Fluhr},
  title        = {Quasi-universality of Reeb graph distances},
  journal      = {CoRR},
  volume       = {abs/2112.00720},
  year         = {2021},
  url          = {https://arxiv.org/abs/2112.00720},
  eprinttype    = {arXiv},
  eprint       = {2112.00720},
  timestamp    = {Wed, 08 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2112-00720.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2112-03656,
  author       = {H{\aa}vard Bakke Bjerkevik},
  title        = {Tighter bounds for reconstruction from {\(\epsilon\)}-samples},
  journal      = {CoRR},
  volume       = {abs/2112.03656},
  year         = {2021},
  url          = {https://arxiv.org/abs/2112.03656},
  eprinttype    = {arXiv},
  eprint       = {2112.03656},
  timestamp    = {Mon, 13 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2112-03656.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/focm/BjerkevikBK20,
  author       = {H{\aa}vard Bakke Bjerkevik and
                  Magnus Bakke Botnan and
                  Michael Kerber},
  title        = {Computing the Interleaving Distance is NP-Hard},
  journal      = {Found. Comput. Math.},
  volume       = {20},
  number       = {5},
  pages        = {1237--1271},
  year         = {2020},
  url          = {https://doi.org/10.1007/s10208-019-09442-y},
  doi          = {10.1007/S10208-019-09442-Y},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/focm/BjerkevikBK20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/compgeom/BjerkevikB18,
  author       = {H{\aa}vard Bakke Bjerkevik and
                  Magnus Bakke Botnan},
  editor       = {Bettina Speckmann and
                  Csaba D. T{\'{o}}th},
  title        = {Computational Complexity of the Interleaving Distance},
  booktitle    = {34th International Symposium on Computational Geometry, SoCG 2018,
                  June 11-14, 2018, Budapest, Hungary},
  series       = {LIPIcs},
  volume       = {99},
  pages        = {13:1--13:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2018.13},
  doi          = {10.4230/LIPICS.SOCG.2018.13},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/compgeom/BjerkevikB18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1811-09165,
  author       = {H{\aa}vard Bakke Bjerkevik and
                  Magnus Bakke Botnan and
                  Michael Kerber},
  title        = {Computing the interleaving distance is NP-hard},
  journal      = {CoRR},
  volume       = {abs/1811.09165},
  year         = {2018},
  url          = {http://arxiv.org/abs/1811.09165},
  eprinttype    = {arXiv},
  eprint       = {1811.09165},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1811-09165.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1712-04281,
  author       = {H{\aa}vard Bakke Bjerkevik and
                  Magnus Bakke Botnan},
  title        = {Computational Complexity of the Interleaving Distance},
  journal      = {CoRR},
  volume       = {abs/1712.04281},
  year         = {2017},
  url          = {http://arxiv.org/abs/1712.04281},
  eprinttype    = {arXiv},
  eprint       = {1712.04281},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1712-04281.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Bjerkevik16,
  author       = {H{\aa}vard Bakke Bjerkevik},
  title        = {Stability of higher-dimensional interval decomposable persistence
                  modules},
  journal      = {CoRR},
  volume       = {abs/1609.02086},
  year         = {2016},
  url          = {http://arxiv.org/abs/1609.02086},
  eprinttype    = {arXiv},
  eprint       = {1609.02086},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Bjerkevik16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.