Kai Strunz

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 Gabriele Michalke

> Home > Persons > Kai Strunz

Publications

2024
[j23]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tr/BreveBMKS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tr/BreveBMKS24
Matheus Montanini Breve, Bernd Bohnet, Gabriele Michalke, Julia Kowal, Kai Strunz:
Flow-Network-Based Method for the Reliability Analysis of Decentralized Power System Topologies With a Sequential Monte-Carlo Simulation. IEEE Trans. Reliab. 73(2): 1005-1019 (2024)
2023
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/isgteurope/BreveMBKS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isgteurope/BreveMBKS23
Matheus Montanini Breve, Gabriele Michalke, Bernd Bohnet, Julia Kowal, Kai Strunz:
Improved redundancy of an islanded microgrid via seamless transition between operation modes. ISGT EUROPE 2023: 1-5
2022
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/icsrs/BreveMBKS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icsrs/BreveMBKS22
Matheus Montanini Breve, Gabriele Michalke, Bernd Bohnet, Julia Kowal, Kai Strunz:
Sensitivity Analysis of the Availability of an Islanded Microgrid with a Sequential Monte-Carlo Simulation. ICSRS 2022: 157-162

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.