---
_id: '26190'
abstract:
- lang: eng
  text: A major goal of the On-The-Fly Computing project is the automated composition
    of individual services based on services that are available in dynamic markets.
    Dependent on the granularity of a market, different alternatives that satisfy
    the requested functional requirements may emerge. In order to select the best
    solution, services are usually selected with respect to their quality in terms
    of inherent non-functional properties. In this paper, we describe our idea of
    how to model this service selection process as a Markov Decision Process, which
    we in turn intend to solve by means of Reinforcement Learning techniques in order
    to control the underlying service composition process. In addition, some initial
    issues with respect to our approach are addressed.
author:
- first_name: Alexander
  full_name: Jungmann, Alexander
  last_name: Jungmann
- first_name: Bernd
  full_name: Kleinjohann, Bernd
  last_name: Kleinjohann
citation:
  ama: 'Jungmann A, Kleinjohann B. Towards the Application of Reinforcement Learning
    Techniques for Quality-Based Service Selection in Automated Service Composition.
    In: <i>Proceedings of the 9th IEEE International Conference on Services Computing
    (SCC)</i>. IEEE; 2012.'
  apa: Jungmann, A., &#38; Kleinjohann, B. (2012). Towards the Application of Reinforcement
    Learning Techniques for Quality-Based Service Selection in Automated Service Composition.
    <i>Proceedings of the 9th IEEE International Conference on Services Computing
    (SCC)</i>.
  bibtex: '@inproceedings{Jungmann_Kleinjohann_2012, title={Towards the Application
    of Reinforcement Learning Techniques for Quality-Based Service Selection in Automated
    Service Composition}, booktitle={Proceedings of the 9th IEEE International Conference
    on Services Computing (SCC)}, publisher={IEEE}, author={Jungmann, Alexander and
    Kleinjohann, Bernd}, year={2012} }'
  chicago: Jungmann, Alexander, and Bernd Kleinjohann. “Towards the Application of
    Reinforcement Learning Techniques for Quality-Based Service Selection in Automated
    Service Composition.” In <i>Proceedings of the 9th IEEE International Conference
    on Services Computing (SCC)</i>. IEEE, 2012.
  ieee: A. Jungmann and B. Kleinjohann, “Towards the Application of Reinforcement
    Learning Techniques for Quality-Based Service Selection in Automated Service Composition,”
    2012.
  mla: Jungmann, Alexander, and Bernd Kleinjohann. “Towards the Application of Reinforcement
    Learning Techniques for Quality-Based Service Selection in Automated Service Composition.”
    <i>Proceedings of the 9th IEEE International Conference on Services Computing
    (SCC)</i>, IEEE, 2012.
  short: 'A. Jungmann, B. Kleinjohann, in: Proceedings of the 9th IEEE International
    Conference on Services Computing (SCC), IEEE, 2012.'
date_created: 2021-10-15T07:52:47Z
date_updated: 2022-01-06T06:57:17Z
department:
- _id: '672'
language:
- iso: eng
publication: Proceedings of the 9th IEEE International Conference on Services Computing
  (SCC)
publisher: IEEE
status: public
title: Towards the Application of Reinforcement Learning Techniques for Quality-Based
  Service Selection in Automated Service Composition
type: conference
user_id: '21240'
year: '2012'
...
---
_id: '26212'
author:
- first_name: Yara
  full_name: Khaluf, Yara
  last_name: Khaluf
- first_name: Fabian
  full_name: Weiss, Fabian
  last_name: Weiss
- first_name: Sebastian
  full_name: Micus, Sebastian
  last_name: Micus
citation:
  ama: 'Khaluf Y, Weiss F, Micus S. Master Election for Time Synchronization in Swarm
    Robotic Systems. In: <i>The 10th IEEE International Symposium on Parallel and
    Distributed Processing with Applications</i>. ; 2012.'
  apa: Khaluf, Y., Weiss, F., &#38; Micus, S. (2012). Master Election for Time Synchronization
    in Swarm Robotic Systems. <i>The 10th IEEE International Symposium on Parallel
    and Distributed Processing with Applications</i>.
  bibtex: '@inproceedings{Khaluf_Weiss_Micus_2012, place={ Leganés, Madrid}, title={Master
    Election for Time Synchronization in Swarm Robotic Systems}, booktitle={The 10th
    IEEE International Symposium on Parallel and Distributed Processing with Applications},
    author={Khaluf, Yara and Weiss, Fabian and Micus, Sebastian}, year={2012} }'
  chicago: Khaluf, Yara, Fabian Weiss, and Sebastian Micus. “Master Election for Time
    Synchronization in Swarm Robotic Systems.” In <i>The 10th IEEE International Symposium
    on Parallel and Distributed Processing with Applications</i>.  Leganés, Madrid,
    2012.
  ieee: Y. Khaluf, F. Weiss, and S. Micus, “Master Election for Time Synchronization
    in Swarm Robotic Systems,” 2012.
  mla: Khaluf, Yara, et al. “Master Election for Time Synchronization in Swarm Robotic
    Systems.” <i>The 10th IEEE International Symposium on Parallel and Distributed
    Processing with Applications</i>, 2012.
  short: 'Y. Khaluf, F. Weiss, S. Micus, in: The 10th IEEE International Symposium
    on Parallel and Distributed Processing with Applications,  Leganés, Madrid, 2012.'
date_created: 2021-10-15T09:16:19Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '672'
language:
- iso: eng
place: ' Leganés, Madrid'
publication: The 10th IEEE International Symposium on Parallel and Distributed Processing
  with Applications
status: public
title: Master Election for Time Synchronization in Swarm Robotic Systems
type: conference
user_id: '21240'
year: '2012'
...
---
_id: '26264'
author:
- first_name: Emi
  full_name: Mathews, Emi
  last_name: Mathews
- first_name: Ciby
  full_name: Mathew, Ciby
  last_name: Mathew
citation:
  ama: 'Mathews E, Mathew C. Connectivity of Autonomous Agents Using Ad-hoc Mobile
    Router Networks. In: <i>Third International Conference on Networks &#38; Communications,
    LNICST</i>. Springer; 2012.'
  apa: Mathews, E., &#38; Mathew, C. (2012). Connectivity of Autonomous Agents Using
    Ad-hoc Mobile Router Networks. <i>Third International Conference on Networks &#38;
    Communications, LNICST</i>.
  bibtex: '@inproceedings{Mathews_Mathew_2012, place={Bangalore, India}, title={Connectivity
    of Autonomous Agents Using Ad-hoc Mobile Router Networks}, booktitle={Third International
    Conference on Networks &#38; Communications, LNICST}, publisher={Springer}, author={Mathews,
    Emi and Mathew, Ciby}, year={2012} }'
  chicago: 'Mathews, Emi, and Ciby Mathew. “Connectivity of Autonomous Agents Using
    Ad-Hoc Mobile Router Networks.” In <i>Third International Conference on Networks
    &#38; Communications, LNICST</i>. Bangalore, India: Springer, 2012.'
  ieee: E. Mathews and C. Mathew, “Connectivity of Autonomous Agents Using Ad-hoc
    Mobile Router Networks,” 2012.
  mla: Mathews, Emi, and Ciby Mathew. “Connectivity of Autonomous Agents Using Ad-Hoc
    Mobile Router Networks.” <i>Third International Conference on Networks &#38; Communications,
    LNICST</i>, Springer, 2012.
  short: 'E. Mathews, C. Mathew, in: Third International Conference on Networks &#38;
    Communications, LNICST, Springer, Bangalore, India, 2012.'
