Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Jens Teubner

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Christian Hakert

> Home > Persons > Jens Teubner

Publications

2023
[c52]
- view
  authority control:
- export record
  dblp key:
  - conf/damon/KuhnBHCT23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/damon/KuhnBHCT23
Roland Kühn, Daniel Biebert, Christian Hakert, Jian-Jia Chen, Jens Teubner:
Towards Data-Based Cache Optimization of B+-Trees. DaMoN 2023: 63-69
2021
[c51]
- view
  authority control:
- export record
  dblp key:
  - conf/nvmsa/HakertKCCT21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nvmsa/HakertKCCT21
Christian Hakert, Roland Kühn, Kuan-Hsun Chen, Jian-Jia Chen, Jens Teubner:
OCTO+: Optimized Checkpointing of B+ Trees for Non-Volatile Main Memory Wear-Leveling. NVMSA 2021: 1-6
2019
[c43]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/btw/LindemannBDHHMM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/btw/LindemannBDHHMM19
Thomas Lindemann, Patrick Brinkmann, Fadi Dalbah, Christian Hakert, Philipp-Jan Honysz, Daniel Matuszczyk, Nikolas Müller, Alexander Schmulbach, Stefan Petyov Todorinski, Oliver Tüselmann, Shimon Wonsak, Jens Teubner:
MAGPIE: Scalable Data Storage System for Efficient High Volume Data Queries. BTW 2019: 543-546

a service of

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.