Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Ulrike Korte

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 Tomasz Kusber

> Home > Persons > Ulrike Korte

Publications

2022
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/dud/KusberSKE22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dud/KusberSKE22
Tomasz Kusber, Steffen Schwalm, Ulrike Korte, Mario Engel:
Langfristige Beweissicherheit und Vertrauenswürdigkeit digitaler Unterlagen. Datenschutz und Datensicherheit 46(1): 32-39 (2022)
2021
[c18]
- view
  - electronic edition @ gi.de
  - no references & citations available
- export record
  dblp key:
  - conf/openidentity/KusberSKS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/openidentity/KusberSKS21
Tomasz Kusber, Steffen Schwalm, Ulrike Korte, Kalinda Schamburger:
Records Management and Long-Term Preservation of Evidence in DLT. Open Identity Summit 2021: 131-142
2020
[c17]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/openidentity/KusberSSK20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/openidentity/KusberSSK20
Tomasz Kusber, Steffen Schwalm, Kalinda Shamburger, Ulrike Korte:
Criteria for trustworthy digital transactions - Blockchain/DLT between eI-DAS, GDPR, Data and Evidence Preservation. Open Identity Summit 2020: 49-60

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.