date_created: 2021-10-15T11:20:32Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '672'
language:
- iso: eng
place: Bangalore, India
publication: Third International Conference on Networks & Communications, LNICST
publisher: Springer
status: public
title: Connectivity of Autonomous Agents Using Ad-hoc Mobile Router Networks
type: conference
user_id: '21240'
year: '2012'
...
---
_id: '3812'
author:
- first_name: Henning
  full_name: Wachsmuth, Henning
  id: '3900'
  last_name: Wachsmuth
- first_name: Benno
  full_name: Stein, Benno
  last_name: Stein
citation:
  ama: 'Wachsmuth H, Stein B. Optimal Scheduling of Information Extraction Algorithms.
    In: <i>Proceedings of COLING 2012: Posters</i>. ; 2012:1281-1290.'
  apa: 'Wachsmuth, H., &#38; Stein, B. (2012). Optimal Scheduling of Information Extraction
    Algorithms. In <i>Proceedings of COLING 2012: Posters</i> (pp. 1281–1290).'
  bibtex: '@inproceedings{Wachsmuth_Stein_2012, title={Optimal Scheduling of Information
    Extraction Algorithms}, booktitle={Proceedings of COLING 2012: Posters}, author={Wachsmuth,
    Henning and Stein, Benno}, year={2012}, pages={1281–1290} }'
  chicago: 'Wachsmuth, Henning, and Benno Stein. “Optimal Scheduling of Information
    Extraction Algorithms.” In <i>Proceedings of COLING 2012: Posters</i>, 1281–90,
    2012.'
  ieee: 'H. Wachsmuth and B. Stein, “Optimal Scheduling of Information Extraction
    Algorithms,” in <i>Proceedings of COLING 2012: Posters</i>, 2012, pp. 1281–1290.'
  mla: 'Wachsmuth, Henning, and Benno Stein. “Optimal Scheduling of Information Extraction
    Algorithms.” <i>Proceedings of COLING 2012: Posters</i>, 2012, pp. 1281–90.'
  short: 'H. Wachsmuth, B. Stein, in: Proceedings of COLING 2012: Posters, 2012, pp.
    1281–1290.'
date_created: 2018-08-02T13:38:37Z
date_updated: 2022-01-06T06:59:37Z
department:
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/C12-2125.pdf
page: 1281-1290
publication: 'Proceedings of COLING 2012: Posters'
status: public
title: Optimal Scheduling of Information Extraction Algorithms
type: conference
user_id: '82920'
year: '2012'
...
---
_id: '2918'
author:
- first_name: Saqib
  full_name: Kakvi, Saqib
  id: '66268'
  last_name: Kakvi
- first_name: Eike
  full_name: Kiltz, Eike
  last_name: Kiltz
- first_name: Alexander
  full_name: May, Alexander
  last_name: May
citation:
  ama: 'Kakvi S, Kiltz E, May A. Certifying RSA. In: <i>Advances in Cryptology – ASIACRYPT
    2012</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:404-414. doi:<a
    href="https://doi.org/10.1007/978-3-642-34961-4_25">10.1007/978-3-642-34961-4_25</a>'
  apa: 'Kakvi, S., Kiltz, E., &#38; May, A. (2012). Certifying RSA. In <i>Advances
    in Cryptology – ASIACRYPT 2012</i> (pp. 404–414). Berlin, Heidelberg: Springer
    Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-642-34961-4_25">https://doi.org/10.1007/978-3-642-34961-4_25</a>'
  bibtex: '@inbook{Kakvi_Kiltz_May_2012, place={Berlin, Heidelberg}, title={Certifying
    RSA}, DOI={<a href="https://doi.org/10.1007/978-3-642-34961-4_25">10.1007/978-3-642-34961-4_25</a>},
    booktitle={Advances in Cryptology – ASIACRYPT 2012}, publisher={Springer Berlin
    Heidelberg}, author={Kakvi, Saqib and Kiltz, Eike and May, Alexander}, year={2012},
    pages={404–414} }'
  chicago: 'Kakvi, Saqib, Eike Kiltz, and Alexander May. “Certifying RSA.” In <i>Advances
    in Cryptology – ASIACRYPT 2012</i>, 404–14. Berlin, Heidelberg: Springer Berlin
    Heidelberg, 2012. <a href="https://doi.org/10.1007/978-3-642-34961-4_25">https://doi.org/10.1007/978-3-642-34961-4_25</a>.'
  ieee: 'S. Kakvi, E. Kiltz, and A. May, “Certifying RSA,” in <i>Advances in Cryptology
    – ASIACRYPT 2012</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp.
    404–414.'
  mla: Kakvi, Saqib, et al. “Certifying RSA.” <i>Advances in Cryptology – ASIACRYPT
    2012</i>, Springer Berlin Heidelberg, 2012, pp. 404–14, doi:<a href="https://doi.org/10.1007/978-3-642-34961-4_25">10.1007/978-3-642-34961-4_25</a>.
  short: 'S. Kakvi, E. Kiltz, A. May, in: Advances in Cryptology – ASIACRYPT 2012,
    Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 404–414.'
date_created: 2018-05-25T12:34:06Z
date_updated: 2022-01-06T06:58:47Z
department:
- _id: '558'
doi: 10.1007/978-3-642-34961-4_25
extern: '1'
page: 404-414
place: Berlin, Heidelberg
publication: Advances in Cryptology – ASIACRYPT 2012
publication_identifier:
  isbn:
  - '9783642349607'
  - '9783642349614'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Certifying RSA
type: book_chapter
user_id: '25078'
year: '2012'
...
---
_id: '2919'
author:
- first_name: Saqib
  full_name: Kakvi, Saqib
  id: '66268'
  last_name: Kakvi
- first_name: Eike
  full_name: Kiltz, Eike
  last_name: Kiltz
citation:
  ama: 'Kakvi S, Kiltz E. Optimal Security Proofs for Full Domain Hash, Revisited.
    In: <i>Advances in Cryptology – EUROCRYPT 2012</i>. Berlin, Heidelberg: Springer
    Berlin Heidelberg; 2012:537-553. doi:<a href="https://doi.org/10.1007/978-3-642-29011-4_32">10.1007/978-3-642-29011-4_32</a>'
  apa: 'Kakvi, S., &#38; Kiltz, E. (2012). Optimal Security Proofs for Full Domain
    Hash, Revisited. In <i>Advances in Cryptology – EUROCRYPT 2012</i> (pp. 537–553).
    Berlin, Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-642-29011-4_32">https://doi.org/10.1007/978-3-642-29011-4_32</a>'
  bibtex: '@inbook{Kakvi_Kiltz_2012, place={Berlin, Heidelberg}, title={Optimal Security
    Proofs for Full Domain Hash, Revisited}, DOI={<a href="https://doi.org/10.1007/978-3-642-29011-4_32">10.1007/978-3-642-29011-4_32</a>},
    booktitle={Advances in Cryptology – EUROCRYPT 2012}, publisher={Springer Berlin
    Heidelberg}, author={Kakvi, Saqib and Kiltz, Eike}, year={2012}, pages={537–553}
    }'
  chicago: 'Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain
    Hash, Revisited.” In <i>Advances in Cryptology – EUROCRYPT 2012</i>, 537–53. Berlin,
    Heidelberg: Springer Berlin Heidelberg, 2012. <a href="https://doi.org/10.1007/978-3-642-29011-4_32">https://doi.org/10.1007/978-3-642-29011-4_32</a>.'
  ieee: 'S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,”
    in <i>Advances in Cryptology – EUROCRYPT 2012</i>, Berlin, Heidelberg: Springer
    Berlin Heidelberg, 2012, pp. 537–553.'
  mla: Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash,
    Revisited.” <i>Advances in Cryptology – EUROCRYPT 2012</i>, Springer Berlin Heidelberg,
    2012, pp. 537–53, doi:<a href="https://doi.org/10.1007/978-3-642-29011-4_32">10.1007/978-3-642-29011-4_32</a>.
  short: 'S. Kakvi, E. Kiltz, in: Advances in Cryptology – EUROCRYPT 2012, Springer
    Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 537–553.'
