[{"title":"Widersprüchliche Annäherungen – das deutschsprachige Drama","user_id":"14932","place":"München","editor":[{"last_name":"Reichel","first_name":"Peter","full_name":"Reichel, Peter"},{"full_name":"Schmid, Harald","first_name":"Harald","last_name":"Schmid"},{"last_name":"Steinbach","first_name":"Peter","full_name":"Steinbach, Peter"}],"date_created":"2020-09-11T08:23:28Z","status":"public","publication":"Der Nationalsozialismus – Die zweite Geschichte. Überwindung – Deutung – Erinnerung","department":[{"_id":"465"}],"author":[{"full_name":"Eke, Norbert Otto","first_name":"Norbert Otto","id":"104","last_name":"Eke"}],"publisher":"C. H. Beck","_id":"19296","date_updated":"2022-01-06T06:54:01Z","page":"261-282 (444-446)","citation":{"bibtex":"@inbook{Eke_2009, place={München}, title={Widersprüchliche Annäherungen – das deutschsprachige Drama}, booktitle={Der Nationalsozialismus – Die zweite Geschichte. Überwindung – Deutung – Erinnerung}, publisher={C. H. Beck}, author={Eke, Norbert Otto}, editor={Reichel, Peter and Schmid, Harald and Steinbach, PeterEditors}, year={2009}, pages={261-282 (444-446)} }","mla":"Eke, Norbert Otto. “Widersprüchliche Annäherungen – das deutschsprachige Drama.” Der Nationalsozialismus – Die zweite Geschichte. Überwindung – Deutung – Erinnerung, edited by Peter Reichel et al., C. H. Beck, 2009, pp. 261-282 (444-446).","ama":"Eke NO. Widersprüchliche Annäherungen – das deutschsprachige Drama. In: Reichel P, Schmid H, Steinbach P, eds. Der Nationalsozialismus – Die zweite Geschichte. Überwindung – Deutung – Erinnerung. München: C. H. Beck; 2009:261-282 (444-446).","apa":"Eke, N. O. (2009). Widersprüchliche Annäherungen – das deutschsprachige Drama. In P. Reichel, H. Schmid, & P. Steinbach (Eds.), Der Nationalsozialismus – Die zweite Geschichte. Überwindung – Deutung – Erinnerung (pp. 261-282 (444-446)). München: C. H. Beck.","chicago":"Eke, Norbert Otto. “Widersprüchliche Annäherungen – das deutschsprachige Drama.” In Der Nationalsozialismus – Die zweite Geschichte. Überwindung – Deutung – Erinnerung, edited by Peter Reichel, Harald Schmid, and Peter Steinbach, 261-282 (444-446). München: C. H. Beck, 2009.","ieee":"N. O. Eke, “Widersprüchliche Annäherungen – das deutschsprachige Drama,” in Der Nationalsozialismus – Die zweite Geschichte. Überwindung – Deutung – Erinnerung, P. Reichel, H. Schmid, and P. Steinbach, Eds. München: C. H. Beck, 2009, pp. 261-282 (444-446).","short":"N.O. Eke, in: P. Reichel, H. Schmid, P. Steinbach (Eds.), Der Nationalsozialismus – Die zweite Geschichte. Überwindung – Deutung – Erinnerung, C. H. Beck, München, 2009, pp. 261-282 (444-446)."},"year":"2009","type":"book_chapter","language":[{"iso":"ger"}]},{"date_updated":"2022-01-06T06:54:02Z","oa":"1","doi":"10.1007/978-3-642-10631-6_78","series_title":"Lecture Notes in Computer Science","title":"A Self-stabilizing and Local Delaunay Graph Construction","department":[{"_id":"79"}],"urn":"19304","_id":"1930","intvolume":" 5878","page":"771--780","year":"2009","citation":{"ieee":"R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “A Self-stabilizing and Local Delaunay Graph Construction,” in Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, 2009, vol. 5878, pp. 771--780.","short":"R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, in: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, Springer, 2009, pp. 771--780.","bibtex":"@inproceedings{Jacob_Ritscher_Scheideler_Schmid_2009, series={Lecture Notes in Computer Science}, title={A Self-stabilizing and Local Delaunay Graph Construction}, volume={5878}, DOI={10.1007/978-3-642-10631-6_78}, booktitle={Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, publisher={Springer}, author={Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={771--780}, collection={Lecture Notes in Computer Science} }","mla":"Jacob, Riko, et al. “A Self-Stabilizing and Local Delaunay Graph Construction.” Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, vol. 5878, Springer, 2009, pp. 771--780, doi:10.1007/978-3-642-10631-6_78.","chicago":"Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid. “A Self-Stabilizing and Local Delaunay Graph Construction.” In Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, 5878:771--780. Lecture Notes in Computer Science. Springer, 2009. https://doi.org/10.1007/978-3-642-10631-6_78.","apa":"Jacob, R., Ritscher, S., Scheideler, C., & Schmid, S. (2009). A Self-stabilizing and Local Delaunay Graph Construction. In Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings (Vol. 5878, pp. 771--780). Springer. https://doi.org/10.1007/978-3-642-10631-6_78","ama":"Jacob R, Ritscher S, Scheideler C, Schmid S. A Self-stabilizing and Local Delaunay Graph Construction. In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings. Vol 5878. Lecture Notes in Computer Science. Springer; 2009:771--780. doi:10.1007/978-3-642-10631-6_78"},"type":"conference","user_id":"15504","ddc":["040"],"file":[{"access_level":"open_access","date_created":"2018-04-13T10:05:53Z","file_name":"isaac09.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T10:05:53Z","file_id":"2342","creator":"florida","file_size":139275}],"file_date_updated":"2018-04-13T10:05:53Z","publication":"Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings","publisher":"Springer","author":[{"last_name":"Jacob","first_name":"Riko","full_name":"Jacob, Riko"},{"first_name":"Stephan","full_name":"Ritscher, Stephan","last_name":"Ritscher"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"}],"date_created":"2018-03-29T09:12:59Z","has_accepted_license":"1","status":"public","volume":5878},{"volume":67,"date_created":"2020-09-11T12:03:09Z","status":"public","publication":"Neulektüren – New Readings. Festschrift für Gerd Labroisse zum 80. Geburtstag","department":[{"_id":"465"}],"author":[{"last_name":"Eke","id":"104","first_name":"Norbert Otto","full_name":"Eke, Norbert Otto"}],"title":"Einsenkungen in Finsternisse oder: Flossenbürg liegt (nicht nur) in der Oberpfalz. Werner Fritschs Grabungen","user_id":"14932","page":"359-375","year":"2009","citation":{"ieee":"N. O. Eke, “Einsenkungen in Finsternisse oder: Flossenbürg liegt (nicht nur) in der Oberpfalz. Werner Fritschs Grabungen,” in Neulektüren – New Readings. Festschrift für Gerd Labroisse zum 80. Geburtstag, vol. 67, 2009, pp. 359–375.","short":"N.O. Eke, in: Neulektüren – New Readings. Festschrift für Gerd Labroisse zum 80. Geburtstag, 2009, pp. 359–375.","bibtex":"@inbook{Eke_2009, series={Amsterdamer Beiträge zur neueren Germanistik}, title={Einsenkungen in Finsternisse oder: Flossenbürg liegt (nicht nur) in der Oberpfalz. Werner Fritschs Grabungen}, volume={67}, booktitle={Neulektüren – New Readings. Festschrift für Gerd Labroisse zum 80. Geburtstag}, author={Eke, Norbert Otto}, year={2009}, pages={359–375}, collection={Amsterdamer Beiträge zur neueren Germanistik} }","mla":"Eke, Norbert Otto. “Einsenkungen in Finsternisse oder: Flossenbürg liegt (nicht nur) in der Oberpfalz. Werner Fritschs Grabungen.” Neulektüren – New Readings. Festschrift für Gerd Labroisse zum 80. Geburtstag, vol. 67, 2009, pp. 359–75.","chicago":"Eke, Norbert Otto. “Einsenkungen in Finsternisse oder: Flossenbürg liegt (nicht nur) in der Oberpfalz. Werner Fritschs Grabungen.” In Neulektüren – New Readings. Festschrift für Gerd Labroisse zum 80. Geburtstag, 67:359–75. Amsterdamer Beiträge zur neueren Germanistik, 2009.","apa":"Eke, N. O. (2009). Einsenkungen in Finsternisse oder: Flossenbürg liegt (nicht nur) in der Oberpfalz. Werner Fritschs Grabungen. In Neulektüren – New Readings. Festschrift für Gerd Labroisse zum 80. Geburtstag (Vol. 67, pp. 359–375).","ama":"Eke NO. Einsenkungen in Finsternisse oder: Flossenbürg liegt (nicht nur) in der Oberpfalz. Werner Fritschs Grabungen. In: Neulektüren – New Readings. Festschrift für Gerd Labroisse zum 80. Geburtstag. Vol 67. Amsterdamer Beiträge zur neueren Germanistik. ; 2009:359-375."},"type":"book_chapter","language":[{"iso":"ger"}],"series_title":"Amsterdamer Beiträge zur neueren Germanistik","intvolume":" 67","_id":"19315","date_updated":"2022-01-06T06:54:02Z"},{"title":"A distributed polylogarithmic time algorithm for self-stabilizing skip graphs","user_id":"15504","publication":"Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009","department":[{"_id":"79"}],"author":[{"last_name":"Jacob","first_name":"Riko","full_name":"Jacob, Riko"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"last_name":"Täubig","first_name":"Hanjo","full_name":"Täubig, Hanjo"}],"publication_identifier":{"isbn":["978-1-60558-396-9"]},"date_created":"2018-03-29T09:16:22Z","status":"public","_id":"1932","date_updated":"2022-01-06T06:54:02Z","doi":"10.1145/1582716.1582741","page":"131--140","type":"conference","year":"2009","citation":{"short":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.","ieee":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A distributed polylogarithmic time algorithm for self-stabilizing skip graphs,” in Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.","ama":"Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009. ; 2009:131--140. doi:10.1145/1582716.1582741","apa":"Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2009). A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009 (pp. 131--140). https://doi.org/10.1145/1582716.1582741","chicago":"Jacob, Riko, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.” In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 131--140, 2009. https://doi.org/10.1145/1582716.1582741.","mla":"Jacob, Riko, et al. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.” Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140, doi:10.1145/1582716.1582741.","bibtex":"@inproceedings{Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, title={A distributed polylogarithmic time algorithm for self-stabilizing skip graphs}, DOI={10.1145/1582716.1582741}, booktitle={Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009}, author={Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={131--140} }"}},{"title":"A DoS-resilient information system for dynamic data management","user_id":"15504","publication_identifier":{"isbn":["978-1-60558-606-9"]},"date_created":"2018-03-29T09:18:06Z","status":"public","department":[{"_id":"79"}],"publication":"SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009","author":[{"first_name":"Matthias","full_name":"Baumgart, Matthias","last_name":"Baumgart"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"doi":"10.1145/1583991.1584064","date_updated":"2022-01-06T06:54:02Z","_id":"1933","page":"300--309","citation":{"chicago":"Baumgart, Matthias, Christian Scheideler, and Stefan Schmid. “A DoS-Resilient Information System for Dynamic Data Management.” In SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 300--309, 2009. https://doi.org/10.1145/1583991.1584064.","apa":"Baumgart, M., Scheideler, C., & Schmid, S. (2009). A DoS-resilient information system for dynamic data management. In SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009 (pp. 300--309). https://doi.org/10.1145/1583991.1584064","ama":"Baumgart M, Scheideler C, Schmid S. A DoS-resilient information system for dynamic data management. In: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009. ; 2009:300--309. doi:10.1145/1583991.1584064","bibtex":"@inproceedings{Baumgart_Scheideler_Schmid_2009, title={A DoS-resilient information system for dynamic data management}, DOI={10.1145/1583991.1584064}, booktitle={SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009}, author={Baumgart, Matthias and Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={300--309} }","mla":"Baumgart, Matthias, et al. “A DoS-Resilient Information System for Dynamic Data Management.” SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309, doi:10.1145/1583991.1584064.","short":"M. Baumgart, C. Scheideler, S. Schmid, in: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309.","ieee":"M. Baumgart, C. Scheideler, and S. Schmid, “A DoS-resilient information system for dynamic data management,” in SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309."},"year":"2009","type":"conference"},{"year":"2009","citation":{"chicago":"Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization.” In Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, 5873:781--782. Lecture Notes in Computer Science. Springer, 2009. https://doi.org/10.1007/978-3-642-05118-0_58.","apa":"Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2009). Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. In Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings (Vol. 5873, pp. 781--782). Springer. https://doi.org/10.1007/978-3-642-05118-0_58","ama":"Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. In: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings. Vol 5873. Lecture Notes in Computer Science. Springer; 2009:781--782. doi:10.1007/978-3-642-05118-0_58","mla":"Gall, Dominik, et al. “Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization.” Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, vol. 5873, Springer, 2009, pp. 781--782, doi:10.1007/978-3-642-05118-0_58.","bibtex":"@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, series={Lecture Notes in Computer Science}, title={Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization}, volume={5873}, DOI={10.1007/978-3-642-05118-0_58}, booktitle={Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings}, publisher={Springer}, author={Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={781--782}, collection={Lecture Notes in Computer Science} }","short":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, Springer, 2009, pp. 781--782.","ieee":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization,” in Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, 2009, vol. 5873, pp. 781--782."},"type":"conference","page":"781--782","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-05118-0_58","_id":"1934","intvolume":" 5873","date_updated":"2022-01-06T06:54:02Z","publication_identifier":{"isbn":["978-3-642-05117-3"]},"volume":5873,"status":"public","date_created":"2018-03-29T09:19:17Z","publisher":"Springer","author":[{"last_name":"Gall","full_name":"Gall, Dominik","first_name":"Dominik"},{"first_name":"Riko","full_name":"Jacob, Riko","last_name":"Jacob"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"last_name":"Täubig","full_name":"Täubig, Hanjo","first_name":"Hanjo"}],"publication":"Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings","department":[{"_id":"79"}],"title":"Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization","user_id":"15504"},{"_id":"1935","date_updated":"2022-01-06T06:54:02Z","intvolume":" 9371","doi":"10.1145/1989493.1989516","series_title":"Dagstuhl Seminar Proceedings","citation":{"bibtex":"@inproceedings{Doerr_Ann Goldberg_Minder_Sauerwald_Scheideler_2009, series={Dagstuhl Seminar Proceedings}, title={Stabilizing Consensus with the Power of Two Choices}, volume={09371}, DOI={10.1145/1989493.1989516}, booktitle={Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany}, author={Doerr, Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2009}, collection={Dagstuhl Seminar Proceedings} }","mla":"Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.” Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, vol. 09371, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009, doi:10.1145/1989493.1989516.","ama":"Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Stabilizing Consensus with the Power of Two Choices. In: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009. Vol 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany; 2009. doi:10.1145/1989493.1989516","apa":"Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., & Scheideler, C. (2009). Stabilizing Consensus with the Power of Two Choices. In Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009 (Vol. 09371). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. https://doi.org/10.1145/1989493.1989516","chicago":"Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.” In Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Vol. 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009. https://doi.org/10.1145/1989493.1989516.","ieee":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing Consensus with the Power of Two Choices,” in Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, 2009, vol. 09371.","short":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009."},"type":"conference","year":"2009","title":"Stabilizing Consensus with the Power of Two Choices","user_id":"15504","publication":"Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009","department":[{"_id":"79"}],"author":[{"last_name":"Doerr","first_name":"Benjamin","full_name":"Doerr, Benjamin"},{"full_name":"Ann Goldberg, Leslie","first_name":"Leslie","last_name":"Ann Goldberg"},{"last_name":"Minder","full_name":"Minder, Lorenz","first_name":"Lorenz"},{"first_name":"Thomas","full_name":"Sauerwald, Thomas","last_name":"Sauerwald"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany","volume":"09371","date_created":"2018-03-29T09:20:44Z","status":"public"},{"_id":"2353","date_updated":"2022-01-06T06:55:56Z","citation":{"chicago":"Woehrle, Matthias, Christian Plessl, and Lothar Thiele. Rupeas: Ruby Powered Event Analysis DSL. Computer Engineering and Networks Lab, ETH Zurich, 2009.","ama":"Woehrle M, Plessl C, Thiele L. Rupeas: Ruby Powered Event Analysis DSL. Computer Engineering and Networks Lab, ETH Zurich; 2009.","apa":"Woehrle, M., Plessl, C., & Thiele, L. (2009). Rupeas: Ruby Powered Event Analysis DSL. Computer Engineering and Networks Lab, ETH Zurich.","mla":"Woehrle, Matthias, et al. Rupeas: Ruby Powered Event Analysis DSL. 2009.","bibtex":"@book{Woehrle_Plessl_Thiele_2009, place={Computer Engineering and Networks Lab, ETH Zurich}, title={Rupeas: Ruby Powered Event Analysis DSL}, author={Woehrle, Matthias and Plessl, Christian and Thiele, Lothar}, year={2009} }","short":"M. Woehrle, C. Plessl, L. Thiele, Rupeas: Ruby Powered Event Analysis DSL, Computer Engineering and Networks Lab, ETH Zurich, 2009.","ieee":"M. Woehrle, C. Plessl, and L. Thiele, Rupeas: Ruby Powered Event Analysis DSL. Computer Engineering and Networks Lab, ETH Zurich, 2009."},"year":"2009","type":"report","language":[{"iso":"eng"}],"report_number":"TIK-Report 290","extern":"1","place":"Computer Engineering and Networks Lab, ETH Zurich","abstract":[{"lang":"eng","text":"Wireless Sensor Networks (WSNs) are unique embedded computation systems for distributed sensing of a dispersed phenomenon. While being a strongly concurrent distributed system, its embedded aspects with severe resource limitations and the wireless communication requires a fusion of technologies and methodologies from very different fields. As WSNs are deployed in remote locations for long-term unattended operation, assurance of correct functioning of the system is of prime concern. Thus, the design and development of WSNs requires specialized tools to allow for testing and debugging the system. To this end, we present a framework for analyzing and checking WSNs based on collected events during system operation. It allows for abstracting from the event trace by means of behavioral queries and uses assertions for checking the accordance of an execution to its specification. The framework is independent from WSN test platforms, applications and logging semantics and thus generally applicable for analyzing event logs of WSN test executions. "}],"title":"Rupeas: Ruby Powered Event Analysis DSL","user_id":"16153","author":[{"last_name":"Woehrle","full_name":"Woehrle, Matthias","first_name":"Matthias"},{"last_name":"Plessl","id":"16153","first_name":"Christian","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian"},{"last_name":"Thiele","first_name":"Lothar","full_name":"Thiele, Lothar"}],"keyword":["Rupeas","DSL","WSN","testing"],"department":[{"_id":"27"},{"_id":"518"}],"status":"public","date_created":"2018-04-16T15:09:19Z"},{"doi":"10.1145/1654059.1654095","date_updated":"2022-01-06T06:55:56Z","_id":"2354","page":"35:1-35:10","citation":{"ieee":"A. Brinkmann and D. Eschweiler, “A Microdriver Architecture for Error Correcting Codes inside the Linux Kernel,” Journal of Supercomputing, pp. 35:1-35:10, 2009.","short":"A. Brinkmann, D. Eschweiler, Journal of Supercomputing (2009) 35:1-35:10.","bibtex":"@article{Brinkmann_Eschweiler_2009, title={A Microdriver Architecture for Error Correcting Codes inside the Linux Kernel}, DOI={10.1145/1654059.1654095}, journal={Journal of Supercomputing}, publisher={ACM}, author={Brinkmann, André and Eschweiler, Dominic}, year={2009}, pages={35:1-35:10} }","mla":"Brinkmann, André, and Dominic Eschweiler. “A Microdriver Architecture for Error Correcting Codes inside the Linux Kernel.” Journal of Supercomputing, ACM, 2009, pp. 35:1-35:10, doi:10.1145/1654059.1654095.","chicago":"Brinkmann, André, and Dominic Eschweiler. “A Microdriver Architecture for Error Correcting Codes inside the Linux Kernel.” Journal of Supercomputing, 2009, 35:1-35:10. https://doi.org/10.1145/1654059.1654095.","apa":"Brinkmann, A., & Eschweiler, D. (2009). A Microdriver Architecture for Error Correcting Codes inside the Linux Kernel. Journal of Supercomputing, 35:1-35:10. https://doi.org/10.1145/1654059.1654095","ama":"Brinkmann A, Eschweiler D. A Microdriver Architecture for Error Correcting Codes inside the Linux Kernel. Journal of Supercomputing. 2009:35:1-35:10. doi:10.1145/1654059.1654095"},"type":"journal_article","year":"2009","user_id":"24135","title":"A Microdriver Architecture for Error Correcting Codes inside the Linux Kernel","date_created":"2018-04-16T15:11:07Z","status":"public","publication":"Journal of Supercomputing","department":[{"_id":"27"}],"author":[{"full_name":"Brinkmann, André","first_name":"André","last_name":"Brinkmann"},{"full_name":"Eschweiler, Dominic","first_name":"Dominic","last_name":"Eschweiler"}],"publisher":"ACM"},{"_id":"23744","date_updated":"2022-01-06T06:55:59Z","doi":"10.1007/978-3-642-10841-9_6","language":[{"iso":"eng"}],"year":"2009","citation":{"ieee":"P. Briest, M. Hoefer, L. Gualà, and C. Ventre, “On Stackelberg Pricing with Computationally Bounded Consumers,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.","short":"P. Briest, M. Hoefer, L. Gualà, C. Ventre, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.","mla":"Briest, Patrick, et al. “On Stackelberg Pricing with Computationally Bounded Consumers.” Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-10841-9_6.","bibtex":"@inbook{Briest_Hoefer_Gualà_Ventre_2009, place={Berlin, Heidelberg}, title={On Stackelberg Pricing with Computationally Bounded Consumers}, DOI={10.1007/978-3-642-10841-9_6}, booktitle={Lecture Notes in Computer Science}, author={Briest, Patrick and Hoefer, Martin and Gualà, Luciano and Ventre, Carmine}, year={2009} }","ama":"Briest P, Hoefer M, Gualà L, Ventre C. On Stackelberg Pricing with Computationally Bounded Consumers. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2009. doi:10.1007/978-3-642-10841-9_6","apa":"Briest, P., Hoefer, M., Gualà, L., & Ventre, C. (2009). On Stackelberg Pricing with Computationally Bounded Consumers. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_6","chicago":"Briest, Patrick, Martin Hoefer, Luciano Gualà, and Carmine Ventre. “On Stackelberg Pricing with Computationally Bounded Consumers.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 2009. https://doi.org/10.1007/978-3-642-10841-9_6."},"type":"book_chapter","place":"Berlin, Heidelberg","abstract":[{"lang":"eng","text":"In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset of the items. We focus on the case of computationally bounded followers who cannot optimize exactly over the range of all feasible subsets, but apply some publicly known algorithm to determine the set of items to purchase. This corresponds to general multi-dimensional pricing assuming that consumers cannot optimize over the full domain of their valuation functions but still aim to act rationally to the best of their ability.\r\n\r\nWe consider two versions of this novel type of Stackelberg pricing games. Assuming that items are weighted objects and the follower seeks to purchase a min-cost selection of objects of some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate algorithm, we show how an extension of the known single-price algorithm can be used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s revenue maximization problem based on so-called near-uniform price assignments. We also prove the problem to be strongly NP-hard.\r\n\r\nConsidering the case that items are subsets of some ground set which the follower seeks to cover (the Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform price assignments fail to yield a good approximation guarantee. However, in the special case of elements with frequency 2 (the Vertex-Cover problem) it turns out that exact revenue maximization can be done in polynomial-time. This stands in sharp contrast to the fact that revenue maximization becomes APX-hard already for elements with frequency 3."}],"user_id":"15415","title":"On Stackelberg Pricing with Computationally Bounded Consumers","author":[{"last_name":"Briest","full_name":"Briest, Patrick","first_name":"Patrick"},{"full_name":"Hoefer, Martin","first_name":"Martin","last_name":"Hoefer"},{"first_name":"Luciano","full_name":"Gualà, Luciano","last_name":"Gualà"},{"last_name":"Ventre","full_name":"Ventre, Carmine","first_name":"Carmine"}],"publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"status":"public","date_created":"2021-09-03T10:55:38Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"]}},{"extern":"1","user_id":"54823","title":"Making it relevant: Context-based learning of science [Book review]","publication":"International Journal of Science Education","department":[{"_id":"386"}],"author":[{"full_name":"Fechner, Sabine","orcid":"0000-0001-5645-5870","first_name":"Sabine","id":"54823","last_name":"Fechner"},{"first_name":"David F.","full_name":"Treagust, David F.","last_name":"Treagust"}],"date_created":"2021-09-04T20:57:55Z","status":"public","volume":31,"intvolume":" 31","_id":"23771","date_updated":"2022-01-06T06:55:59Z","issue":"4","language":[{"iso":"eng"}],"page":"596-601","citation":{"apa":"Fechner, S., & Treagust, D. F. (2009). Making it relevant: Context-based learning of science [Book review]. International Journal of Science Education.","ama":"Fechner S, Treagust DF. Making it relevant: Context-based learning of science [Book review]. International Journal of Science Education. 2009;31(4):596-601.","chicago":"Fechner, Sabine, and David F. Treagust. “Making It Relevant: Context-Based Learning of Science [Book Review].” International Journal of Science Education, 2009.","bibtex":"@article{Fechner_Treagust_2009, title={Making it relevant: Context-based learning of science [Book review]}, volume={31}, number={4}, journal={International Journal of Science Education}, author={Fechner, Sabine and Treagust, David F.}, year={2009}, pages={596–601} }","mla":"Fechner, Sabine, and David F. Treagust. “Making It Relevant: Context-Based Learning of Science [Book Review].” International Journal of Science Education, vol. 31, no. 4, 2009, pp. 596–601.","short":"S. Fechner, D.F. Treagust, International Journal of Science Education 31 (2009) 596–601.","ieee":"S. Fechner and D. F. Treagust, “Making it relevant: Context-based learning of science [Book review],” International Journal of Science Education, vol. 31, no. 4. pp. 596–601, 2009."},"year":"2009","type":"review"},{"_id":"18138","date_updated":"2022-01-06T06:53:26Z","year":"2009","citation":{"ieee":"C. Laroque, M. Fischer, and W. Dangelmaier, “Concepts for Model Verification and Validation during Simulation Runtime,” in European Simulation and Modelling Conference (ESM 2009), 2009.","short":"C. Laroque, M. Fischer, W. Dangelmaier, in: European Simulation and Modelling Conference (ESM 2009), EUROSIS-ETI, 2009.","bibtex":"@inproceedings{Laroque_Fischer_Dangelmaier_2009, title={Concepts for Model Verification and Validation during Simulation Runtime}, booktitle={European Simulation and Modelling Conference (ESM 2009)}, publisher={EUROSIS-ETI}, author={Laroque, Christoph and Fischer, Matthias and Dangelmaier, Wilhelm}, year={2009} }","mla":"Laroque, Christoph, et al. “Concepts for Model Verification and Validation during Simulation Runtime.” European Simulation and Modelling Conference (ESM 2009), EUROSIS-ETI, 2009.","apa":"Laroque, C., Fischer, M., & Dangelmaier, W. (2009). Concepts for Model Verification and Validation during Simulation Runtime. In European Simulation and Modelling Conference (ESM 2009). EUROSIS-ETI.","ama":"Laroque C, Fischer M, Dangelmaier W. Concepts for Model Verification and Validation during Simulation Runtime. In: European Simulation and Modelling Conference (ESM 2009). EUROSIS-ETI; 2009.","chicago":"Laroque, Christoph, Matthias Fischer, and Wilhelm Dangelmaier. “Concepts for Model Verification and Validation during Simulation Runtime.” In European Simulation and Modelling Conference (ESM 2009). EUROSIS-ETI, 2009."},"type":"conference","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Modern companies are nowadays confronted with an increasing demand of multiple products, where they need to perform more flexible every day. Cost-intensive decisions are to be confirmed in short times, in order to minimize risks and secure efficient production programs as well as material flows. Tools for this digital planning via simulation methods are one well established possibility to receive decision support. Nevertheless, the creation of the necessary simulation models is a complicated and error-prone process, where complexity of modeling, validation and verification depends on the used tool and its functionalities. This paper presents implemented concepts for an innovative user support in his tasks of verification and validation of simulation models during the execution of a simulation run. Time-intensive procedures like stopping simulation, parameterization and restarting within the problem analysis are simplified. So the user is able to focus on the real problem solving task."}],"title":"Concepts for Model Verification and Validation during Simulation Runtime","user_id":"15415","publisher":"EUROSIS-ETI","author":[{"last_name":"Laroque","full_name":"Laroque, Christoph","first_name":"Christoph"},{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"last_name":"Dangelmaier","first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm"}],"department":[{"_id":"63"}],"publication":"European Simulation and Modelling Conference (ESM 2009)","status":"public","date_created":"2020-08-24T07:28:23Z"},{"status":"public","date_created":"2018-03-27T12:25:03Z","publication_status":"published","publication_identifier":{"isbn":["9781424439386"]},"publisher":"IEEE","author":[{"first_name":"Tobias","full_name":"Volkhausen, Tobias","last_name":"Volkhausen"},{"last_name":"Woldegebreal","first_name":"Dereje H.","full_name":"Woldegebreal, Dereje H."},{"full_name":"Karl, Holger","first_name":"Holger","id":"126","last_name":"Karl"}],"department":[{"_id":"75"}],"publication":"2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops","user_id":"15572","title":"Improving Network Coded Cooperation by Soft Information","type":"conference","citation":{"bibtex":"@inproceedings{Volkhausen_Woldegebreal_Karl_2009, title={Improving Network Coded Cooperation by Soft Information}, DOI={10.1109/sahcnw.2009.5172938}, booktitle={2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops}, publisher={IEEE}, author={Volkhausen, Tobias and Woldegebreal, Dereje H. and Karl, Holger}, year={2009} }","mla":"Volkhausen, Tobias, et al. “Improving Network Coded Cooperation by Soft Information.” 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, IEEE, 2009, doi:10.1109/sahcnw.2009.5172938.","ama":"Volkhausen T, Woldegebreal DH, Karl H. Improving Network Coded Cooperation by Soft Information. In: 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops. IEEE; 2009. doi:10.1109/sahcnw.2009.5172938","apa":"Volkhausen, T., Woldegebreal, D. H., & Karl, H. (2009). Improving Network Coded Cooperation by Soft Information. In 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops. IEEE. https://doi.org/10.1109/sahcnw.2009.5172938","chicago":"Volkhausen, Tobias, Dereje H. Woldegebreal, and Holger Karl. “Improving Network Coded Cooperation by Soft Information.” In 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops. IEEE, 2009. https://doi.org/10.1109/sahcnw.2009.5172938.","ieee":"T. Volkhausen, D. H. Woldegebreal, and H. Karl, “Improving Network Coded Cooperation by Soft Information,” in 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, 2009.","short":"T. Volkhausen, D.H. Woldegebreal, H. Karl, in: 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, IEEE, 2009."},"year":"2009","doi":"10.1109/sahcnw.2009.5172938","_id":"1828","date_updated":"2022-01-06T06:53:28Z"},{"title":"Combining for Cooperative WLANs - A Reality Check Based on Prototype Measurements","user_id":"15572","publication_identifier":{"isbn":["9781424434374"]},"publication_status":"published","date_created":"2018-03-27T12:27:29Z","status":"public","department":[{"_id":"75"}],"publication":"2009 IEEE International Conference on Communications Workshops","author":[{"last_name":"Valentin","full_name":"Valentin, S.","first_name":"S."},{"last_name":"Woldegebreal","first_name":"D. H.","full_name":"Woldegebreal, D. H."},{"full_name":"Volkhausen, T.","first_name":"T.","last_name":"Volkhausen"},{"id":"126","last_name":"Karl","full_name":"Karl, Holger","first_name":"Holger"}],"publisher":"IEEE","doi":"10.1109/iccw.2009.5208050","_id":"1829","date_updated":"2022-01-06T06:53:28Z","type":"conference","citation":{"short":"S. Valentin, D.H. Woldegebreal, T. Volkhausen, H. Karl, in: 2009 IEEE International Conference on Communications Workshops, IEEE, 2009.","ieee":"S. Valentin, D. H. Woldegebreal, T. Volkhausen, and H. Karl, “Combining for Cooperative WLANs - A Reality Check Based on Prototype Measurements,” in 2009 IEEE International Conference on Communications Workshops, 2009.","chicago":"Valentin, S., D. H. Woldegebreal, T. Volkhausen, and Holger Karl. “Combining for Cooperative WLANs - A Reality Check Based on Prototype Measurements.” In 2009 IEEE International Conference on Communications Workshops. IEEE, 2009. https://doi.org/10.1109/iccw.2009.5208050.","apa":"Valentin, S., Woldegebreal, D. H., Volkhausen, T., & Karl, H. (2009). Combining for Cooperative WLANs - A Reality Check Based on Prototype Measurements. In 2009 IEEE International Conference on Communications Workshops. IEEE. https://doi.org/10.1109/iccw.2009.5208050","ama":"Valentin S, Woldegebreal DH, Volkhausen T, Karl H. Combining for Cooperative WLANs - A Reality Check Based on Prototype Measurements. In: 2009 IEEE International Conference on Communications Workshops. IEEE; 2009. doi:10.1109/iccw.2009.5208050","mla":"Valentin, S., et al. “Combining for Cooperative WLANs - A Reality Check Based on Prototype Measurements.” 2009 IEEE International Conference on Communications Workshops, IEEE, 2009, doi:10.1109/iccw.2009.5208050.","bibtex":"@inproceedings{Valentin_Woldegebreal_Volkhausen_Karl_2009, title={Combining for Cooperative WLANs - A Reality Check Based on Prototype Measurements}, DOI={10.1109/iccw.2009.5208050}, booktitle={2009 IEEE International Conference on Communications Workshops}, publisher={IEEE}, author={Valentin, S. and Woldegebreal, D. H. and Volkhausen, T. and Karl, Holger}, year={2009} }"},"year":"2009"},{"user_id":"5786","title":"Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen","author":[{"full_name":"Suess, Tim","first_name":"Tim","last_name":"Suess"},{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"},{"last_name":"Huber","full_name":"Huber, Daniel","first_name":"Daniel"},{"first_name":"Christoph ","full_name":"Laroque, Christoph ","last_name":"Laroque"},{"first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publication":"Augmented & Virtual Reality in der Produktentstehung","department":[{"_id":"63"},{"_id":"26"}],"status":"public","date_created":"2020-08-25T14:25:41Z","volume":252,"intvolume":" 252","_id":"18291","date_updated":"2022-01-06T06:53:28Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"year":"2009","citation":{"chicago":"Suess, Tim, Matthias Fischer, Daniel Huber, Christoph Laroque, and Wilhelm Dangelmaier. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.” In Augmented & Virtual Reality in Der Produktentstehung, 252:111--126. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ama":"Suess T, Fischer M, Huber D, Laroque C, Dangelmaier W. Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen. In: Augmented & Virtual Reality in Der Produktentstehung. Vol 252. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009:111--126.","apa":"Suess, T., Fischer, M., Huber, D., Laroque, C., & Dangelmaier, W. (2009). Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen. In Augmented & Virtual Reality in der Produktentstehung (Vol. 252, pp. 111--126). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","mla":"Suess, Tim, et al. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.” Augmented & Virtual Reality in Der Produktentstehung, vol. 252, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.","bibtex":"@inbook{Suess_Fischer_Huber_Laroque_Dangelmaier_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen}, volume={252}, booktitle={Augmented & Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Suess, Tim and Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Dangelmaier, Wilhelm}, year={2009}, pages={111--126}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"T. Suess, M. Fischer, D. Huber, C. Laroque, W. Dangelmaier, in: Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.","ieee":"T. Suess, M. Fischer, D. Huber, C. Laroque, and W. Dangelmaier, “Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen,” in Augmented & Virtual Reality in der Produktentstehung, vol. 252, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126."},"type":"book_chapter","page":"111--126"},{"place":"Berlin, Heidelberg","title":"Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE","user_id":"15572","publication":"NETWORKING 2009","department":[{"_id":"75"}],"publisher":"Springer Berlin Heidelberg","author":[{"full_name":"Biermann, Thorsten","first_name":"Thorsten","last_name":"Biermann"},{"full_name":"Schwabe, Arne","first_name":"Arne","last_name":"Schwabe"},{"first_name":"Holger","full_name":"Karl, Holger","last_name":"Karl","id":"126"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642013980","9783642013997"]},"date_created":"2018-03-27T12:31:37Z","status":"public","date_updated":"2022-01-06T06:53:28Z","_id":"1830","doi":"10.1007/978-3-642-01399-7_69","page":"883-894","year":"2009","citation":{"ieee":"T. Biermann, A. Schwabe, and H. Karl, “Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE,” in NETWORKING 2009, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 883–894.","short":"T. Biermann, A. Schwabe, H. Karl, in: NETWORKING 2009, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 883–894.","bibtex":"@inbook{Biermann_Schwabe_Karl_2009, place={Berlin, Heidelberg}, title={Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE}, DOI={10.1007/978-3-642-01399-7_69}, booktitle={NETWORKING 2009}, publisher={Springer Berlin Heidelberg}, author={Biermann, Thorsten and Schwabe, Arne and Karl, Holger}, year={2009}, pages={883–894} }","mla":"Biermann, Thorsten, et al. “Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE.” NETWORKING 2009, Springer Berlin Heidelberg, 2009, pp. 883–94, doi:10.1007/978-3-642-01399-7_69.","apa":"Biermann, T., Schwabe, A., & Karl, H. (2009). Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE. In NETWORKING 2009 (pp. 883–894). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-01399-7_69","ama":"Biermann T, Schwabe A, Karl H. Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE. In: NETWORKING 2009. Berlin, Heidelberg: Springer Berlin Heidelberg; 2009:883-894. doi:10.1007/978-3-642-01399-7_69","chicago":"Biermann, Thorsten, Arne Schwabe, and Holger Karl. “Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE.” In NETWORKING 2009, 883–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. https://doi.org/10.1007/978-3-642-01399-7_69."},"type":"book_chapter"},{"status":"public","date_created":"2018-03-27T12:34:52Z","publication_identifier":{"isbn":["9789639799455"]},"publication_status":"published","author":[{"full_name":"Lichte, Hermann S.","first_name":"Hermann S.","last_name":"Lichte"},{"last_name":"Weide","first_name":"Jannis","full_name":"Weide, Jannis"}],"publisher":"ICST","publication":"Proceedings of the Second International ICST Conference on Simulation Tools and Techniques","department":[{"_id":"75"}],"user_id":"15572","title":"Modeling obstacles in INET/Mobility framework: motivation, integration, and performance","citation":{"apa":"Lichte, H. S., & Weide, J. (2009). Modeling obstacles in INET/Mobility framework: motivation, integration, and performance. In Proceedings of the Second International ICST Conference on Simulation Tools and Techniques. ICST. https://doi.org/10.4108/icst.simutools2009.5680","ama":"Lichte HS, Weide J. Modeling obstacles in INET/Mobility framework: motivation, integration, and performance. In: Proceedings of the Second International ICST Conference on Simulation Tools and Techniques. ICST; 2009. doi:10.4108/icst.simutools2009.5680","chicago":"Lichte, Hermann S., and Jannis Weide. “Modeling Obstacles in INET/Mobility Framework: Motivation, Integration, and Performance.” In Proceedings of the Second International ICST Conference on Simulation Tools and Techniques. ICST, 2009. https://doi.org/10.4108/icst.simutools2009.5680.","mla":"Lichte, Hermann S., and Jannis Weide. “Modeling Obstacles in INET/Mobility Framework: Motivation, Integration, and Performance.” Proceedings of the Second International ICST Conference on Simulation Tools and Techniques, ICST, 2009, doi:10.4108/icst.simutools2009.5680.","bibtex":"@inproceedings{Lichte_Weide_2009, title={Modeling obstacles in INET/Mobility framework: motivation, integration, and performance}, DOI={10.4108/icst.simutools2009.5680}, booktitle={Proceedings of the Second International ICST Conference on Simulation Tools and Techniques}, publisher={ICST}, author={Lichte, Hermann S. and Weide, Jannis}, year={2009} }","short":"H.S. Lichte, J. Weide, in: Proceedings of the Second International ICST Conference on Simulation Tools and Techniques, ICST, 2009.","ieee":"H. S. Lichte and J. Weide, “Modeling obstacles in INET/Mobility framework: motivation, integration, and performance,” in Proceedings of the Second International ICST Conference on Simulation Tools and Techniques, 2009."},"year":"2009","type":"conference","doi":"10.4108/icst.simutools2009.5680","_id":"1832","date_updated":"2022-01-06T06:53:29Z"},{"_id":"1833","date_updated":"2022-01-06T06:53:29Z","doi":"10.1145/1544012.1544078","type":"conference","citation":{"ama":"Ahlgren B, Vercellone V, D’Ambrosio M, et al. Design considerations for a network of information. In: Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT ’08. ACM Press; 2009. doi:10.1145/1544012.1544078","apa":"Ahlgren, B., Vercellone, V., D’Ambrosio, M., Marchisio, M., Marsh, I., Dannewitz, C., … Rembarz, R. (2009). Design considerations for a network of information. In Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT ’08. ACM Press. https://doi.org/10.1145/1544012.1544078","chicago":"Ahlgren, Bengt, Vinicio Vercellone, Matteo D’Ambrosio, Marco Marchisio, Ian Marsh, Christian Dannewitz, Börje Ohlman, Kostas Pentikousis, Ove Strandberg, and René Rembarz. “Design Considerations for a Network of Information.” In Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT ’08. ACM Press, 2009. https://doi.org/10.1145/1544012.1544078.","bibtex":"@inproceedings{Ahlgren_Vercellone_D’Ambrosio_Marchisio_Marsh_Dannewitz_Ohlman_Pentikousis_Strandberg_Rembarz_2009, title={Design considerations for a network of information}, DOI={10.1145/1544012.1544078}, booktitle={Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT ’08}, publisher={ACM Press}, author={Ahlgren, Bengt and Vercellone, Vinicio and D’Ambrosio, Matteo and Marchisio, Marco and Marsh, Ian and Dannewitz, Christian and Ohlman, Börje and Pentikousis, Kostas and Strandberg, Ove and Rembarz, René}, year={2009} }","mla":"Ahlgren, Bengt, et al. “Design Considerations for a Network of Information.” Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT ’08, ACM Press, 2009, doi:10.1145/1544012.1544078.","short":"B. Ahlgren, V. Vercellone, M. D’Ambrosio, M. Marchisio, I. Marsh, C. Dannewitz, B. Ohlman, K. Pentikousis, O. Strandberg, R. Rembarz, in: Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT ’08, ACM Press, 2009.","ieee":"B. Ahlgren et al., “Design considerations for a network of information,” in Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT ’08, 2009."},"year":"2009","user_id":"15572","title":"Design considerations for a network of information","author":[{"last_name":"Ahlgren","full_name":"Ahlgren, Bengt","first_name":"Bengt"},{"last_name":"Vercellone","first_name":"Vinicio","full_name":"Vercellone, Vinicio"},{"full_name":"D'Ambrosio, Matteo","first_name":"Matteo","last_name":"D'Ambrosio"},{"last_name":"Marchisio","first_name":"Marco","full_name":"Marchisio, Marco"},{"last_name":"Marsh","full_name":"Marsh, Ian","first_name":"Ian"},{"first_name":"Christian","full_name":"Dannewitz, Christian","last_name":"Dannewitz"},{"last_name":"Ohlman","full_name":"Ohlman, Börje","first_name":"Börje"},{"last_name":"Pentikousis","first_name":"Kostas","full_name":"Pentikousis, Kostas"},{"first_name":"Ove","full_name":"Strandberg, Ove","last_name":"Strandberg"},{"first_name":"René","full_name":"Rembarz, René","last_name":"Rembarz"}],"publisher":"ACM Press","publication":"Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT '08","department":[{"_id":"75"}],"status":"public","date_created":"2018-03-27T12:36:38Z","publication_identifier":{"isbn":["9781605582108"]},"publication_status":"published"},{"language":[{"iso":"eng"}],"page":"203-206","year":"2009","type":"conference","citation":{"chicago":"Fischer, Matthias, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf der Heide, and Martin Ziegler. “Planar Visibility Counting.” In Proc. 25th European Workshop on Computational Geometry, 203–6, 2009.","apa":"Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., & Ziegler, M. (2009). Planar Visibility Counting. In Proc. 25th European Workshop on Computational Geometry (pp. 203–206).","ama":"Fischer M, Hilbig M, Jähn C, Meyer auf der Heide F, Ziegler M. Planar Visibility Counting. In: Proc. 25th European Workshop on Computational Geometry. ; 2009:203-206.","bibtex":"@inproceedings{Fischer_Hilbig_Jähn_Meyer auf der Heide_Ziegler_2009, title={Planar Visibility Counting}, booktitle={Proc. 25th European Workshop on Computational Geometry}, author={Fischer, Matthias and Hilbig, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Ziegler, Martin}, year={2009}, pages={203–206} }","mla":"Fischer, Matthias, et al. “Planar Visibility Counting.” Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–06.","short":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, in: Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–206.","ieee":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar Visibility Counting,” in Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–206."},"_id":"18346","date_updated":"2022-01-06T06:53:29Z","date_created":"2020-08-26T08:49:50Z","status":"public","department":[{"_id":"63"}],"publication":"Proc. 25th European Workshop on Computational Geometry","author":[{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"first_name":"Matthias","full_name":"Hilbig, Matthias","last_name":"Hilbig"},{"last_name":"Jähn","first_name":"Claudius","full_name":"Jähn, Claudius"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"user_id":"15415","title":"Planar Visibility Counting","abstract":[{"lang":"eng","text":"For a fixed virtual scene (=collection of simplices) S and given observer\r\nposition p, how many elements of S are weakly visible (i.e. not fully occluded\r\nby others) from p? The present work explores the trade-off between query time\r\nand preprocessing space for these quantities in 2D: exactly, in the approximate\r\ndeterministic, and in the probabilistic sense. We deduce the EXISTENCE of an\r\nO(m^2/n^2) space data structure for S that, given p and time O(log n), allows\r\nto approximate the ratio of occluded segments up to arbitrary constant absolute\r\nerror; here m denotes the size of the Visibility Graph--which may be quadratic,\r\nbut typically is just linear in the size n of the scene S. On the other hand,\r\nwe present a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)\r\npreprocessing time and space with similar approximation properties and query\r\ntime O(k*polylog n), where ket al., “Measurement of effective electron mass in biaxial tensile strained silicon on insulator,” Applied Physics Letters, vol. 95, no. 18, 2009.","short":"S.F. Feste, T. Schäpers, D. Buca, Q.T. Zhao, J. Knoch, M. Bouhassoune, A. Schindlmayr, S. Mantl, Applied Physics Letters 95 (2009).","mla":"Feste, Sebastian F., et al. “Measurement of Effective Electron Mass in Biaxial Tensile Strained Silicon on Insulator.” Applied Physics Letters, vol. 95, no. 18, 182101, American Institute of Physics, 2009, doi:10.1063/1.3254330.","bibtex":"@article{Feste_Schäpers_Buca_Zhao_Knoch_Bouhassoune_Schindlmayr_Mantl_2009, title={Measurement of effective electron mass in biaxial tensile strained silicon on insulator}, volume={95}, DOI={10.1063/1.3254330}, number={18182101}, journal={Applied Physics Letters}, publisher={American Institute of Physics}, author={Feste, Sebastian F. and Schäpers, Thomas and Buca, Dan and Zhao, Qing Tai and Knoch, Joachim and Bouhassoune, Mohammed and Schindlmayr, Arno and Mantl, Siegfried}, year={2009} }","chicago":"Feste, Sebastian F., Thomas Schäpers, Dan Buca, Qing Tai Zhao, Joachim Knoch, Mohammed Bouhassoune, Arno Schindlmayr, and Siegfried Mantl. “Measurement of Effective Electron Mass in Biaxial Tensile Strained Silicon on Insulator.” Applied Physics Letters 95, no. 18 (2009). https://doi.org/10.1063/1.3254330.","ama":"Feste SF, Schäpers T, Buca D, et al. Measurement of effective electron mass in biaxial tensile strained silicon on insulator. Applied Physics Letters. 2009;95(18). doi:10.1063/1.3254330","apa":"Feste, S. F., Schäpers, T., Buca, D., Zhao, Q. T., Knoch, J., Bouhassoune, M., … Mantl, S. (2009). Measurement of effective electron mass in biaxial tensile strained silicon on insulator. Applied Physics Letters, 95(18). https://doi.org/10.1063/1.3254330"},"issue":"18","article_number":"182101","intvolume":" 95","_id":"18632","has_accepted_license":"1","status":"public","date_created":"2020-08-28T22:24:30Z","volume":95,"file":[{"date_updated":"2020-08-30T15:29:43Z","content_type":"application/pdf","relation":"main_file","description":"© 2009 American Institute of Physics","creator":"schindlm","file_id":"18633","file_size":198836,"title":"Measurement of effective electron mass in biaxial tensile strained silicon on insulator","access_level":"open_access","date_created":"2020-08-28T22:28:31Z","file_name":"1.3254330.pdf"}],"quality_controlled":"1","author":[{"full_name":"Feste, Sebastian F.","first_name":"Sebastian F.","last_name":"Feste"},{"last_name":"Schäpers","first_name":"Thomas","full_name":"Schäpers, Thomas"},{"last_name":"Buca","first_name":"Dan","full_name":"Buca, Dan"},{"first_name":"Qing Tai","full_name":"Zhao, Qing Tai","last_name":"Zhao"},{"full_name":"Knoch, Joachim","first_name":"Joachim","last_name":"Knoch"},{"last_name":"Bouhassoune","first_name":"Mohammed","full_name":"Bouhassoune, Mohammed"},{"first_name":"Arno","full_name":"Schindlmayr, Arno","orcid":"0000-0002-4855-071X","last_name":"Schindlmayr","id":"458"},{"full_name":"Mantl, Siegfried","first_name":"Siegfried","last_name":"Mantl"}],"publisher":"American Institute of Physics","file_date_updated":"2020-08-30T15:29:43Z","publication":"Applied Physics Letters","user_id":"458","ddc":["530"],"article_type":"original","abstract":[{"lang":"eng","text":"We present measurements of the effective electron mass in biaxial tensile strained silicon on insulator (SSOI) material with 1.2 GPa stress and in unstrained SOI. Hall-bar metal oxide semiconductor field effect transistors on 60 nm SSOI and SOI were fabricated and Shubnikov–de Haas oscillations in the temperature range of T=0.4–4 K for magnetic fields of B=0–10 T were measured. The effective electron mass in SSOI and SOI samples was determined as mt=(0.20±0.01)m0. This result is in excellent agreement with first-principles calculations of the\r\neffective electron mass in the presence of strain."}]}]