[{"language":[{"iso":"eng"}],"_id":"47839","publisher":"Springer Berlin Heidelberg","doi":"10.1007/978-3-642-55032-4_49","user_id":"99291","year":"2014","status":"public","title":"Aggregation of Network Protocol Data Near Its Source","author":[{"id":"99291","full_name":"Fourné, Marcel","first_name":"Marcel","last_name":"Fourné"},{"full_name":"Stegemann, Kevin","last_name":"Stegemann","first_name":"Kevin"},{"full_name":"Petersen, Dominique","first_name":"Dominique","last_name":"Petersen"},{"full_name":"Pohlmann, Norbert","last_name":"Pohlmann","first_name":"Norbert"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642550317","9783642550324"]},"date_updated":"2023-10-06T16:22:35Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2023-10-06T16:08:23Z","type":"book_chapter","publication":"Information and Communication Technology","citation":{"ieee":"M. Fourné, K. Stegemann, D. Petersen, and N. Pohlmann, “Aggregation of Network Protocol Data Near Its Source,” in <i>Information and Communication Technology</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2014.","mla":"Fourné, Marcel, et al. “Aggregation of Network Protocol Data Near Its Source.” <i>Information and Communication Technology</i>, Springer Berlin Heidelberg, 2014, doi:<a href=\"https://doi.org/10.1007/978-3-642-55032-4_49\">10.1007/978-3-642-55032-4_49</a>.","apa":"Fourné, M., Stegemann, K., Petersen, D., &#38; Pohlmann, N. (2014). Aggregation of Network Protocol Data Near Its Source. In <i>Information and Communication Technology</i>. Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-55032-4_49\">https://doi.org/10.1007/978-3-642-55032-4_49</a>","bibtex":"@inbook{Fourné_Stegemann_Petersen_Pohlmann_2014, place={Berlin, Heidelberg}, title={Aggregation of Network Protocol Data Near Its Source}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-55032-4_49\">10.1007/978-3-642-55032-4_49</a>}, booktitle={Information and Communication Technology}, publisher={Springer Berlin Heidelberg}, author={Fourné, Marcel and Stegemann, Kevin and Petersen, Dominique and Pohlmann, Norbert}, year={2014} }","chicago":"Fourné, Marcel, Kevin Stegemann, Dominique Petersen, and Norbert Pohlmann. “Aggregation of Network Protocol Data Near Its Source.” In <i>Information and Communication Technology</i>. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. <a href=\"https://doi.org/10.1007/978-3-642-55032-4_49\">https://doi.org/10.1007/978-3-642-55032-4_49</a>.","short":"M. Fourné, K. Stegemann, D. Petersen, N. Pohlmann, in: Information and Communication Technology, Springer Berlin Heidelberg, Berlin, Heidelberg, 2014.","ama":"Fourné M, Stegemann K, Petersen D, Pohlmann N. Aggregation of Network Protocol Data Near Its Source. In: <i>Information and Communication Technology</i>. Springer Berlin Heidelberg; 2014. doi:<a href=\"https://doi.org/10.1007/978-3-642-55032-4_49\">10.1007/978-3-642-55032-4_49</a>"},"extern":"1"},{"page":"154-168","publisher":"Springer Berlin Heidelberg","_id":"2979","user_id":"25078","doi":"10.1007/978-3-642-40026-1_10","status":"public","year":"2013","title":"Improved Side Channel Attacks on Pairing Based Cryptography","publication_identifier":{"isbn":["9783642400254","9783642400261"],"issn":["0302-9743","1611-3349"]},"author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Peter","last_name":"Günther","full_name":"Günther, Peter"},{"last_name":"Liske","first_name":"Gennadij","full_name":"Liske, Gennadij"}],"publication_status":"published","date_updated":"2022-01-06T06:58:49Z","date_created":"2018-06-05T07:33:22Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"64"}],"publication":"Constructive Side-Channel Analysis and Secure Design","citation":{"apa":"Blömer, J., Günther, P., &#38; Liske, G. (2013). Improved Side Channel Attacks on Pairing Based Cryptography. In <i>Constructive Side-Channel Analysis and Secure Design</i> (pp. 154–168). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-40026-1_10\">https://doi.org/10.1007/978-3-642-40026-1_10</a>","ieee":"J. Blömer, P. Günther, and G. Liske, “Improved Side Channel Attacks on Pairing Based Cryptography,” in <i>Constructive Side-Channel Analysis and Secure Design</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 154–168.","short":"J. Blömer, P. Günther, G. Liske, in: Constructive Side-Channel Analysis and Secure Design, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 154–168.","chicago":"Blömer, Johannes, Peter Günther, and Gennadij Liske. “Improved Side Channel Attacks on Pairing Based Cryptography.” In <i>Constructive Side-Channel Analysis and Secure Design</i>, 154–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40026-1_10\">https://doi.org/10.1007/978-3-642-40026-1_10</a>.","mla":"Blömer, Johannes, et al. “Improved Side Channel Attacks on Pairing Based Cryptography.” <i>Constructive Side-Channel Analysis and Secure Design</i>, Springer Berlin Heidelberg, 2013, pp. 154–68, doi:<a href=\"https://doi.org/10.1007/978-3-642-40026-1_10\">10.1007/978-3-642-40026-1_10</a>.","ama":"Blömer J, Günther P, Liske G. Improved Side Channel Attacks on Pairing Based Cryptography. In: <i>Constructive Side-Channel Analysis and Secure Design</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:154-168. doi:<a href=\"https://doi.org/10.1007/978-3-642-40026-1_10\">10.1007/978-3-642-40026-1_10</a>","bibtex":"@inbook{Blömer_Günther_Liske_2013, place={Berlin, Heidelberg}, title={Improved Side Channel Attacks on Pairing Based Cryptography}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-40026-1_10\">10.1007/978-3-642-40026-1_10</a>}, booktitle={Constructive Side-Channel Analysis and Secure Design}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Günther, Peter and Liske, Gennadij}, year={2013}, pages={154–168} }"}},{"publication":"Distributed, Ambient, and Pervasive Interactions","date_created":"2018-12-18T12:42:33Z","type":"book_chapter","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"year":"2013","title":"A Taxonomy-Based Approach towards NUI Interaction Design","author":[{"first_name":"Florian","last_name":"Klompmaker","full_name":"Klompmaker, Florian"},{"full_name":"Paelke, Volker","last_name":"Paelke","first_name":"Volker"},{"full_name":"Fischer, Holger Gerhard","last_name":"Fischer","first_name":"Holger Gerhard","id":"30457"}],"publication_identifier":{"isbn":["9783642393501","9783642393518"],"issn":["0302-9743","1611-3349"]},"date_updated":"2022-01-06T07:02:59Z","publication_status":"published","intvolume":"      8028","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-39351-8_4","citation":{"bibtex":"@inbook{Klompmaker_Paelke_Fischer_2013, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={A Taxonomy-Based Approach towards NUI Interaction Design}, volume={8028}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-39351-8_4\">10.1007/978-3-642-39351-8_4</a>}, booktitle={Distributed, Ambient, and Pervasive Interactions}, publisher={Springer Berlin Heidelberg}, author={Klompmaker, Florian and Paelke, Volker and Fischer, Holger Gerhard}, year={2013}, pages={32–41}, collection={Lecture Notes in Computer Science} }","ama":"Klompmaker F, Paelke V, Fischer HG. A Taxonomy-Based Approach towards NUI Interaction Design. In: <i>Distributed, Ambient, and Pervasive Interactions</i>. Vol 8028. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:32-41. doi:<a href=\"https://doi.org/10.1007/978-3-642-39351-8_4\">10.1007/978-3-642-39351-8_4</a>","mla":"Klompmaker, Florian, et al. “A Taxonomy-Based Approach towards NUI Interaction Design.” <i>Distributed, Ambient, and Pervasive Interactions</i>, vol. 8028, Springer Berlin Heidelberg, 2013, pp. 32–41, doi:<a href=\"https://doi.org/10.1007/978-3-642-39351-8_4\">10.1007/978-3-642-39351-8_4</a>.","short":"F. Klompmaker, V. Paelke, H.G. Fischer, in: Distributed, Ambient, and Pervasive Interactions, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 32–41.","chicago":"Klompmaker, Florian, Volker Paelke, and Holger Gerhard Fischer. “A Taxonomy-Based Approach towards NUI Interaction Design.” In <i>Distributed, Ambient, and Pervasive Interactions</i>, 8028:32–41. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39351-8_4\">https://doi.org/10.1007/978-3-642-39351-8_4</a>.","ieee":"F. Klompmaker, V. Paelke, and H. G. Fischer, “A Taxonomy-Based Approach towards NUI Interaction Design,” in <i>Distributed, Ambient, and Pervasive Interactions</i>, vol. 8028, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 32–41.","apa":"Klompmaker, F., Paelke, V., &#38; Fischer, H. G. (2013). A Taxonomy-Based Approach towards NUI Interaction Design. In <i>Distributed, Ambient, and Pervasive Interactions</i> (Vol. 8028, pp. 32–41). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-39351-8_4\">https://doi.org/10.1007/978-3-642-39351-8_4</a>"},"place":"Berlin, Heidelberg","status":"public","conference":{"name":"International Conference on Distributed, Ambient, and Pervasive Interactions (DAPI) as part of HCI International 2013","start_date":"2013-07-21","location":"Las Vegas, USA","end_date":"2013-07-26"},"page":"32-41","publisher":"Springer Berlin Heidelberg","_id":"6276","user_id":"30457","volume":8028},{"conference":{"end_date":"2013-07-26","start_date":"2013-07-21","name":"International Conference of Design, User Experience, and Usability (DUXU) as part of HCI International 2013","location":"Las Vegas, USA"},"status":"public","volume":8012,"user_id":"30457","_id":"6279","publisher":"Springer Berlin Heidelberg","page":"252-261","citation":{"apa":"Fischer, H. G., Strenge, B., &#38; Nebe, K. (2013). Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design. In <i>Design, User Experience, and Usability. Design Philosophy, Methods, and Tools</i> (Vol. 8012, pp. 252–261). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-39229-0_28\">https://doi.org/10.1007/978-3-642-39229-0_28</a>","ieee":"H. G. Fischer, B. Strenge, and K. Nebe, “Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design,” in <i>Design, User Experience, and Usability. Design Philosophy, Methods, and Tools</i>, vol. 8012, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 252–261.","chicago":"Fischer, Holger Gerhard, Benjamin Strenge, and Karsten Nebe. “Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design.” In <i>Design, User Experience, and Usability. Design Philosophy, Methods, and Tools</i>, 8012:252–61. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39229-0_28\">https://doi.org/10.1007/978-3-642-39229-0_28</a>.","short":"H.G. Fischer, B. Strenge, K. Nebe, in: Design, User Experience, and Usability. Design Philosophy, Methods, and Tools, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 252–261.","mla":"Fischer, Holger Gerhard, et al. “Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design.” <i>Design, User Experience, and Usability. Design Philosophy, Methods, and Tools</i>, vol. 8012, Springer Berlin Heidelberg, 2013, pp. 252–61, doi:<a href=\"https://doi.org/10.1007/978-3-642-39229-0_28\">10.1007/978-3-642-39229-0_28</a>.","ama":"Fischer HG, Strenge B, Nebe K. Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design. In: <i>Design, User Experience, and Usability. Design Philosophy, Methods, and Tools</i>. Vol 8012. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:252-261. doi:<a href=\"https://doi.org/10.1007/978-3-642-39229-0_28\">10.1007/978-3-642-39229-0_28</a>","bibtex":"@inbook{Fischer_Strenge_Nebe_2013, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design}, volume={8012}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-39229-0_28\">10.1007/978-3-642-39229-0_28</a>}, booktitle={Design, User Experience, and Usability. Design Philosophy, Methods, and Tools}, publisher={Springer Berlin Heidelberg}, author={Fischer, Holger Gerhard and Strenge, Benjamin and Nebe, Karsten}, year={2013}, pages={252–261}, collection={Lecture Notes in Computer Science} }"},"place":"Berlin, Heidelberg","intvolume":"      8012","publication_status":"published","date_updated":"2022-01-06T07:02:59Z","publication_identifier":{"isbn":["9783642392283","9783642392290"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Fischer","first_name":"Holger Gerhard","full_name":"Fischer, Holger Gerhard","id":"30457"},{"full_name":"Strenge, Benjamin","first_name":"Benjamin","last_name":"Strenge"},{"full_name":"Nebe, Karsten","first_name":"Karsten","last_name":"Nebe"}],"title":"Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design","year":"2013","doi":"10.1007/978-3-642-39229-0_28","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"publication":"Design, User Experience, and Usability. Design Philosophy, Methods, and Tools","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"type":"book_chapter","date_created":"2018-12-18T12:44:48Z"},{"type":"conference","department":[{"_id":"66"}],"place":"Berlin, Heidelberg","date_created":"2019-01-15T10:23:36Z","extern":"1","publication":"Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013","citation":{"ama":"Place T, van Rooijen L, Zeitoun M. Separating Regular Languages by Piecewise Testable and Unambiguous Languages. In: <i>Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:729-740. doi:<a href=\"https://doi.org/10.1007/978-3-642-40313-2_64\">10.1007/978-3-642-40313-2_64</a>","bibtex":"@inproceedings{Place_van Rooijen_Zeitoun_2013, place={Berlin, Heidelberg}, title={Separating Regular Languages by Piecewise Testable and Unambiguous Languages}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-40313-2_64\">10.1007/978-3-642-40313-2_64</a>}, booktitle={Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013}, publisher={Springer Berlin Heidelberg}, author={Place, Thomas and van Rooijen, Lorijn and Zeitoun, Marc}, year={2013}, pages={729–740} }","mla":"Place, Thomas, et al. “Separating Regular Languages by Piecewise Testable and Unambiguous Languages.” <i>Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013</i>, Springer Berlin Heidelberg, 2013, pp. 729–40, doi:<a href=\"https://doi.org/10.1007/978-3-642-40313-2_64\">10.1007/978-3-642-40313-2_64</a>.","chicago":"Place, Thomas, Lorijn van Rooijen, and Marc Zeitoun. “Separating Regular Languages by Piecewise Testable and Unambiguous Languages.” In <i>Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013</i>, 729–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40313-2_64\">https://doi.org/10.1007/978-3-642-40313-2_64</a>.","short":"T. Place, L. van Rooijen, M. Zeitoun, in: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 729–740.","apa":"Place, T., van Rooijen, L., &#38; Zeitoun, M. (2013). Separating Regular Languages by Piecewise Testable and Unambiguous Languages. In <i>Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013</i> (pp. 729–740). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-40313-2_64\">https://doi.org/10.1007/978-3-642-40313-2_64</a>","ieee":"T. Place, L. van Rooijen, and M. Zeitoun, “Separating Regular Languages by Piecewise Testable and Unambiguous Languages,” in <i>Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013</i>, 2013, pp. 729–740."},"doi":"10.1007/978-3-642-40313-2_64","user_id":"58843","page":"729-740","_id":"6732","publisher":"Springer Berlin Heidelberg","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:17Z","publication_status":"published","title":"Separating Regular Languages by Piecewise Testable and Unambiguous Languages","status":"public","year":"2013","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642403125","9783642403132"]},"author":[{"last_name":"Place","first_name":"Thomas","full_name":"Place, Thomas"},{"id":"58843","full_name":"van Rooijen, Lorijn","last_name":"van Rooijen","first_name":"Lorijn"},{"full_name":"Zeitoun, Marc","first_name":"Marc","last_name":"Zeitoun"}]},{"publication":"Big Data - 29th British National Conference on Databases, BNCOD 2013,","citation":{"short":"S. Böttcher, R. Hartel, T. Jacobs, in: Big Data - 29th British National Conference on Databases, BNCOD 2013, Springer, Berlin, Heidelberg, 2013, pp. 149–164.","chicago":"Böttcher, Stefan, Rita Hartel, and Thomas Jacobs. “Fast Multi-Update Operations on Compressed XML Data.” In <i>Big Data - 29th British National Conference on Databases, BNCOD 2013,</i> 149–64. Berlin, Heidelberg: Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39467-6_15\">https://doi.org/10.1007/978-3-642-39467-6_15</a>.","apa":"Böttcher, S., Hartel, R., &#38; Jacobs, T. (2013). Fast Multi-update Operations on Compressed XML Data. In <i>Big Data - 29th British National Conference on Databases, BNCOD 2013,</i> (pp. 149–164). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39467-6_15\">https://doi.org/10.1007/978-3-642-39467-6_15</a>","ieee":"S. Böttcher, R. Hartel, and T. Jacobs, “Fast Multi-update Operations on Compressed XML Data,” in <i>Big Data - 29th British National Conference on Databases, BNCOD 2013,</i> 2013, pp. 149–164.","ama":"Böttcher S, Hartel R, Jacobs T. Fast Multi-update Operations on Compressed XML Data. In: <i>Big Data - 29th British National Conference on Databases, BNCOD 2013,</i>. Berlin, Heidelberg: Springer; 2013:149-164. doi:<a href=\"https://doi.org/10.1007/978-3-642-39467-6_15\">10.1007/978-3-642-39467-6_15</a>","bibtex":"@inproceedings{Böttcher_Hartel_Jacobs_2013, place={Berlin, Heidelberg}, title={Fast Multi-update Operations on Compressed XML Data}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-39467-6_15\">10.1007/978-3-642-39467-6_15</a>}, booktitle={Big Data - 29th British National Conference on Databases, BNCOD 2013,}, publisher={Springer}, author={Böttcher, Stefan and Hartel, Rita and Jacobs, Thomas}, year={2013}, pages={149–164} }","mla":"Böttcher, Stefan, et al. “Fast Multi-Update Operations on Compressed XML Data.” <i>Big Data - 29th British National Conference on Databases, BNCOD 2013,</i> Springer, 2013, pp. 149–64, doi:<a href=\"https://doi.org/10.1007/978-3-642-39467-6_15\">10.1007/978-3-642-39467-6_15</a>."},"type":"conference","department":[{"_id":"69"}],"date_created":"2019-11-21T15:19:46Z","place":"Berlin, Heidelberg","publication_status":"published","date_updated":"2022-01-06T06:52:15Z","status":"public","title":"Fast Multi-update Operations on Compressed XML Data","year":"2013","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642394669","9783642394676"]},"author":[{"last_name":"Böttcher","first_name":"Stefan","full_name":"Böttcher, Stefan","id":"624"},{"id":"14961","last_name":"Hartel","first_name":"Rita","full_name":"Hartel, Rita"},{"full_name":"Jacobs, Thomas","first_name":"Thomas","last_name":"Jacobs"}],"user_id":"14961","doi":"10.1007/978-3-642-39467-6_15","page":"149-164","publisher":"Springer","_id":"15093","language":[{"iso":"eng"}]},{"date_created":"2020-04-06T07:21:55Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}],"publication":"Advances in Visual Computing","citation":{"apa":"Jähn, C., Eikel, B., Fischer, M., Petring, R., &#38; Meyer auf der Heide, F. (2013). Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties. In <i>Advances in Visual Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">https://doi.org/10.1007/978-3-642-41914-0_12</a>","ieee":"C. Jähn, B. Eikel, M. Fischer, R. Petring, and F. Meyer auf der Heide, “Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties,” in <i>Advances in Visual Computing</i>, Berlin, Heidelberg, 2013.","chicago":"Jähn, Claudius, Benjamin Eikel, Matthias Fischer, Ralf Petring, and Friedhelm Meyer auf der Heide. “Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.” In <i>Advances in Visual Computing</i>. Berlin, Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">https://doi.org/10.1007/978-3-642-41914-0_12</a>.","short":"C. Jähn, B. Eikel, M. Fischer, R. Petring, F. Meyer auf der Heide, in: Advances in Visual Computing, Berlin, Heidelberg, 2013.","mla":"Jähn, Claudius, et al. “Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.” <i>Advances in Visual Computing</i>, 2013, doi:<a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">10.1007/978-3-642-41914-0_12</a>.","ama":"Jähn C, Eikel B, Fischer M, Petring R, Meyer auf der Heide F. Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties. In: <i>Advances in Visual Computing</i>. Berlin, Heidelberg; 2013. doi:<a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">10.1007/978-3-642-41914-0_12</a>","bibtex":"@inbook{Jähn_Eikel_Fischer_Petring_Meyer auf der Heide_2013, place={Berlin, Heidelberg}, title={Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">10.1007/978-3-642-41914-0_12</a>}, booktitle={Advances in Visual Computing}, author={Jähn, Claudius and Eikel, Benjamin and Fischer, Matthias and Petring, Ralf and Meyer auf der Heide, Friedhelm}, year={2013} }"},"abstract":[{"lang":"eng","text":"In order to evaluate the efficiency of algorithms for real-time 3D rendering, different properties like rendering time, occluded triangles, or image quality, need to be investigated. Since these properties depend on the position of the camera, usually some camera path is chosen, along which the measurements are performed. As those measurements cover only a small part of the scene, this approach hardly allows drawing conclusions regarding the algorithm's properties at arbitrary positions in the scene. The presented method allows the systematic and position-independent evaluation of rendering algorithms. It uses an adaptive sampling approach to approximate the distribution of a property (like rendering time) for all positions in the scene. This approximation can be visualized to produce an intuitive impression of the algorithm's behavior or be statistically analyzed for objectively rating and comparing algorithms. We demonstrate our method by evaluating performance aspects of a known occlusion culling algorithm.\r\n"}],"language":[{"iso":"eng"}],"_id":"16406","user_id":"15415","doi":"10.1007/978-3-642-41914-0_12","status":"public","year":"2013","title":"Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties","author":[{"full_name":"Jähn, Claudius","last_name":"Jähn","first_name":"Claudius"},{"first_name":"Benjamin","last_name":"Eikel","full_name":"Eikel, Benjamin"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"first_name":"Ralf","last_name":"Petring","full_name":"Petring, Ralf"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"isbn":["9783642419133","9783642419140"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_updated":"2022-01-06T06:52:50Z"},{"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","title":"Real-Time 3D Rendering of Heterogeneous Scenes","status":"public","year":"2013","author":[{"full_name":"Petring, Ralf","first_name":"Ralf","last_name":"Petring"},{"full_name":"Eikel, Benjamin","last_name":"Eikel","first_name":"Benjamin"},{"full_name":"Jähn, Claudius","first_name":"Claudius","last_name":"Jähn"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642419133","9783642419140"]},"doi":"10.1007/978-3-642-41914-0_44","user_id":"15415","_id":"16407","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Many virtual 3D scenes, especially those that are large, are not structured evenly. For such heterogeneous data, there is no single algorithm that is able to render every scene type at each position fast and with the same high image quality. For a small set of scenes, this situation can be improved if different rendering algorithms are manually assigned to particular parts of the scene by an experienced user. We introduce the Multi-Algorithm-Rendering method. It automatically deploys different rendering algorithms simultaneously for a broad range of scene types. The method divides the scene into subregions and measures the behavior of different algorithms for each region in a preprocessing step. During runtime, this data is utilized to compute an estimate for the quality and running time of the available rendering algorithms from the observer's point of view. By solving an optimizing problem, the image quality can be optimized by an assignment of algorithms to regions while keeping the frame rate almost constant.\r\n"}],"publication":"Advances in Visual Computing","citation":{"chicago":"Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Real-Time 3D Rendering of Heterogeneous Scenes.” In <i>Advances in Visual Computing</i>. Berlin, Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">https://doi.org/10.1007/978-3-642-41914-0_44</a>.","short":"R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Advances in Visual Computing, Berlin, Heidelberg, 2013.","apa":"Petring, R., Eikel, B., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2013). Real-Time 3D Rendering of Heterogeneous Scenes. In <i>Advances in Visual Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">https://doi.org/10.1007/978-3-642-41914-0_44</a>","ieee":"R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Real-Time 3D Rendering of Heterogeneous Scenes,” in <i>Advances in Visual Computing</i>, Berlin, Heidelberg, 2013.","ama":"Petring R, Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Real-Time 3D Rendering of Heterogeneous Scenes. In: <i>Advances in Visual Computing</i>. Berlin, Heidelberg; 2013. doi:<a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">10.1007/978-3-642-41914-0_44</a>","bibtex":"@inbook{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Berlin, Heidelberg}, title={Real-Time 3D Rendering of Heterogeneous Scenes}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">10.1007/978-3-642-41914-0_44</a>}, booktitle={Advances in Visual Computing}, author={Petring, Ralf and Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2013} }","mla":"Petring, Ralf, et al. “Real-Time 3D Rendering of Heterogeneous Scenes.” <i>Advances in Visual Computing</i>, 2013, doi:<a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">10.1007/978-3-642-41914-0_44</a>."},"type":"book_chapter","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-04-06T07:38:52Z"},{"publication":"Swarm Intelligence: 8th International Conference, ANTS 2012","type":"conference","department":[{"_id":"63"},{"_id":"238"}],"date_created":"2020-10-22T10:00:11Z","date_updated":"2022-01-06T06:54:21Z","publication_status":"published","intvolume":"      7461","title":"Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions","year":"2012","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642326493","9783642326509"]},"author":[{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"full_name":"Engelbrecht, Andreas","first_name":"Andreas","last_name":"Engelbrecht"},{"full_name":"Birattari, Mauro","first_name":"Mauro","last_name":"Birattari"},{"full_name":"Dorigo, Marco","last_name":"Dorigo","first_name":"Marco"},{"full_name":"Blum, Christian","last_name":"Blum","first_name":"Christian"},{"full_name":"Stuetzle, Thomas","last_name":"Stuetzle","first_name":"Thomas"},{"full_name":"Christensen, Anders Lyhne","last_name":"Christensen","first_name":"Anders Lyhne"},{"full_name":"Gross, Roderich","first_name":"Roderich","last_name":"Gross"}],"doi":"10.1007/978-3-642-32650-9_15","language":[{"iso":"eng"}],"citation":{"mla":"Hamann, Heiko, et al. “Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions.” <i>Swarm Intelligence: 8th International Conference, ANTS 2012</i>, vol. 7461, Springer, 2012, pp. 168–79, doi:<a href=\"https://doi.org/10.1007/978-3-642-32650-9_15\">10.1007/978-3-642-32650-9_15</a>.","bibtex":"@inproceedings{Hamann_Engelbrecht_Birattari_Dorigo_Blum_Stuetzle_Christensen_Gross_2012, place={Berlin, Heidelberg}, title={Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions}, volume={7461}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-32650-9_15\">10.1007/978-3-642-32650-9_15</a>}, booktitle={Swarm Intelligence: 8th International Conference, ANTS 2012}, publisher={Springer}, author={Hamann, Heiko and Engelbrecht, Andreas and Birattari, Mauro and Dorigo, Marco and Blum, Christian and Stuetzle, Thomas and Christensen, Anders Lyhne and Gross, Roderich}, year={2012}, pages={168–179} }","ama":"Hamann H, Engelbrecht A, Birattari M, et al. Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions. In: <i>Swarm Intelligence: 8th International Conference, ANTS 2012</i>. Vol 7461. Berlin, Heidelberg: Springer; 2012:168-179. doi:<a href=\"https://doi.org/10.1007/978-3-642-32650-9_15\">10.1007/978-3-642-32650-9_15</a>","ieee":"H. Hamann <i>et al.</i>, “Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions,” in <i>Swarm Intelligence: 8th International Conference, ANTS 2012</i>, 2012, vol. 7461, pp. 168–179.","apa":"Hamann, H., Engelbrecht, A., Birattari, M., Dorigo, M., Blum, C., Stuetzle, T., … Gross, R. (2012). Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions. In <i>Swarm Intelligence: 8th International Conference, ANTS 2012</i> (Vol. 7461, pp. 168–179). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32650-9_15\">https://doi.org/10.1007/978-3-642-32650-9_15</a>","short":"H. Hamann, A. Engelbrecht, M. Birattari, M. Dorigo, C. Blum, T. Stuetzle, A.L. Christensen, R. Gross, in: Swarm Intelligence: 8th International Conference, ANTS 2012, Springer, Berlin, Heidelberg, 2012, pp. 168–179.","chicago":"Hamann, Heiko, Andreas Engelbrecht, Mauro Birattari, Marco Dorigo, Christian Blum, Thomas Stuetzle, Anders Lyhne Christensen, and Roderich Gross. “Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions.” In <i>Swarm Intelligence: 8th International Conference, ANTS 2012</i>, 7461:168–79. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32650-9_15\">https://doi.org/10.1007/978-3-642-32650-9_15</a>."},"place":"Berlin, Heidelberg","status":"public","user_id":"15415","volume":7461,"page":"168-179","_id":"20179","publisher":"Springer"},{"extern":"1","publication":"Advances in Cryptology – ASIACRYPT 2012","citation":{"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>.","short":"S. Kakvi, E. Kiltz, A. May, in: Advances in Cryptology – ASIACRYPT 2012, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 404–414.","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>","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.","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>","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} }","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>."},"type":"book_chapter","department":[{"_id":"558"}],"place":"Berlin, Heidelberg","date_created":"2018-05-25T12:34:06Z","date_updated":"2022-01-06T06:58:47Z","publication_status":"published","status":"public","year":"2012","title":"Certifying RSA","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642349607","9783642349614"]},"author":[{"first_name":"Saqib","last_name":"Kakvi","full_name":"Kakvi, Saqib","id":"66268"},{"last_name":"Kiltz","first_name":"Eike","full_name":"Kiltz, Eike"},{"last_name":"May","first_name":"Alexander","full_name":"May, Alexander"}],"doi":"10.1007/978-3-642-34961-4_25","user_id":"25078","page":"404-414","_id":"2918","publisher":"Springer Berlin Heidelberg"},{"publisher":"Springer Berlin Heidelberg","_id":"2919","page":"537-553","main_file_link":[{"url":"https://doi.org/10.1007/s00145-017-9257-9"}],"user_id":"66268","doi":"10.1007/978-3-642-29011-4_32","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642290107","9783642290114"]},"author":[{"id":"66268","full_name":"Kakvi, Saqib","last_name":"Kakvi","first_name":"Saqib"},{"full_name":"Kiltz, Eike","first_name":"Eike","last_name":"Kiltz"}],"title":"Optimal Security Proofs for Full Domain Hash, Revisited","status":"public","year":"2012","publication_status":"published","date_updated":"2022-01-06T06:58:47Z","date_created":"2018-05-25T12:36:44Z","place":"Berlin, Heidelberg","department":[{"_id":"558"}],"type":"book_chapter","citation":{"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>","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.","short":"S. Kakvi, E. Kiltz, in: Advances in Cryptology – EUROCRYPT 2012, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 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>.","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>.","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>","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} }"},"publication":"Advances in Cryptology – EUROCRYPT 2012","extern":"1"},{"publication":"Experimental Algorithms","citation":{"ama":"Kempkes B, Meyer auf der Heide F. Continuous Local Strategies for Robotic Formation Problems. In: <i>Experimental Algorithms</i>. Berlin, Heidelberg; 2012. doi:<a href=\"https://doi.org/10.1007/978-3-642-30850-5_2\">10.1007/978-3-642-30850-5_2</a>","bibtex":"@inbook{Kempkes_Meyer auf der Heide_2012, place={Berlin, Heidelberg}, title={Continuous Local Strategies for Robotic Formation Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-30850-5_2\">10.1007/978-3-642-30850-5_2</a>}, booktitle={Experimental Algorithms}, author={Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2012} }","mla":"Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Continuous Local Strategies for Robotic Formation Problems.” <i>Experimental Algorithms</i>, 2012, doi:<a href=\"https://doi.org/10.1007/978-3-642-30850-5_2\">10.1007/978-3-642-30850-5_2</a>.","short":"B. Kempkes, F. Meyer auf der Heide, in: Experimental Algorithms, Berlin, Heidelberg, 2012.","chicago":"Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Continuous Local Strategies for Robotic Formation Problems.” In <i>Experimental Algorithms</i>. Berlin, Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-30850-5_2\">https://doi.org/10.1007/978-3-642-30850-5_2</a>.","apa":"Kempkes, B., &#38; Meyer auf der Heide, F. (2012). Continuous Local Strategies for Robotic Formation Problems. In <i>Experimental Algorithms</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-30850-5_2\">https://doi.org/10.1007/978-3-642-30850-5_2</a>","ieee":"B. Kempkes and F. Meyer auf der Heide, “Continuous Local Strategies for Robotic Formation Problems,” in <i>Experimental Algorithms</i>, Berlin, Heidelberg, 2012."},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-07T06:41:18Z","place":"Berlin, Heidelberg","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","year":"2012","title":"Continuous Local Strategies for Robotic Formation Problems","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642308499","9783642308505"]},"author":[{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"user_id":"15415","doi":"10.1007/978-3-642-30850-5_2","_id":"16445","language":[{"iso":"eng"}]},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642282089","9783642282096"]},"author":[{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"title":"Local, Self-organizing Strategies for Robotic Formation Problems","year":"2012","status":"public","date_updated":"2022-01-06T06:52:50Z","publication_status":"published","_id":"16448","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-28209-6_2","user_id":"15415","citation":{"ieee":"B. Kempkes and F. Meyer auf der Heide, “Local, Self-organizing Strategies for Robotic Formation Problems,” in <i>Algorithms for Sensor Systems</i>, Berlin, Heidelberg, 2012.","apa":"Kempkes, B., &#38; Meyer auf der Heide, F. (2012). Local, Self-organizing Strategies for Robotic Formation Problems. In <i>Algorithms for Sensor Systems</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-28209-6_2\">https://doi.org/10.1007/978-3-642-28209-6_2</a>","chicago":"Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Local, Self-Organizing Strategies for Robotic Formation Problems.” In <i>Algorithms for Sensor Systems</i>. Berlin, Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28209-6_2\">https://doi.org/10.1007/978-3-642-28209-6_2</a>.","short":"B. Kempkes, F. Meyer auf der Heide, in: Algorithms for Sensor Systems, Berlin, Heidelberg, 2012.","mla":"Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Local, Self-Organizing Strategies for Robotic Formation Problems.” <i>Algorithms for Sensor Systems</i>, 2012, doi:<a href=\"https://doi.org/10.1007/978-3-642-28209-6_2\">10.1007/978-3-642-28209-6_2</a>.","bibtex":"@inbook{Kempkes_Meyer auf der Heide_2012, place={Berlin, Heidelberg}, title={Local, Self-organizing Strategies for Robotic Formation Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-28209-6_2\">10.1007/978-3-642-28209-6_2</a>}, booktitle={Algorithms for Sensor Systems}, author={Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2012} }","ama":"Kempkes B, Meyer auf der Heide F. Local, Self-organizing Strategies for Robotic Formation Problems. In: <i>Algorithms for Sensor Systems</i>. Berlin, Heidelberg; 2012. doi:<a href=\"https://doi.org/10.1007/978-3-642-28209-6_2\">10.1007/978-3-642-28209-6_2</a>"},"publication":"Algorithms for Sensor Systems","place":"Berlin, Heidelberg","date_created":"2020-04-07T06:51:14Z","department":[{"_id":"63"}],"type":"book_chapter"},{"citation":{"apa":"Baier, R., &#38; Molo, M. H. (2012). Newton’s Method and Secant Method for Set-Valued Mappings. In <i>Large-Scale Scientific Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-29843-1_9\">https://doi.org/10.1007/978-3-642-29843-1_9</a>","ieee":"R. Baier and M. H. Molo, “Newton’s Method and Secant Method for Set-Valued Mappings,” in <i>Large-Scale Scientific Computing</i>, Berlin, Heidelberg, 2012.","short":"R. Baier, M.H. Molo, in: Large-Scale Scientific Computing, Berlin, Heidelberg, 2012.","chicago":"Baier, Robert, and Mirko Hessel-von Molo. “Newton’s Method and Secant Method for Set-Valued Mappings.” In <i>Large-Scale Scientific Computing</i>. Berlin, Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-29843-1_9\">https://doi.org/10.1007/978-3-642-29843-1_9</a>.","mla":"Baier, Robert, and Mirko Hessel-von Molo. “Newton’s Method and Secant Method for Set-Valued Mappings.” <i>Large-Scale Scientific Computing</i>, 2012, doi:<a href=\"https://doi.org/10.1007/978-3-642-29843-1_9\">10.1007/978-3-642-29843-1_9</a>.","ama":"Baier R, Molo MH. Newton’s Method and Secant Method for Set-Valued Mappings. In: <i>Large-Scale Scientific Computing</i>. Berlin, Heidelberg; 2012. doi:<a href=\"https://doi.org/10.1007/978-3-642-29843-1_9\">10.1007/978-3-642-29843-1_9</a>","bibtex":"@inbook{Baier_Molo_2012, place={Berlin, Heidelberg}, title={Newton’s Method and Secant Method for Set-Valued Mappings}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-29843-1_9\">10.1007/978-3-642-29843-1_9</a>}, booktitle={Large-Scale Scientific Computing}, author={Baier, Robert and Molo, Mirko Hessel-von}, year={2012} }"},"publication":"Large-Scale Scientific Computing","place":"Berlin, Heidelberg","date_created":"2020-04-15T07:59:49Z","department":[{"_id":"101"}],"type":"book_chapter","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642298424","9783642298431"]},"author":[{"last_name":"Baier","first_name":"Robert","full_name":"Baier, Robert"},{"last_name":"Molo","first_name":"Mirko Hessel-von","full_name":"Molo, Mirko Hessel-von"}],"title":"Newton’s Method and Secant Method for Set-Valued Mappings","status":"public","year":"2012","date_updated":"2022-01-06T06:52:52Z","publication_status":"published","_id":"16516","doi":"10.1007/978-3-642-29843-1_9","user_id":"15701"},{"title":"Bleichenbacher’s Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption","status":"public","year":"2012","publication_identifier":{"isbn":["9783642331664","9783642331671"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager"},{"full_name":"Schinzel, Sebastian","last_name":"Schinzel","first_name":"Sebastian"},{"id":"83504","full_name":"Somorovsky, Juraj","orcid":"0000-0002-3593-7720","first_name":"Juraj","last_name":"Somorovsky"}],"date_updated":"2022-01-06T06:52:39Z","publication_status":"published","_id":"15891","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-33167-1_43","user_id":"83504","publication":"Computer Security – ESORICS 2012","citation":{"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</i>. Berlin, Heidelberg. <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</i>, Berlin, Heidelberg, 2012.","short":"T. Jager, S. Schinzel, J. Somorovsky, in: Computer Security – ESORICS 2012, Berlin, Heidelberg, 2012.","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</i>. Berlin, Heidelberg, 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>.","mla":"Jager, Tibor, et al. “Bleichenbacher’s Attack Strikes Again: Breaking PKCS#1 v1.5 in XML Encryption.” <i>Computer Security – ESORICS 2012</i>, 2012, doi:<a href=\"https://doi.org/10.1007/978-3-642-33167-1_43\">10.1007/978-3-642-33167-1_43</a>.","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</i>. Berlin, Heidelberg; 2012. doi:<a href=\"https://doi.org/10.1007/978-3-642-33167-1_43\">10.1007/978-3-642-33167-1_43</a>","bibtex":"@inbook{Jager_Schinzel_Somorovsky_2012, place={Berlin, Heidelberg}, 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}, author={Jager, Tibor and Schinzel, Sebastian and Somorovsky, Juraj}, year={2012} }"},"place":"Berlin, Heidelberg","date_created":"2020-02-15T09:31:47Z","type":"book_chapter"},{"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-33179-4_48","publication_identifier":{"isbn":["9783642331787","9783642331794"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Suess","first_name":"Tim","full_name":"Suess, Tim"},{"last_name":"Koch","first_name":"Clemens","full_name":"Koch, Clemens"},{"full_name":"Jähn, Claudius","last_name":"Jähn","first_name":"Claudius"},{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer","id":"146"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"year":"2012","title":"Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes","intvolume":"      7431","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-06T07:40:57Z","department":[{"_id":"63"}],"type":"conference","publication":"Advances in Visual Computing","abstract":[{"text":"We present a parallel rendering system for heterogeneous PC clusters to visualize massive models. One single, powerful visualization node is supported by a group of backend nodes with weak graphics performance. While the visualization node renders the visible objects, the backend nodes asynchronously perform visibility tests and supply the front end with visible scene objects. The visualization node stores only currently visible objects in its memory, while the scene is distributed among the backend nodes’ memory without redundancy. To efficiently compute the occlusion tests in spite of that each backend node stores only a fraction of the original geometry, we complete the scene by adding highly simplified versions of the objects stored on other nodes. We test our system with 15 backend nodes. It is able to render a ≈ 350,M polygons (≈ 8.5,GiB) large aircraft model with 20, to 30,fps and thus allows a walk-through in real-time.\r\n","lang":"eng"}],"_id":"16408","page":"502-512","volume":7431,"user_id":"15415","status":"public","place":"Berlin, Heidelberg","citation":{"ama":"Suess T, Koch C, Jähn C, Fischer M, Meyer auf der Heide F. Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. In: <i>Advances in Visual Computing</i>. Vol 7431. Lecture Notes in Computer Science. ; 2012:502-512. doi:<a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">10.1007/978-3-642-33179-4_48</a>","bibtex":"@inproceedings{Suess_Koch_Jähn_Fischer_Meyer auf der Heide_2012, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes}, volume={7431}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">10.1007/978-3-642-33179-4_48</a>}, booktitle={Advances in Visual Computing}, author={Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2012}, pages={502–512}, collection={Lecture Notes in Computer Science} }","mla":"Suess, Tim, et al. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes.” <i>Advances in Visual Computing</i>, vol. 7431, 2012, pp. 502–12, doi:<a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">10.1007/978-3-642-33179-4_48</a>.","chicago":"Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes.” In <i>Advances in Visual Computing</i>, 7431:502–12. Lecture Notes in Computer Science. Berlin, Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">https://doi.org/10.1007/978-3-642-33179-4_48</a>.","short":"T. Suess, C. Koch, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Advances in Visual Computing, Berlin, Heidelberg, 2012, pp. 502–512.","apa":"Suess, T., Koch, C., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2012). Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. <i>Advances in Visual Computing</i>, <i>7431</i>, 502–512. <a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">https://doi.org/10.1007/978-3-642-33179-4_48</a>","ieee":"T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes,” in <i>Advances in Visual Computing</i>, 2012, vol. 7431, pp. 502–512, doi: <a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">10.1007/978-3-642-33179-4_48</a>."}},{"citation":{"short":"H. Hamann, T. Schmickl, K. Crailsheim, in: 10th European Conference on Artificial Life (ECAL’09), 2011, pp. 442--449.","chicago":"Hamann, Heiko, Thomas Schmickl, and Karl Crailsheim. “Evolving for Creativity: Maximizing Complexity in a Self-Organized Multi-Particle System.” In <i>10th European Conference on Artificial Life (ECAL’09)</i>, 5777:442--449, 2011. <a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">https://doi.org/10.1007/978-3-642-21283-3_55</a>.","apa":"Hamann, H., Schmickl, T., &#38; Crailsheim, K. (2011). Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System. In <i>10th European Conference on Artificial Life (ECAL’09)</i> (Vol. 5777, pp. 442--449). <a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">https://doi.org/10.1007/978-3-642-21283-3_55</a>","ieee":"H. Hamann, T. Schmickl, and K. Crailsheim, “Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System,” in <i>10th European Conference on Artificial Life (ECAL’09)</i>, 2011, vol. 5777, pp. 442--449.","ama":"Hamann H, Schmickl T, Crailsheim K. Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System. In: <i>10th European Conference on Artificial Life (ECAL’09)</i>. Vol 5777. ; 2011:442--449. doi:<a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">10.1007/978-3-642-21283-3_55</a>","bibtex":"@inproceedings{Hamann_Schmickl_Crailsheim_2011, title={Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System}, volume={5777}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">10.1007/978-3-642-21283-3_55</a>}, booktitle={10th European Conference on Artificial Life (ECAL’09)}, author={Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}, year={2011}, pages={442--449} }","mla":"Hamann, Heiko, et al. “Evolving for Creativity: Maximizing Complexity in a Self-Organized Multi-Particle System.” <i>10th European Conference on Artificial Life (ECAL’09)</i>, vol. 5777, 2011, pp. 442--449, doi:<a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">10.1007/978-3-642-21283-3_55</a>."},"publication":"10th European Conference on Artificial Life (ECAL'09)","date_created":"2020-10-22T12:27:11Z","department":[{"_id":"63"},{"_id":"238"}],"type":"conference","publication_identifier":{"isbn":["9783642212826","9783642212833"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Heiko","last_name":"Hamann","full_name":"Hamann, Heiko"},{"full_name":"Schmickl, Thomas","last_name":"Schmickl","first_name":"Thomas"},{"last_name":"Crailsheim","first_name":"Karl","full_name":"Crailsheim, Karl"}],"title":"Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System","status":"public","year":"2011","intvolume":"      5777","date_updated":"2022-01-06T06:54:21Z","publication_status":"published","_id":"20183","language":[{"iso":"eng"}],"page":"442--449","volume":5777,"doi":"10.1007/978-3-642-21283-3_55","user_id":"15415"},{"type":"journal_article","date_created":"2018-06-25T09:22:18Z","citation":{"mla":"Lettmann, Theodor, et al. “Modeling Agents and Agent Systems.” <i>Transactions on Computational Collective Intelligence V</i>, Springer Berlin Heidelberg, 2011, pp. 157–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-24016-4_9\">10.1007/978-3-642-24016-4_9</a>.","apa":"Lettmann, T., Baumann, M., Eberling, M., &#38; Kemmerich, T. (2011). Modeling Agents and Agent Systems. <i>Transactions on Computational Collective Intelligence V</i>, 157–181. <a href=\"https://doi.org/10.1007/978-3-642-24016-4_9\">https://doi.org/10.1007/978-3-642-24016-4_9</a>","ieee":"T. Lettmann, M. Baumann, M. Eberling, and T. Kemmerich, “Modeling Agents and Agent Systems,” <i>Transactions on Computational Collective Intelligence V</i>, pp. 157–181, 2011.","chicago":"Lettmann, Theodor, Michael Baumann, Markus Eberling, and Thomas Kemmerich. “Modeling Agents and Agent Systems.” <i>Transactions on Computational Collective Intelligence V</i>, 2011, 157–81. <a href=\"https://doi.org/10.1007/978-3-642-24016-4_9\">https://doi.org/10.1007/978-3-642-24016-4_9</a>.","ama":"Lettmann T, Baumann M, Eberling M, Kemmerich T. Modeling Agents and Agent Systems. <i>Transactions on Computational Collective Intelligence V</i>. 2011:157-181. doi:<a href=\"https://doi.org/10.1007/978-3-642-24016-4_9\">10.1007/978-3-642-24016-4_9</a>","short":"T. Lettmann, M. Baumann, M. Eberling, T. Kemmerich, Transactions on Computational Collective Intelligence V (2011) 157–181.","bibtex":"@article{Lettmann_Baumann_Eberling_Kemmerich_2011, title={Modeling Agents and Agent Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-24016-4_9\">10.1007/978-3-642-24016-4_9</a>}, journal={Transactions on Computational Collective Intelligence V}, publisher={Springer Berlin Heidelberg}, author={Lettmann, Theodor and Baumann, Michael and Eberling, Markus and Kemmerich, Thomas}, year={2011}, pages={157–181} }"},"publication":"Transactions on Computational Collective Intelligence V","doi":"10.1007/978-3-642-24016-4_9","user_id":"315","_id":"3332","publisher":"Springer Berlin Heidelberg","language":[{"iso":"eng"}],"page":"157-181","date_updated":"2022-01-06T06:59:10Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642240157","9783642240164"]},"author":[{"id":"315","orcid":"0000-0001-5859-2457","first_name":"Theodor","last_name":"Lettmann","full_name":"Lettmann, Theodor"},{"full_name":"Baumann, Michael","first_name":"Michael","last_name":"Baumann"},{"first_name":"Markus","last_name":"Eberling","full_name":"Eberling, Markus"},{"first_name":"Thomas","last_name":"Kemmerich","full_name":"Kemmerich, Thomas"}],"year":"2011","title":"Modeling Agents and Agent Systems","status":"public"},{"date_updated":"2022-01-06T06:54:33Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642183805","9783642183812"]},"author":[{"last_name":"Cord-Landwehr","first_name":"Andreas","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias"},{"last_name":"Hüllmann","first_name":"Martina","full_name":"Hüllmann, Martina"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"last_name":"Klaas","first_name":"Alexander","full_name":"Klaas, Alexander"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"full_name":"Kurras, Sven","first_name":"Sven","last_name":"Kurras"},{"full_name":"Märtens, Marcus","last_name":"Märtens","first_name":"Marcus"},{"first_name":"Friedhelm Meyer","last_name":"auf der Heide","full_name":"auf der Heide, Friedhelm Meyer"},{"first_name":"Christoph","last_name":"Raupach","full_name":"Raupach, Christoph"},{"full_name":"Swierkot, Kamil","first_name":"Kamil","last_name":"Swierkot"},{"id":"3902","full_name":"Warner, Daniel","last_name":"Warner","first_name":"Daniel"},{"last_name":"Weddemann","first_name":"Christoph","full_name":"Weddemann, Christoph"},{"last_name":"Wonisch","first_name":"Daniel","full_name":"Wonisch, Daniel"}],"status":"public","title":"Collisionless Gathering of Robots with an Extent","year":"2011","doi":"10.1007/978-3-642-18381-2_15","user_id":"3902","_id":"20709","language":[{"iso":"eng"}],"citation":{"mla":"Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” <i>SOFSEM 2011: Theory and Practice of Computer Science</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>.","bibtex":"@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={Collisionless Gathering of Robots with an Extent}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>}, booktitle={SOFSEM 2011: Theory and Practice of Computer Science}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and auf der Heide, Friedhelm Meyer and et al.}, year={2011} }","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: <i>SOFSEM 2011: Theory and Practice of Computer Science</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>","ieee":"A. Cord-Landwehr <i>et al.</i>, “Collisionless Gathering of Robots with an Extent,” in <i>SOFSEM 2011: Theory and Practice of Computer Science</i>, Berlin, Heidelberg, 2011.","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In <i>SOFSEM 2011: Theory and Practice of Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>","chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering of Robots with an Extent.” In <i>SOFSEM 2011: Theory and Practice of Computer Science</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>.","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F.M. auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: SOFSEM 2011: Theory and Practice of Computer Science, Berlin, Heidelberg, 2011."},"publication":"SOFSEM 2011: Theory and Practice of Computer Science","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-12-12T11:15:30Z"},{"citation":{"ieee":"A. Cord-Landwehr <i>et al.</i>, “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 2011.","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>","mla":"Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” <i>Automata, Languages and Programming</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>.","bibtex":"@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for Analyzing Convergence Algorithms for Mobile Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>}, booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }","chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>.","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming, Berlin, Heidelberg, 2011."},"publication":"Automata, Languages and Programming","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-12-12T12:22:41Z","date_updated":"2022-01-06T06:54:33Z","publication_status":"published","publication_identifier":{"isbn":["9783642220111","9783642220128"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"first_name":"Martina","last_name":"Hüllmann","full_name":"Hüllmann, Martina"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"first_name":"Alexander","last_name":"Klaas","full_name":"Klaas, Alexander"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"first_name":"Sven","last_name":"Kurras","full_name":"Kurras, Sven"},{"last_name":"Märtens","first_name":"Marcus","full_name":"Märtens, Marcus"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Raupach, Christoph","first_name":"Christoph","last_name":"Raupach"},{"last_name":"Swierkot","first_name":"Kamil","full_name":"Swierkot, Kamil"},{"full_name":"Warner, Daniel","first_name":"Daniel","last_name":"Warner","id":"3902"},{"first_name":"Christoph","last_name":"Weddemann","full_name":"Weddemann, Christoph"},{"full_name":"Wonisch, Daniel","last_name":"Wonisch","first_name":"Daniel"}],"year":"2011","title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","status":"public","doi":"10.1007/978-3-642-22012-8_52","user_id":"3902","_id":"20710","language":[{"iso":"eng"}]}]