date_created: 2018-05-25T12:36:44Z
date_updated: 2022-01-06T06:58:47Z
department:
- _id: '558'
doi: 10.1007/978-3-642-29011-4_32
extern: '1'
main_file_link:
- url: https://doi.org/10.1007/s00145-017-9257-9
page: 537-553
place: Berlin, Heidelberg
publication: Advances in Cryptology – EUROCRYPT 2012
publication_identifier:
  isbn:
  - '9783642290107'
  - '9783642290114'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Optimal Security Proofs for Full Domain Hash, Revisited
type: book_chapter
user_id: '66268'
year: '2012'
...
---
_id: '2982'
author:
- first_name: Marcel Rudolf
  full_name: Ackermann, Marcel Rudolf
  last_name: Ackermann
- first_name: Marcus
  full_name: Märtens, Marcus
  last_name: Märtens
- first_name: Christoph
  full_name: Raupach, Christoph
  last_name: Raupach
- first_name: Kamil
  full_name: Swierkot, Kamil
  last_name: Swierkot
- first_name: Christiane
  full_name: Lammersen, Christiane
  last_name: Lammersen
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
citation:
  ama: 'Ackermann MR, Märtens M, Raupach C, Swierkot K, Lammersen C, Sohler C. StreamKM++:
    A clustering algorithm for data streams. 2012;17. doi:<a href="https://doi.org/10.1145/2133803.2184450">10.1145/2133803.2184450</a>'
  apa: 'Ackermann, M. R., Märtens, M., Raupach, C., Swierkot, K., Lammersen, C., &#38;
    Sohler, C. (2012). StreamKM++: A clustering algorithm for data streams. New York,
    NY, USA: ACM. <a href="https://doi.org/10.1145/2133803.2184450">https://doi.org/10.1145/2133803.2184450</a>'
  bibtex: '@article{Ackermann_Märtens_Raupach_Swierkot_Lammersen_Sohler_2012, place={New
    York, NY, USA}, series={ACM Journal of Experimental Algorithmics}, title={StreamKM++:
    A clustering algorithm for data streams}, volume={17}, DOI={<a href="https://doi.org/10.1145/2133803.2184450">10.1145/2133803.2184450</a>},
    publisher={ACM}, author={Ackermann, Marcel Rudolf and Märtens, Marcus and Raupach,
    Christoph and Swierkot, Kamil and Lammersen, Christiane and Sohler, Christian},
    year={2012}, collection={ACM Journal of Experimental Algorithmics} }'
  chicago: 'Ackermann, Marcel Rudolf, Marcus Märtens, Christoph Raupach, Kamil Swierkot,
    Christiane Lammersen, and Christian Sohler. “StreamKM++: A Clustering Algorithm
    for Data Streams.” ACM Journal of Experimental Algorithmics. New York, NY, USA:
    ACM, 2012. <a href="https://doi.org/10.1145/2133803.2184450">https://doi.org/10.1145/2133803.2184450</a>.'
  ieee: 'M. R. Ackermann, M. Märtens, C. Raupach, K. Swierkot, C. Lammersen, and C.
    Sohler, “StreamKM++: A clustering algorithm for data streams,” vol. 17. ACM, New
    York, NY, USA, 2012.'
  mla: 'Ackermann, Marcel Rudolf, et al. <i>StreamKM++: A Clustering Algorithm for
    Data Streams</i>. Vol. 17, ACM, 2012, doi:<a href="https://doi.org/10.1145/2133803.2184450">10.1145/2133803.2184450</a>.'
  short: M.R. Ackermann, M. Märtens, C. Raupach, K. Swierkot, C. Lammersen, C. Sohler,
    17 (2012).
date_created: 2018-06-05T07:41:14Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1145/2133803.2184450
intvolume: '        17'
place: New York, NY, USA
publication_status: published
publisher: ACM
series_title: ACM Journal of Experimental Algorithmics
status: public
title: 'StreamKM++: A clustering algorithm for data streams'
type: conference
user_id: '25078'
volume: 17
year: '2012'
...
---
_id: '2984'
abstract:
- lang: eng
  text: 'Ich beschreibe die deutsche Enigma-VerschlÃ¼sselungsmaschine und skizziere,
    wie sie von den Codebrechern von Bletchely Park um Alan Turing gebrochen wurde.
    Besonderes Augenmerk lege ich auf die BeitrÃ¤ge Alan Turings und die Bedeutung
    seiner Leistung fÃ¼r die Entwicklung moderner Kryptografie. '
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
citation:
  ama: Blömer J. Turing und Kryptografie. <i>Informatik-Spektrum</i>. 2012;35(4).
    doi:<a href="https://doi.org/10.1007/s00287-012-0622-7">10.1007/s00287-012-0622-7</a>
  apa: Blömer, J. (2012). Turing und Kryptografie. <i>Informatik-Spektrum</i>, <i>35</i>(4).
    <a href="https://doi.org/10.1007/s00287-012-0622-7">https://doi.org/10.1007/s00287-012-0622-7</a>
  bibtex: '@article{Blömer_2012, title={Turing und Kryptografie}, volume={35}, DOI={<a
    href="https://doi.org/10.1007/s00287-012-0622-7">10.1007/s00287-012-0622-7</a>},
    number={4}, journal={Informatik-Spektrum}, author={Blömer, Johannes}, year={2012}
    }'
  chicago: Blömer, Johannes. “Turing Und Kryptografie.” <i>Informatik-Spektrum</i>
    35, no. 4 (2012). <a href="https://doi.org/10.1007/s00287-012-0622-7">https://doi.org/10.1007/s00287-012-0622-7</a>.
  ieee: J. Blömer, “Turing und Kryptografie,” <i>Informatik-Spektrum</i>, vol. 35,
    no. 4, 2012.
  mla: Blömer, Johannes. “Turing Und Kryptografie.” <i>Informatik-Spektrum</i>, vol.
    35, no. 4, 2012, doi:<a href="https://doi.org/10.1007/s00287-012-0622-7">10.1007/s00287-012-0622-7</a>.
  short: J. Blömer, Informatik-Spektrum 35 (2012).
date_created: 2018-06-05T07:42:38Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/s00287-012-0622-7
intvolume: '        35'
issue: '4'
language:
- iso: eng
publication: Informatik-Spektrum
publication_identifier:
  issn:
  - 1432-122X
