Jan Carlson

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 Jukka Mäki-Turja

> Home > Persons > Jan Carlson

Publications

2011
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/euromicro/MubeenMSC11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/euromicro/MubeenMSC11
Saad Mubeen, Jukka Mäki-Turja, Mikael Sjödin, Jan Carlson:
Analyzable Modeling of Legacy Communication in Component-Based Distributed Embedded Systems. EUROMICRO-SEAA 2011: 229-238
2010
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/euromicro/CarlsonFMS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/euromicro/CarlsonFMS10
Jan Carlson, Juraj Feljan, Jukka Mäki-Turja, Mikael Sjödin:
Deployment Modelling and Synthesis in a Component Model for Distributed Embedded Systems. EUROMICRO-SEAA 2010: 74-82
2008
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/ecrts/BohlinHMCN08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ecrts/BohlinHMCN08
Markus Bohlin, Kaj Hänninen, Jukka Mäki-Turja, Jan Carlson, Mikael Nolin:
Bounding Shared-Stack Usage in Systems with Offsets and Precedences. ECRTS 2008: 276-285
2006
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/rtss/HanninenMBCN06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rtss/HanninenMBCN06
Kaj Hänninen, Jukka Mäki-Turja, Markus Bohlin, Jan Carlson, Mikael Nolin:
Determining Maximum Stack Usage in Preemptive Shared Stack Systems. RTSS 2006: 445-453

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.