[{"page":"545-558","_id":"26805","publisher":"Springer Basel","language":[{"iso":"eng"}],"user_id":"21240","doi":"10.1007/978-3-0348-0130-0_36","year":"2011","title":"A Fast Hierarchical Learning Approach for Autonomous Robots","status":"public","author":[{"full_name":"Jungmann, Alexander","last_name":"Jungmann","first_name":"Alexander"},{"full_name":"Kleinjohann, Bernd","first_name":"Bernd","last_name":"Kleinjohann"},{"first_name":"Willi","last_name":"Richert","full_name":"Richert, Willi"}],"date_updated":"2022-01-06T06:57:28Z","date_created":"2021-10-25T11:01:29Z","type":"book_chapter","department":[{"_id":"672"}],"publication":"Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems","citation":{"mla":"Jungmann, Alexander, et al. “A Fast Hierarchical Learning Approach for Autonomous Robots.” <i>Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems</i>, Springer Basel, 2011, pp. 545–58, doi:<a href=\"https://doi.org/10.1007/978-3-0348-0130-0_36\">10.1007/978-3-0348-0130-0_36</a>.","ama":"Jungmann A, Kleinjohann B, Richert W. A Fast Hierarchical Learning Approach for Autonomous Robots. In: <i>Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems</i>. Springer Basel; 2011:545-558. doi:<a href=\"https://doi.org/10.1007/978-3-0348-0130-0_36\">10.1007/978-3-0348-0130-0_36</a>","bibtex":"@inbook{Jungmann_Kleinjohann_Richert_2011, title={A Fast Hierarchical Learning Approach for Autonomous Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-0348-0130-0_36\">10.1007/978-3-0348-0130-0_36</a>}, booktitle={Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems}, publisher={Springer Basel}, author={Jungmann, Alexander and Kleinjohann, Bernd and Richert, Willi}, year={2011}, pages={545–558} }","apa":"Jungmann, A., Kleinjohann, B., &#38; Richert, W. (2011). A Fast Hierarchical Learning Approach for Autonomous Robots. In <i>Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems</i> (pp. 545–558). Springer Basel. <a href=\"https://doi.org/10.1007/978-3-0348-0130-0_36\">https://doi.org/10.1007/978-3-0348-0130-0_36</a>","ieee":"A. Jungmann, B. Kleinjohann, and W. Richert, “A Fast Hierarchical Learning Approach for Autonomous Robots,” in <i>Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems</i>, Springer Basel, 2011, pp. 545–558.","short":"A. Jungmann, B. Kleinjohann, W. Richert, in: Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems, Springer Basel, 2011, pp. 545–558.","chicago":"Jungmann, Alexander, Bernd Kleinjohann, and Willi Richert. “A Fast Hierarchical Learning Approach for Autonomous Robots.” In <i>Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems</i>, 545–58. Springer Basel, 2011. <a href=\"https://doi.org/10.1007/978-3-0348-0130-0_36\">https://doi.org/10.1007/978-3-0348-0130-0_36</a>."},"abstract":[{"text":"In this article we present an approach that enables robots to learn how to act and react robustly in continuous and noisy environments while not loosing track of the overall feasibility, i.e. minimising the execution time in order to keep up continuous learning. We do so by combining reinforcement learning mechanisms with techniques belonging to the field of multivariate statistics on three different levels of abstraction: the motivation layer and the two simultaneously learning strategy and skill layers. The motivation layer allows for modelling occasionally contradicting goals in terms of drives in a very intuitive fashion. A drive represents one single goal, that a robot wants to be satisfied, like charging its battery, when it is nearly exhausted, or transporting an object to a target position. The strategy layer encapsulates the main reinforcement learning algorithm based on an abstracted and dynamically adjusted Markovian state space. By means of state abstraction, we minimise the overall state space size in order to ensure feasibility of the learning process in a dynamically changing environment. The skill layer finally realises a generalised learning method for learning reactive low-level behaviours, that enable a robot to interact with the environment.","lang":"eng"}]},{"year":"2011","title":"Increasing Learning Speed by Imitation in Multi-robot Societies","status":"public","author":[{"full_name":"Jungmann, Alexander","first_name":"Alexander","last_name":"Jungmann"},{"first_name":"Bernd","last_name":"Kleinjohann","full_name":"Kleinjohann, Bernd"},{"last_name":"Richert","first_name":"Willi","full_name":"Richert, Willi"}],"date_updated":"2022-01-06T06:57:28Z","page":"295-307","language":[{"iso":"eng"}],"_id":"26810","publisher":"Springer Basel","doi":"10.1007/978-3-0348-0130-0_19","user_id":"21240","publication":"Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems, Band 1 ","citation":{"ama":"Jungmann A, Kleinjohann B, Richert W. Increasing Learning Speed by Imitation in Multi-robot Societies. In: <i>Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems, Band 1 </i>. Springer Basel; 2011:295-307. doi:<a href=\"https://doi.org/10.1007/978-3-0348-0130-0_19\">10.1007/978-3-0348-0130-0_19</a>","bibtex":"@inbook{Jungmann_Kleinjohann_Richert_2011, title={Increasing Learning Speed by Imitation in Multi-robot Societies}, DOI={<a href=\"https://doi.org/10.1007/978-3-0348-0130-0_19\">10.1007/978-3-0348-0130-0_19</a>}, booktitle={Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems, Band 1 }, publisher={Springer Basel}, author={Jungmann, Alexander and Kleinjohann, Bernd and Richert, Willi}, year={2011}, pages={295–307} }","mla":"Jungmann, Alexander, et al. “Increasing Learning Speed by Imitation in Multi-Robot Societies.” <i>Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems, Band 1 </i>, Springer Basel, 2011, pp. 295–307, doi:<a href=\"https://doi.org/10.1007/978-3-0348-0130-0_19\">10.1007/978-3-0348-0130-0_19</a>.","short":"A. Jungmann, B. Kleinjohann, W. Richert, in: Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems, Band 1 , Springer Basel, 2011, pp. 295–307.","chicago":"Jungmann, Alexander, Bernd Kleinjohann, and Willi Richert. “Increasing Learning Speed by Imitation in Multi-Robot Societies.” In <i>Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems, Band 1 </i>, 295–307. Springer Basel, 2011. <a href=\"https://doi.org/10.1007/978-3-0348-0130-0_19\">https://doi.org/10.1007/978-3-0348-0130-0_19</a>.","apa":"Jungmann, A., Kleinjohann, B., &#38; Richert, W. (2011). Increasing Learning Speed by Imitation in Multi-robot Societies. In <i>Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems, Band 1 </i> (pp. 295–307). Springer Basel. <a href=\"https://doi.org/10.1007/978-3-0348-0130-0_19\">https://doi.org/10.1007/978-3-0348-0130-0_19</a>","ieee":"A. Jungmann, B. Kleinjohann, and W. Richert, “Increasing Learning Speed by Imitation in Multi-robot Societies,” in <i>Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems, Band 1 </i>, Springer Basel, 2011, pp. 295–307."},"abstract":[{"text":"The paradigm of imitation provides a powerful means for increasing the overall learning speed in a group of robots. While separately exploring the environment in order to learn how to behave with respect to a pre-defined goal, a robot gathers experience based on its own actions and interactions with the surroundings, respectively. By accumulating additional experience via observing the behaviour of other robots, the learning process can be significantly improved in terms of speed and quality. Within this article we present an approach, that enables robots in a multi-robot society to imitate any other available robot without imposing unnecessary restrictions regarding the robots’ design. Therefore, it benefits not only from its own actions, but also from actions that an observed robot performs. In order to realise the imitation paradigm, we solve three main challenges, namely enabling a robot to decide whom and when to imitate, to interpret and thereby understand the behaviour of an observed robot, and to integrate the experience gathered by observation into its individual learning process.","lang":"eng"}],"date_created":"2021-10-25T11:05:02Z","type":"book_chapter","department":[{"_id":"672"}]},{"editor":[{"first_name":"Bettina","last_name":"Berendt","full_name":"Berendt, Bettina"},{"full_name":"de Vries, Arjen","last_name":"de Vries","first_name":"Arjen"},{"full_name":"Fan, Wenfei","last_name":"Fan","first_name":"Wenfei"},{"last_name":"Macdonald","first_name":"Craig","full_name":"Macdonald, Craig"},{"last_name":"Ounis","first_name":"Iadh","full_name":"Ounis, Iadh"},{"last_name":"Ruthven","first_name":"Ian","full_name":"Ruthven, Ian"}],"user_id":"82920","_id":"3811","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.aclweb.org/anthology/I11-1071.pdf"}],"page":"632-640","date_updated":"2022-01-06T06:59:37Z","author":[{"id":"3900","first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning"},{"full_name":"Bujna, Kathrin","last_name":"Bujna","first_name":"Kathrin"}],"publication_identifier":{"isbn":["978-1-4503-0717-8"]},"status":"public","title":"Back to the Roots of Genres: Text Classification by Language Function","year":"2011","department":[{"_id":"600"}],"type":"conference","date_created":"2018-08-02T13:38:36Z","citation":{"ama":"Wachsmuth H, Bujna K. Back to the Roots of Genres: Text Classification by Language Function. In: Berendt B, de Vries A, Fan W, Macdonald C, Ounis I, Ruthven I, eds. <i>Proceedings of 5th International Joint Conference on Natural Language Processing</i>. ; 2011:632-640.","bibtex":"@inproceedings{Wachsmuth_Bujna_2011, title={Back to the Roots of Genres: Text Classification by Language Function}, booktitle={Proceedings of 5th International Joint Conference on Natural Language Processing}, author={Wachsmuth, Henning and Bujna, Kathrin}, editor={Berendt, Bettina and de Vries, Arjen and Fan, Wenfei and Macdonald, Craig and Ounis, Iadh and Ruthven, IanEditors}, year={2011}, pages={632–640} }","mla":"Wachsmuth, Henning, and Kathrin Bujna. “Back to the Roots of Genres: Text Classification by Language Function.” <i>Proceedings of 5th International Joint Conference on Natural Language Processing</i>, edited by Bettina Berendt et al., 2011, pp. 632–40.","short":"H. Wachsmuth, K. Bujna, in: B. Berendt, A. de Vries, W. Fan, C. Macdonald, I. Ounis, I. Ruthven (Eds.), Proceedings of 5th International Joint Conference on Natural Language Processing, 2011, pp. 632–640.","chicago":"Wachsmuth, Henning, and Kathrin Bujna. “Back to the Roots of Genres: Text Classification by Language Function.” In <i>Proceedings of 5th International Joint Conference on Natural Language Processing</i>, edited by Bettina Berendt, Arjen de Vries, Wenfei Fan, Craig Macdonald, Iadh Ounis, and Ian Ruthven, 632–40, 2011.","apa":"Wachsmuth, H., &#38; Bujna, K. (2011). Back to the Roots of Genres: Text Classification by Language Function. In B. Berendt, A. de Vries, W. Fan, C. Macdonald, I. Ounis, &#38; I. Ruthven (Eds.), <i>Proceedings of 5th International Joint Conference on Natural Language Processing</i> (pp. 632–640).","ieee":"H. Wachsmuth and K. Bujna, “Back to the Roots of Genres: Text Classification by Language Function,” in <i>Proceedings of 5th International Joint Conference on Natural Language Processing</i>, 2011, pp. 632–640."},"publication":"Proceedings of 5th International Joint Conference on Natural Language Processing"},{"user_id":"82920","editor":[{"full_name":"Berendt, Bettina","last_name":"Berendt","first_name":"Bettina"},{"last_name":"de Vries","first_name":"Arjen","full_name":"de Vries, Arjen"},{"full_name":"Fan, Wenfei","first_name":"Wenfei","last_name":"Fan"},{"full_name":"Macdonald, Craig","first_name":"Craig","last_name":"Macdonald"},{"full_name":"Ounis, Iadh","first_name":"Iadh","last_name":"Ounis"},{"last_name":"Ruthven","first_name":"Ian","full_name":"Ruthven, Ian"}],"main_file_link":[{"url":"https://webis.de/downloads/publications/papers/stein_2011m.pdf"}],"page":"2237-2240","language":[{"iso":"eng"}],"_id":"3875","date_updated":"2022-01-06T06:59:47Z","status":"public","title":"Constructing Efficient Information Extraction Pipelines","year":"2011","publication_identifier":{"isbn":["978-1-4503-0717-8"]},"author":[{"full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning","id":"3900"},{"first_name":"Benno","last_name":"Stein","full_name":"Stein, Benno"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"}],"type":"conference","department":[{"_id":"600"}],"date_created":"2018-08-11T16:11:20Z","publication":"20th ACM International Conference on Information and Knowledge Management","citation":{"apa":"Wachsmuth, H., Stein, B., &#38; Engels, G. (2011). Constructing Efficient Information Extraction Pipelines. In B. Berendt, A. de Vries, W. Fan, C. Macdonald, I. Ounis, &#38; I. Ruthven (Eds.), <i>20th ACM International Conference on Information and Knowledge Management</i> (pp. 2237–2240).","ieee":"H. Wachsmuth, B. Stein, and G. Engels, “Constructing Efficient Information Extraction Pipelines,” in <i>20th ACM International Conference on Information and Knowledge Management</i>, 2011, pp. 2237–2240.","chicago":"Wachsmuth, Henning, Benno Stein, and Gregor Engels. “Constructing Efficient Information Extraction Pipelines.” In <i>20th ACM International Conference on Information and Knowledge Management</i>, edited by Bettina Berendt, Arjen de Vries, Wenfei Fan, Craig Macdonald, Iadh Ounis, and Ian Ruthven, 2237–40, 2011.","short":"H. Wachsmuth, B. Stein, G. Engels, in: B. Berendt, A. de Vries, W. Fan, C. Macdonald, I. Ounis, I. Ruthven (Eds.), 20th ACM International Conference on Information and Knowledge Management, 2011, pp. 2237–2240.","mla":"Wachsmuth, Henning, et al. “Constructing Efficient Information Extraction Pipelines.” <i>20th ACM International Conference on Information and Knowledge Management</i>, edited by Bettina Berendt et al., 2011, pp. 2237–40.","ama":"Wachsmuth H, Stein B, Engels G. Constructing Efficient Information Extraction Pipelines. In: Berendt B, de Vries A, Fan W, Macdonald C, Ounis I, Ruthven I, eds. <i>20th ACM International Conference on Information and Knowledge Management</i>. ; 2011:2237-2240.","bibtex":"@inproceedings{Wachsmuth_Stein_Engels_2011, title={Constructing Efficient Information Extraction Pipelines}, booktitle={20th ACM International Conference on Information and Knowledge Management}, author={Wachsmuth, Henning and Stein, Benno and Engels, Gregor}, editor={Berendt, Bettina and de Vries, Arjen and Fan, Wenfei and Macdonald, Craig and Ounis, Iadh and Ruthven, IanEditors}, year={2011}, pages={2237–2240} }"}},{"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"citation":{"ama":"Märtens M. <i>The Monotone Complexity of Computing K-Clique on Random Graphs</i>.; 2011.","bibtex":"@book{Märtens_2011, title={The Monotone Complexity of Computing k-Clique on Random Graphs}, author={Märtens, Marcus}, year={2011} }","mla":"Märtens, Marcus. <i>The Monotone Complexity of Computing K-Clique on Random Graphs</i>. 2011.","chicago":"Märtens, Marcus. <i>The Monotone Complexity of Computing K-Clique on Random Graphs</i>, 2011.","short":"M. Märtens, The Monotone Complexity of Computing K-Clique on Random Graphs, 2011.","apa":"Märtens, M. (2011). <i>The Monotone Complexity of Computing k-Clique on Random Graphs</i>.","ieee":"M. Märtens, <i>The Monotone Complexity of Computing k-Clique on Random Graphs</i>. 2011."},"department":[{"_id":"64"}],"type":"mastersthesis","date_created":"2018-05-25T09:46:27Z","date_updated":"2022-01-06T06:58:44Z","author":[{"first_name":"Marcus","last_name":"Märtens","full_name":"Märtens, Marcus"}],"year":"2011","status":"public","title":"The Monotone Complexity of Computing k-Clique on Random Graphs","user_id":"25078","_id":"2902"},{"user_id":"25078","series_title":"Electronic Colloquium on Computational Complexity (ECCC)","_id":"2985","publication_status":"published","date_updated":"2022-01-06T06:58:50Z","author":[{"full_name":"Ackermann, Marcel R","last_name":"Ackermann","first_name":"Marcel R"},{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"last_name":"Scholz","first_name":"Christoph","full_name":"Scholz, Christoph"}],"status":"public","title":"Hardness and Non-Approximability of Bregman Clustering Problems.","year":"2011","department":[{"_id":"64"}],"type":"conference","date_created":"2018-06-05T07:47:21Z","citation":{"ieee":"M. R. Ackermann, J. Blömer, and C. Scholz, “Hardness and Non-Approximability of Bregman Clustering Problems.” 2011.","mla":"Ackermann, Marcel R., et al. <i>Hardness and Non-Approximability of Bregman Clustering Problems.</i> 2011.","apa":"Ackermann, M. R., Blömer, J., &#38; Scholz, C. (2011). Hardness and Non-Approximability of Bregman Clustering Problems.","bibtex":"@article{Ackermann_Blömer_Scholz_2011, series={Electronic Colloquium on Computational Complexity (ECCC)}, title={Hardness and Non-Approximability of Bregman Clustering Problems.}, author={Ackermann, Marcel R and Blömer, Johannes and Scholz, Christoph}, year={2011}, collection={Electronic Colloquium on Computational Complexity (ECCC)} }","ama":"Ackermann MR, Blömer J, Scholz C. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.","short":"M.R. Ackermann, J. Blömer, C. Scholz, (2011).","chicago":"Ackermann, Marcel R, Johannes Blömer, and Christoph Scholz. “Hardness and Non-Approximability of Bregman Clustering Problems.” Electronic Colloquium on Computational Complexity (ECCC), 2011."}},{"_id":"2986","publisher":"Springer Berlin Heidelberg","page":"159-168","doi":"10.1007/978-3-642-15328-0_17","user_id":"25078","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"publication_identifier":{"isbn":["9783642153273","9783642153280"]},"title":"How to Share a Secret","status":"public","year":"2011","date_updated":"2022-01-06T06:58:50Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2018-06-05T07:48:25Z","department":[{"_id":"64"}],"type":"book_chapter","citation":{"mla":"Blömer, Johannes. “How to Share a Secret.” <i>Algorithms Unplugged</i>, Springer Berlin Heidelberg, 2011, pp. 159–68, doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">10.1007/978-3-642-15328-0_17</a>.","ama":"Blömer J. How to Share a Secret. In: <i>Algorithms Unplugged</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:159-168. doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">10.1007/978-3-642-15328-0_17</a>","bibtex":"@inbook{Blömer_2011, place={Berlin, Heidelberg}, title={How to Share a Secret}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">10.1007/978-3-642-15328-0_17</a>}, booktitle={Algorithms Unplugged}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={2011}, pages={159–168} }","apa":"Blömer, J. (2011). How to Share a Secret. In <i>Algorithms Unplugged</i> (pp. 159–168). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">https://doi.org/10.1007/978-3-642-15328-0_17</a>","ieee":"J. Blömer, “How to Share a Secret,” in <i>Algorithms Unplugged</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 159–168.","chicago":"Blömer, Johannes. “How to Share a Secret.” In <i>Algorithms Unplugged</i>, 159–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">https://doi.org/10.1007/978-3-642-15328-0_17</a>.","short":"J. Blömer, in: Algorithms Unplugged, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 159–168."},"publication":"Algorithms Unplugged"},{"date_created":"2018-06-07T09:27:58Z","type":"conference","department":[{"_id":"558"}],"publication":"Advances in Cryptology - ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings","citation":{"ieee":"D. Hofheinz, T. Jager, and E. Kiltz, “Short Signatures from Weaker Assumptions,” in <i>Advances in Cryptology - ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings</i>, 2011, pp. 647--666.","apa":"Hofheinz, D., Jager, T., &#38; Kiltz, E. (2011). Short Signatures from Weaker Assumptions. In <i>Advances in Cryptology - ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings</i> (pp. 647--666). <a href=\"https://doi.org/10.1007/978-3-642-25385-0_35\">https://doi.org/10.1007/978-3-642-25385-0_35</a>","short":"D. Hofheinz, T. Jager, E. Kiltz, in: Advances in Cryptology - ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings, 2011, pp. 647--666.","chicago":"Hofheinz, Dennis, Tibor Jager, and Eike Kiltz. “Short Signatures from Weaker Assumptions.” In <i>Advances in Cryptology - ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings</i>, 647--666, 2011. <a href=\"https://doi.org/10.1007/978-3-642-25385-0_35\">https://doi.org/10.1007/978-3-642-25385-0_35</a>.","mla":"Hofheinz, Dennis, et al. “Short Signatures from Weaker Assumptions.” <i>Advances in Cryptology - ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings</i>, 2011, pp. 647--666, doi:<a href=\"https://doi.org/10.1007/978-3-642-25385-0_35\">10.1007/978-3-642-25385-0_35</a>.","bibtex":"@inproceedings{Hofheinz_Jager_Kiltz_2011, title={Short Signatures from Weaker Assumptions}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-25385-0_35\">10.1007/978-3-642-25385-0_35</a>}, booktitle={Advances in Cryptology - ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings}, author={Hofheinz, Dennis and Jager, Tibor and Kiltz, Eike}, year={2011}, pages={647--666} }","ama":"Hofheinz D, Jager T, Kiltz E. Short Signatures from Weaker Assumptions. In: <i>Advances in Cryptology - ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings</i>. ; 2011:647--666. doi:<a href=\"https://doi.org/10.1007/978-3-642-25385-0_35\">10.1007/978-3-642-25385-0_35</a>"},"extern":"1","page":"647--666","_id":"3137","user_id":"38235","doi":"10.1007/978-3-642-25385-0_35","status":"public","year":"2011","title":"Short Signatures from Weaker Assumptions","author":[{"full_name":"Hofheinz, Dennis","first_name":"Dennis","last_name":"Hofheinz"},{"last_name":"Jager","first_name":"Tibor","full_name":"Jager, Tibor","id":"64669"},{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"}],"date_updated":"2022-01-06T06:58:58Z"},{"date_created":"2018-06-07T09:28:23Z","department":[{"_id":"558"}],"type":"conference","citation":{"mla":"Jager, Tibor, and Juraj Somorovsky. “How to Break XML Encryption.” <i>Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS 2011, Chicago, Illinois, USA, October 17-21, 2011</i>, 2011, pp. 413--422, doi:<a href=\"https://doi.org/10.1145/2046707.2046756\">10.1145/2046707.2046756</a>.","apa":"Jager, T., &#38; Somorovsky, J. (2011). How to break XML encryption. In <i>Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS 2011, Chicago, Illinois, USA, October 17-21, 2011</i> (pp. 413--422). <a href=\"https://doi.org/10.1145/2046707.2046756\">https://doi.org/10.1145/2046707.2046756</a>","ieee":"T. Jager and J. Somorovsky, “How to break XML encryption,” in <i>Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS 2011, Chicago, Illinois, USA, October 17-21, 2011</i>, 2011, pp. 413--422.","ama":"Jager T, Somorovsky J. How to break XML encryption. In: <i>Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS 2011, Chicago, Illinois, USA, October 17-21, 2011</i>. ; 2011:413--422. doi:<a href=\"https://doi.org/10.1145/2046707.2046756\">10.1145/2046707.2046756</a>","short":"T. Jager, J. Somorovsky, in: Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS 2011, Chicago, Illinois, USA, October 17-21, 2011, 2011, pp. 413--422.","chicago":"Jager, Tibor, and Juraj Somorovsky. “How to Break XML Encryption.” In <i>Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS 2011, Chicago, Illinois, USA, October 17-21, 2011</i>, 413--422, 2011. <a href=\"https://doi.org/10.1145/2046707.2046756\">https://doi.org/10.1145/2046707.2046756</a>.","bibtex":"@inproceedings{Jager_Somorovsky_2011, title={How to break XML encryption}, DOI={<a href=\"https://doi.org/10.1145/2046707.2046756\">10.1145/2046707.2046756</a>}, booktitle={Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS 2011, Chicago, Illinois, USA, October 17-21, 2011}, author={Jager, Tibor and Somorovsky, Juraj}, year={2011}, pages={413--422} }"},"publication":"Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS 2011, Chicago, Illinois, USA, October 17-21, 2011","extern":"1","_id":"3138","page":"413--422","user_id":"38235","doi":"10.1145/2046707.2046756","author":[{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"full_name":"Somorovsky, Juraj","first_name":"Juraj","last_name":"Somorovsky"}],"year":"2011","status":"public","title":"How to break XML encryption","date_updated":"2022-01-06T06:58:58Z"},{"type":"journal_article","department":[{"_id":"77"}],"date_created":"2018-06-13T08:20:47Z","publication":"Electr. Notes Theor. Comput. Sci.","citation":{"short":"S. Schneider, H. Treharne, H. Wehrheim, Electr. Notes Theor. Comput. Sci. (2011) 69--80.","chicago":"Schneider, Steve, Helen Treharne, and Heike Wehrheim. “Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: A Case Study.” <i>Electr. Notes Theor. Comput. Sci.</i>, 2011, 69--80. <a href=\"https://doi.org/10.1016/j.entcs.2011.11.019\">https://doi.org/10.1016/j.entcs.2011.11.019</a>.","apa":"Schneider, S., Treharne, H., &#38; Wehrheim, H. (2011). Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: a Case Study. <i>Electr. Notes Theor. Comput. Sci.</i>, 69--80. <a href=\"https://doi.org/10.1016/j.entcs.2011.11.019\">https://doi.org/10.1016/j.entcs.2011.11.019</a>","ieee":"S. Schneider, H. Treharne, and H. Wehrheim, “Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: a Case Study,” <i>Electr. Notes Theor. Comput. Sci.</i>, pp. 69--80, 2011.","ama":"Schneider S, Treharne H, Wehrheim H. Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: a Case Study. <i>Electr Notes Theor Comput Sci</i>. 2011:69--80. doi:<a href=\"https://doi.org/10.1016/j.entcs.2011.11.019\">10.1016/j.entcs.2011.11.019</a>","bibtex":"@article{Schneider_Treharne_Wehrheim_2011, title={Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: a Case Study}, DOI={<a href=\"https://doi.org/10.1016/j.entcs.2011.11.019\">10.1016/j.entcs.2011.11.019</a>}, journal={Electr. Notes Theor. Comput. Sci.}, author={Schneider, Steve and Treharne, Helen and Wehrheim, Heike}, year={2011}, pages={69--80} }","mla":"Schneider, Steve, et al. “Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: A Case Study.” <i>Electr. Notes Theor. Comput. Sci.</i>, 2011, pp. 69--80, doi:<a href=\"https://doi.org/10.1016/j.entcs.2011.11.019\">10.1016/j.entcs.2011.11.019</a>."},"doi":"10.1016/j.entcs.2011.11.019","user_id":"29719","page":"69--80","_id":"3183","date_updated":"2022-01-06T06:59:03Z","status":"public","year":"2011","title":"Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: a Case Study","author":[{"full_name":"Schneider, Steve","first_name":"Steve","last_name":"Schneider"},{"last_name":"Treharne","first_name":"Helen","full_name":"Treharne, Helen"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}]},{"_id":"3184","page":"4:1--4:43","user_id":"29719","doi":"10.1145/1889997.1890001","author":[{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"},{"first_name":"Gerhard","last_name":"Schellhorn","full_name":"Schellhorn, Gerhard"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"title":"Mechanically verified proof obligations for linearizability","year":"2011","status":"public","date_updated":"2022-01-06T06:59:03Z","date_created":"2018-06-13T08:22:02Z","department":[{"_id":"77"}],"type":"journal_article","citation":{"bibtex":"@article{Derrick_Schellhorn_Wehrheim_2011, title={Mechanically verified proof obligations for linearizability}, DOI={<a href=\"https://doi.org/10.1145/1889997.1890001\">10.1145/1889997.1890001</a>}, number={1}, journal={{ACM} Trans. Program. Lang. Syst.}, author={Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}, year={2011}, pages={4:1--4:43} }","ama":"Derrick J, Schellhorn G, Wehrheim H. Mechanically verified proof obligations for linearizability. <i>{ACM} Trans Program Lang Syst</i>. 2011;(1):4:1--4:43. doi:<a href=\"https://doi.org/10.1145/1889997.1890001\">10.1145/1889997.1890001</a>","mla":"Derrick, John, et al. “Mechanically Verified Proof Obligations for Linearizability.” <i>{ACM} Trans. Program. Lang. Syst.</i>, no. 1, 2011, pp. 4:1--4:43, doi:<a href=\"https://doi.org/10.1145/1889997.1890001\">10.1145/1889997.1890001</a>.","chicago":"Derrick, John, Gerhard Schellhorn, and Heike Wehrheim. “Mechanically Verified Proof Obligations for Linearizability.” <i>{ACM} Trans. Program. Lang. Syst.</i>, no. 1 (2011): 4:1--4:43. <a href=\"https://doi.org/10.1145/1889997.1890001\">https://doi.org/10.1145/1889997.1890001</a>.","short":"J. Derrick, G. Schellhorn, H. Wehrheim, {ACM} Trans. Program. Lang. Syst. (2011) 4:1--4:43.","ieee":"J. Derrick, G. Schellhorn, and H. Wehrheim, “Mechanically verified proof obligations for linearizability,” <i>{ACM} Trans. Program. Lang. Syst.</i>, no. 1, pp. 4:1--4:43, 2011.","apa":"Derrick, J., Schellhorn, G., &#38; Wehrheim, H. (2011). Mechanically verified proof obligations for linearizability. <i>{ACM} Trans. Program. Lang. Syst.</i>, (1), 4:1--4:43. <a href=\"https://doi.org/10.1145/1889997.1890001\">https://doi.org/10.1145/1889997.1890001</a>"},"issue":"1","publication":"{ACM} Trans. Program. Lang. Syst."},{"citation":{"bibtex":"@inproceedings{Ruhroth_Wehrheim_Ziegert_2011, title={ReL: {A} Generic Refactoring Language for Specification and Execution}, DOI={<a href=\"https://doi.org/10.1109/SEAA.2011.22\">10.1109/SEAA.2011.22</a>}, booktitle={37th {EUROMICRO} Conference on Software Engineering and Advanced Applications, {SEAA} 2011, Oulu, Finland, August 30 - September 2, 2011}, author={Ruhroth, Thomas and Wehrheim, Heike and Ziegert, Steffen}, year={2011}, pages={83--90} }","ama":"Ruhroth T, Wehrheim H, Ziegert S. ReL: {A} Generic Refactoring Language for Specification and Execution. In: <i>37th {EUROMICRO} Conference on Software Engineering and Advanced Applications, {SEAA} 2011, Oulu, Finland, August 30 - September 2, 2011</i>. ; 2011:83--90. doi:<a href=\"https://doi.org/10.1109/SEAA.2011.22\">10.1109/SEAA.2011.22</a>","mla":"Ruhroth, Thomas, et al. “ReL: {A} Generic Refactoring Language for Specification and Execution.” <i>37th {EUROMICRO} Conference on Software Engineering and Advanced Applications, {SEAA} 2011, Oulu, Finland, August 30 - September 2, 2011</i>, 2011, pp. 83--90, doi:<a href=\"https://doi.org/10.1109/SEAA.2011.22\">10.1109/SEAA.2011.22</a>.","chicago":"Ruhroth, Thomas, Heike Wehrheim, and Steffen Ziegert. “ReL: {A} Generic Refactoring Language for Specification and Execution.” In <i>37th {EUROMICRO} Conference on Software Engineering and Advanced Applications, {SEAA} 2011, Oulu, Finland, August 30 - September 2, 2011</i>, 83--90, 2011. <a href=\"https://doi.org/10.1109/SEAA.2011.22\">https://doi.org/10.1109/SEAA.2011.22</a>.","short":"T. Ruhroth, H. Wehrheim, S. Ziegert, in: 37th {EUROMICRO} Conference on Software Engineering and Advanced Applications, {SEAA} 2011, Oulu, Finland, August 30 - September 2, 2011, 2011, pp. 83--90.","ieee":"T. Ruhroth, H. Wehrheim, and S. Ziegert, “ReL: {A} Generic Refactoring Language for Specification and Execution,” in <i>37th {EUROMICRO} Conference on Software Engineering and Advanced Applications, {SEAA} 2011, Oulu, Finland, August 30 - September 2, 2011</i>, 2011, pp. 83--90.","apa":"Ruhroth, T., Wehrheim, H., &#38; Ziegert, S. (2011). ReL: {A} Generic Refactoring Language for Specification and Execution. In <i>37th {EUROMICRO} Conference on Software Engineering and Advanced Applications, {SEAA} 2011, Oulu, Finland, August 30 - September 2, 2011</i> (pp. 83--90). <a href=\"https://doi.org/10.1109/SEAA.2011.22\">https://doi.org/10.1109/SEAA.2011.22</a>"},"publication":"37th {EUROMICRO} Conference on Software Engineering and Advanced Applications, {SEAA} 2011, Oulu, Finland, August 30 - September 2, 2011","department":[{"_id":"77"}],"type":"conference","date_created":"2018-06-13T08:23:28Z","date_updated":"2022-01-06T06:59:03Z","author":[{"full_name":"Ruhroth, Thomas","first_name":"Thomas","last_name":"Ruhroth"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"},{"full_name":"Ziegert, Steffen","first_name":"Steffen","last_name":"Ziegert"}],"title":"ReL: {A} Generic Refactoring Language for Specification and Execution","status":"public","year":"2011","doi":"10.1109/SEAA.2011.22","user_id":"29719","_id":"3185","page":"83--90"},{"user_id":"29719","doi":"10.1007/978-3-642-21437-0_25","editor":[{"full_name":"J. Butler, Michael","last_name":"J. Butler","first_name":"Michael"},{"last_name":"Schulte","first_name":"Wolfram","full_name":"Schulte, Wolfram"}],"page":"323--337","_id":"3186","series_title":"Lecture Notes in Computer Science","date_updated":"2022-01-06T06:59:03Z","year":"2011","status":"public","title":"Verifying Linearisability with Potential Linearisation Points","author":[{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"},{"full_name":"Schellhorn, Gerhard","first_name":"Gerhard","last_name":"Schellhorn"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"type":"conference","department":[{"_id":"77"}],"date_created":"2018-06-13T08:25:07Z","publication":"{FM} 2011: Formal Methods - 17th International Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011. Proceedings","citation":{"apa":"Derrick, J., Schellhorn, G., &#38; Wehrheim, H. (2011). Verifying Linearisability with Potential Linearisation Points. In M. J. Butler &#38; W. Schulte (Eds.), <i>{FM} 2011: Formal Methods - 17th International Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011. Proceedings</i> (pp. 323--337). <a href=\"https://doi.org/10.1007/978-3-642-21437-0_25\">https://doi.org/10.1007/978-3-642-21437-0_25</a>","mla":"Derrick, John, et al. “Verifying Linearisability with Potential Linearisation Points.” <i>{FM} 2011: Formal Methods - 17th International Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011. Proceedings</i>, edited by Michael J. Butler and Wolfram Schulte, 2011, pp. 323--337, doi:<a href=\"https://doi.org/10.1007/978-3-642-21437-0_25\">10.1007/978-3-642-21437-0_25</a>.","ieee":"J. Derrick, G. Schellhorn, and H. Wehrheim, “Verifying Linearisability with Potential Linearisation Points,” in <i>{FM} 2011: Formal Methods - 17th International Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011. Proceedings</i>, 2011, pp. 323--337.","chicago":"Derrick, John, Gerhard Schellhorn, and Heike Wehrheim. “Verifying Linearisability with Potential Linearisation Points.” In <i>{FM} 2011: Formal Methods - 17th International Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011. Proceedings</i>, edited by Michael J. Butler and Wolfram Schulte, 323--337. Lecture Notes in Computer Science, 2011. <a href=\"https://doi.org/10.1007/978-3-642-21437-0_25\">https://doi.org/10.1007/978-3-642-21437-0_25</a>.","short":"J. Derrick, G. Schellhorn, H. Wehrheim, in: M. J. Butler, W. Schulte (Eds.), {FM} 2011: Formal Methods - 17th International Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011. Proceedings, 2011, pp. 323--337.","ama":"Derrick J, Schellhorn G, Wehrheim H. Verifying Linearisability with Potential Linearisation Points. In: J. Butler M, Schulte W, eds. <i>{FM} 2011: Formal Methods - 17th International Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011. Proceedings</i>. Lecture Notes in Computer Science. ; 2011:323--337. doi:<a href=\"https://doi.org/10.1007/978-3-642-21437-0_25\">10.1007/978-3-642-21437-0_25</a>","bibtex":"@inproceedings{Derrick_Schellhorn_Wehrheim_2011, series={Lecture Notes in Computer Science}, title={Verifying Linearisability with Potential Linearisation Points}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-21437-0_25\">10.1007/978-3-642-21437-0_25</a>}, booktitle={{FM} 2011: Formal Methods - 17th International Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011. Proceedings}, author={Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}, editor={J. Butler, Michael and Schulte, WolframEditors}, year={2011}, pages={323--337}, collection={Lecture Notes in Computer Science} }"}},{"type":"conference","department":[{"_id":"77"}],"date_created":"2018-06-13T08:32:12Z","publication":"Formal Methods, Foundations and Applications - 14th Brazilian Symposium, {SBMF} 2011, S{\\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected Papers","citation":{"ama":"Steenken D, Wehrheim H, Wonisch D. Sound and Complete Abstract Graph Transformation. In: da Silva Sim{\\~{a}}o A, Morgan C, eds. <i>Formal Methods, Foundations and Applications - 14th Brazilian Symposium, {SBMF} 2011, S{\\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected Papers</i>. Lecture Notes in Computer Science. ; 2011:92--107. doi:<a href=\"https://doi.org/10.1007/978-3-642-25032-3_7\">10.1007/978-3-642-25032-3_7</a>","bibtex":"@inproceedings{Steenken_Wehrheim_Wonisch_2011, series={Lecture Notes in Computer Science}, title={Sound and Complete Abstract Graph Transformation}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-25032-3_7\">10.1007/978-3-642-25032-3_7</a>}, booktitle={Formal Methods, Foundations and Applications - 14th Brazilian Symposium, {SBMF} 2011, S{\\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected Papers}, author={Steenken, Dominik and Wehrheim, Heike and Wonisch, Daniel}, editor={da Silva Sim{\\~{a}}o, Adenilso and Morgan, CarrollEditors}, year={2011}, pages={92--107}, collection={Lecture Notes in Computer Science} }","mla":"Steenken, Dominik, et al. “Sound and Complete Abstract Graph Transformation.” <i>Formal Methods, Foundations and Applications - 14th Brazilian Symposium, {SBMF} 2011, S{\\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected Papers</i>, edited by Adenilso da Silva Sim{\\~{a}}o and Carroll Morgan, 2011, pp. 92--107, doi:<a href=\"https://doi.org/10.1007/978-3-642-25032-3_7\">10.1007/978-3-642-25032-3_7</a>.","short":"D. Steenken, H. Wehrheim, D. Wonisch, in: A. da Silva Sim{\\~{a}}o, C. Morgan (Eds.), Formal Methods, Foundations and Applications - 14th Brazilian Symposium, {SBMF} 2011, S{\\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected Papers, 2011, pp. 92--107.","chicago":"Steenken, Dominik, Heike Wehrheim, and Daniel Wonisch. “Sound and Complete Abstract Graph Transformation.” In <i>Formal Methods, Foundations and Applications - 14th Brazilian Symposium, {SBMF} 2011, S{\\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected Papers</i>, edited by Adenilso da Silva Sim{\\~{a}}o and Carroll Morgan, 92--107. Lecture Notes in Computer Science, 2011. <a href=\"https://doi.org/10.1007/978-3-642-25032-3_7\">https://doi.org/10.1007/978-3-642-25032-3_7</a>.","apa":"Steenken, D., Wehrheim, H., &#38; Wonisch, D. (2011). Sound and Complete Abstract Graph Transformation. In A. da Silva Sim{\\~{a}}o &#38; C. Morgan (Eds.), <i>Formal Methods, Foundations and Applications - 14th Brazilian Symposium, {SBMF} 2011, S{\\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected Papers</i> (pp. 92--107). <a href=\"https://doi.org/10.1007/978-3-642-25032-3_7\">https://doi.org/10.1007/978-3-642-25032-3_7</a>","ieee":"D. Steenken, H. Wehrheim, and D. Wonisch, “Sound and Complete Abstract Graph Transformation,” in <i>Formal Methods, Foundations and Applications - 14th Brazilian Symposium, {SBMF} 2011, S{\\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected Papers</i>, 2011, pp. 92--107."},"doi":"10.1007/978-3-642-25032-3_7","user_id":"29719","editor":[{"first_name":"Adenilso","last_name":"da Silva Sim{\\~{a}}o","full_name":"da Silva Sim{\\~{a}}o, Adenilso"},{"first_name":"Carroll","last_name":"Morgan","full_name":"Morgan, Carroll"}],"page":"92--107","series_title":"Lecture Notes in Computer Science","_id":"3187","date_updated":"2022-01-06T06:59:03Z","year":"2011","status":"public","title":"Sound and Complete Abstract Graph Transformation","author":[{"full_name":"Steenken, Dominik","last_name":"Steenken","first_name":"Dominik"},{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"},{"first_name":"Daniel","last_name":"Wonisch","full_name":"Wonisch, Daniel"}]},{"editor":[{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"},{"full_name":"A. Boiten, Eerke","first_name":"Eerke","last_name":"A. Boiten"},{"first_name":"Steve","last_name":"Reeves","full_name":"Reeves, Steve"}],"user_id":"29719","doi":"10.4204/EPTCS.55.9","series_title":"{EPTCS}","_id":"3188","page":"139--154","date_updated":"2022-01-06T06:59:03Z","author":[{"full_name":"Schneider, Steve","last_name":"Schneider","first_name":"Steve"},{"first_name":"Helen","last_name":"Treharne","full_name":"Treharne, Helen"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"year":"2011","title":"A {CSP} Account of Event-B Refinement","status":"public","department":[{"_id":"77"}],"type":"conference","date_created":"2018-06-13T08:43:19Z","citation":{"bibtex":"@inproceedings{Schneider_Treharne_Wehrheim_2011, series={{EPTCS}}, title={A {CSP} Account of Event-B Refinement}, DOI={<a href=\"https://doi.org/10.4204/EPTCS.55.9\">10.4204/EPTCS.55.9</a>}, booktitle={Proceedings 15th International Refinement Workshop, Refine@FM 2011, Limerick, Ireland, 20th June 2011.}, author={Schneider, Steve and Treharne, Helen and Wehrheim, Heike}, editor={Derrick, John and A. Boiten, Eerke and Reeves, SteveEditors}, year={2011}, pages={139--154}, collection={{EPTCS}} }","ama":"Schneider S, Treharne H, Wehrheim H. A {CSP} Account of Event-B Refinement. In: Derrick J, A. Boiten E, Reeves S, eds. <i>Proceedings 15th International Refinement Workshop, Refine@FM 2011, Limerick, Ireland, 20th June 2011.</i> {EPTCS}. ; 2011:139--154. doi:<a href=\"https://doi.org/10.4204/EPTCS.55.9\">10.4204/EPTCS.55.9</a>","mla":"Schneider, Steve, et al. “A {CSP} Account of Event-B Refinement.” <i>Proceedings 15th International Refinement Workshop, Refine@FM 2011, Limerick, Ireland, 20th June 2011.</i>, edited by John Derrick et al., 2011, pp. 139--154, doi:<a href=\"https://doi.org/10.4204/EPTCS.55.9\">10.4204/EPTCS.55.9</a>.","short":"S. Schneider, H. Treharne, H. Wehrheim, in: J. Derrick, E. A. Boiten, S. Reeves (Eds.), Proceedings 15th International Refinement Workshop, Refine@FM 2011, Limerick, Ireland, 20th June 2011., 2011, pp. 139--154.","chicago":"Schneider, Steve, Helen Treharne, and Heike Wehrheim. “A {CSP} Account of Event-B Refinement.” In <i>Proceedings 15th International Refinement Workshop, Refine@FM 2011, Limerick, Ireland, 20th June 2011.</i>, edited by John Derrick, Eerke A. Boiten, and Steve Reeves, 139--154. {EPTCS}, 2011. <a href=\"https://doi.org/10.4204/EPTCS.55.9\">https://doi.org/10.4204/EPTCS.55.9</a>.","ieee":"S. Schneider, H. Treharne, and H. Wehrheim, “A {CSP} Account of Event-B Refinement,” in <i>Proceedings 15th International Refinement Workshop, Refine@FM 2011, Limerick, Ireland, 20th June 2011.</i>, 2011, pp. 139--154.","apa":"Schneider, S., Treharne, H., &#38; Wehrheim, H. (2011). A {CSP} Account of Event-B Refinement. In J. Derrick, E. A. Boiten, &#38; S. Reeves (Eds.), <i>Proceedings 15th International Refinement Workshop, Refine@FM 2011, Limerick, Ireland, 20th June 2011.</i> (pp. 139--154). <a href=\"https://doi.org/10.4204/EPTCS.55.9\">https://doi.org/10.4204/EPTCS.55.9</a>"},"publication":"Proceedings 15th International Refinement Workshop, Refine@FM 2011, Limerick, Ireland, 20th June 2011."},{"department":[{"_id":"71"}],"type":"conference","date_created":"2021-11-21T18:35:27Z","citation":{"ama":"Nebe K, Fischer HG, Klompmaker F, Jung H. Multi-touch, tangible and pen-based interaction in incident planning. In: Oldenbourg Wissenschaftsverlag GmbH, M {\\ \"u} nchen; 2011:263-273.","bibtex":"@inproceedings{Nebe_Fischer_Klompmaker_Jung_2011, title={Multi-touch, tangible and pen-based interaction in incident planning}, publisher={Oldenbourg Wissenschaftsverlag GmbH, M {\\ \"u} nchen}, author={Nebe, Karsten and Fischer, Holger Gerhard and Klompmaker, Florian  and Jung, Helge}, year={2011}, pages={263–273} }","mla":"Nebe, Karsten, et al. <i>Multi-Touch, Tangible and Pen-Based Interaction in Incident Planning</i>. Oldenbourg Wissenschaftsverlag GmbH, M {\\ \"u} nchen, 2011, pp. 263–73.","short":"K. Nebe, H.G. Fischer, F. Klompmaker, H. Jung, in: Oldenbourg Wissenschaftsverlag GmbH, M {\\ \"u} nchen, 2011, pp. 263–273.","chicago":"Nebe, Karsten, Holger Gerhard Fischer, Florian  Klompmaker, and Helge Jung. “Multi-Touch, Tangible and Pen-Based Interaction in Incident Planning,” 263–73. Oldenbourg Wissenschaftsverlag GmbH, M {\\ \"u} nchen, 2011.","apa":"Nebe, K., Fischer, H. G., Klompmaker, F., &#38; Jung, H. (2011). <i>Multi-touch, tangible and pen-based interaction in incident planning</i>. 263–273.","ieee":"K. Nebe, H. G. Fischer, F. Klompmaker, and H. Jung, “Multi-touch, tangible and pen-based interaction in incident planning,” 2011, pp. 263–273."},"user_id":"71124","_id":"27622","publisher":"Oldenbourg Wissenschaftsverlag GmbH, M {\\ \"u} nchen","language":[{"iso":"eng"}],"page":"263-273","date_updated":"2022-01-06T06:57:43Z","publication_status":"published","author":[{"full_name":"Nebe, Karsten","first_name":"Karsten","last_name":"Nebe"},{"full_name":"Fischer, Holger Gerhard","last_name":"Fischer","first_name":"Holger Gerhard","id":"30457"},{"full_name":"Klompmaker, Florian ","first_name":"Florian ","last_name":"Klompmaker"},{"full_name":"Jung, Helge","first_name":"Helge","last_name":"Jung"}],"title":"Multi-touch, tangible and pen-based interaction in incident planning","year":"2011","status":"public"},{"language":[{"iso":"eng"}],"_id":"27623","page":"191-202","user_id":"71124","author":[{"full_name":"Keil, Reinhard","first_name":"Reinhard","last_name":"Keil"},{"id":"497","first_name":"Harald","last_name":"Selke","full_name":"Selke, Harald"}],"conference":{"start_date":"2011-07-19","end_date":"2011-07-22"},"title":"Virtual Learning Spaces for Co-Active Learning","year":"2011","status":"public","publication_status":"published","date_updated":"2022-01-06T06:57:43Z","date_created":"2021-11-21T19:32:20Z","department":[{"_id":"71"}],"type":"conference","citation":{"ama":"Keil R, Selke H. Virtual Learning Spaces for Co-Active Learning. In: <i>Proc. of Int. Conf. on Improving University Teaching</i>. ; 2011:191-202.","bibtex":"@inproceedings{Keil_Selke_2011, title={Virtual Learning Spaces for Co-Active Learning}, booktitle={Proc. of Int. Conf. on Improving University Teaching}, author={Keil, Reinhard and Selke, Harald}, year={2011}, pages={191–202} }","mla":"Keil, Reinhard, and Harald Selke. “Virtual Learning Spaces for Co-Active Learning.” <i>Proc. of Int. Conf. on Improving University Teaching</i>, 2011, pp. 191–202.","short":"R. Keil, H. Selke, in: Proc. of Int. Conf. on Improving University Teaching, 2011, pp. 191–202.","chicago":"Keil, Reinhard, and Harald Selke. “Virtual Learning Spaces for Co-Active Learning.” In <i>Proc. of Int. Conf. on Improving University Teaching</i>, 191–202, 2011.","apa":"Keil, R., &#38; Selke, H. (2011). Virtual Learning Spaces for Co-Active Learning. <i>Proc. of Int. Conf. on Improving University Teaching</i>, 191–202.","ieee":"R. Keil and H. Selke, “Virtual Learning Spaces for Co-Active Learning,” in <i>Proc. of Int. Conf. on Improving University Teaching</i>, 2011, pp. 191–202."},"publication":"Proc. of Int. Conf. on Improving University Teaching","abstract":[{"text":"Kollaboratives Lernen kann im Großen und Ganzen durch verteilte, unterbrochene kooperative Prozesse charakterisiert werden, da die Interaktion mit anderen Lernern und Lehrenden zu verschiedenen Zeiten an verschiedenen Orten stattfindet. Um die zeitlich und räumlich verteilten Lernaktivitäten zu integrieren, muss ein virtueller Lernraum bereitgestellt werden der einerseits als Arena kooperativer Interaktionen dient und andererseits gleichzeitig ein verteiltes externes Gedächtnis durch persistente Lernobjekte bietet. Das Konzept des ko-aktiven Lernens umfasst eine Vielzahl von technischen Konzepten und Funktionen, die kollaboratives Lernen in unterschiedlichsten Lernarrangements unterstützen.\r\n","lang":"eng"}]},{"date_created":"2021-11-21T19:38:09Z","department":[{"_id":"71"}],"type":"conference","citation":{"mla":"Paelke, Volker, et al. <i>Multi-Touch Interaction for Disaster Management.}</i>. 2011.","ama":"Paelke V, Nebe K, Klompmaker F, Jung H. Multi-Touch Interaction for Disaster Management.}. In: ; 2011.","bibtex":"@inproceedings{Paelke_Nebe_Klompmaker_Jung_2011, title={Multi-Touch Interaction for Disaster Management.}}, author={Paelke, Volker and Nebe, Karsten and Klompmaker, Florian and Jung, Helge}, year={2011} }","apa":"Paelke, V., Nebe, K., Klompmaker, F., &#38; Jung, H. (2011). <i>Multi-Touch Interaction for Disaster Management.}</i>.","ieee":"V. Paelke, K. Nebe, F. Klompmaker, and H. Jung, “Multi-Touch Interaction for Disaster Management.},” 2011.","short":"V. Paelke, K. Nebe, F. Klompmaker, H. Jung, in: 2011.","chicago":"Paelke, Volker, Karsten Nebe, Florian Klompmaker, and Helge Jung. “Multi-Touch Interaction for Disaster Management.},” 2011."},"_id":"27624","language":[{"iso":"eng"}],"user_id":"71124","author":[{"first_name":"Volker","last_name":"Paelke","full_name":"Paelke, Volker"},{"first_name":"Karsten","last_name":"Nebe","full_name":"Nebe, Karsten"},{"full_name":"Klompmaker, Florian","first_name":"Florian","last_name":"Klompmaker"},{"first_name":"Helge","last_name":"Jung","full_name":"Jung, Helge"}],"title":"Multi-Touch Interaction for Disaster Management.}","year":"2011","status":"public","date_updated":"2022-01-06T06:57:43Z","publication_status":"published"},{"author":[{"last_name":"Keil","first_name":"Reinhard","full_name":"Keil, Reinhard"}],"title":"Hypothesis- guided technology design as the basis of contextual computer science","status":"public","year":"2011","publication_status":"published","date_updated":"2022-01-06T06:57:43Z","_id":"27625","language":[{"iso":"eng"}],"publisher":"Lit Verlag, M {\\\" u} nster","page":"165-184","editor":[{"full_name":"Breiter, A","first_name":"A","last_name":"Breiter"},{"full_name":"Wind, M","last_name":"Wind","first_name":"M"}],"user_id":"71124","citation":{"chicago":"Keil, Reinhard. “Hypothesis- Guided Technology Design as the Basis of Contextual Computer Science.” edited by A Breiter and M Wind, 165–84. Lit Verlag, M {\\\" u} nster, 2011.","short":"R. Keil, in: A. Breiter, M. Wind (Eds.), Lit Verlag, M {\\\" u} nster, 2011, pp. 165–184.","ama":"Keil R. Hypothesis- guided technology design as the basis of contextual computer science. In: Breiter A, Wind M, eds. Lit Verlag, M {\\\" u} nster; 2011:165-184.","bibtex":"@inproceedings{Keil_2011, title={Hypothesis- guided technology design as the basis of contextual computer science}, publisher={Lit Verlag, M {\\\" u} nster}, author={Keil, Reinhard}, editor={Breiter, A and Wind, M}, year={2011}, pages={165–184} }","apa":"Keil, R. (2011). <i>Hypothesis- guided technology design as the basis of contextual computer science</i> (A. Breiter &#38; M. Wind, Eds.; pp. 165–184). Lit Verlag, M {\\\" u} nster.","mla":"Keil, Reinhard. <i>Hypothesis- Guided Technology Design as the Basis of Contextual Computer Science</i>. Edited by A Breiter and M Wind, Lit Verlag, M {\\\" u} nster, 2011, pp. 165–84.","ieee":"R. Keil, “Hypothesis- guided technology design as the basis of contextual computer science,” 2011, pp. 165–184."},"date_created":"2021-11-21T19:43:58Z","department":[{"_id":"71"}],"type":"conference"},{"year":"2011","status":"public","title":"Smart Fiducials: Advanced Tangible Interaction Techniques through Dynamic Visual Paterns","author":[{"first_name":"Florian","last_name":"Klompmaker","full_name":"Klompmaker, Florian"},{"full_name":"Nebe,  Karsten","last_name":"Nebe","first_name":" Karsten"},{"first_name":"H","last_name":"Jung","full_name":"Jung, H"}],"publication_status":"published","date_updated":"2022-01-06T06:57:43Z","language":[{"iso":"eng"}],"_id":"27626","user_id":"71124","citation":{"short":"F. Klompmaker,  Karsten Nebe, H. Jung, in: 2011.","chicago":"Klompmaker, Florian,  Karsten Nebe, and H Jung. “Smart Fiducials: Advanced Tangible Interaction Techniques through Dynamic Visual Paterns,” 2011.","ieee":"F. Klompmaker,  Karsten Nebe, and H. Jung, “Smart Fiducials: Advanced Tangible Interaction Techniques through Dynamic Visual Paterns,” 2011.","apa":"Klompmaker, F., Nebe,  Karsten, &#38; Jung, H. (2011). <i>Smart Fiducials: Advanced Tangible Interaction Techniques through Dynamic Visual Paterns</i>.","bibtex":"@inproceedings{Klompmaker_Nebe_Jung_2011, title={Smart Fiducials: Advanced Tangible Interaction Techniques through Dynamic Visual Paterns}, author={Klompmaker, Florian and Nebe,  Karsten and Jung, H}, year={2011} }","ama":"Klompmaker F, Nebe  Karsten, Jung H. Smart Fiducials: Advanced Tangible Interaction Techniques through Dynamic Visual Paterns. In: ; 2011.","mla":"Klompmaker, Florian, et al. <i>Smart Fiducials: Advanced Tangible Interaction Techniques through Dynamic Visual Paterns</i>. 2011."},"date_created":"2021-11-21T19:51:23Z","type":"conference","department":[{"_id":"71"}]}]