[{"author":[{"full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager","id":"64669"},{"first_name":"Florian","last_name":"Kohlar","full_name":"Kohlar, Florian"},{"last_name":"Schäge","first_name":"Sven","full_name":"Schäge, Sven"},{"first_name":"Jörg","last_name":"Schwenk","full_name":"Schwenk, Jörg"}],"status":"public","title":"Authenticated Confidential Channel Establishment and the Security of TLS-DHE","year":"2017","date_updated":"2022-01-06T06:58:56Z","_id":"3108","page":"1276--1324","user_id":"38235","doi":"10.1007/s00145-016-9248-2","citation":{"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>","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>.","short":"T. Jager, F. Kohlar, S. Schäge, J. Schwenk, J. Cryptology (2017) 1276--1324.","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>.","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>"},"issue":"4","publication":"J. Cryptology","date_created":"2018-06-07T08:58:36Z","department":[{"_id":"558"}],"type":"journal_article"},{"date_updated":"2022-01-06T06:58:56Z","author":[{"last_name":"Hale","first_name":"Britta","full_name":"Hale, Britta"},{"full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor","id":"64669"},{"last_name":"Lauer","first_name":"Sebastian","full_name":"Lauer, Sebastian"},{"last_name":"Schwenk","first_name":"Jörg","full_name":"Schwenk, Jörg"}],"status":"public","title":"Simple Security Definitions for and Constructions of 0-RTT Key Exchange","year":"2017","user_id":"38235","doi":"10.1007/978-3-319-61204-1_2","_id":"3109","page":"20--38","citation":{"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.","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.","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>.","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} }"},"publication":"Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings","department":[{"_id":"558"}],"type":"conference","date_created":"2018-06-07T09:07:59Z"},{"type":"conference","department":[{"_id":"558"}],"date_created":"2018-06-07T09:10:17Z","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":{"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>.","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>","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>","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."},"user_id":"38235","doi":"10.1007/978-3-319-56617-7_18","page":"519--548","_id":"3110","date_updated":"2022-01-06T06:58:56Z","year":"2017","status":"public","title":"0-RTT Key Exchange with Full Forward Secrecy","author":[{"last_name":"Günther","first_name":"Felix","full_name":"Günther, Felix"},{"first_name":"Britta","last_name":"Hale","full_name":"Hale, Britta"},{"last_name":"Jager","first_name":"Tibor","full_name":"Jager, Tibor","id":"64669"},{"last_name":"Lauer","first_name":"Sebastian","full_name":"Lauer, Sebastian"}]},{"publication":"Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I","citation":{"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>.","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>","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} }","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>","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.","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.","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>."},"date_created":"2018-06-07T09:11:07Z","type":"conference","department":[{"_id":"558"}],"status":"public","year":"2017","title":"Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy","author":[{"id":"64669","first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor"},{"last_name":"Stam","first_name":"Martijn","full_name":"Stam, Martijn"},{"last_name":"Stanley-Oakes","first_name":"Ryan","full_name":"Stanley-Oakes, 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"},{"page":"362--378","_id":"3155","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-319-68690-5_22","user_id":"29719","editor":[{"first_name":"Zhenhua","last_name":"Duan","full_name":"Duan, Zhenhua"},{"full_name":"Ong, Luke","last_name":"Ong","first_name":"Luke"}],"status":"public","year":"2017","title":"Policy Dependent and Independent Information Flow Analyses","author":[{"full_name":"Töws, Manuel","last_name":"Töws","first_name":"Manuel"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"date_updated":"2022-01-06T06:59:00Z","date_created":"2018-06-13T07:35:49Z","type":"conference","department":[{"_id":"77"}],"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.","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>.","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.","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} }"}},{"_id":"3156","series_title":"Lecture Notes in Computer Science","page":"118--135","editor":[{"full_name":"Van Hung, Dang","last_name":"Van Hung","first_name":"Dang"},{"full_name":"Kapur, Deepak","last_name":"Kapur","first_name":"Deepak"}],"user_id":"29719","doi":"10.1007/978-3-319-67729-3_8","author":[{"full_name":"König, Jürgen","last_name":"König","first_name":"Jürgen"},{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"year":"2017","title":"Value-Based or Conflict-Based? Opacity Definitions for STMs","status":"public","date_updated":"2022-01-06T06:59:00Z","date_created":"2018-06-13T07:37:18Z","department":[{"_id":"77"}],"type":"conference","citation":{"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>","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>.","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>.","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>"},"publication":"Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings","project":[{"name":"Validation of Software Transactional Memory","_id":"78"}]},{"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8011336/"}],"publisher":"Proceedings of 23th European Wireless Conference 2017, 17- 19.05.2017","_id":"2741","user_id":"15572","status":"public","title":"From Radio Design to System Evaluations for Ultra-Reliable and Low-Latency Communication ","year":"2017","author":[{"last_name":"Ali Ashraf","first_name":"Shehzad","full_name":"Ali Ashraf, Shehzad"},{"last_name":"Wang","first_name":"Y.-P. Eric","full_name":"Wang, Y.-P. Eric"},{"last_name":"Eldessoki","first_name":"Sameh ","full_name":"Eldessoki, Sameh "},{"full_name":"Holfeld, Bernd","last_name":"Holfeld","first_name":"Bernd"},{"full_name":"Parruca, Donald ","first_name":"Donald ","last_name":"Parruca"},{"full_name":"Serror, Martin","first_name":"Martin","last_name":"Serror"},{"full_name":"Gross, James","last_name":"Gross","first_name":"James"}],"date_updated":"2022-01-06T06:57:39Z","date_created":"2018-05-14T10:46:57Z","place":"Dresden","type":"conference","department":[{"_id":"75"}],"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.","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} }","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.","ieee":"S. Ali Ashraf <i>et al.</i>, “From Radio Design to System Evaluations for Ultra-Reliable and Low-Latency Communication ,” 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.","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.","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."},"project":[{"name":"Verbundprojekt: Koordinierte Industriekommunikation - Latenzarme und verlässliche Industriekommunikation  - Teilvorhaben: Verteilte Koordination","_id":"29"}]},{"status":"public","has_accepted_license":"1","page":"222--233","_id":"112","user_id":"14052","ddc":["040"],"file_date_updated":"2018-03-21T13:05:37Z","citation":{"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>.","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} }","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>","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.","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>","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>.","short":"M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"external_id":{"arxiv":["1701.07304"]},"year":"2017","title":"Congestion Games with Complementarities","author":[{"full_name":"Feldotto, Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","first_name":"Matthias","id":"14052"},{"last_name":"Leder","first_name":"Lennart","full_name":"Leder, Lennart"},{"id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander","last_name":"Skopalik"}],"date_updated":"2022-01-06T06:50:58Z","series_title":"LNCS","doi":"10.1007/978-3-319-57586-5_19","publication":"Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)","abstract":[{"lang":"eng","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."}],"file":[{"date_created":"2018-03-21T13:05:37Z","creator":"florida","file_id":"1566","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T13:05:37Z","file_name":"112-FeldottoLederSkopalik2017.pdf","file_size":264089,"access_level":"closed"}],"date_created":"2017-10-17T12:41:13Z","type":"conference","department":[{"_id":"63"},{"_id":"541"}]},{"file":[{"date_created":"2018-10-31T17:01:32Z","creator":"feldi","file_id":"5231","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-10-31T17:01:32Z","file_name":"Feldotto2017_Chapter_ComputingApproximatePureNashEq.pdf","file_size":279055,"access_level":"closed"}],"date_created":"2017-10-17T12:41:13Z","type":"conference","department":[{"_id":"63"},{"_id":"541"}],"publication":"Proceedings of the 13th International Conference on Web and Internet Economics (WINE)","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]."}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-71924-5_14","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","first_name":"Martin","last_name":"Gairing"},{"full_name":"Kotsialou, Grammateia","first_name":"Grammateia","last_name":"Kotsialou"},{"full_name":"Skopalik, Alexander","last_name":"Skopalik","first_name":"Alexander","id":"40384"}],"date_updated":"2022-01-06T06:50:59Z","external_id":{"arxiv":["1710.01634"]},"file_date_updated":"2018-10-31T17:01:32Z","citation":{"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>.","short":"M. Feldotto, M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.","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.","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>","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} }","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>","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>."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"113","ddc":["000"],"user_id":"14052","status":"public","has_accepted_license":"1"},{"editor":[{"full_name":"Barrett, Clark","first_name":"Clark","last_name":"Barrett"},{"first_name":"Misty","last_name":"Davies","full_name":"Davies, Misty"},{"first_name":"Temesghen","last_name":"Kahsai","full_name":"Kahsai, Temesghen"}],"ddc":["040"],"user_id":"477","_id":"114","page":"389-403","has_accepted_license":"1","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"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>.","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>"},"file_date_updated":"2018-03-21T13:05:02Z","doi":"10.1007/978-3-319-57288-8_28","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","date_updated":"2022-01-06T06:51:00Z","author":[{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"year":"2017","title":"Compact Proof Witnesses","department":[{"_id":"77"}],"type":"conference","date_created":"2017-10-17T12:41:13Z","file":[{"file_id":"1565","success":1,"content_type":"application/pdf","file_name":"114-chp_3A10.1007_2F978-3-319-57288-8_28.pdf","file_size":492800,"access_level":"closed","relation":"main_file","date_updated":"2018-03-21T13:05:02Z","date_created":"2018-03-21T13:05:02Z","creator":"florida"}],"abstract":[{"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.","lang":"eng"}],"publication":"NASA Formal Methods: 9th International Symposium"},{"file_date_updated":"2018-03-21T13:04:12Z","citation":{"chicago":"Jakobs, Marie-Christine, Julia Krämer, Dirk van Straaten, and Theodor Lettmann. “Certification Matters for Service Markets.” In <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 7–12, 2017.","short":"M.-C. Jakobs, J. Krämer, D. van Straaten, T. Lettmann, in: T.P. Marcelo De Barros, Janusz Klink,Tadeus Uhl (Ed.), The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2017, pp. 7–12.","apa":"Jakobs, M.-C., Krämer, J., van Straaten, D., &#38; Lettmann, T. (2017). Certification Matters for Service Markets. In T. P. Marcelo De Barros, Janusz Klink,Tadeus Uhl (Ed.), <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i> (pp. 7–12).","ieee":"M.-C. Jakobs, J. Krämer, D. van Straaten, and T. Lettmann, “Certification Matters for Service Markets,” in <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2017, pp. 7–12.","ama":"Jakobs M-C, Krämer J, van Straaten D, Lettmann T. Certification Matters for Service Markets. In: Marcelo De Barros, Janusz Klink,Tadeus Uhl TP, ed. <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>. ; 2017:7-12.","bibtex":"@inproceedings{Jakobs_Krämer_van Straaten_Lettmann_2017, title={Certification Matters for Service Markets}, booktitle={The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}, author={Jakobs, Marie-Christine and Krämer, Julia and van Straaten, Dirk and Lettmann, Theodor}, editor={Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas PrinzEditor}, year={2017}, pages={7–12} }","mla":"Jakobs, Marie-Christine, et al. “Certification Matters for Service Markets.” <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 2017, pp. 7–12."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area B","_id":"3"}],"status":"public","has_accepted_license":"1","page":"7-12","_id":"115","user_id":"477","ddc":["040"],"editor":[{"full_name":"Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas Prinz","first_name":"Thomas Prinz","last_name":"Marcelo De Barros, Janusz Klink,Tadeus Uhl"}],"publication":"The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)","abstract":[{"lang":"eng","text":"Whenever customers have to decide between different instances of the same product, they are interested in buying the best product. In contrast, companies are interested in reducing the construction effort (and usually as a consequence thereof, the quality) to gain profit. The described setting is widely known as opposed preferences in quality of the product and also applies to the context of service-oriented computing. In general, service-oriented computing emphasizes the construction of large software systems out of existing services, where services are small and self-contained pieces of software that adhere to a specified interface. Several implementations of the same interface are considered as several instances of the same service. Thereby, customers are interested in buying the best service implementation for their service composition wrt. to metrics, such as costs, energy, memory consumption, or execution time. One way to ensure the service quality is to employ certificates, which can come in different kinds: Technical certificates proving correctness can be automatically constructed by the service provider and again be automatically checked by the user. Digital certificates allow proof of the integrity of a product. Other certificates might be rolled out if service providers follow a good software construction principle, which is checked in annual audits. Whereas all of these certificates are handled differently in service markets, what they have in common is that they influence the buying decisions of customers. In this paper, we review state-of-the-art developments in certification with respect to service-oriented computing. We not only discuss how certificates are constructed and handled in service-oriented computing but also review the effects of certificates on the market from an economic perspective."}],"file":[{"date_created":"2018-03-21T13:04:12Z","creator":"florida","file_id":"1564","success":1,"content_type":"application/pdf","file_name":"115-JakobsKraemerVanStraatenLettmann2017.pdf","access_level":"closed","file_size":133531,"relation":"main_file","date_updated":"2018-03-21T13:04:12Z"}],"date_created":"2017-10-17T12:41:14Z","type":"conference","department":[{"_id":"77"},{"_id":"355"},{"_id":"179"}],"year":"2017","title":"Certification Matters for Service Markets","author":[{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"full_name":"Krämer, Julia","last_name":"Krämer","first_name":"Julia"},{"id":"10311","first_name":"Dirk","last_name":"van Straaten","full_name":"van Straaten, Dirk"},{"full_name":"Lettmann, Theodor","last_name":"Lettmann","first_name":"Theodor","orcid":"0000-0001-5859-2457","id":"315"}],"date_updated":"2022-01-06T06:51:02Z","language":[{"iso":"eng"}]},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"supervisor":[{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"},{"id":"3118","first_name":"Tobias","last_name":"Wiersema","full_name":"Wiersema, Tobias"}],"citation":{"chicago":"Witschen, Linus Matthias. <i>A Framework for the Synthesis of Approximate Circuits</i>. Universität Paderborn, 2017.","short":"L.M. Witschen, A Framework for the Synthesis of Approximate Circuits, Universität Paderborn, 2017.","ieee":"L. M. Witschen, <i>A Framework for the Synthesis of Approximate Circuits</i>. Universität Paderborn, 2017.","apa":"Witschen, L. M. (2017). <i>A Framework for the Synthesis of Approximate Circuits</i>. Universität Paderborn.","bibtex":"@book{Witschen_2017, title={A Framework for the Synthesis of Approximate Circuits}, publisher={Universität Paderborn}, author={Witschen, Linus Matthias}, year={2017} }","ama":"Witschen LM. <i>A Framework for the Synthesis of Approximate Circuits</i>. Universität Paderborn; 2017.","mla":"Witschen, Linus Matthias. <i>A Framework for the Synthesis of Approximate Circuits</i>. Universität Paderborn, 2017."},"department":[{"_id":"78"},{"_id":"7"}],"type":"mastersthesis","date_created":"2018-02-01T14:21:19Z","date_updated":"2022-01-06T06:51:03Z","author":[{"id":"49051","full_name":"Witschen, Linus Matthias","first_name":"Linus Matthias","last_name":"Witschen"}],"title":"A Framework for the Synthesis of Approximate Circuits","status":"public","year":"2017","user_id":"477","publisher":"Universität Paderborn","_id":"1157","language":[{"iso":"eng"}]},{"conference":{"start_date":"2017-07-31","name":"Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature (LaTeCH-CLfL 2017)","location":"Vancouver, BC, Canada","end_date":"2017-08-04"},"status":"public","_id":"1158","publisher":"Association for Computational Linguistics (ACL)","page":"40-45","user_id":"13929","citation":{"ieee":"N. Seemann, M.-L. Merten, M. Geierhos, D. Tophinke, and E. Hüllermeier, “Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German,” in <i>Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature</i>, Vancouver, BC, Canada, 2017, pp. 40–45.","apa":"Seemann, N., Merten, M.-L., Geierhos, M., Tophinke, D., &#38; Hüllermeier, E. (2017). Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German. In <i>Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature</i> (pp. 40–45). Stroudsburg, PA, USA: Association for Computational Linguistics (ACL). <a href=\"https://doi.org/10.18653/v1/W17-2206\">https://doi.org/10.18653/v1/W17-2206</a>","chicago":"Seemann, Nina, Marie-Luis Merten, Michaela Geierhos, Doris Tophinke, and Eyke Hüllermeier. “Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German.” In <i>Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature</i>, 40–45. Stroudsburg, PA, USA: Association for Computational Linguistics (ACL), 2017. <a href=\"https://doi.org/10.18653/v1/W17-2206\">https://doi.org/10.18653/v1/W17-2206</a>.","short":"N. Seemann, M.-L. Merten, M. Geierhos, D. Tophinke, E. Hüllermeier, in: Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature, Association for Computational Linguistics (ACL), Stroudsburg, PA, USA, 2017, pp. 40–45.","mla":"Seemann, Nina, et al. “Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German.” <i>Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature</i>, Association for Computational Linguistics (ACL), 2017, pp. 40–45, doi:<a href=\"https://doi.org/10.18653/v1/W17-2206\">10.18653/v1/W17-2206</a>.","bibtex":"@inproceedings{Seemann_Merten_Geierhos_Tophinke_Hüllermeier_2017, place={Stroudsburg, PA, USA}, title={Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German}, DOI={<a href=\"https://doi.org/10.18653/v1/W17-2206\">10.18653/v1/W17-2206</a>}, booktitle={Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature}, publisher={Association for Computational Linguistics (ACL)}, author={Seemann, Nina and Merten, Marie-Luis and Geierhos, Michaela and Tophinke, Doris and Hüllermeier, Eyke}, year={2017}, pages={40–45} }","ama":"Seemann N, Merten M-L, Geierhos M, Tophinke D, Hüllermeier E. Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German. In: <i>Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature</i>. Stroudsburg, PA, USA: Association for Computational Linguistics (ACL); 2017:40-45. doi:<a href=\"https://doi.org/10.18653/v1/W17-2206\">10.18653/v1/W17-2206</a>"},"project":[{"name":"InterGramm","_id":"39"}],"quality_controlled":"1","place":"Stroudsburg, PA, USA","author":[{"last_name":"Seemann","first_name":"Nina","full_name":"Seemann, Nina","id":"65408"},{"full_name":"Merten, Marie-Luis","first_name":"Marie-Luis","last_name":"Merten"},{"id":"42496","last_name":"Geierhos","orcid":"0000-0002-8180-5606","first_name":"Michaela","full_name":"Geierhos, Michaela"},{"full_name":"Tophinke, Doris","last_name":"Tophinke","first_name":"Doris"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"}],"year":"2017","title":"Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German","publication_status":"published","date_updated":"2022-01-06T06:51:03Z","language":[{"iso":"eng"}],"doi":"10.18653/v1/W17-2206","publication":"Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature","abstract":[{"text":"In this paper, we present the annotation challenges we have encountered when working on a historical language that was undergoing elaboration processes. We especially focus on syntactic ambiguity and gradience in Middle Low German, which causes uncertainty to some extent. Since current annotation tools consider construction contexts and the dynamics of the grammaticalization only partially, we plan to extend CorA – a web-based annotation tool for historical and other non-standard language data – to capture elaboration phenomena and annotator unsureness. Moreover, we seek to interactively learn morphological as well as syntactic annotations.","lang":"eng"}],"date_created":"2018-01-31T15:32:33Z","department":[{"_id":"36"},{"_id":"579"},{"_id":"115"},{"_id":"355"},{"_id":"615"}],"type":"conference"},{"date_updated":"2022-01-06T06:51:04Z","author":[{"full_name":"Liske, Gennadij","last_name":"Liske","first_name":"Gennadij"}],"status":"public","title":"CCA-Security for Predicate Encryption Schemes","year":"2017","user_id":"25078","doi":"10.17619/UNIPB/1-220","publisher":"Universität Paderborn","_id":"116","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-29690"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"short":"G. Liske, CCA-Security for Predicate Encryption Schemes, Universität Paderborn, 2017.","chicago":"Liske, Gennadij. <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-220\">https://doi.org/10.17619/UNIPB/1-220</a>.","ieee":"G. Liske, <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn, 2017.","apa":"Liske, G. (2017). <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-220\">https://doi.org/10.17619/UNIPB/1-220</a>","bibtex":"@book{Liske_2017, title={CCA-Security for Predicate Encryption Schemes}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-220\">10.17619/UNIPB/1-220</a>}, publisher={Universität Paderborn}, author={Liske, Gennadij}, year={2017} }","ama":"Liske G. <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-220\">10.17619/UNIPB/1-220</a>","mla":"Liske, Gennadij. <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-220\">10.17619/UNIPB/1-220</a>."},"supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"department":[{"_id":"64"}],"type":"dissertation","date_created":"2017-10-17T12:41:14Z"},{"author":[{"first_name":"Gleb","last_name":"Polevoy","full_name":"Polevoy, Gleb","id":"83983"},{"full_name":"Trajanovski, Stojan","last_name":"Trajanovski","first_name":"Stojan"},{"full_name":"Grosso, Paola","first_name":"Paola","last_name":"Grosso"},{"full_name":"de Laat, Cees","last_name":"de Laat","first_name":"Cees"}],"publication_identifier":{"isbn":["978-3-319-71150-8"]},"title":"Filtering Undesirable Flows in Networks","year":"2017","date_updated":"2022-01-06T06:53:16Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-319-71150-8_1","publication":"Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I","extern":"1","date_created":"2020-08-06T15:19:48Z","department":[{"_id":"63"},{"_id":"541"}],"type":"conference","keyword":["flow","filter","MMSA","set cover","approximation","local ratio algorithm"],"status":"public","publisher":"Springer International Publishing","_id":"17652","page":"3-17","user_id":"83983","citation":{"mla":"Polevoy, Gleb, et al. “Filtering Undesirable Flows in Networks.” <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, Springer International Publishing, 2017, pp. 3–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>.","apa":"Polevoy, G., Trajanovski, S., Grosso, P., &#38; de Laat, C. (2017). Filtering Undesirable Flows in Networks. In <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i> (pp. 3–17). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">https://doi.org/10.1007/978-3-319-71150-8_1</a>","ieee":"G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Filtering Undesirable Flows in Networks,” in <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, 2017, pp. 3–17.","chicago":"Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Filtering Undesirable Flows in Networks.” In <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, 3–17. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">https://doi.org/10.1007/978-3-319-71150-8_1</a>.","short":"G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing, Cham, 2017, pp. 3–17.","ama":"Polevoy G, Trajanovski S, Grosso P, de Laat C. Filtering Undesirable Flows in Networks. In: <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:3-17. doi:<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>","bibtex":"@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2017, place={Cham}, series={Lecture Notes in Computer Science}, title={Filtering Undesirable Flows in Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>}, booktitle={Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I}, publisher={Springer International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, year={2017}, pages={3–17}, collection={Lecture Notes in Computer Science} }"},"place":"Cham"},{"extern":"1","publication":"Proceedings of the 29th Benelux Conference on Artificial Intelligence","citation":{"mla":"Polevoy, Gleb, and M. M. de Weerdt. “Reciprocation Effort Games.” <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, Springer, 2017.","bibtex":"@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Reciprocation Effort Games}, booktitle={Proceedings of the 29th Benelux Conference on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.}, year={2017}, collection={CCIS} }","ama":"Polevoy G, de Weerdt MM. Reciprocation Effort Games. In: <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer; 2017.","ieee":"G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, 2017.","apa":"Polevoy, G., &#38; de Weerdt, M. M. (2017). Reciprocation Effort Games. In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. Springer.","short":"G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.","chicago":"Polevoy, Gleb, and M.M. de Weerdt. “Reciprocation Effort Games.” In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer, 2017."},"keyword":["interaction","reciprocation","contribute","shared effort","curbing","convergence","threshold","Nash equilibrium","social welfare","efficiency","price of anarchy","price of stability"],"type":"conference","department":[{"_id":"63"},{"_id":"541"}],"date_created":"2020-08-06T15:20:09Z","date_updated":"2022-01-06T06:53:16Z","status":"public","year":"2017","title":"Reciprocation Effort Games","author":[{"id":"83983","last_name":"Polevoy","first_name":"Gleb","full_name":"Polevoy, Gleb"},{"first_name":"M.M.","last_name":"de Weerdt","full_name":"de Weerdt, M.M."}],"user_id":"83983","language":[{"iso":"eng"}],"_id":"17653","publisher":"Springer","series_title":"CCIS"},{"_id":"17654","language":[{"iso":"eng"}],"publisher":"Springer","series_title":"CCIS","user_id":"83983","author":[{"id":"83983","last_name":"Polevoy","first_name":"Gleb","full_name":"Polevoy, Gleb"},{"first_name":"M.M.","last_name":"de Weerdt","full_name":"de Weerdt, M.M."}],"title":"Competition between Cooperative Projects","year":"2017","status":"public","date_updated":"2022-01-06T06:53:16Z","date_created":"2020-08-06T15:20:19Z","department":[{"_id":"63"},{"_id":"541"}],"type":"conference","keyword":["agents","projects","contribute","shared effort game","competition","quota","threshold","Nash equilibrium","social welfare","efficiency","price of anarchy","price of stability"],"citation":{"ama":"Polevoy G, de Weerdt MM. Competition between Cooperative Projects. In: <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer; 2017.","bibtex":"@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Competition between Cooperative Projects}, booktitle={Proceedings of the 29th Benelux Conference on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.}, year={2017}, collection={CCIS} }","mla":"Polevoy, Gleb, and M. M. de Weerdt. “Competition between Cooperative Projects.” <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, Springer, 2017.","chicago":"Polevoy, Gleb, and M.M. de Weerdt. “Competition between Cooperative Projects.” In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer, 2017.","short":"G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.","apa":"Polevoy, G., &#38; de Weerdt, M. M. (2017). Competition between Cooperative Projects. In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. Springer.","ieee":"G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,” in <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, 2017."},"publication":"Proceedings of the 29th Benelux Conference on Artificial Intelligence","extern":"1"},{"intvolume":"     10504","date_updated":"2022-01-06T06:53:16Z","author":[{"first_name":"Marios","last_name":"Mavronicolas","full_name":"Mavronicolas, Marios"},{"full_name":"Monien, Burkhard","first_name":"Burkhard","last_name":"Monien"}],"title":"Conditional Value-at-Risk: Structure and Complexity of Equilibria","year":"2017","doi":"10.1007/978-3-319-66700-3_11","language":[{"iso":"eng"}],"series_title":"LNCS","abstract":[{"lang":"eng","text":"Conditional Value-at-Risk, denoted as CVaRα, is becoming the prevailing measure of risk over two paramount economic domains: the insurance domain and the financial domain; α∈(0,1) is the confidence level. In this work, we study the strategic equilibria for an economic system modeled as a game, where risk-averse players seek to minimize the Conditional Value-at-Risk of their costs. Concretely, in a CVaRα -equilibrium, the mixed strategy of each player is a best-response. We establish two significant properties of CVaRα at equilibrium: (1) The Optimal-Value property: For any best-response of a player, each mixed strategy in the support gives the same cost to the player. This follows directly from the concavity of CVaRα in the involved probabilities, which we establish. (2) The Crawford property: For every α, there is a 2-player game with no CVaRα-equilibrium. The property is established using the Optimal-Value property and a new functional property of CVaRα, called Weak-Equilibrium-for- VaRα, we establish. On top of these properties, we show, as one of our two main results, that deciding the existence of a CVaRα-equilibrium is strongly NP-hard even for 2-player games. As our other main result, we show the strong NP-hardness of deciding the existence of a V-equilibrium, over 2-player games, for any valuation V with the Optimal-Value and the Crawford properties. This result has a rich potential since we prove that the very significant and broad class of strictly quasiconcave valuations has the Optimal-Value property."}],"publication":"Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)","department":[{"_id":"7"}],"type":"conference","date_created":"2018-03-23T13:58:02Z","file":[{"creator":"ups","date_created":"2018-11-02T14:53:56Z","date_updated":"2018-11-02T14:53:56Z","relation":"main_file","access_level":"closed","file_size":352365,"file_name":"ConditionalValue-at-RiskStruct.pdf","content_type":"application/pdf","success":1,"file_id":"5287"}],"has_accepted_license":"1","conference":{"end_date":"2017-09-14","name":"10th International Symposium on Algorithmic Game Theory (SAGT 2017)","start_date":"2017-09-12","location":"L'Aquila, Italy"},"status":"public","volume":10504,"ddc":["000"],"user_id":"477","_id":"1767","page":"131--143","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"citation":{"mla":"Mavronicolas, Marios, and Burkhard Monien. “Conditional Value-at-Risk: Structure and Complexity of Equilibria.” <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>, vol. 10504, 2017, pp. 131--143, doi:<a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">10.1007/978-3-319-66700-3_11</a>.","bibtex":"@inproceedings{Mavronicolas_Monien_2017, series={LNCS}, title={Conditional Value-at-Risk: Structure and Complexity of Equilibria}, volume={10504}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">10.1007/978-3-319-66700-3_11</a>}, booktitle={Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)}, author={Mavronicolas, Marios and Monien, Burkhard}, year={2017}, pages={131--143}, collection={LNCS} }","ama":"Mavronicolas M, Monien B. Conditional Value-at-Risk: Structure and Complexity of Equilibria. In: <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>. Vol 10504. LNCS. ; 2017:131--143. doi:<a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">10.1007/978-3-319-66700-3_11</a>","ieee":"M. Mavronicolas and B. Monien, “Conditional Value-at-Risk: Structure and Complexity of Equilibria,” in <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>, L’Aquila, Italy, 2017, vol. 10504, pp. 131--143.","apa":"Mavronicolas, M., &#38; Monien, B. (2017). Conditional Value-at-Risk: Structure and Complexity of Equilibria. In <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i> (Vol. 10504, pp. 131--143). L’Aquila, Italy. <a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">https://doi.org/10.1007/978-3-319-66700-3_11</a>","chicago":"Mavronicolas, Marios, and Burkhard Monien. “Conditional Value-at-Risk: Structure and Complexity of Equilibria.” In <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>, 10504:131--143. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">https://doi.org/10.1007/978-3-319-66700-3_11</a>.","short":"M. Mavronicolas, B. Monien, in: Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017), 2017, pp. 131--143."},"file_date_updated":"2018-11-02T14:53:56Z"},{"user_id":"15415","_id":"17811","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:20Z","author":[{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias","id":"146"},{"full_name":"Jung, Daniel","last_name":"Jung","first_name":"Daniel","id":"37827"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"title":"Gathering Anonymous, Oblivious Robots on a Grid","status":"public","year":"2017","department":[{"_id":"63"}],"type":"preprint","date_created":"2020-08-11T13:48:38Z","abstract":[{"lang":"eng","text":"We consider a swarm of $n$ autonomous mobile robots, distributed on a\r\n2-dimensional grid. A basic task for such a swarm is the gathering process: All\r\nrobots have to gather at one (not predefined) place. A common local model for\r\nextremely simple robots is the following: The robots do not have a common\r\ncompass, only have a constant viewing radius, are autonomous and\r\nindistinguishable, can move at most a constant distance in each step, cannot\r\ncommunicate, are oblivious and do not have flags or states. The only gathering\r\nalgorithm under this robot model, with known runtime bounds, needs\r\n$\\mathcal{O}(n^2)$ rounds and works in the Euclidean plane. The underlying time\r\nmodel for the algorithm is the fully synchronous $\\mathcal{FSYNC}$ model. On\r\nthe other side, in the case of the 2-dimensional grid, the only known gathering\r\nalgorithms for the same time and a similar local model additionally require a\r\nconstant memory, states and \"flags\" to communicate these states to neighbors in\r\nviewing range. They gather in time $\\mathcal{O}(n)$.\r\n  In this paper we contribute the (to the best of our knowledge) first\r\ngathering algorithm on the grid that works under the same simple local model as\r\nthe above mentioned Euclidean plane strategy, i.e., without memory (oblivious),\r\n\"flags\" and states. We prove its correctness and an $\\mathcal{O}(n^2)$ time\r\nbound in the fully synchronous $\\mathcal{FSYNC}$ time model. This time bound\r\nmatches the time bound of the best known algorithm for the Euclidean plane\r\nmentioned above. We say gathering is done if all robots are located within a\r\n$2\\times 2$ square, because in $\\mathcal{FSYNC}$ such configurations cannot be\r\nsolved."}],"citation":{"mla":"Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” <i>ArXiv:1702.03400</i>, 2017.","ama":"Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. <i>arXiv:170203400</i>. 2017.","bibtex":"@article{Fischer_Jung_Meyer auf der Heide_2017, title={Gathering Anonymous, Oblivious Robots on a Grid}, journal={arXiv:1702.03400}, author={Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2017} }","apa":"Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. <i>ArXiv:1702.03400</i>.","ieee":"M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” <i>arXiv:1702.03400</i>. 2017.","short":"M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1702.03400 (2017).","chicago":"Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” <i>ArXiv:1702.03400</i>, 2017."},"publication":"arXiv:1702.03400"},{"has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"13703","_id":"2343","publisher":"ACM Press","project":[{"name":"Securing the Financial Cloud","_id":"43"}],"citation":{"chicago":"Löken, Nils. “Searchable Encryption with Access Control.” In <i>Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17</i>. ICPS. ACM Press, 2017. <a href=\"https://doi.org/10.1145/3098954.3098987\">https://doi.org/10.1145/3098954.3098987</a>.","short":"N. Löken, in: Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17, ACM Press, 2017.","apa":"Löken, N. (2017). Searchable Encryption with Access Control. In <i>Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17</i>. ACM Press. <a href=\"https://doi.org/10.1145/3098954.3098987\">https://doi.org/10.1145/3098954.3098987</a>","ieee":"N. Löken, “Searchable Encryption with Access Control,” in <i>Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17</i>, 2017.","ama":"Löken N. Searchable Encryption with Access Control. In: <i>Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17</i>. ICPS. ACM Press; 2017. doi:<a href=\"https://doi.org/10.1145/3098954.3098987\">10.1145/3098954.3098987</a>","bibtex":"@inproceedings{Löken_2017, series={ICPS}, title={Searchable Encryption with Access Control}, DOI={<a href=\"https://doi.org/10.1145/3098954.3098987\">10.1145/3098954.3098987</a>}, number={24}, booktitle={Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17}, publisher={ACM Press}, author={Löken, Nils}, year={2017}, collection={ICPS} }","mla":"Löken, Nils. “Searchable Encryption with Access Control.” <i>Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17</i>, 24, ACM Press, 2017, doi:<a href=\"https://doi.org/10.1145/3098954.3098987\">10.1145/3098954.3098987</a>."},"file_date_updated":"2018-11-08T10:56:15Z","oa":"1","date_updated":"2022-01-06T06:55:54Z","publication_status":"published","publication_identifier":{"isbn":["9781450352574"]},"author":[{"id":"13703","last_name":"Löken","first_name":"Nils","full_name":"Löken, Nils"}],"year":"2017","title":"Searchable Encryption with Access Control","doi":"10.1145/3098954.3098987","language":[{"iso":"eng"}],"series_title":"ICPS","main_file_link":[{"url":"http://eprint.iacr.org/2017/679","open_access":"1"}],"article_number":"24","publication":"Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES '17","department":[{"_id":"64"}],"type":"conference","date_created":"2018-04-13T11:40:23Z","file":[{"relation":"main_file","date_updated":"2018-11-08T10:56:15Z","file_name":"searchable_encryption_access_control_website.pdf","access_level":"open_access","file_size":658797,"file_id":"5431","content_type":"application/pdf","creator":"nilo","date_created":"2018-11-08T10:56:15Z"}]}]