Ekkart Kindler

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 Tijs Slaats

> Home > Persons > Ekkart Kindler

Publications

2023
[j24]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/eswa/AndaloussiBSKW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eswa/AndaloussiBSKW23
Amine Abbad Andaloussi, Andrea Burattin, Tijs Slaats, Ekkart Kindler, Barbara Weber:
Complexity in declarative process models: Metrics and multi-modal assessment of cognitive load. Expert Syst. Appl. 233: 120924 (2023)
2021
[j23]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/emisa/AndaloussiBSKW21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/emisa/AndaloussiBSKW21
Amine Abbad Andaloussi, Andrea Burattin, Tijs Slaats, Ekkart Kindler, Barbara Weber:
On the Declarative Paradigm in Hybrid Business Process Representations: A Conceptual Framework and a Systematic Literature Study (Extended Abstract). EMISA Forum 41(1): 19-20 (2021)
2020
[j22]
- view
  authority control:
- export record
  dblp key:
  - journals/is/AndaloussiBSKW20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/is/AndaloussiBSKW20
Amine Abbad Andaloussi, Andrea Burattin, Tijs Slaats, Ekkart Kindler, Barbara Weber:
On the declarative paradigm in hybrid business process representations: A conceptual framework and a systematic literature study. Inf. Syst. 91: 101505 (2020)

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.