publication_status: published
quality_controlled: '1'
status: public
title: Turing und Kryptografie
type: journal_article
user_id: '25078'
volume: 35
year: '2012'
...
---
_id: '3132'
author:
- first_name: Tibor
  full_name: Jager, Tibor
  id: '64669'
  last_name: Jager
citation:
  ama: Jager T. <i>On Black-Box Models of Computation in Cryptology</i>. Ruhr University
    Bochum; 2012.
  apa: Jager, T. (2012). <i>On black-box models of computation in cryptology</i>.
    Ruhr University Bochum.
  bibtex: '@book{Jager_2012, title={On black-box models of computation in cryptology},
    publisher={Ruhr University Bochum}, author={Jager, Tibor}, year={2012} }'
  chicago: Jager, Tibor. <i>On Black-Box Models of Computation in Cryptology</i>.
    Ruhr University Bochum, 2012.
  ieee: T. Jager, <i>On black-box models of computation in cryptology</i>. Ruhr University
    Bochum, 2012.
  mla: Jager, Tibor. <i>On Black-Box Models of Computation in Cryptology</i>. Ruhr
    University Bochum, 2012.
  short: T. Jager, On Black-Box Models of Computation in Cryptology, Ruhr University
    Bochum, 2012.
date_created: 2018-06-07T09:25:35Z
date_updated: 2022-01-06T06:58:58Z
department:
- _id: '558'
extern: '1'
publication_identifier:
  isbn:
  - 978-3-8348-1989-5
publisher: Ruhr University Bochum
status: public
title: On black-box models of computation in cryptology
type: dissertation
user_id: '38235'
year: '2012'
...
---
_id: '3133'
author:
- first_name: Tibor
  full_name: Jager, Tibor
  id: '64669'
  last_name: Jager
- first_name: Florian
  full_name: Kohlar, Florian
  last_name: Kohlar
- first_name: Sven
  full_name: Schäge, Sven
  last_name: Schäge
- first_name: Jörg
  full_name: Schwenk, Jörg
  last_name: Schwenk
citation:
  ama: 'Jager T, Kohlar F, Schäge S, Schwenk J. On the Security of TLS-DHE in the
    Standard Model. In: <i>Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology
    Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings</i>. ; 2012:273--293.
    doi:<a href="https://doi.org/10.1007/978-3-642-32009-5_17">10.1007/978-3-642-32009-5_17</a>'
  apa: Jager, T., Kohlar, F., Schäge, S., &#38; Schwenk, J. (2012). On the Security
    of TLS-DHE in the Standard Model. In <i>Advances in Cryptology - CRYPTO 2012 -
    32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012.
    Proceedings</i> (pp. 273--293). <a href="https://doi.org/10.1007/978-3-642-32009-5_17">https://doi.org/10.1007/978-3-642-32009-5_17</a>
  bibtex: '@inproceedings{Jager_Kohlar_Schäge_Schwenk_2012, title={On the Security
    of TLS-DHE in the Standard Model}, DOI={<a href="https://doi.org/10.1007/978-3-642-32009-5_17">10.1007/978-3-642-32009-5_17</a>},
    booktitle={Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference,
    Santa Barbara, CA, USA, August 19-23, 2012. Proceedings}, author={Jager, Tibor
    and Kohlar, Florian and Schäge, Sven and Schwenk, Jörg}, year={2012}, pages={273--293}
    }'
  chicago: Jager, Tibor, Florian Kohlar, Sven Schäge, and Jörg Schwenk. “On the Security
    of TLS-DHE in the Standard Model.” In <i>Advances in Cryptology - CRYPTO 2012
    - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012.
    Proceedings</i>, 273--293, 2012. <a href="https://doi.org/10.1007/978-3-642-32009-5_17">https://doi.org/10.1007/978-3-642-32009-5_17</a>.
  ieee: T. Jager, F. Kohlar, S. Schäge, and J. Schwenk, “On the Security of TLS-DHE
    in the Standard Model,” in <i>Advances in Cryptology - CRYPTO 2012 - 32nd Annual
    Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings</i>,
    2012, pp. 273--293.
  mla: Jager, Tibor, et al. “On the Security of TLS-DHE in the Standard Model.” <i>Advances
    in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara,
    CA, USA, August 19-23, 2012. Proceedings</i>, 2012, pp. 273--293, doi:<a href="https://doi.org/10.1007/978-3-642-32009-5_17">10.1007/978-3-642-32009-5_17</a>.
  short: 'T. Jager, F. Kohlar, S. Schäge, J. Schwenk, in: Advances in Cryptology -
    CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August
    19-23, 2012. Proceedings, 2012, pp. 273--293.'
date_created: 2018-06-07T09:25:56Z
date_updated: 2022-01-06T06:58:58Z
department:
- _id: '558'
doi: 10.1007/978-3-642-32009-5_17
extern: '1'
page: 273--293
publication: Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference,
  Santa Barbara, CA, USA, August 19-23, 2012. Proceedings
status: public
title: On the Security of TLS-DHE in the Standard Model
type: conference
user_id: '38235'
year: '2012'
...
---
_id: '3134'
author:
- first_name: Dennis
  full_name: Hofheinz, Dennis
  last_name: Hofheinz
- first_name: Tibor
  full_name: Jager, Tibor
  id: '64669'
  last_name: Jager
citation:
  ama: 'Hofheinz D, Jager T. Tightly Secure Signatures and Public-Key Encryption.
    In: <i>Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference,
    Santa Barbara, CA, USA, August 19-23, 2012. Proceedings</i>. ; 2012:590--607.
    doi:<a href="https://doi.org/10.1007/978-3-642-32009-5_35">10.1007/978-3-642-32009-5_35</a>'
  apa: Hofheinz, D., &#38; Jager, T. (2012). Tightly Secure Signatures and Public-Key
    Encryption. In <i>Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology
    Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings</i> (pp. 590--607).
    <a href="https://doi.org/10.1007/978-3-642-32009-5_35">https://doi.org/10.1007/978-3-642-32009-5_35</a>
  bibtex: '@inproceedings{Hofheinz_Jager_2012, title={Tightly Secure Signatures and
    Public-Key Encryption}, DOI={<a href="https://doi.org/10.1007/978-3-642-32009-5_35">10.1007/978-3-642-32009-5_35</a>},
    booktitle={Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference,
    Santa Barbara, CA, USA, August 19-23, 2012. Proceedings}, author={Hofheinz, Dennis
    and Jager, Tibor}, year={2012}, pages={590--607} }'
  chicago: Hofheinz, Dennis, and Tibor Jager. “Tightly Secure Signatures and Public-Key
    Encryption.” In <i>Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology
    Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings</i>, 590--607,
    2012. <a href="https://doi.org/10.1007/978-3-642-32009-5_35">https://doi.org/10.1007/978-3-642-32009-5_35</a>.
  ieee: D. Hofheinz and T. Jager, “Tightly Secure Signatures and Public-Key Encryption,”
    in <i>Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference,
    Santa Barbara, CA, USA, August 19-23, 2012. Proceedings</i>, 2012, pp. 590--607.
  mla: Hofheinz, Dennis, and Tibor Jager. “Tightly Secure Signatures and Public-Key
    Encryption.” <i>Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology
    Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings</i>, 2012,
    pp. 590--607, doi:<a href="https://doi.org/10.1007/978-3-642-32009-5_35">10.1007/978-3-642-32009-5_35</a>.
  short: 'D. Hofheinz, T. Jager, in: Advances in Cryptology - CRYPTO 2012 - 32nd Annual
    Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings,
    2012, pp. 590--607.'
