[{"project":[{"name":"TRR 142","_id":"53"},{"_id":"54","name":"TRR 142 - Project Area A"},{"name":"TRR 142 - Subproject A5","_id":"62"}],"citation":{"short":"L. Ebers, M. Hammer, J. Förstner, Optical and Quantum Electronics 49 (2017) 49:176.","chicago":"Ebers, Lena, Manfred Hammer, and Jens Förstner. “Spiral Modes Supported by Circular Dielectric Tubes and Tube Segments.” <i>Optical and Quantum Electronics</i> 49, no. 4 (2017): 49:176. <a href=\"https://doi.org/10.1007/s11082-017-1011-x\">https://doi.org/10.1007/s11082-017-1011-x</a>.","apa":"Ebers, L., Hammer, M., &#38; Förstner, J. (2017). Spiral modes supported by circular dielectric tubes and tube segments. <i>Optical and Quantum Electronics</i>, <i>49</i>(4), 49:176. <a href=\"https://doi.org/10.1007/s11082-017-1011-x\">https://doi.org/10.1007/s11082-017-1011-x</a>","ieee":"L. Ebers, M. Hammer, and J. Förstner, “Spiral modes supported by circular dielectric tubes and tube segments,” <i>Optical and Quantum Electronics</i>, vol. 49, no. 4, p. 49:176, 2017.","ama":"Ebers L, Hammer M, Förstner J. Spiral modes supported by circular dielectric tubes and tube segments. <i>Optical and Quantum Electronics</i>. 2017;49(4):49:176. doi:<a href=\"https://doi.org/10.1007/s11082-017-1011-x\">10.1007/s11082-017-1011-x</a>","bibtex":"@article{Ebers_Hammer_Förstner_2017, title={Spiral modes supported by circular dielectric tubes and tube segments}, volume={49}, DOI={<a href=\"https://doi.org/10.1007/s11082-017-1011-x\">10.1007/s11082-017-1011-x</a>}, number={4}, journal={Optical and Quantum Electronics}, publisher={Springer Nature}, author={Ebers, Lena and Hammer, Manfred and Förstner, Jens}, year={2017}, pages={49:176} }","mla":"Ebers, Lena, et al. “Spiral Modes Supported by Circular Dielectric Tubes and Tube Segments.” <i>Optical and Quantum Electronics</i>, vol. 49, no. 4, Springer Nature, 2017, p. 49:176, doi:<a href=\"https://doi.org/10.1007/s11082-017-1011-x\">10.1007/s11082-017-1011-x</a>."},"file_date_updated":"2022-01-06T06:59:38Z","has_accepted_license":"1","status":"public","volume":49,"user_id":"158","ddc":["530"],"_id":"3830","urn":"38308","publisher":"Springer Nature","page":"49:176","abstract":[{"text":"The modal properties of curved dielectric slab waveguides are investigated. We\r\nconsider quasi-confined, attenuated modes that propagate at oblique angles with respect to\r\nthe axis through the center of curvature. Our analytical model describes the transition from\r\nscalar 2-D TE/TM bend modes to lossless spiral waves at near-axis propagation angles,\r\nwith a continuum of vectorial attenuated spiral modes in between. Modal solutions are\r\ncharacterized in terms of directional wavenumbers and attenuation constants. Examples for\r\nvectorial mode profiles illustrate the effects of oblique wave propagation along the curved\r\nslab segments. For the regime of lossless spiral waves, the relation with the guided modes\r\nof corresponding dielectric tubes is demonstrated.","lang":"eng"}],"publication":"Optical and Quantum Electronics","issue":"4","department":[{"_id":"61"}],"keyword":["tet_topic_waveguide"],"type":"journal_article","date_created":"2018-08-07T09:52:20Z","file":[{"date_updated":"2022-01-06T06:59:38Z","relation":"main_file","access_level":"request","file_size":2379736,"file_name":"2017-03 Ebers, Hammer_Spiral modes supported by circular dielectric tubes and tube segments.pdf","content_type":"application/pdf","file_id":"3831","creator":"hclaudia","date_created":"2018-08-07T09:56:27Z"}],"article_type":"original","intvolume":"        49","publication_status":"published","date_updated":"2022-01-06T06:59:39Z","author":[{"id":"40428","full_name":"Ebers, Lena","last_name":"Ebers","first_name":"Lena"},{"id":"48077","full_name":"Hammer, Manfred","last_name":"Hammer","first_name":"Manfred","orcid":"0000-0002-6331-9348"},{"id":"158","last_name":"Förstner","first_name":"Jens","orcid":"0000-0001-7059-9862","full_name":"Förstner, Jens"}],"publication_identifier":{"issn":["0306-8919","1572-817X"]},"title":"Spiral modes supported by circular dielectric tubes and tube segments","year":"2017","doi":"10.1007/s11082-017-1011-x","language":[{"iso":"eng"}]},{"oa":"1","file_date_updated":"2018-09-03T14:12:22Z","citation":{"mla":"Song, Xiaohong, et al. “Direction-Tunable Enhanced Emission from a Subwavelength Metallic Double-Nanoslit Structure.” <i>Optics Express</i>, vol. 25, no. 12, The Optical Society, 2017, pp. 13207–14, doi:<a href=\"https://doi.org/10.1364/oe.25.013207\">10.1364/oe.25.013207</a>.","bibtex":"@article{Song_Wang_Yan_Lin_Förstner_Yang_2017, title={Direction-tunable enhanced emission from a subwavelength metallic double-nanoslit structure}, volume={25}, DOI={<a href=\"https://doi.org/10.1364/oe.25.013207\">10.1364/oe.25.013207</a>}, number={12}, journal={Optics Express}, publisher={The Optical Society}, author={Song, Xiaohong and Wang, Nini and Yan, Ming and Lin, Cheng and Förstner, Jens and Yang, Weifeng}, year={2017}, pages={13207–13214} }","ama":"Song X, Wang N, Yan M, Lin C, Förstner J, Yang W. Direction-tunable enhanced emission from a subwavelength metallic double-nanoslit structure. <i>Optics Express</i>. 2017;25(12):13207-13214. doi:<a href=\"https://doi.org/10.1364/oe.25.013207\">10.1364/oe.25.013207</a>","ieee":"X. Song, N. Wang, M. Yan, C. Lin, J. Förstner, and W. Yang, “Direction-tunable enhanced emission from a subwavelength metallic double-nanoslit structure,” <i>Optics Express</i>, vol. 25, no. 12, pp. 13207–13214, 2017.","apa":"Song, X., Wang, N., Yan, M., Lin, C., Förstner, J., &#38; Yang, W. (2017). Direction-tunable enhanced emission from a subwavelength metallic double-nanoslit structure. <i>Optics Express</i>, <i>25</i>(12), 13207–13214. <a href=\"https://doi.org/10.1364/oe.25.013207\">https://doi.org/10.1364/oe.25.013207</a>","chicago":"Song, Xiaohong, Nini Wang, Ming Yan, Cheng Lin, Jens Förstner, and Weifeng Yang. “Direction-Tunable Enhanced Emission from a Subwavelength Metallic Double-Nanoslit Structure.” <i>Optics Express</i> 25, no. 12 (2017): 13207–14. <a href=\"https://doi.org/10.1364/oe.25.013207\">https://doi.org/10.1364/oe.25.013207</a>.","short":"X. Song, N. Wang, M. Yan, C. Lin, J. Förstner, W. Yang, Optics Express 25 (2017) 13207–13214."},"page":"13207-13214","_id":"3832","urn":"38325","publisher":"The Optical Society","ddc":["530"],"user_id":"158","volume":25,"status":"public","has_accepted_license":"1","file":[{"file_id":"3833","content_type":"application/pdf","relation":"main_file","date_updated":"2018-09-03T14:12:22Z","file_name":"2017-06 Xiahong_Direction-tunable enhanced emission from a subwavelength metallic double-nanoslit structure_Optics Express.pdf","file_size":3225569,"access_level":"open_access","date_created":"2018-08-07T10:17:15Z","creator":"hclaudia"}],"date_created":"2018-08-07T10:13:24Z","type":"journal_article","keyword":["tet_topic_plasmonics"],"department":[{"_id":"61"}],"publication":"Optics Express","issue":"12","abstract":[{"text":"Controlling light emission out of subwavelength nanoslit/aperture structures is of great important for highly integrated photonic circuits. Here we propose a new method to achieve direction-tunable emission based on a compact metallic microcavity with double nanoslit. Our method combines the principles of Young’s interference and surface plasmon polaritons interference. We show that the direction of the far-field beam can be controlled over a wide range of angles by manipulating the frequency and relative phase of light arriving at the two slits, which holds promise for applications in the ultracompact optoelectronic devices.","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1364/oe.25.013207","year":"2017","title":"Direction-tunable enhanced emission from a subwavelength metallic double-nanoslit structure","publication_identifier":{"issn":["1094-4087"]},"author":[{"first_name":"Xiaohong","last_name":"Song","full_name":"Song, Xiaohong"},{"last_name":"Wang","first_name":"Nini","full_name":"Wang, Nini"},{"first_name":"Ming","last_name":"Yan","full_name":"Yan, Ming"},{"full_name":"Lin, Cheng","first_name":"Cheng","last_name":"Lin"},{"full_name":"Förstner, Jens","first_name":"Jens","orcid":"0000-0001-7059-9862","last_name":"Förstner","id":"158"},{"first_name":"Weifeng","last_name":"Yang","full_name":"Yang, Weifeng"}],"date_updated":"2022-01-06T06:59:40Z","publication_status":"published","intvolume":"        25","article_type":"original"},{"abstract":[{"lang":"eng","text":"We apply the Discontinuous Galerkin Time Domain (DGTD) method for numerical simulations of the second harmonic generation from various metallic nanostructures. A Maxwell–Vlasov hydrodynamic model is used to describe the nonlinear effects in the motion of the excited free electrons in a metal. The results are compared with the corresponding experimental measurements for split-ring resonators and plasmonic gap antennas."}],"publication":"Recent Trends in Computational Photonics","department":[{"_id":"61"}],"type":"book_chapter","keyword":["tet_topic_numerics","tet_topic_shg","tet_topic_meta"],"date_created":"2018-08-07T10:42:30Z","file":[{"creator":"fossie","date_created":"2018-08-16T08:05:50Z","access_level":"request","file_size":2798215,"file_name":"Recent-Trends-in-Computational-Photonics - chapter 9 - Grynko - SHG DG.pdf","date_updated":"2022-01-06T06:59:40Z","relation":"main_file","content_type":"application/pdf","file_id":"3916"}],"publication_status":"published","date_updated":"2022-01-06T06:59:41Z","author":[{"id":"26059","last_name":"Grynko","first_name":"Yevgen","full_name":"Grynko, Yevgen"},{"id":"158","full_name":"Förstner, Jens","last_name":"Förstner","orcid":"0000-0001-7059-9862","first_name":"Jens"}],"publication_identifier":{"issn":["0342-4111","1556-1534"],"isbn":["9783319554372","9783319554389"]},"title":"Simulation of Second Harmonic Generation from Photonic Nanostructures Using the Discontinuous Galerkin Time Domain Method","year":"2017","doi":"10.1007/978-3-319-55438-9_9","language":[{"iso":"eng"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"},{"name":"TRR 142","_id":"53"},{"_id":"54","name":"TRR 142 - Project Area A"},{"_id":"62","name":"TRR 142 - Subproject A5"}],"citation":{"mla":"Grynko, Yevgen, and Jens Förstner. “Simulation of Second Harmonic Generation from Photonic Nanostructures Using the Discontinuous Galerkin Time Domain Method.” <i>Recent Trends in Computational Photonics</i>, edited by Arti Agrawal, Springer International Publishing, 2017, pp. 261–84, doi:<a href=\"https://doi.org/10.1007/978-3-319-55438-9_9\">10.1007/978-3-319-55438-9_9</a>.","apa":"Grynko, Y., &#38; Förstner, J. (2017). Simulation of Second Harmonic Generation from Photonic Nanostructures Using the Discontinuous Galerkin Time Domain Method. In A. Agrawal (Ed.), <i>Recent Trends in Computational Photonics</i> (pp. 261–284). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-55438-9_9\">https://doi.org/10.1007/978-3-319-55438-9_9</a>","ieee":"Y. Grynko and J. Förstner, “Simulation of Second Harmonic Generation from Photonic Nanostructures Using the Discontinuous Galerkin Time Domain Method,” in <i>Recent Trends in Computational Photonics</i>, A. Agrawal, Ed. Cham: Springer International Publishing, 2017, pp. 261–284.","chicago":"Grynko, Yevgen, and Jens Förstner. “Simulation of Second Harmonic Generation from Photonic Nanostructures Using the Discontinuous Galerkin Time Domain Method.” In <i>Recent Trends in Computational Photonics</i>, edited by Arti Agrawal, 261–84. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-55438-9_9\">https://doi.org/10.1007/978-3-319-55438-9_9</a>.","short":"Y. Grynko, J. Förstner, in: A. Agrawal (Ed.), Recent Trends in Computational Photonics, Springer International Publishing, Cham, 2017, pp. 261–284.","ama":"Grynko Y, Förstner J. Simulation of Second Harmonic Generation from Photonic Nanostructures Using the Discontinuous Galerkin Time Domain Method. In: Agrawal A, ed. <i>Recent Trends in Computational Photonics</i>. Cham: Springer International Publishing; 2017:261-284. doi:<a href=\"https://doi.org/10.1007/978-3-319-55438-9_9\">10.1007/978-3-319-55438-9_9</a>","bibtex":"@inbook{Grynko_Förstner_2017, place={Cham}, title={Simulation of Second Harmonic Generation from Photonic Nanostructures Using the Discontinuous Galerkin Time Domain Method}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-55438-9_9\">10.1007/978-3-319-55438-9_9</a>}, booktitle={Recent Trends in Computational Photonics}, publisher={Springer International Publishing}, author={Grynko, Yevgen and Förstner, Jens}, editor={Agrawal, ArtiEditor}, year={2017}, pages={261–284} }"},"file_date_updated":"2022-01-06T06:59:40Z","place":"Cham","has_accepted_license":"1","status":"public","editor":[{"full_name":"Agrawal, Arti","first_name":"Arti","last_name":"Agrawal"}],"user_id":"158","ddc":["530"],"_id":"3836","publisher":"Springer International Publishing","page":"261-284"},{"doi":"10.1007/s00446-017-0307-1","intvolume":"        31","date_updated":"2022-01-06T06:59:47Z","publication_status":"published","author":[{"full_name":"Ogierman, Adrian","first_name":"Adrian","last_name":"Ogierman"},{"last_name":"Richa","first_name":"Andrea","full_name":"Richa, Andrea"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"full_name":"Zhang, Jin","first_name":"Jin","last_name":"Zhang"}],"publication_identifier":{"issn":["0178-2770","1432-0452"]},"title":"Sade: competitive MAC under adversarial SINR","year":"2017","department":[{"_id":"79"}],"type":"journal_article","date_created":"2018-08-10T07:05:12Z","abstract":[{"lang":"eng","text":"This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. So far, this problem is understood only in simplistic single-hop or unit disk graph models. We in this paper initiate the study of MAC protocols for the SINR interference model (a.k.a. physical model). This paper makes two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. Our second contribution is a distributed MAC protocol called Sade which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions."}],"publication":"Distributed Computing","issue":"3","volume":31,"user_id":"15504","publisher":"Springer Nature","_id":"3872","page":"241-254","status":"public","citation":{"ama":"Ogierman A, Richa A, Scheideler C, Schmid S, Zhang J. Sade: competitive MAC under adversarial SINR. <i>Distributed Computing</i>. 2017;31(3):241-254. doi:<a href=\"https://doi.org/10.1007/s00446-017-0307-1\">10.1007/s00446-017-0307-1</a>","bibtex":"@article{Ogierman_Richa_Scheideler_Schmid_Zhang_2017, title={Sade: competitive MAC under adversarial SINR}, volume={31}, DOI={<a href=\"https://doi.org/10.1007/s00446-017-0307-1\">10.1007/s00446-017-0307-1</a>}, number={3}, journal={Distributed Computing}, publisher={Springer Nature}, author={Ogierman, Adrian and Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2017}, pages={241–254} }","mla":"Ogierman, Adrian, et al. “Sade: Competitive MAC under Adversarial SINR.” <i>Distributed Computing</i>, vol. 31, no. 3, Springer Nature, 2017, pp. 241–54, doi:<a href=\"https://doi.org/10.1007/s00446-017-0307-1\">10.1007/s00446-017-0307-1</a>.","chicago":"Ogierman, Adrian, Andrea Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Sade: Competitive MAC under Adversarial SINR.” <i>Distributed Computing</i> 31, no. 3 (2017): 241–54. <a href=\"https://doi.org/10.1007/s00446-017-0307-1\">https://doi.org/10.1007/s00446-017-0307-1</a>.","short":"A. Ogierman, A. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing 31 (2017) 241–254.","apa":"Ogierman, A., Richa, A., Scheideler, C., Schmid, S., &#38; Zhang, J. (2017). Sade: competitive MAC under adversarial SINR. <i>Distributed Computing</i>, <i>31</i>(3), 241–254. <a href=\"https://doi.org/10.1007/s00446-017-0307-1\">https://doi.org/10.1007/s00446-017-0307-1</a>","ieee":"A. Ogierman, A. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Sade: competitive MAC under adversarial SINR,” <i>Distributed Computing</i>, vol. 31, no. 3, pp. 241–254, 2017."}},{"citation":{"ama":"Wachsmuth H, Naderi N, Hou Y, et al. Computational Argumentation Quality Assessment in Natural Language. In: <i>Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers</i>. ; 2017:176-187.","bibtex":"@inproceedings{Wachsmuth_Naderi_Hou_Bilu_Prabhakaran_Thijm_Hirst_Stein_2017, title={Computational Argumentation Quality Assessment in Natural Language}, booktitle={Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers}, author={Wachsmuth, Henning and Naderi, Nona and Hou, Yufang and Bilu, Yonatan and Prabhakaran, Vinodkumar and Thijm, Tim Alberdingk and Hirst, Graeme and Stein, Benno}, year={2017}, pages={176–187} }","mla":"Wachsmuth, Henning, et al. “Computational Argumentation Quality Assessment in Natural Language.” <i>Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers</i>, 2017, pp. 176–87.","chicago":"Wachsmuth, Henning, Nona Naderi, Yufang Hou, Yonatan Bilu, Vinodkumar Prabhakaran, Tim Alberdingk Thijm, Graeme Hirst, and Benno Stein. “Computational Argumentation Quality Assessment in Natural Language.” In <i>Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers</i>, 176–87, 2017.","short":"H. Wachsmuth, N. Naderi, Y. Hou, Y. Bilu, V. Prabhakaran, T.A. Thijm, G. Hirst, B. Stein, in: Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers, 2017, pp. 176–187.","apa":"Wachsmuth, H., Naderi, N., Hou, Y., Bilu, Y., Prabhakaran, V., Thijm, T. A., … Stein, B. (2017). Computational Argumentation Quality Assessment in Natural Language. In <i>Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers</i> (pp. 176–187).","ieee":"H. Wachsmuth <i>et al.</i>, “Computational Argumentation Quality Assessment in Natural Language,” in <i>Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers</i>, 2017, pp. 176–187."},"publication":"Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers","date_created":"2018-08-11T16:17:16Z","department":[{"_id":"600"},{"_id":"568"}],"type":"conference","author":[{"id":"3900","last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning"},{"full_name":"Naderi, Nona","first_name":"Nona","last_name":"Naderi"},{"first_name":"Yufang","last_name":"Hou","full_name":"Hou, Yufang"},{"first_name":"Yonatan","last_name":"Bilu","full_name":"Bilu, Yonatan"},{"first_name":"Vinodkumar","last_name":"Prabhakaran","full_name":"Prabhakaran, Vinodkumar"},{"first_name":"Tim Alberdingk","last_name":"Thijm","full_name":"Thijm, Tim Alberdingk"},{"full_name":"Hirst, Graeme","first_name":"Graeme","last_name":"Hirst"},{"full_name":"Stein, Benno","first_name":"Benno","last_name":"Stein"}],"title":"Computational Argumentation Quality Assessment in Natural Language","status":"public","year":"2017","date_updated":"2022-01-06T06:59:47Z","_id":"3881","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.aclweb.org/anthology/E17-1017.pdf"}],"page":"176-187","user_id":"82920"},{"date_updated":"2022-01-06T06:59:47Z","title":"A Universal Model for Discourse-Level Argumentation Analysis","status":"public","year":"2017","author":[{"id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"},{"full_name":"Stein, Benno","first_name":"Benno","last_name":"Stein"}],"publication_identifier":{"issn":["1533-5399"]},"user_id":"82920","main_file_link":[{"url":"https://dl.acm.org/doi/pdf/10.1145/2957757"}],"page":"1-24","language":[{"iso":"eng"}],"_id":"3882","issue":"3","publication":"Special Section of the ACM Transactions on Internet Technology: Argumentation in Social Media","citation":{"chicago":"Wachsmuth, Henning, and Benno Stein. “A Universal Model for Discourse-Level Argumentation Analysis.” <i>Special Section of the ACM Transactions on Internet Technology: Argumentation in Social Media</i>, no. 3 (2017): 1–24.","short":"H. Wachsmuth, B. Stein, Special Section of the ACM Transactions on Internet Technology: Argumentation in Social Media (2017) 1–24.","apa":"Wachsmuth, H., &#38; Stein, B. (2017). A Universal Model for Discourse-Level Argumentation Analysis. <i>Special Section of the ACM Transactions on Internet Technology: Argumentation in Social Media</i>, (3), 1–24.","ieee":"H. Wachsmuth and B. Stein, “A Universal Model for Discourse-Level Argumentation Analysis,” <i>Special Section of the ACM Transactions on Internet Technology: Argumentation in Social Media</i>, no. 3, pp. 1–24, 2017.","ama":"Wachsmuth H, Stein B. A Universal Model for Discourse-Level Argumentation Analysis. <i>Special Section of the ACM Transactions on Internet Technology: Argumentation in Social Media</i>. 2017;(3):1-24.","bibtex":"@article{Wachsmuth_Stein_2017, title={A Universal Model for Discourse-Level Argumentation Analysis}, number={3}, journal={Special Section of the ACM Transactions on Internet Technology: Argumentation in Social Media}, author={Wachsmuth, Henning and Stein, Benno}, year={2017}, pages={1–24} }","mla":"Wachsmuth, Henning, and Benno Stein. “A Universal Model for Discourse-Level Argumentation Analysis.” <i>Special Section of the ACM Transactions on Internet Technology: Argumentation in Social Media</i>, no. 3, 2017, pp. 1–24."},"type":"journal_article","department":[{"_id":"568"},{"_id":"600"}],"date_created":"2018-08-11T16:18:03Z"},{"date_updated":"2022-01-06T06:59:47Z","status":"public","year":"2017","title":"Argumentation Quality Assessment: Theory vs. Practice","author":[{"id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"},{"first_name":"Nona","last_name":"Naderi","full_name":"Naderi, Nona"},{"full_name":"Habernal, Ivan","first_name":"Ivan","last_name":"Habernal"},{"full_name":"Hou, Yufang","first_name":"Yufang","last_name":"Hou"},{"last_name":"Hirst","first_name":"Graeme","full_name":"Hirst, Graeme"},{"first_name":"Iryna","last_name":"Gurevych","full_name":"Gurevych, Iryna"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"}],"user_id":"82920","doi":"10.18653/v1/P17-2039","page":"250-255","main_file_link":[{"url":"https://www.aclweb.org/anthology/P17-2039.pdf"}],"_id":"3883","language":[{"iso":"eng"}],"publication":"Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)","citation":{"bibtex":"@inproceedings{Wachsmuth_Naderi_Habernal_Hou_Hirst_Gurevych_Stein_2017, title={Argumentation Quality Assessment: Theory vs. Practice}, DOI={<a href=\"https://doi.org/10.18653/v1/P17-2039\">10.18653/v1/P17-2039</a>}, booktitle={Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)}, author={Wachsmuth, Henning and Naderi, Nona and Habernal, Ivan and Hou, Yufang and Hirst, Graeme and Gurevych, Iryna and Stein, Benno}, year={2017}, pages={250–255} }","ama":"Wachsmuth H, Naderi N, Habernal I, et al. Argumentation Quality Assessment: Theory vs. Practice. In: <i>Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)</i>. ; 2017:250-255. doi:<a href=\"https://doi.org/10.18653/v1/P17-2039\">10.18653/v1/P17-2039</a>","mla":"Wachsmuth, Henning, et al. “Argumentation Quality Assessment: Theory vs. Practice.” <i>Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)</i>, 2017, pp. 250–55, doi:<a href=\"https://doi.org/10.18653/v1/P17-2039\">10.18653/v1/P17-2039</a>.","chicago":"Wachsmuth, Henning, Nona Naderi, Ivan Habernal, Yufang Hou, Graeme Hirst, Iryna Gurevych, and Benno Stein. “Argumentation Quality Assessment: Theory vs. Practice.” In <i>Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)</i>, 250–55, 2017. <a href=\"https://doi.org/10.18653/v1/P17-2039\">https://doi.org/10.18653/v1/P17-2039</a>.","short":"H. Wachsmuth, N. Naderi, I. Habernal, Y. Hou, G. Hirst, I. Gurevych, B. Stein, in: Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), 2017, pp. 250–255.","ieee":"H. Wachsmuth <i>et al.</i>, “Argumentation Quality Assessment: Theory vs. Practice,” in <i>Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)</i>, 2017, pp. 250–255.","apa":"Wachsmuth, H., Naderi, N., Habernal, I., Hou, Y., Hirst, G., Gurevych, I., &#38; Stein, B. (2017). Argumentation Quality Assessment: Theory vs. Practice. In <i>Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)</i> (pp. 250–255). <a href=\"https://doi.org/10.18653/v1/P17-2039\">https://doi.org/10.18653/v1/P17-2039</a>"},"type":"conference","department":[{"_id":"568"},{"_id":"600"}],"date_created":"2018-08-11T16:18:38Z"},{"department":[{"_id":"600"}],"type":"conference","date_created":"2018-08-14T13:28:44Z","citation":{"apa":"Hagen, M., Kiesel, J., Alshomary, M., &#38; Stein, B. (2017). Webis at the CLEF 2017 Dynamic Search Lab. In <i>Working Notes of CLEF 2017 - Conference and Labs of the Evaluation Forum</i>.","ieee":"M. Hagen, J. Kiesel, M. Alshomary, and B. Stein, “Webis at the CLEF 2017 Dynamic Search Lab,” in <i>Working Notes of CLEF 2017 - Conference and Labs of the Evaluation Forum</i>, 2017.","chicago":"Hagen, Matthias, Johannes Kiesel, Milad Alshomary, and Benno Stein. “Webis at the CLEF 2017 Dynamic Search Lab.” In <i>Working Notes of CLEF 2017 - Conference and Labs of the Evaluation Forum</i>, 2017.","short":"M. Hagen, J. Kiesel, M. Alshomary, B. Stein, in: Working Notes of CLEF 2017 - Conference and Labs of the Evaluation Forum, 2017.","mla":"Hagen, Matthias, et al. “Webis at the CLEF 2017 Dynamic Search Lab.” <i>Working Notes of CLEF 2017 - Conference and Labs of the Evaluation Forum</i>, 2017.","ama":"Hagen M, Kiesel J, Alshomary M, Stein B. Webis at the CLEF 2017 Dynamic Search Lab. In: <i>Working Notes of CLEF 2017 - Conference and Labs of the Evaluation Forum</i>. ; 2017.","bibtex":"@inproceedings{Hagen_Kiesel_Alshomary_Stein_2017, title={Webis at the CLEF 2017 Dynamic Search Lab}, booktitle={Working Notes of CLEF 2017 - Conference and Labs of the Evaluation Forum}, author={Hagen, Matthias and Kiesel, Johannes and Alshomary, Milad and Stein, Benno}, year={2017} }"},"publication":"Working Notes of CLEF 2017 - Conference and Labs of the Evaluation Forum","user_id":"73059","_id":"3904","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://ceur-ws.org/Vol-1866/paper_198.pdf"}],"date_updated":"2022-01-06T06:59:54Z","author":[{"full_name":"Hagen, Matthias","last_name":"Hagen","first_name":"Matthias"},{"full_name":"Kiesel, Johannes","last_name":"Kiesel","first_name":"Johannes"},{"id":"73059","last_name":"Alshomary","first_name":"Milad","full_name":"Alshomary, Milad"},{"full_name":"Stein, Benno","first_name":"Benno","last_name":"Stein"}],"year":"2017","title":"Webis at the CLEF 2017 Dynamic Search Lab","status":"public"},{"date_updated":"2022-01-06T06:58:46Z","status":"public","title":"Soft Clustering Algorithms - Theoretical and Practical Improvements","year":"2017","author":[{"full_name":"Bujna, Kathrin","last_name":"Bujna","first_name":"Kathrin"}],"doi":"10.17619/UNIPB/1-226","user_id":"25078","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-29759"}],"_id":"2908","publisher":"Universität Paderborn","supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"citation":{"mla":"Bujna, Kathrin. <i>Soft Clustering Algorithms - Theoretical and Practical Improvements</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-226\">10.17619/UNIPB/1-226</a>.","ama":"Bujna K. <i>Soft Clustering Algorithms - Theoretical and Practical Improvements</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-226\">10.17619/UNIPB/1-226</a>","bibtex":"@book{Bujna_2017, title={Soft Clustering Algorithms - Theoretical and Practical Improvements}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-226\">10.17619/UNIPB/1-226</a>}, publisher={Universität Paderborn}, author={Bujna, Kathrin}, year={2017} }","apa":"Bujna, K. (2017). <i>Soft Clustering Algorithms - Theoretical and Practical Improvements</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-226\">https://doi.org/10.17619/UNIPB/1-226</a>","ieee":"K. Bujna, <i>Soft Clustering Algorithms - Theoretical and Practical Improvements</i>. Universität Paderborn, 2017.","short":"K. Bujna, Soft Clustering Algorithms - Theoretical and Practical Improvements, Universität Paderborn, 2017.","chicago":"Bujna, Kathrin. <i>Soft Clustering Algorithms - Theoretical and Practical Improvements</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-226\">https://doi.org/10.17619/UNIPB/1-226</a>."},"type":"dissertation","department":[{"_id":"64"}],"date_created":"2018-05-25T10:02:30Z"},{"title":"Subtleties in Security Definitions for Predicate Encryption with Public Index","year":"2017","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Gennadij","last_name":"Liske","full_name":"Liske, Gennadij"}],"publication_identifier":{"isbn":["9783319724522","9783319724539"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_updated":"2022-01-06T06:58:49Z","intvolume":"     10693","main_file_link":[{"url":"https://eprint.iacr.org/2017/453.pdf","open_access":"1"}],"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-72453-9_35","publication":"Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)","file":[{"relation":"main_file","date_updated":"2018-11-02T14:52:10Z","file_name":"SubtletiesInSecurityDefinition.pdf","file_size":463904,"access_level":"closed","file_id":"5286","content_type":"application/pdf","success":1,"creator":"ups","date_created":"2018-11-02T14:52:10Z"}],"date_created":"2018-06-04T12:17:48Z","type":"conference","department":[{"_id":"64"}],"status":"public","has_accepted_license":"1","page":"438-453","_id":"2967","publisher":"Springer International Publishing","user_id":"477","ddc":["000"],"volume":10693,"file_date_updated":"2018-11-02T14:52:10Z","citation":{"mla":"Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for Predicate Encryption with Public Index.” <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, vol. 10693, Springer International Publishing, 2017, pp. 438–53, doi:<a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">10.1007/978-3-319-72453-9_35</a>.","bibtex":"@inproceedings{Blömer_Liske_2017, place={Cham}, series={Lecture Notes in Computer Science}, title={Subtleties in Security Definitions for Predicate Encryption with Public Index}, volume={10693}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">10.1007/978-3-319-72453-9_35</a>}, booktitle={Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)}, publisher={Springer International Publishing}, author={Blömer, Johannes and Liske, Gennadij}, year={2017}, pages={438–453}, collection={Lecture Notes in Computer Science} }","ama":"Blömer J, Liske G. Subtleties in Security Definitions for Predicate Encryption with Public Index. In: <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>. Vol 10693. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:438-453. doi:<a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">10.1007/978-3-319-72453-9_35</a>","ieee":"J. Blömer and G. Liske, “Subtleties in Security Definitions for Predicate Encryption with Public Index,” in <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2017, vol. 10693, pp. 438–453.","apa":"Blömer, J., &#38; Liske, G. (2017). Subtleties in Security Definitions for Predicate Encryption with Public Index. In <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i> (Vol. 10693, pp. 438–453). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">https://doi.org/10.1007/978-3-319-72453-9_35</a>","chicago":"Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for Predicate Encryption with Public Index.” In <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 10693:438–53. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">https://doi.org/10.1007/978-3-319-72453-9_35</a>.","short":"J. Blömer, G. Liske, in: Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), Springer International Publishing, Cham, 2017, pp. 438–453."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"place":"Cham","oa":"1"},{"doi":"10.1007/s00145-016-9248-2","user_id":"38235","page":"1276--1324","_id":"3108","date_updated":"2022-01-06T06:58:56Z","year":"2017","title":"Authenticated Confidential Channel Establishment and the Security of TLS-DHE","status":"public","author":[{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"last_name":"Kohlar","first_name":"Florian","full_name":"Kohlar, Florian"},{"full_name":"Schäge, Sven","last_name":"Schäge","first_name":"Sven"},{"first_name":"Jörg","last_name":"Schwenk","full_name":"Schwenk, Jörg"}],"type":"journal_article","department":[{"_id":"558"}],"date_created":"2018-06-07T08:58:36Z","issue":"4","publication":"J. Cryptology","citation":{"mla":"Jager, Tibor, et al. “Authenticated Confidential Channel Establishment and the Security of TLS-DHE.” <i>J. Cryptology</i>, no. 4, 2017, pp. 1276--1324, doi:<a href=\"https://doi.org/10.1007/s00145-016-9248-2\">10.1007/s00145-016-9248-2</a>.","bibtex":"@article{Jager_Kohlar_Schäge_Schwenk_2017, title={Authenticated Confidential Channel Establishment and the Security of TLS-DHE}, DOI={<a href=\"https://doi.org/10.1007/s00145-016-9248-2\">10.1007/s00145-016-9248-2</a>}, number={4}, journal={J. Cryptology}, author={Jager, Tibor and Kohlar, Florian and Schäge, Sven and Schwenk, Jörg}, year={2017}, pages={1276--1324} }","ama":"Jager T, Kohlar F, Schäge S, Schwenk J. Authenticated Confidential Channel Establishment and the Security of TLS-DHE. <i>J Cryptology</i>. 2017;(4):1276--1324. doi:<a href=\"https://doi.org/10.1007/s00145-016-9248-2\">10.1007/s00145-016-9248-2</a>","ieee":"T. Jager, F. Kohlar, S. Schäge, and J. Schwenk, “Authenticated Confidential Channel Establishment and the Security of TLS-DHE,” <i>J. Cryptology</i>, no. 4, pp. 1276--1324, 2017.","apa":"Jager, T., Kohlar, F., Schäge, S., &#38; Schwenk, J. (2017). Authenticated Confidential Channel Establishment and the Security of TLS-DHE. <i>J. Cryptology</i>, (4), 1276--1324. <a href=\"https://doi.org/10.1007/s00145-016-9248-2\">https://doi.org/10.1007/s00145-016-9248-2</a>","chicago":"Jager, Tibor, Florian Kohlar, Sven Schäge, and Jörg Schwenk. “Authenticated Confidential Channel Establishment and the Security of TLS-DHE.” <i>J. Cryptology</i>, no. 4 (2017): 1276--1324. <a href=\"https://doi.org/10.1007/s00145-016-9248-2\">https://doi.org/10.1007/s00145-016-9248-2</a>.","short":"T. Jager, F. Kohlar, S. Schäge, J. Schwenk, J. Cryptology (2017) 1276--1324."}},{"date_created":"2018-06-07T09:07:59Z","type":"conference","department":[{"_id":"558"}],"publication":"Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings","citation":{"mla":"Hale, Britta, et al. “Simple Security Definitions for and Constructions of 0-RTT Key Exchange.” <i>Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings</i>, 2017, pp. 20--38, doi:<a href=\"https://doi.org/10.1007/978-3-319-61204-1_2\">10.1007/978-3-319-61204-1_2</a>.","ama":"Hale B, Jager T, Lauer S, Schwenk J. Simple Security Definitions for and Constructions of 0-RTT Key Exchange. In: <i>Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings</i>. ; 2017:20--38. doi:<a href=\"https://doi.org/10.1007/978-3-319-61204-1_2\">10.1007/978-3-319-61204-1_2</a>","bibtex":"@inproceedings{Hale_Jager_Lauer_Schwenk_2017, title={Simple Security Definitions for and Constructions of 0-RTT Key Exchange}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-61204-1_2\">10.1007/978-3-319-61204-1_2</a>}, booktitle={Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings}, author={Hale, Britta and Jager, Tibor and Lauer, Sebastian and Schwenk, Jörg}, year={2017}, pages={20--38} }","apa":"Hale, B., Jager, T., Lauer, S., &#38; Schwenk, J. (2017). Simple Security Definitions for and Constructions of 0-RTT Key Exchange. In <i>Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings</i> (pp. 20--38). <a href=\"https://doi.org/10.1007/978-3-319-61204-1_2\">https://doi.org/10.1007/978-3-319-61204-1_2</a>","ieee":"B. Hale, T. Jager, S. Lauer, and J. Schwenk, “Simple Security Definitions for and Constructions of 0-RTT Key Exchange,” in <i>Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings</i>, 2017, pp. 20--38.","chicago":"Hale, Britta, Tibor Jager, Sebastian Lauer, and Jörg Schwenk. “Simple Security Definitions for and Constructions of 0-RTT Key Exchange.” In <i>Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings</i>, 20--38, 2017. <a href=\"https://doi.org/10.1007/978-3-319-61204-1_2\">https://doi.org/10.1007/978-3-319-61204-1_2</a>.","short":"B. Hale, T. Jager, S. Lauer, J. Schwenk, in: Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings, 2017, pp. 20--38."},"page":"20--38","_id":"3109","doi":"10.1007/978-3-319-61204-1_2","user_id":"38235","title":"Simple Security Definitions for and Constructions of 0-RTT Key Exchange","status":"public","year":"2017","author":[{"full_name":"Hale, Britta","last_name":"Hale","first_name":"Britta"},{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"full_name":"Lauer, Sebastian","first_name":"Sebastian","last_name":"Lauer"},{"full_name":"Schwenk, Jörg","first_name":"Jörg","last_name":"Schwenk"}],"date_updated":"2022-01-06T06:58:56Z"},{"title":"0-RTT Key Exchange with Full Forward Secrecy","year":"2017","status":"public","author":[{"last_name":"Günther","first_name":"Felix","full_name":"Günther, Felix"},{"full_name":"Hale, Britta","last_name":"Hale","first_name":"Britta"},{"id":"64669","full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager"},{"full_name":"Lauer, Sebastian","first_name":"Sebastian","last_name":"Lauer"}],"date_updated":"2022-01-06T06:58:56Z","page":"519--548","_id":"3110","doi":"10.1007/978-3-319-56617-7_18","user_id":"38235","publication":"Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III","citation":{"bibtex":"@inproceedings{Günther_Hale_Jager_Lauer_2017, title={0-RTT Key Exchange with Full Forward Secrecy}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-56617-7_18\">10.1007/978-3-319-56617-7_18</a>}, booktitle={Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III}, author={Günther, Felix and Hale, Britta and Jager, Tibor and Lauer, Sebastian}, year={2017}, pages={519--548} }","ama":"Günther F, Hale B, Jager T, Lauer S. 0-RTT Key Exchange with Full Forward Secrecy. In: <i>Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III</i>. ; 2017:519--548. doi:<a href=\"https://doi.org/10.1007/978-3-319-56617-7_18\">10.1007/978-3-319-56617-7_18</a>","mla":"Günther, Felix, et al. “0-RTT Key Exchange with Full Forward Secrecy.” <i>Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III</i>, 2017, pp. 519--548, doi:<a href=\"https://doi.org/10.1007/978-3-319-56617-7_18\">10.1007/978-3-319-56617-7_18</a>.","chicago":"Günther, Felix, Britta Hale, Tibor Jager, and Sebastian Lauer. “0-RTT Key Exchange with Full Forward Secrecy.” In <i>Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III</i>, 519--548, 2017. <a href=\"https://doi.org/10.1007/978-3-319-56617-7_18\">https://doi.org/10.1007/978-3-319-56617-7_18</a>.","short":"F. Günther, B. Hale, T. Jager, S. Lauer, in: Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III, 2017, pp. 519--548.","ieee":"F. Günther, B. Hale, T. Jager, and S. Lauer, “0-RTT Key Exchange with Full Forward Secrecy,” in <i>Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III</i>, 2017, pp. 519--548.","apa":"Günther, F., Hale, B., Jager, T., &#38; Lauer, S. (2017). 0-RTT Key Exchange with Full Forward Secrecy. In <i>Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III</i> (pp. 519--548). <a href=\"https://doi.org/10.1007/978-3-319-56617-7_18\">https://doi.org/10.1007/978-3-319-56617-7_18</a>"},"date_created":"2018-06-07T09:10:17Z","type":"conference","department":[{"_id":"558"}]},{"publication":"Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I","citation":{"ieee":"T. Jager, M. Stam, R. Stanley-Oakes, and B. Warinschi, “Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy,” in <i>Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I</i>, 2017, pp. 409--441.","apa":"Jager, T., Stam, M., Stanley-Oakes, R., &#38; Warinschi, B. (2017). Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy. In <i>Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I</i> (pp. 409--441). <a href=\"https://doi.org/10.1007/978-3-319-70500-2_14\">https://doi.org/10.1007/978-3-319-70500-2_14</a>","chicago":"Jager, Tibor, Martijn Stam, Ryan Stanley-Oakes, and Bogdan Warinschi. “Multi-Key Authenticated Encryption with Corruptions: Reductions Are Lossy.” In <i>Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I</i>, 409--441, 2017. <a href=\"https://doi.org/10.1007/978-3-319-70500-2_14\">https://doi.org/10.1007/978-3-319-70500-2_14</a>.","short":"T. Jager, M. Stam, R. Stanley-Oakes, B. Warinschi, in: Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I, 2017, pp. 409--441.","mla":"Jager, Tibor, et al. “Multi-Key Authenticated Encryption with Corruptions: Reductions Are Lossy.” <i>Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I</i>, 2017, pp. 409--441, doi:<a href=\"https://doi.org/10.1007/978-3-319-70500-2_14\">10.1007/978-3-319-70500-2_14</a>.","bibtex":"@inproceedings{Jager_Stam_Stanley-Oakes_Warinschi_2017, title={Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-70500-2_14\">10.1007/978-3-319-70500-2_14</a>}, booktitle={Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I}, author={Jager, Tibor and Stam, Martijn and Stanley-Oakes, Ryan and Warinschi, Bogdan}, year={2017}, pages={409--441} }","ama":"Jager T, Stam M, Stanley-Oakes R, Warinschi B. Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy. In: <i>Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I</i>. ; 2017:409--441. doi:<a href=\"https://doi.org/10.1007/978-3-319-70500-2_14\">10.1007/978-3-319-70500-2_14</a>"},"date_created":"2018-06-07T09:11:07Z","type":"conference","department":[{"_id":"558"}],"title":"Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy","status":"public","year":"2017","author":[{"full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager","id":"64669"},{"full_name":"Stam, Martijn","last_name":"Stam","first_name":"Martijn"},{"full_name":"Stanley-Oakes, Ryan","last_name":"Stanley-Oakes","first_name":"Ryan"},{"last_name":"Warinschi","first_name":"Bogdan","full_name":"Warinschi, Bogdan"}],"date_updated":"2022-01-06T06:58:56Z","page":"409--441","_id":"3111","doi":"10.1007/978-3-319-70500-2_14","user_id":"38235"},{"publication":"Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi'an, China, November 13-17, 2017, Proceedings","citation":{"apa":"Töws, M., &#38; Wehrheim, H. (2017). Policy Dependent and Independent Information Flow Analyses. In Z. Duan &#38; L. Ong (Eds.), <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i> (pp. 362--378). <a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">https://doi.org/10.1007/978-3-319-68690-5_22</a>","ieee":"M. Töws and H. Wehrheim, “Policy Dependent and Independent Information Flow Analyses,” in <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i>, 2017, pp. 362--378.","short":"M. Töws, H. Wehrheim, in: Z. Duan, L. Ong (Eds.), Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings, 2017, pp. 362--378.","chicago":"Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information Flow Analyses.” In <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i>, edited by Zhenhua Duan and Luke Ong, 362--378. Lecture Notes in Computer Science, 2017. <a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">https://doi.org/10.1007/978-3-319-68690-5_22</a>.","mla":"Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information Flow Analyses.” <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i>, edited by Zhenhua Duan and Luke Ong, 2017, pp. 362--378, doi:<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>.","ama":"Töws M, Wehrheim H. Policy Dependent and Independent Information Flow Analyses. In: Duan Z, Ong L, eds. <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i>. Lecture Notes in Computer Science. ; 2017:362--378. doi:<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>","bibtex":"@inproceedings{Töws_Wehrheim_2017, series={Lecture Notes in Computer Science}, title={Policy Dependent and Independent Information Flow Analyses}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>}, booktitle={Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings}, author={Töws, Manuel and Wehrheim, Heike}, editor={Duan, Zhenhua and Ong, LukeEditors}, year={2017}, pages={362--378}, collection={Lecture Notes in Computer Science} }"},"date_created":"2018-06-13T07:35:49Z","type":"conference","department":[{"_id":"77"}],"year":"2017","status":"public","title":"Policy Dependent and Independent Information Flow Analyses","author":[{"full_name":"Töws, Manuel","last_name":"Töws","first_name":"Manuel"},{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"date_updated":"2022-01-06T06:59:00Z","page":"362--378","series_title":"Lecture Notes in Computer Science","_id":"3155","doi":"10.1007/978-3-319-68690-5_22","user_id":"29719","editor":[{"full_name":"Duan, Zhenhua","first_name":"Zhenhua","last_name":"Duan"},{"full_name":"Ong, Luke","last_name":"Ong","first_name":"Luke"}]},{"year":"2017","title":"Value-Based or Conflict-Based? Opacity Definitions for STMs","status":"public","author":[{"last_name":"König","first_name":"Jürgen","full_name":"König, Jürgen"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"date_updated":"2022-01-06T06:59:00Z","page":"118--135","series_title":"Lecture Notes in Computer Science","_id":"3156","doi":"10.1007/978-3-319-67729-3_8","user_id":"29719","editor":[{"full_name":"Van Hung, Dang","first_name":"Dang","last_name":"Van Hung"},{"first_name":"Deepak","last_name":"Kapur","full_name":"Kapur, Deepak"}],"publication":"Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings","citation":{"bibtex":"@inproceedings{König_Wehrheim_2017, series={Lecture Notes in Computer Science}, title={Value-Based or Conflict-Based? Opacity Definitions for STMs}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">10.1007/978-3-319-67729-3_8</a>}, booktitle={Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings}, author={König, Jürgen and Wehrheim, Heike}, editor={Van Hung, Dang and Kapur, DeepakEditors}, year={2017}, pages={118--135}, collection={Lecture Notes in Computer Science} }","ama":"König J, Wehrheim H. Value-Based or Conflict-Based? Opacity Definitions for STMs. In: Van Hung D, Kapur D, eds. <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>. Lecture Notes in Computer Science. ; 2017:118--135. doi:<a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">10.1007/978-3-319-67729-3_8</a>","mla":"König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity Definitions for STMs.” <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>, edited by Dang Van Hung and Deepak Kapur, 2017, pp. 118--135, doi:<a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">10.1007/978-3-319-67729-3_8</a>.","short":"J. König, H. Wehrheim, in: D. Van Hung, D. Kapur (Eds.), Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings, 2017, pp. 118--135.","chicago":"König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity Definitions for STMs.” In <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>, edited by Dang Van Hung and Deepak Kapur, 118--135. Lecture Notes in Computer Science, 2017. <a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">https://doi.org/10.1007/978-3-319-67729-3_8</a>.","ieee":"J. König and H. Wehrheim, “Value-Based or Conflict-Based? Opacity Definitions for STMs,” in <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>, 2017, pp. 118--135.","apa":"König, J., &#38; Wehrheim, H. (2017). Value-Based or Conflict-Based? Opacity Definitions for STMs. In D. Van Hung &#38; D. Kapur (Eds.), <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i> (pp. 118--135). <a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">https://doi.org/10.1007/978-3-319-67729-3_8</a>"},"project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"date_created":"2018-06-13T07:37:18Z","type":"conference","department":[{"_id":"77"}]},{"citation":{"mla":"Ali Ashraf, Shehzad, et al. <i>From Radio Design to System Evaluations for Ultra-Reliable and Low-Latency Communication </i>. Proceedings of 23th European Wireless Conference 2017, 17- 19.05.2017, 2017.","ama":"Ali Ashraf S, Wang Y-PE, Eldessoki S, et al. From Radio Design to System Evaluations for Ultra-Reliable and Low-Latency Communication . In: Dresden: Proceedings of 23th European Wireless Conference 2017, 17- 19.05.2017; 2017.","bibtex":"@inproceedings{Ali Ashraf_Wang_Eldessoki_Holfeld_Parruca_Serror_Gross_2017, place={Dresden}, title={From Radio Design to System Evaluations for Ultra-Reliable and Low-Latency Communication }, publisher={Proceedings of 23th European Wireless Conference 2017, 17- 19.05.2017}, author={Ali Ashraf, Shehzad and Wang, Y.-P. Eric and Eldessoki, Sameh  and Holfeld, Bernd and Parruca, Donald  and Serror, Martin and Gross, James}, year={2017} }","apa":"Ali Ashraf, S., Wang, Y.-P. E., Eldessoki, S., Holfeld, B., Parruca, D., Serror, M., &#38; Gross, J. (2017). From Radio Design to System Evaluations for Ultra-Reliable and Low-Latency Communication . Dresden: Proceedings of 23th European Wireless Conference 2017, 17- 19.05.2017.","ieee":"S. Ali Ashraf <i>et al.</i>, “From Radio Design to System Evaluations for Ultra-Reliable and Low-Latency Communication ,” 2017.","short":"S. Ali Ashraf, Y.-P.E. Wang, S. Eldessoki, B. Holfeld, D. Parruca, M. Serror, J. Gross, in: Proceedings of 23th European Wireless Conference 2017, 17- 19.05.2017, Dresden, 2017.","chicago":"Ali Ashraf, Shehzad, Y.-P. Eric Wang, Sameh  Eldessoki, Bernd Holfeld, Donald  Parruca, Martin Serror, and James Gross. “From Radio Design to System Evaluations for Ultra-Reliable and Low-Latency Communication .” Dresden: Proceedings of 23th European Wireless Conference 2017, 17- 19.05.2017, 2017."},"project":[{"_id":"29","name":"Verbundprojekt: Koordinierte Industriekommunikation - Latenzarme und verlässliche Industriekommunikation  - Teilvorhaben: Verteilte Koordination"}],"place":"Dresden","date_created":"2018-05-14T10:46:57Z","department":[{"_id":"75"}],"type":"conference","author":[{"last_name":"Ali Ashraf","first_name":"Shehzad","full_name":"Ali Ashraf, Shehzad"},{"first_name":"Y.-P. Eric","last_name":"Wang","full_name":"Wang, Y.-P. Eric"},{"full_name":"Eldessoki, Sameh ","first_name":"Sameh ","last_name":"Eldessoki"},{"full_name":"Holfeld, Bernd","first_name":"Bernd","last_name":"Holfeld"},{"full_name":"Parruca, Donald ","last_name":"Parruca","first_name":"Donald "},{"full_name":"Serror, Martin","last_name":"Serror","first_name":"Martin"},{"full_name":"Gross, James","first_name":"James","last_name":"Gross"}],"status":"public","title":"From Radio Design to System Evaluations for Ultra-Reliable and Low-Latency Communication ","year":"2017","date_updated":"2022-01-06T06:57:39Z","publisher":"Proceedings of 23th European Wireless Conference 2017, 17- 19.05.2017","_id":"2741","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8011336/"}],"user_id":"15572"},{"external_id":{"arxiv":["1701.07304"]},"file_date_updated":"2018-03-21T13:05:37Z","citation":{"apa":"Feldotto, M., Leder, L., &#38; Skopalik, A. (2017). Congestion Games with Complementarities. In <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i> (pp. 222--233). <a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">https://doi.org/10.1007/978-3-319-57586-5_19</a>","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,” in <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>, 2017, pp. 222--233.","short":"M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Complementarities.” In <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>, 222--233. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">https://doi.org/10.1007/978-3-319-57586-5_19</a>.","mla":"Feldotto, Matthias, et al. “Congestion Games with Complementarities.” <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>, 2017, pp. 222--233, doi:<a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">10.1007/978-3-319-57586-5_19</a>.","ama":"Feldotto M, Leder L, Skopalik A. Congestion Games with Complementarities. In: <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>. LNCS. ; 2017:222--233. doi:<a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">10.1007/978-3-319-57586-5_19</a>","bibtex":"@inproceedings{Feldotto_Leder_Skopalik_2017, series={LNCS}, title={Congestion Games with Complementarities}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">10.1007/978-3-319-57586-5_19</a>}, booktitle={Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2017}, pages={222--233}, collection={LNCS} }"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"page":"222--233","_id":"112","ddc":["040"],"user_id":"14052","status":"public","has_accepted_license":"1","file":[{"creator":"florida","date_created":"2018-03-21T13:05:37Z","relation":"main_file","date_updated":"2018-03-21T13:05:37Z","file_name":"112-FeldottoLederSkopalik2017.pdf","file_size":264089,"access_level":"closed","file_id":"1566","content_type":"application/pdf","success":1}],"date_created":"2017-10-17T12:41:13Z","type":"conference","department":[{"_id":"63"},{"_id":"541"}],"publication":"Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)","abstract":[{"text":"We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES) which is a well-studied model in economics. We consider congestion games with different aggregation functions. In particular, we study $L_p$ norms and analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally, we give an almost tight characterization based on monotonicity properties to describe the set of aggregation functions that guarantee the existence of pure Nash equilibria.","lang":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-57586-5_19","year":"2017","title":"Congestion Games with Complementarities","author":[{"first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","id":"14052"},{"first_name":"Lennart","last_name":"Leder","full_name":"Leder, Lennart"},{"id":"40384","first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander"}],"date_updated":"2022-01-06T06:50:58Z"},{"doi":"10.1007/978-3-319-71924-5_14","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:59Z","year":"2017","title":"Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games","author":[{"id":"14052","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","first_name":"Matthias","last_name":"Feldotto"},{"full_name":"Gairing, Martin","last_name":"Gairing","first_name":"Martin"},{"full_name":"Kotsialou, Grammateia","last_name":"Kotsialou","first_name":"Grammateia"},{"last_name":"Skopalik","first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384"}],"type":"conference","department":[{"_id":"63"},{"_id":"541"}],"file":[{"date_created":"2018-10-31T17:01:32Z","creator":"feldi","success":1,"content_type":"application/pdf","file_id":"5231","access_level":"closed","file_size":279055,"file_name":"Feldotto2017_Chapter_ComputingApproximatePureNashEq.pdf","date_updated":"2018-10-31T17:01:32Z","relation":"main_file"}],"date_created":"2017-10-17T12:41:13Z","abstract":[{"lang":"eng","text":"We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial resource cost functions and present an algorithm that computes approximate pure Nash equilibria with a polynomial number of strategy updates. Since computing a single strategy update is hard, we apply sampling techniques which allow us to achieve polynomial running time. The algorithm builds on the algorithmic ideas of [7], however, to the best of our knowledge, this is the first algorithmic result on computation of approximate equilibria using other than proportional shares as player costs in this setting. We present a novel relation that approximates the Shapley value of a player by her proportional share and vice versa. As side results, we upper bound the approximate price of anarchy of such games and significantly improve the best known factor for computing approximate pure Nash equilibria in weighted congestion games of [7]."}],"publication":"Proceedings of the 13th International Conference on Web and Internet Economics (WINE)","user_id":"14052","ddc":["000"],"_id":"113","has_accepted_license":"1","status":"public","external_id":{"arxiv":["1710.01634"]},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-10-31T17:01:32Z","citation":{"apa":"Feldotto, M., Gairing, M., Kotsialou, G., &#38; Skopalik, A. (2017). Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>. <a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">https://doi.org/10.1007/978-3-319-71924-5_14</a>","ieee":"M. Feldotto, M. Gairing, G. Kotsialou, and A. Skopalik, “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games,” in <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>, 2017.","short":"M. Feldotto, M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.","chicago":"Feldotto, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” In <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>, 2017. <a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">https://doi.org/10.1007/978-3-319-71924-5_14</a>.","mla":"Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">10.1007/978-3-319-71924-5_14</a>.","ama":"Feldotto M, Gairing M, Kotsialou G, Skopalik A. Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In: <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">10.1007/978-3-319-71924-5_14</a>","bibtex":"@inproceedings{Feldotto_Gairing_Kotsialou_Skopalik_2017, title={Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">10.1007/978-3-319-71924-5_14</a>}, booktitle={Proceedings of the 13th International Conference on Web and Internet Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander}, year={2017} }"}},{"title":"Compact Proof Witnesses","year":"2017","author":[{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_updated":"2022-01-06T06:51:00Z","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-57288-8_28","publication":"NASA Formal Methods: 9th International Symposium","abstract":[{"lang":"eng","text":"Proof witnesses are proof artifacts showing correctness of programs wrt. safety properties. The recent past has seen a rising interest in witnesses as (a) proofs in a proof-carrying-code context, (b) certificates for the correct functioning of verification tools, or simply (c) exchange formats for (partial) verification results. As witnesses in all theses scenarios need to be stored and processed, witnesses are required to be as small as possible. However, software verification tools – the prime suppliers of witnesses – do not necessarily construct small witnesses. In this paper, we present a formal account of proof witnesses. We introduce the concept of weakenings, reducing the complexity of proof witnesses while preserving the ability of witnessing safety. We develop aweakening technique for a specific class of program analyses, and prove it to be sound. Finally, we experimentally demonstrate our weakening technique to indeed achieve a size reduction of proof witnesses."}],"file":[{"creator":"florida","date_created":"2018-03-21T13:05:02Z","file_size":492800,"access_level":"closed","file_name":"114-chp_3A10.1007_2F978-3-319-57288-8_28.pdf","date_updated":"2018-03-21T13:05:02Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1565"}],"date_created":"2017-10-17T12:41:13Z","type":"conference","department":[{"_id":"77"}],"status":"public","has_accepted_license":"1","page":"389-403","_id":"114","ddc":["040"],"user_id":"477","editor":[{"full_name":"Barrett, Clark","first_name":"Clark","last_name":"Barrett"},{"first_name":"Misty","last_name":"Davies","full_name":"Davies, Misty"},{"full_name":"Kahsai, Temesghen","first_name":"Temesghen","last_name":"Kahsai"}],"file_date_updated":"2018-03-21T13:05:02Z","citation":{"mla":"Jakobs, Marie-Christine, and Heike Wehrheim. “Compact Proof Witnesses.” <i>NASA Formal Methods: 9th International Symposium</i>, edited by Clark Barrett et al., 2017, pp. 389–403, doi:<a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">10.1007/978-3-319-57288-8_28</a>.","bibtex":"@inproceedings{Jakobs_Wehrheim_2017, series={Lecture Notes in Computer Science}, title={Compact Proof Witnesses}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">10.1007/978-3-319-57288-8_28</a>}, booktitle={NASA Formal Methods: 9th International Symposium}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Barrett, Clark and Davies, Misty and Kahsai, TemesghenEditors}, year={2017}, pages={389–403}, collection={Lecture Notes in Computer Science} }","ama":"Jakobs M-C, Wehrheim H. Compact Proof Witnesses. In: Barrett C, Davies M, Kahsai T, eds. <i>NASA Formal Methods: 9th International Symposium</i>. Lecture Notes in Computer Science. ; 2017:389-403. doi:<a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">10.1007/978-3-319-57288-8_28</a>","ieee":"M.-C. Jakobs and H. Wehrheim, “Compact Proof Witnesses,” in <i>NASA Formal Methods: 9th International Symposium</i>, 2017, pp. 389–403.","apa":"Jakobs, M.-C., &#38; Wehrheim, H. (2017). Compact Proof Witnesses. In C. Barrett, M. Davies, &#38; T. Kahsai (Eds.), <i>NASA Formal Methods: 9th International Symposium</i> (pp. 389–403). <a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">https://doi.org/10.1007/978-3-319-57288-8_28</a>","short":"M.-C. Jakobs, H. Wehrheim, in: C. Barrett, M. Davies, T. Kahsai (Eds.), NASA Formal Methods: 9th International Symposium, 2017, pp. 389–403.","chicago":"Jakobs, Marie-Christine, and Heike Wehrheim. “Compact Proof Witnesses.” In <i>NASA Formal Methods: 9th International Symposium</i>, edited by Clark Barrett, Misty Davies, and Temesghen Kahsai, 389–403. Lecture Notes in Computer Science, 2017. <a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">https://doi.org/10.1007/978-3-319-57288-8_28</a>."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}]}]