date_created: 2018-06-07T09:26:31Z
date_updated: 2022-01-06T06:58:58Z
department:
- _id: '558'
doi: 10.1007/978-3-642-32009-5_35
extern: '1'
page: 590--607
publication: Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference,
  Santa Barbara, CA, USA, August 19-23, 2012. Proceedings
status: public
title: Tightly Secure Signatures and Public-Key Encryption
type: conference
user_id: '38235'
year: '2012'
...
---
_id: '3135'
author:
- first_name: Tibor
  full_name: Jager, Tibor
  id: '64669'
  last_name: Jager
- first_name: Sebastian
  full_name: Schinzel, Sebastian
  last_name: Schinzel
- first_name: Juraj
  full_name: Somorovsky, Juraj
  last_name: Somorovsky
citation:
  ama: 'Jager T, Schinzel S, Somorovsky J. Bleichenbacher’s Attack Strikes again:
    Breaking PKCS#1 v1.5 in XML Encryption. In: <i>Computer Security - ESORICS 2012
    - 17th European Symposium on Research in Computer Security, Pisa, Italy, September
    10-12, 2012. Proceedings</i>. ; 2012:752--769. doi:<a href="https://doi.org/10.1007/978-3-642-33167-1_43">10.1007/978-3-642-33167-1_43</a>'
  apa: 'Jager, T., Schinzel, S., &#38; Somorovsky, J. (2012). Bleichenbacher’s Attack
    Strikes again: Breaking PKCS#1 v1.5 in XML Encryption. In <i>Computer Security
    - ESORICS 2012 - 17th European Symposium on Research in Computer Security, Pisa,
    Italy, September 10-12, 2012. Proceedings</i> (pp. 752--769). <a href="https://doi.org/10.1007/978-3-642-33167-1_43">https://doi.org/10.1007/978-3-642-33167-1_43</a>'
  bibtex: '@inproceedings{Jager_Schinzel_Somorovsky_2012, title={Bleichenbacher’s
    Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption}, DOI={<a href="https://doi.org/10.1007/978-3-642-33167-1_43">10.1007/978-3-642-33167-1_43</a>},
    booktitle={Computer Security - ESORICS 2012 - 17th European Symposium on Research
    in Computer Security, Pisa, Italy, September 10-12, 2012. Proceedings}, author={Jager,
    Tibor and Schinzel, Sebastian and Somorovsky, Juraj}, year={2012}, pages={752--769}
    }'
  chicago: 'Jager, Tibor, Sebastian Schinzel, and Juraj Somorovsky. “Bleichenbacher’s
    Attack Strikes Again: Breaking PKCS#1 v1.5 in XML Encryption.” In <i>Computer
    Security - ESORICS 2012 - 17th European Symposium on Research in Computer Security,
    Pisa, Italy, September 10-12, 2012. Proceedings</i>, 752--769, 2012. <a href="https://doi.org/10.1007/978-3-642-33167-1_43">https://doi.org/10.1007/978-3-642-33167-1_43</a>.'
  ieee: 'T. Jager, S. Schinzel, and J. Somorovsky, “Bleichenbacher’s Attack Strikes
    again: Breaking PKCS#1 v1.5 in XML Encryption,” in <i>Computer Security - ESORICS
    2012 - 17th European Symposium on Research in Computer Security, Pisa, Italy,
    September 10-12, 2012. Proceedings</i>, 2012, pp. 752--769.'
  mla: 'Jager, Tibor, et al. “Bleichenbacher’s Attack Strikes Again: Breaking PKCS#1
    v1.5 in XML Encryption.” <i>Computer Security - ESORICS 2012 - 17th European Symposium
    on Research in Computer Security, Pisa, Italy, September 10-12, 2012. Proceedings</i>,
    2012, pp. 752--769, doi:<a href="https://doi.org/10.1007/978-3-642-33167-1_43">10.1007/978-3-642-33167-1_43</a>.'
  short: 'T. Jager, S. Schinzel, J. Somorovsky, in: Computer Security - ESORICS 2012
    - 17th European Symposium on Research in Computer Security, Pisa, Italy, September
    10-12, 2012. Proceedings, 2012, pp. 752--769.'
date_created: 2018-06-07T09:26:54Z
date_updated: 2022-01-06T06:58:58Z
department:
- _id: '558'
doi: 10.1007/978-3-642-33167-1_43
extern: '1'
page: 752--769
publication: Computer Security - ESORICS 2012 - 17th European Symposium on Research
  in Computer Security, Pisa, Italy, September 10-12, 2012. Proceedings
status: public
title: 'Bleichenbacher''s Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption'
type: conference
user_id: '38235'
year: '2012'
...
---
_id: '3136'
author:
- first_name: Dennis
  full_name: Hofheinz, Dennis
  last_name: Hofheinz
- first_name: Tibor
  full_name: Jager, Tibor
  id: '64669'
  last_name: Jager
- first_name: Edward
  full_name: Knapp, Edward
  last_name: Knapp
citation:
  ama: 'Hofheinz D, Jager T, Knapp E. Waters Signatures with Optimal Security Reduction.
    In: <i>Public Key Cryptography - PKC 2012 - 15th International Conference on Practice
    and Theory in Public Key Cryptography, Darmstadt, Germany, May 21-23, 2012. Proceedings</i>.
    ; 2012:66--83. doi:<a href="https://doi.org/10.1007/978-3-642-30057-8_5">10.1007/978-3-642-30057-8_5</a>'
  apa: Hofheinz, D., Jager, T., &#38; Knapp, E. (2012). Waters Signatures with Optimal
    Security Reduction. In <i>Public Key Cryptography - PKC 2012 - 15th International
    Conference on Practice and Theory in Public Key Cryptography, Darmstadt, Germany,
    May 21-23, 2012. Proceedings</i> (pp. 66--83). <a href="https://doi.org/10.1007/978-3-642-30057-8_5">https://doi.org/10.1007/978-3-642-30057-8_5</a>
  bibtex: '@inproceedings{Hofheinz_Jager_Knapp_2012, title={Waters Signatures with
    Optimal Security Reduction}, DOI={<a href="https://doi.org/10.1007/978-3-642-30057-8_5">10.1007/978-3-642-30057-8_5</a>},
    booktitle={Public Key Cryptography - PKC 2012 - 15th International Conference
    on Practice and Theory in Public Key Cryptography, Darmstadt, Germany, May 21-23,
    2012. Proceedings}, author={Hofheinz, Dennis and Jager, Tibor and Knapp, Edward},
    year={2012}, pages={66--83} }'
  chicago: Hofheinz, Dennis, Tibor Jager, and Edward Knapp. “Waters Signatures with
    Optimal Security Reduction.” In <i>Public Key Cryptography - PKC 2012 - 15th International
    Conference on Practice and Theory in Public Key Cryptography, Darmstadt, Germany,
    May 21-23, 2012. Proceedings</i>, 66--83, 2012. <a href="https://doi.org/10.1007/978-3-642-30057-8_5">https://doi.org/10.1007/978-3-642-30057-8_5</a>.
  ieee: D. Hofheinz, T. Jager, and E. Knapp, “Waters Signatures with Optimal Security
    Reduction,” in <i>Public Key Cryptography - PKC 2012 - 15th International Conference
    on Practice and Theory in Public Key Cryptography, Darmstadt, Germany, May 21-23,
    2012. Proceedings</i>, 2012, pp. 66--83.
  mla: Hofheinz, Dennis, et al. “Waters Signatures with Optimal Security Reduction.”
    <i>Public Key Cryptography - PKC 2012 - 15th International Conference on Practice
    and Theory in Public Key Cryptography, Darmstadt, Germany, May 21-23, 2012. Proceedings</i>,
    2012, pp. 66--83, doi:<a href="https://doi.org/10.1007/978-3-642-30057-8_5">10.1007/978-3-642-30057-8_5</a>.
  short: 'D. Hofheinz, T. Jager, E. Knapp, in: Public Key Cryptography - PKC 2012
    - 15th International Conference on Practice and Theory in Public Key Cryptography,
    Darmstadt, Germany, May 21-23, 2012. Proceedings, 2012, pp. 66--83.'
date_created: 2018-06-07T09:27:25Z
date_updated: 2022-01-06T06:58:58Z
department:
- _id: '558'
doi: 10.1007/978-3-642-30057-8_5
extern: '1'
page: 66--83
publication: Public Key Cryptography - PKC 2012 - 15th International Conference on
  Practice and Theory in Public Key Cryptography, Darmstadt, Germany, May 21-23, 2012.
  Proceedings
status: public
title: Waters Signatures with Optimal Security Reduction
type: conference
user_id: '38235'
year: '2012'
...
---
_id: '3180'
author:
- first_name: Oleg
  full_name: Travkin, Oleg
  last_name: Travkin
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
- first_name: Gerhard
  full_name: Schellhorn, Gerhard
  last_name: Schellhorn
citation:
  ama: Travkin O, Wehrheim H, Schellhorn G. Proving Linearizability of Multiset with
    Local Proof Obligations. <i>{ECEASST}</i>. 2012.
  apa: Travkin, O., Wehrheim, H., &#38; Schellhorn, G. (2012). Proving Linearizability
    of Multiset with Local Proof Obligations. <i>{ECEASST}</i>.
  bibtex: '@article{Travkin_Wehrheim_Schellhorn_2012, title={Proving Linearizability
    of Multiset with Local Proof Obligations}, journal={{ECEASST}}, author={Travkin,
    Oleg and Wehrheim, Heike and Schellhorn, Gerhard}, year={2012} }'
  chicago: Travkin, Oleg, Heike Wehrheim, and Gerhard Schellhorn. “Proving Linearizability
    of Multiset with Local Proof Obligations.” <i>{ECEASST}</i>, 2012.
  ieee: O. Travkin, H. Wehrheim, and G. Schellhorn, “Proving Linearizability of Multiset
    with Local Proof Obligations,” <i>{ECEASST}</i>, 2012.
  mla: Travkin, Oleg, et al. “Proving Linearizability of Multiset with Local Proof
    Obligations.” <i>{ECEASST}</i>, 2012.
  short: O. Travkin, H. Wehrheim, G. Schellhorn, {ECEASST} (2012).
date_created: 2018-06-13T08:16:49Z
date_updated: 2022-01-06T06:59:03Z
department:
- _id: '77'
publication: '{ECEASST}'
status: public
title: Proving Linearizability of Multiset with Local Proof Obligations
type: journal_article
user_id: '29719'
year: '2012'
...
---
_id: '3181'
author:
- first_name: Thomas
  full_name: Ruhroth, Thomas
  last_name: Ruhroth
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: Ruhroth T, Wehrheim H. Model evolution and refinement. <i>Sci Comput Program</i>.
    2012;(3):270--289. doi:<a href="https://doi.org/10.1016/j.scico.2011.04.007">10.1016/j.scico.2011.04.007</a>
  apa: Ruhroth, T., &#38; Wehrheim, H. (2012). Model evolution and refinement. <i>Sci.
    Comput. Program.</i>, (3), 270--289. <a href="https://doi.org/10.1016/j.scico.2011.04.007">https://doi.org/10.1016/j.scico.2011.04.007</a>
  bibtex: '@article{Ruhroth_Wehrheim_2012, title={Model evolution and refinement},
    DOI={<a href="https://doi.org/10.1016/j.scico.2011.04.007">10.1016/j.scico.2011.04.007</a>},
    number={3}, journal={Sci. Comput. Program.}, author={Ruhroth, Thomas and Wehrheim,
    Heike}, year={2012}, pages={270--289} }'
  chicago: 'Ruhroth, Thomas, and Heike Wehrheim. “Model Evolution and Refinement.”
    <i>Sci. Comput. Program.</i>, no. 3 (2012): 270--289. <a href="https://doi.org/10.1016/j.scico.2011.04.007">https://doi.org/10.1016/j.scico.2011.04.007</a>.'
  ieee: T. Ruhroth and H. Wehrheim, “Model evolution and refinement,” <i>Sci. Comput.
    Program.</i>, no. 3, pp. 270--289, 2012.
  mla: Ruhroth, Thomas, and Heike Wehrheim. “Model Evolution and Refinement.” <i>Sci.
    Comput. Program.</i>, no. 3, 2012, pp. 270--289, doi:<a href="https://doi.org/10.1016/j.scico.2011.04.007">10.1016/j.scico.2011.04.007</a>.
  short: T. Ruhroth, H. Wehrheim, Sci. Comput. Program. (2012) 270--289.
date_created: 2018-06-13T08:17:58Z
date_updated: 2022-01-06T06:59:03Z
department:
- _id: '77'
doi: 10.1016/j.scico.2011.04.007
issue: '3'
page: 270--289
publication: Sci. Comput. Program.
status: public
title: Model evolution and refinement
type: journal_article
user_id: '29719'
year: '2012'
...
---
_id: '3182'
author:
- first_name: Gerhard
  full_name: Schellhorn, Gerhard
  last_name: Schellhorn
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
- first_name: John
  full_name: Derrick, John
  last_name: Derrick
citation:
  ama: 'Schellhorn G, Wehrheim H, Derrick J. How to Prove Algorithms Linearisable.
    In: Madhusudan P, A. Seshia S, eds. <i>Computer Aided Verification - 24th International
    Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings</i>. Lecture
    Notes in Computer Science. ; 2012:243--259. doi:<a href="https://doi.org/10.1007/978-3-642-31424-7_21">10.1007/978-3-642-31424-7_21</a>'
  apa: Schellhorn, G., Wehrheim, H., &#38; Derrick, J. (2012). How to Prove Algorithms
    Linearisable. In P. Madhusudan &#38; S. A. Seshia (Eds.), <i>Computer Aided Verification
    - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012
    Proceedings</i> (pp. 243--259). <a href="https://doi.org/10.1007/978-3-642-31424-7_21">https://doi.org/10.1007/978-3-642-31424-7_21</a>
  bibtex: '@inproceedings{Schellhorn_Wehrheim_Derrick_2012, series={Lecture Notes
    in Computer Science}, title={How to Prove Algorithms Linearisable}, DOI={<a href="https://doi.org/10.1007/978-3-642-31424-7_21">10.1007/978-3-642-31424-7_21</a>},
    booktitle={Computer Aided Verification - 24th International Conference, {CAV}
    2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings}, author={Schellhorn, Gerhard
    and Wehrheim, Heike and Derrick, John}, editor={Madhusudan, P. and A. Seshia,
    SanjitEditors}, year={2012}, pages={243--259}, collection={Lecture Notes in Computer
    Science} }'
  chicago: Schellhorn, Gerhard, Heike Wehrheim, and John Derrick. “How to Prove Algorithms
    Linearisable.” In <i>Computer Aided Verification - 24th International Conference,
    {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings</i>, edited by P. Madhusudan
    and Sanjit A. Seshia, 243--259. Lecture Notes in Computer Science, 2012. <a href="https://doi.org/10.1007/978-3-642-31424-7_21">https://doi.org/10.1007/978-3-642-31424-7_21</a>.
  ieee: G. Schellhorn, H. Wehrheim, and J. Derrick, “How to Prove Algorithms Linearisable,”
    in <i>Computer Aided Verification - 24th International Conference, {CAV} 2012,
    Berkeley, CA, USA, July 7-13, 2012 Proceedings</i>, 2012, pp. 243--259.
  mla: Schellhorn, Gerhard, et al. “How to Prove Algorithms Linearisable.” <i>Computer
    Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA,
    USA, July 7-13, 2012 Proceedings</i>, edited by P. Madhusudan and Sanjit A. Seshia,
    2012, pp. 243--259, doi:<a href="https://doi.org/10.1007/978-3-642-31424-7_21">10.1007/978-3-642-31424-7_21</a>.
  short: 'G. Schellhorn, H. Wehrheim, J. Derrick, in: P. Madhusudan, S. A. Seshia
    (Eds.), Computer Aided Verification - 24th International Conference, {CAV} 2012,
    Berkeley, CA, USA, July 7-13, 2012 Proceedings, 2012, pp. 243--259.'
date_created: 2018-06-13T08:19:33Z
date_updated: 2022-01-06T06:59:03Z
department:
- _id: '77'
doi: 10.1007/978-3-642-31424-7_21
editor:
- first_name: P.
  full_name: Madhusudan, P.
  last_name: Madhusudan
- first_name: Sanjit
  full_name: A. Seshia, Sanjit
  last_name: A. Seshia
page: 243--259
publication: Computer Aided Verification - 24th International Conference, {CAV} 2012,
  Berkeley, CA, USA, July 7-13, 2012 Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: How to Prove Algorithms Linearisable
type: conference
user_id: '29719'
year: '2012'
...
---
_id: '27176'
abstract:
- lang: eng
  text: "In this article we report on the experiences of a redesigned teaching in
    the field of computer science and society (IuG). The reasons for the redesign
    and the concept are outlined. We have condensed our experiences into theses: 1.
    Computer science and society should be a compulsory course in the bachelor's degree,
    in which students get an overview of which social framework conditions are relevant
    for them and how they can be incorporated into practice. 2. Historical contents
    of computer science are to be processed here by considering current developments
    in the context of their genesis.\r\n"
author:
- first_name: Dieter
  full_name: Engbring, Dieter
  last_name: Engbring
- first_name: Harald
  full_name: Selke, Harald
  id: '497'
  last_name: Selke
citation:
  ama: Engbring D, Selke H. Computer science and society as a field of computer science.
    Forbrig P,  Rick D,  Schmolitzky A, eds. 2012;5:111-116.
  apa: Engbring, D., &#38; Selke, H. (2012). <i>Computer science and society as a
    field of computer science</i> (P. Forbrig, D.  Rick, &#38; A.  Schmolitzky, Eds.;
    Vol. 5, pp. 111–116). Universit { \ "a} tsverlag Potsda.
  bibtex: '@article{Engbring_Selke_2012, series={Commentarii informaticae didacticae},
    title={Computer science and society as a field of computer science}, volume={5},
    publisher={Universit { \ "a} tsverlag Potsda}, author={Engbring, Dieter and Selke,
    Harald}, editor={Forbrig, Peter and  Rick, Detlef and  Schmolitzky, Axel}, year={2012},
    pages={111–116}, collection={Commentarii informaticae didacticae} }'
  chicago: Engbring, Dieter, and Harald Selke. “Computer Science and Society as a
    Field of Computer Science.” Edited by Peter Forbrig, Detlef  Rick, and Axel  Schmolitzky.
    Commentarii Informaticae Didacticae. Universit { \ "a} tsverlag Potsda, 2012.
  ieee: D. Engbring and H. Selke, “Computer science and society as a field of computer
    science,” vol. 5. Universit { \ "a} tsverlag Potsda, pp. 111–116, 2012.
  mla: Engbring, Dieter, and Harald Selke. <i>Computer Science and Society as a Field
    of Computer Science</i>. Edited by Peter Forbrig et al., vol. 5, Universit { \
    "a} tsverlag Potsda, 2012, pp. 111–16.
  short: D. Engbring, H. Selke, 5 (2012) 111–116.
conference:
  end_date: 2012-11-07
  name: 'HDI 2012 - Computer Science for a Sustainable Future: 5th Conference on University
    Didactics of Computer Science'
  start_date: 2012-11-06
date_created: 2021-11-06T00:45:36Z
date_updated: 2022-01-06T06:57:35Z
department:
- _id: '71'
editor:
- first_name: Peter
  full_name: Forbrig, Peter
  last_name: Forbrig
- first_name: Detlef
  full_name: ' Rick, Detlef'
  last_name: ' Rick'
- first_name: Axel
  full_name: ' Schmolitzky, Axel'
  last_name: ' Schmolitzky'
intvolume: '         5'
language:
- iso: eng
page: 111-116
publication_status: published
publisher: Universit { \ "a} tsverlag Potsda
series_title: Commentarii informaticae didacticae
status: public
title: Computer science and society as a field of computer science
type: conference
user_id: '71124'
volume: 5
year: '2012'
...
---
_id: '27177'
author:
- first_name: Florian
  full_name: Klompmaker, Florian
  last_name: Klompmaker
- first_name: ' Anke '
  full_name: ' Workowski,  Anke '
  last_name: ' Workowski'
- first_name: 'Wolfgang '
  full_name: 'Thronicke, Wolfgang '
  last_name: Thronicke
- first_name: Florian
  full_name: Ostermair, Florian
  last_name: Ostermair
- first_name: Detlev
  full_name: Willemsen, Detlev
  last_name: Willemsen
- first_name: D
  full_name: Hoffmann, D
  last_name: Hoffmann
citation:
  ama: 'Klompmaker F,  Workowski  Anke , Thronicke W, Ostermair F, Willemsen D, Hoffmann
    D. User Centered Design of an Interactive Mobile Assistance and Supervision System
    for Rehabilitation Purposes. In: ; 2012.'
  apa: Klompmaker, F.,  Workowski,  Anke , Thronicke, W., Ostermair, F., Willemsen,
    D., &#38; Hoffmann, D. (2012). <i>User Centered Design of an Interactive Mobile
    Assistance and Supervision System for Rehabilitation Purposes</i>. 3rd International
    Conference on Wireless Mobile Communication and Healthcare.
  bibtex: '@inproceedings{Klompmaker_ Workowski_Thronicke_Ostermair_Willemsen_Hoffmann_2012,
    title={User Centered Design of an Interactive Mobile Assistance and Supervision
    System for Rehabilitation Purposes}, author={Klompmaker, Florian and  Workowski,  Anke  and
    Thronicke, Wolfgang  and Ostermair, Florian and Willemsen, Detlev and Hoffmann,
    D}, year={2012} }'
  chicago: Klompmaker, Florian,  Anke   Workowski, Wolfgang  Thronicke, Florian Ostermair,
    Detlev Willemsen, and D Hoffmann. “User Centered Design of an Interactive Mobile
    Assistance and Supervision System for Rehabilitation Purposes,” 2012.
  ieee: F. Klompmaker,  Anke   Workowski, W. Thronicke, F. Ostermair, D. Willemsen,
    and D. Hoffmann, “User Centered Design of an Interactive Mobile Assistance and
    Supervision System for Rehabilitation Purposes,” presented at the 3rd International
    Conference on Wireless Mobile Communication and Healthcare, 2012.
  mla: Klompmaker, Florian, et al. <i>User Centered Design of an Interactive Mobile
    Assistance and Supervision System for Rehabilitation Purposes</i>. 2012.
  short: 'F. Klompmaker,  Anke   Workowski, W. Thronicke, F. Ostermair, D. Willemsen,
    D. Hoffmann, in: 2012.'
conference:
  name: 3rd International Conference on Wireless Mobile Communication and Healthcare
date_created: 2021-11-06T00:50:27Z
date_updated: 2022-01-06T06:57:35Z
department:
- _id: '71'
language:
- iso: eng
publication_status: published
status: public
title: User Centered Design of an Interactive Mobile Assistance and Supervision System
  for Rehabilitation Purposes
type: conference
user_id: '71124'
year: '2012'
...
---
_id: '27179'
author:
- first_name: Florian
  full_name: Klompmaker, Florian
  last_name: Klompmaker
- first_name: Karsten
  full_name: ' Nebe, Karsten'
  last_name: ' Nebe'
- first_name: Julien
  full_name: Eschenlohr, Julien
  last_name: Eschenlohr
citation:
  ama: 'Klompmaker F,  Nebe K, Eschenlohr J. Towards Multimodal 3D Tabletop Interaction
    using Sensor Equipped Mobile Devices . In: Springer; 2012.'
  apa: Klompmaker, F.,  Nebe, K., &#38; Eschenlohr, J. (2012). <i>Towards Multimodal
    3D Tabletop Interaction using Sensor Equipped Mobile Devices </i>. Fourth International
    Conference on Mobile Computing, Applications and Services.
  bibtex: '@inproceedings{Klompmaker_ Nebe_Eschenlohr_2012, title={Towards Multimodal
    3D Tabletop Interaction using Sensor Equipped Mobile Devices }, publisher={Springer},
    author={Klompmaker, Florian and  Nebe, Karsten and Eschenlohr, Julien}, year={2012}
    }'
  chicago: Klompmaker, Florian, Karsten  Nebe, and Julien Eschenlohr. “Towards Multimodal
    3D Tabletop Interaction Using Sensor Equipped Mobile Devices .” Springer, 2012.
  ieee: F. Klompmaker, K.  Nebe, and J. Eschenlohr, “Towards Multimodal 3D Tabletop
    Interaction using Sensor Equipped Mobile Devices ,” presented at the Fourth International
    Conference on Mobile Computing, Applications and Services, 2012.
  mla: Klompmaker, Florian, et al. <i>Towards Multimodal 3D Tabletop Interaction Using
    Sensor Equipped Mobile Devices </i>. Springer, 2012.
  short: 'F. Klompmaker, K.  Nebe, J. Eschenlohr, in: Springer, 2012.'
conference:
  end_date: 2012-10-12
  name: Fourth International Conference on Mobile Computing, Applications and Services
  start_date: 2012-10-11
date_created: 2021-11-06T00:53:24Z
date_updated: 2022-01-06T06:57:35Z
department:
- _id: '71'
language:
- iso: eng
publication_status: published
publisher: Springer
status: public
title: 'Towards Multimodal 3D Tabletop Interaction using Sensor Equipped Mobile Devices '
type: conference
user_id: '71124'
year: '2012'
...
---
_id: '27180'
abstract:
- lang: eng
  text: "This article explains the technical potential of digital boards with which
    more and more schools are being equipped. A consideration of current usage scenarios
    of these interactive whiteboards shows that a large part of this potential is
    still unused and the deficits of the software often have to be circumvented with
    tricks, especially for use in demanding, student-oriented lessons. Finally, the
    further development of existing teaching scenarios using this technical potential
    shows that considering the technical possibilities of digital boards can motivate
    new didactic scenarios.\r\n"
author:
- first_name: Harald
  full_name: Selke, Harald
  id: '497'
  last_name: Selke
- first_name: Felix
  full_name: Winkelnkemper, Felix
  id: '3117'
  last_name: Winkelnkemper
citation:
  ama: 'Selke H, Winkelnkemper F. The technical potential of digital boards. In: Desel
    J{\ "o} rg, Haake  J {\" o} rg, Spannagel C, eds. ; 2012:171-182.'
  apa: Selke, H., &#38; Winkelnkemper, F. (2012). <i>The technical potential of digital
    boards</i> (J. {\ "o} rg Desel,  J {\" o} rg Haake, &#38; C. Spannagel, Eds.;
    pp. 171–182).
  bibtex: '@inproceedings{Selke_Winkelnkemper_2012, title={The technical potential
    of digital boards}, author={Selke, Harald and Winkelnkemper, Felix}, editor={Desel,
    J {\ "o} rg and Haake,  J {\" o} rg and Spannagel, Christian}, year={2012}, pages={171–182}
    }'
  chicago: Selke, Harald, and Felix Winkelnkemper. “The Technical Potential of Digital
    Boards.” edited by J {\ "o} rg Desel,  J {\" o} rg Haake, and Christian Spannagel,
    171–82, 2012.
  ieee: H. Selke and F. Winkelnkemper, “The technical potential of digital boards,”
    2012, pp. 171–182.
  mla: Selke, Harald, and Felix Winkelnkemper. <i>The Technical Potential of Digital
    Boards</i>. Edited by J {\ "o} rg Desel et al., 2012, pp. 171–82.
  short: 'H. Selke, F. Winkelnkemper, in: J.{\ "o} rg Desel,  J {\" o} rg Haake, C.
    Spannagel (Eds.), 2012, pp. 171–182.'
conference:
  end_date: 2012-09-26
  name: DeLFI 2012 - The 10th e-Learning Computer Science Conference of the Society
    for Computer Science eV
  start_date: 2012-09-24
date_created: 2021-11-06T00:58:58Z
date_updated: 2022-01-06T06:57:35Z
department:
- _id: '71'
editor:
- first_name: J {\ "o} rg
  full_name: Desel, J {\ "o} rg
  last_name: Desel
- first_name: ' J {\" o} rg'
  full_name: Haake,  J {\" o} rg
  last_name: Haake
- first_name: Christian
  full_name: Spannagel, Christian
  last_name: Spannagel
language:
- iso: eng
page: 171-182
publication_status: published
status: public
title: The technical potential of digital boards
type: conference
user_id: '71124'
year: '2012'
...
