[{"year":"2016","title":"Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way","status":"public","author":[{"full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager","id":"64669"},{"full_name":"Rupp, Andy","last_name":"Rupp","first_name":"Andy"}],"date_updated":"2022-01-06T06:58:56Z","page":"62--82","_id":"3114","user_id":"38235","issue":"3","publication":"PoPETs","citation":{"mla":"Jager, Tibor, and Andy Rupp. “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way.” <i>PoPETs</i>, no. 3, 2016, pp. 62--82.","bibtex":"@article{Jager_Rupp_2016, title={Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way}, number={3}, journal={PoPETs}, author={Jager, Tibor and Rupp, Andy}, year={2016}, pages={62--82} }","ama":"Jager T, Rupp A. Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way. <i>PoPETs</i>. 2016;(3):62--82.","ieee":"T. Jager and A. Rupp, “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way,” <i>PoPETs</i>, no. 3, pp. 62--82, 2016.","apa":"Jager, T., &#38; Rupp, A. (2016). Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way. <i>PoPETs</i>, (3), 62--82.","short":"T. Jager, A. Rupp, PoPETs (2016) 62--82.","chicago":"Jager, Tibor, and Andy Rupp. “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way.” <i>PoPETs</i>, no. 3 (2016): 62--82."},"extern":"1","date_created":"2018-06-07T09:13:15Z","type":"journal_article","department":[{"_id":"558"}]},{"date_updated":"2022-01-06T06:58:57Z","title":"How to Generate and Use Universal Samplers","status":"public","year":"2016","author":[{"full_name":"Hofheinz, Dennis","first_name":"Dennis","last_name":"Hofheinz"},{"full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor","id":"64669"},{"first_name":"Dakshita","last_name":"Khurana","full_name":"Khurana, Dakshita"},{"first_name":"Amit","last_name":"Sahai","full_name":"Sahai, Amit"},{"first_name":"Brent","last_name":"Waters","full_name":"Waters, Brent"},{"full_name":"Zhandry, Mark","first_name":"Mark","last_name":"Zhandry"}],"user_id":"38235","doi":"10.1007/978-3-662-53890-6_24","page":"715--744","_id":"3115","extern":"1","publication":"Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II","citation":{"ieee":"D. Hofheinz, T. Jager, D. Khurana, A. Sahai, B. Waters, and M. Zhandry, “How to Generate and Use Universal Samplers,” in <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i>, 2016, pp. 715--744.","apa":"Hofheinz, D., Jager, T., Khurana, D., Sahai, A., Waters, B., &#38; Zhandry, M. (2016). How to Generate and Use Universal Samplers. In <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i> (pp. 715--744). <a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">https://doi.org/10.1007/978-3-662-53890-6_24</a>","chicago":"Hofheinz, Dennis, Tibor Jager, Dakshita Khurana, Amit Sahai, Brent Waters, and Mark Zhandry. “How to Generate and Use Universal Samplers.” In <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i>, 715--744, 2016. <a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">https://doi.org/10.1007/978-3-662-53890-6_24</a>.","short":"D. Hofheinz, T. Jager, D. Khurana, A. Sahai, B. Waters, M. Zhandry, in: Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II, 2016, pp. 715--744.","mla":"Hofheinz, Dennis, et al. “How to Generate and Use Universal Samplers.” <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i>, 2016, pp. 715--744, doi:<a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">10.1007/978-3-662-53890-6_24</a>.","bibtex":"@inproceedings{Hofheinz_Jager_Khurana_Sahai_Waters_Zhandry_2016, title={How to Generate and Use Universal Samplers}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">10.1007/978-3-662-53890-6_24</a>}, booktitle={Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II}, author={Hofheinz, Dennis and Jager, Tibor and Khurana, Dakshita and Sahai, Amit and Waters, Brent and Zhandry, Mark}, year={2016}, pages={715--744} }","ama":"Hofheinz D, Jager T, Khurana D, Sahai A, Waters B, Zhandry M. How to Generate and Use Universal Samplers. In: <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i>. ; 2016:715--744. doi:<a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">10.1007/978-3-662-53890-6_24</a>"},"type":"conference","department":[{"_id":"558"}],"date_created":"2018-06-07T09:13:48Z"},{"extern":"1","publication":"Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings","citation":{"ama":"Horst M, Grothe M, Jager T, Schwenk J. Breaking PPTP VPNs via RADIUS Encryption. In: <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i>. ; 2016:159--175. doi:<a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">10.1007/978-3-319-48965-0_10</a>","short":"M. Horst, M. Grothe, T. Jager, J. Schwenk, in: Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings, 2016, pp. 159--175.","chicago":"Horst, Matthias, Martin Grothe, Tibor Jager, and Jörg Schwenk. “Breaking PPTP VPNs via RADIUS Encryption.” In <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i>, 159--175, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">https://doi.org/10.1007/978-3-319-48965-0_10</a>.","bibtex":"@inproceedings{Horst_Grothe_Jager_Schwenk_2016, title={Breaking PPTP VPNs via RADIUS Encryption}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">10.1007/978-3-319-48965-0_10</a>}, booktitle={Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings}, author={Horst, Matthias and Grothe, Martin and Jager, Tibor and Schwenk, Jörg}, year={2016}, pages={159--175} }","mla":"Horst, Matthias, et al. “Breaking PPTP VPNs via RADIUS Encryption.” <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i>, 2016, pp. 159--175, doi:<a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">10.1007/978-3-319-48965-0_10</a>.","apa":"Horst, M., Grothe, M., Jager, T., &#38; Schwenk, J. (2016). Breaking PPTP VPNs via RADIUS Encryption. In <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i> (pp. 159--175). <a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">https://doi.org/10.1007/978-3-319-48965-0_10</a>","ieee":"M. Horst, M. Grothe, T. Jager, and J. Schwenk, “Breaking PPTP VPNs via RADIUS Encryption,” in <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i>, 2016, pp. 159--175."},"type":"conference","department":[{"_id":"558"}],"date_created":"2018-06-07T09:14:34Z","date_updated":"2022-01-06T06:58:57Z","status":"public","title":"Breaking PPTP VPNs via RADIUS Encryption","year":"2016","author":[{"full_name":"Horst, Matthias","last_name":"Horst","first_name":"Matthias"},{"full_name":"Grothe, Martin","last_name":"Grothe","first_name":"Martin"},{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"},{"full_name":"Schwenk, Jörg","first_name":"Jörg","last_name":"Schwenk"}],"doi":"10.1007/978-3-319-48965-0_10","user_id":"38235","page":"159--175","_id":"3116"},{"year":"2016","title":"On the Impossibility of Tight Cryptographic Reductions","status":"public","author":[{"full_name":"Bader, Christoph","first_name":"Christoph","last_name":"Bader"},{"id":"64669","first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor"},{"full_name":"Li, Yong","first_name":"Yong","last_name":"Li"},{"full_name":"Schäge, Sven","last_name":"Schäge","first_name":"Sven"}],"date_updated":"2022-01-06T06:58:57Z","page":"273--304","_id":"3117","doi":"10.1007/978-3-662-49896-5_10","user_id":"38235","publication":"Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II","citation":{"mla":"Bader, Christoph, et al. “On the Impossibility of Tight Cryptographic Reductions.” <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i>, 2016, pp. 273--304, doi:<a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">10.1007/978-3-662-49896-5_10</a>.","bibtex":"@inproceedings{Bader_Jager_Li_Schäge_2016, title={On the Impossibility of Tight Cryptographic Reductions}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">10.1007/978-3-662-49896-5_10</a>}, booktitle={Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II}, author={Bader, Christoph and Jager, Tibor and Li, Yong and Schäge, Sven}, year={2016}, pages={273--304} }","ama":"Bader C, Jager T, Li Y, Schäge S. On the Impossibility of Tight Cryptographic Reductions. In: <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i>. ; 2016:273--304. doi:<a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">10.1007/978-3-662-49896-5_10</a>","ieee":"C. Bader, T. Jager, Y. Li, and S. Schäge, “On the Impossibility of Tight Cryptographic Reductions,” in <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i>, 2016, pp. 273--304.","apa":"Bader, C., Jager, T., Li, Y., &#38; Schäge, S. (2016). On the Impossibility of Tight Cryptographic Reductions. In <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i> (pp. 273--304). <a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">https://doi.org/10.1007/978-3-662-49896-5_10</a>","short":"C. Bader, T. Jager, Y. Li, S. Schäge, in: Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II, 2016, pp. 273--304.","chicago":"Bader, Christoph, Tibor Jager, Yong Li, and Sven Schäge. “On the Impossibility of Tight Cryptographic Reductions.” In <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i>, 273--304, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">https://doi.org/10.1007/978-3-662-49896-5_10</a>."},"extern":"1","date_created":"2018-06-07T09:15:15Z","type":"conference","department":[{"_id":"558"}]},{"user_id":"38235","doi":"10.1007/978-3-662-53644-5_6","_id":"3118","page":"146--168","date_updated":"2022-01-06T06:58:57Z","author":[{"last_name":"Hofheinz","first_name":"Dennis","full_name":"Hofheinz, Dennis"},{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"first_name":"Andy","last_name":"Rupp","full_name":"Rupp, Andy"}],"status":"public","year":"2016","title":"Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts","department":[{"_id":"558"}],"type":"conference","date_created":"2018-06-07T09:15:51Z","extern":"1","citation":{"ieee":"D. Hofheinz, T. Jager, and A. Rupp, “Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts,” in <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i>, 2016, pp. 146--168.","apa":"Hofheinz, D., Jager, T., &#38; Rupp, A. (2016). Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts. In <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i> (pp. 146--168). <a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">https://doi.org/10.1007/978-3-662-53644-5_6</a>","short":"D. Hofheinz, T. Jager, A. Rupp, in: Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II, 2016, pp. 146--168.","chicago":"Hofheinz, Dennis, Tibor Jager, and Andy Rupp. “Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts.” In <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i>, 146--168, 2016. <a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">https://doi.org/10.1007/978-3-662-53644-5_6</a>.","mla":"Hofheinz, Dennis, et al. “Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts.” <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i>, 2016, pp. 146--168, doi:<a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">10.1007/978-3-662-53644-5_6</a>.","bibtex":"@inproceedings{Hofheinz_Jager_Rupp_2016, title={Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">10.1007/978-3-662-53644-5_6</a>}, booktitle={Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II}, author={Hofheinz, Dennis and Jager, Tibor and Rupp, Andy}, year={2016}, pages={146--168} }","ama":"Hofheinz D, Jager T, Rupp A. Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts. In: <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i>. ; 2016:146--168. doi:<a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">10.1007/978-3-662-53644-5_6</a>"},"publication":"Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II"},{"title":"Verifiable Random Functions from Standard Assumptions","year":"2016","status":"public","author":[{"first_name":"Dennis","last_name":"Hofheinz","full_name":"Hofheinz, Dennis"},{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"}],"date_updated":"2022-01-06T06:58:57Z","page":"336--362","_id":"3119","user_id":"38235","doi":"10.1007/978-3-662-49096-9_14","publication":"Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I","citation":{"bibtex":"@inproceedings{Hofheinz_Jager_2016, title={Verifiable Random Functions from Standard Assumptions}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">10.1007/978-3-662-49096-9_14</a>}, booktitle={Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I}, author={Hofheinz, Dennis and Jager, Tibor}, year={2016}, pages={336--362} }","chicago":"Hofheinz, Dennis, and Tibor Jager. “Verifiable Random Functions from Standard Assumptions.” In <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i>, 336--362, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">https://doi.org/10.1007/978-3-662-49096-9_14</a>.","short":"D. Hofheinz, T. Jager, in: Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I, 2016, pp. 336--362.","ama":"Hofheinz D, Jager T. Verifiable Random Functions from Standard Assumptions. In: <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i>. ; 2016:336--362. doi:<a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">10.1007/978-3-662-49096-9_14</a>","ieee":"D. Hofheinz and T. Jager, “Verifiable Random Functions from Standard Assumptions,” in <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i>, 2016, pp. 336--362.","apa":"Hofheinz, D., &#38; Jager, T. (2016). Verifiable Random Functions from Standard Assumptions. In <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i> (pp. 336--362). <a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">https://doi.org/10.1007/978-3-662-49096-9_14</a>","mla":"Hofheinz, Dennis, and Tibor Jager. “Verifiable Random Functions from Standard Assumptions.” <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i>, 2016, pp. 336--362, doi:<a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">10.1007/978-3-662-49096-9_14</a>."},"extern":"1","date_created":"2018-06-07T09:16:30Z","type":"conference","department":[{"_id":"558"}]},{"page":"189--204","_id":"3157","user_id":"477","ddc":["000"],"editor":[{"full_name":"H. ter Beek, Maurice","last_name":"H. ter Beek","first_name":"Maurice"},{"first_name":"Stefania","last_name":"Gnesi","full_name":"Gnesi, Stefania"},{"last_name":"Knapp","first_name":"Alexander","full_name":"Knapp, Alexander"}],"status":"public","has_accepted_license":"1","file_date_updated":"2018-11-02T14:17:13Z","citation":{"apa":"Beringer, S., &#38; Wehrheim, H. (2016). Verification of AUTOSAR Software Architectures with Timed Automata. In M. H. ter Beek, S. Gnesi, &#38; A. Knapp (Eds.), <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i> (pp. 189--204). <a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">https://doi.org/10.1007/978-3-319-45943-1_13</a>","ieee":"S. Beringer and H. Wehrheim, “Verification of AUTOSAR Software Architectures with Timed Automata,” in <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>, 2016, pp. 189--204.","short":"S. Beringer, H. Wehrheim, in: M. H. ter Beek, S. Gnesi, A. Knapp (Eds.), Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings, 2016, pp. 189--204.","chicago":"Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures with Timed Automata.” In <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>, edited by Maurice H. ter Beek, Stefania Gnesi, and Alexander Knapp, 189--204. Lecture Notes in Computer Science, 2016. <a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">https://doi.org/10.1007/978-3-319-45943-1_13</a>.","mla":"Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures with Timed Automata.” <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>, edited by Maurice H. ter Beek et al., 2016, pp. 189--204, doi:<a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">10.1007/978-3-319-45943-1_13</a>.","ama":"Beringer S, Wehrheim H. Verification of AUTOSAR Software Architectures with Timed Automata. In: H. ter Beek M, Gnesi S, Knapp A, eds. <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>. Lecture Notes in Computer Science. ; 2016:189--204. doi:<a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">10.1007/978-3-319-45943-1_13</a>","bibtex":"@inproceedings{Beringer_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Verification of AUTOSAR Software Architectures with Timed Automata}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">10.1007/978-3-319-45943-1_13</a>}, booktitle={Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings}, author={Beringer, Steffen and Wehrheim, Heike}, editor={H. ter Beek, Maurice and Gnesi, Stefania and Knapp, AlexanderEditors}, year={2016}, pages={189--204}, collection={Lecture Notes in Computer Science} }"},"project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-45943-1_13","year":"2016","title":"Verification of AUTOSAR Software Architectures with Timed Automata","author":[{"last_name":"Beringer","first_name":"Steffen","full_name":"Beringer, Steffen"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_updated":"2022-01-06T06:59:01Z","file":[{"relation":"main_file","date_updated":"2018-11-02T14:17:13Z","file_name":"VerificationOfAUTOSARSoftwareA.pdf","file_size":2640695,"access_level":"closed","file_id":"5267","success":1,"content_type":"application/pdf","creator":"ups","date_created":"2018-11-02T14:17:13Z"}],"date_created":"2018-06-13T07:39:35Z","type":"conference","department":[{"_id":"77"}],"publication":"Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings"},{"date_created":"2018-06-13T07:41:07Z","type":"conference","department":[{"_id":"77"}],"publication":"Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings","citation":{"ama":"Travkin O, Wehrheim H. Verification of Concurrent Programs on Weak Memory Models. In: Sampaio A, Wang F, eds. <i>Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings</i>. Lecture Notes in Computer Science. ; 2016:3--24. doi:<a href=\"https://doi.org/10.1007/978-3-319-46750-4_1\">10.1007/978-3-319-46750-4_1</a>","short":"O. Travkin, H. Wehrheim, in: A. Sampaio, F. Wang (Eds.), Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings, 2016, pp. 3--24.","chicago":"Travkin, Oleg, and Heike Wehrheim. “Verification of Concurrent Programs on Weak Memory Models.” In <i>Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings</i>, edited by Augusto Sampaio and Farn Wang, 3--24. Lecture Notes in Computer Science, 2016. <a href=\"https://doi.org/10.1007/978-3-319-46750-4_1\">https://doi.org/10.1007/978-3-319-46750-4_1</a>.","bibtex":"@inproceedings{Travkin_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Verification of Concurrent Programs on Weak Memory Models}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-46750-4_1\">10.1007/978-3-319-46750-4_1</a>}, booktitle={Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings}, author={Travkin, Oleg and Wehrheim, Heike}, editor={Sampaio, Augusto and Wang, FarnEditors}, year={2016}, pages={3--24}, collection={Lecture Notes in Computer Science} }","apa":"Travkin, O., &#38; Wehrheim, H. (2016). Verification of Concurrent Programs on Weak Memory Models. In A. Sampaio &#38; F. Wang (Eds.), <i>Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings</i> (pp. 3--24). <a href=\"https://doi.org/10.1007/978-3-319-46750-4_1\">https://doi.org/10.1007/978-3-319-46750-4_1</a>","mla":"Travkin, Oleg, and Heike Wehrheim. “Verification of Concurrent Programs on Weak Memory Models.” <i>Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings</i>, edited by Augusto Sampaio and Farn Wang, 2016, pp. 3--24, doi:<a href=\"https://doi.org/10.1007/978-3-319-46750-4_1\">10.1007/978-3-319-46750-4_1</a>.","ieee":"O. Travkin and H. Wehrheim, “Verification of Concurrent Programs on Weak Memory Models,” in <i>Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings</i>, 2016, pp. 3--24."},"page":"3--24","series_title":"Lecture Notes in Computer Science","_id":"3158","user_id":"29719","doi":"10.1007/978-3-319-46750-4_1","editor":[{"last_name":"Sampaio","first_name":"Augusto","full_name":"Sampaio, Augusto"},{"first_name":"Farn","last_name":"Wang","full_name":"Wang, Farn"}],"title":"Verification of Concurrent Programs on Weak Memory Models","year":"2016","status":"public","author":[{"first_name":"Oleg","last_name":"Travkin","full_name":"Travkin, Oleg"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_updated":"2022-01-06T06:59:01Z"},{"department":[{"_id":"77"}],"type":"conference","date_created":"2018-06-13T07:42:34Z","citation":{"mla":"Schellhorn, Gerhard, et al. “Towards a Thread-Local Proof Technique for Starvation Freedom.” <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i>, edited by Marieke Huisman, 2016, pp. 193--209, doi:<a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">10.1007/978-3-319-33693-0_13</a>.","bibtex":"@inproceedings{Schellhorn_Travkin_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Towards a Thread-Local Proof Technique for Starvation Freedom}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">10.1007/978-3-319-33693-0_13</a>}, booktitle={Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings}, author={Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}, editor={Huisman, MariekeEditor}, year={2016}, pages={193--209}, collection={Lecture Notes in Computer Science} }","ama":"Schellhorn G, Travkin O, Wehrheim H. Towards a Thread-Local Proof Technique for Starvation Freedom. In: Huisman M, ed. <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i>. Lecture Notes in Computer Science. ; 2016:193--209. doi:<a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">10.1007/978-3-319-33693-0_13</a>","ieee":"G. Schellhorn, O. Travkin, and H. Wehrheim, “Towards a Thread-Local Proof Technique for Starvation Freedom,” in <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i>, 2016, pp. 193--209.","apa":"Schellhorn, G., Travkin, O., &#38; Wehrheim, H. (2016). Towards a Thread-Local Proof Technique for Starvation Freedom. In M. Huisman (Ed.), <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i> (pp. 193--209). <a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">https://doi.org/10.1007/978-3-319-33693-0_13</a>","short":"G. Schellhorn, O. Travkin, H. Wehrheim, in: M. Huisman (Ed.), Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, 2016, pp. 193--209.","chicago":"Schellhorn, Gerhard, Oleg Travkin, and Heike Wehrheim. “Towards a Thread-Local Proof Technique for Starvation Freedom.” In <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i>, edited by Marieke Huisman, 193--209. Lecture Notes in Computer Science, 2016. <a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">https://doi.org/10.1007/978-3-319-33693-0_13</a>."},"publication":"Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings","editor":[{"first_name":"Marieke","last_name":"Huisman","full_name":"Huisman, Marieke"}],"doi":"10.1007/978-3-319-33693-0_13","user_id":"29719","series_title":"Lecture Notes in Computer Science","_id":"3159","page":"193--209","date_updated":"2022-01-06T06:59:01Z","author":[{"last_name":"Schellhorn","first_name":"Gerhard","full_name":"Schellhorn, Gerhard"},{"full_name":"Travkin, Oleg","first_name":"Oleg","last_name":"Travkin"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"title":"Towards a Thread-Local Proof Technique for Starvation Freedom","status":"public","year":"2016"},{"citation":{"bibtex":"@inproceedings{Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2016, series={LIPIcs}, title={Proving Opacity of a Pessimistic {STM}}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">10.4230/LIPIcs.OPODIS.2016.35</a>}, booktitle={20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain}, author={Doherty, Simon and Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}, editor={Fatourou, Panagiota and Jim{\\’{e}}nez, Ernesto and Pedone, FernandoEditors}, year={2016}, pages={35:1--35:17}, collection={LIPIcs} }","ama":"Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Proving Opacity of a Pessimistic {STM}. In: Fatourou P, Jim{\\’{e}}nez E, Pedone F, eds. <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>. LIPIcs. ; 2016:35:1--35:17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">10.4230/LIPIcs.OPODIS.2016.35</a>","mla":"Doherty, Simon, et al. “Proving Opacity of a Pessimistic {STM}.” <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>, edited by Panagiota Fatourou et al., 2016, pp. 35:1--35:17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">10.4230/LIPIcs.OPODIS.2016.35</a>.","chicago":"Doherty, Simon, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike Wehrheim. “Proving Opacity of a Pessimistic {STM}.” In <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>, edited by Panagiota Fatourou, Ernesto Jim{\\’{e}}nez, and Fernando Pedone, 35:1--35:17. LIPIcs, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">https://doi.org/10.4230/LIPIcs.OPODIS.2016.35</a>.","short":"S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim, in: P. Fatourou, E. Jim{\\’{e}}nez, F. Pedone (Eds.), 20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain, 2016, pp. 35:1--35:17.","ieee":"S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim, “Proving Opacity of a Pessimistic {STM},” in <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>, 2016, pp. 35:1--35:17.","apa":"Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., &#38; Wehrheim, H. (2016). Proving Opacity of a Pessimistic {STM}. In P. Fatourou, E. Jim{\\’{e}}nez, &#38; F. Pedone (Eds.), <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i> (pp. 35:1--35:17). <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">https://doi.org/10.4230/LIPIcs.OPODIS.2016.35</a>"},"publication":"20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain","project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"date_created":"2018-06-13T07:44:15Z","department":[{"_id":"77"}],"type":"conference","author":[{"full_name":"Doherty, Simon","last_name":"Doherty","first_name":"Simon"},{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"},{"full_name":"Schellhorn, Gerhard","last_name":"Schellhorn","first_name":"Gerhard"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"title":"Proving Opacity of a Pessimistic {STM}","status":"public","year":"2016","date_updated":"2022-01-06T06:59:01Z","_id":"3160","series_title":"LIPIcs","page":"35:1--35:17","editor":[{"first_name":"Panagiota","last_name":"Fatourou","full_name":"Fatourou, Panagiota"},{"full_name":"Jim{\\'{e}}nez, Ernesto","first_name":"Ernesto","last_name":"Jim{\\'{e}}nez"},{"full_name":"Pedone, Fernando","last_name":"Pedone","first_name":"Fernando"}],"doi":"10.4230/LIPIcs.OPODIS.2016.35","user_id":"29719"},{"type":"journal_article","department":[{"_id":"77"}],"date_created":"2018-06-13T07:45:27Z","publication":"CoRR","citation":{"chicago":"Isenberg, Tobias, Marie{-}Christine Jakobs, Felix Pauck, and Heike Wehrheim. “Deriving Approximation Tolerance Constraints from Verification Runs.” <i>CoRR</i>, 2016.","short":"T. Isenberg, M.-}Christine Jakobs, F. Pauck, H. Wehrheim, CoRR (2016).","apa":"Isenberg, T., Jakobs, M.-}Christine, Pauck, F., &#38; Wehrheim, H. (2016). Deriving approximation tolerance constraints from verification runs. <i>CoRR</i>.","ieee":"T. Isenberg, M.-}Christine Jakobs, F. Pauck, and H. Wehrheim, “Deriving approximation tolerance constraints from verification runs,” <i>CoRR</i>, 2016.","ama":"Isenberg T, Jakobs M-}Christine, Pauck F, Wehrheim H. Deriving approximation tolerance constraints from verification runs. <i>CoRR</i>. 2016.","bibtex":"@article{Isenberg_Jakobs_Pauck_Wehrheim_2016, title={Deriving approximation tolerance constraints from verification runs}, journal={CoRR}, author={Isenberg, Tobias and Jakobs, Marie{-}Christine and Pauck, Felix and Wehrheim, Heike}, year={2016} }","mla":"Isenberg, Tobias, et al. “Deriving Approximation Tolerance Constraints from Verification Runs.” <i>CoRR</i>, 2016."},"user_id":"29719","_id":"3161","date_updated":"2022-01-06T06:59:01Z","status":"public","year":"2016","title":"Deriving approximation tolerance constraints from verification runs","author":[{"last_name":"Isenberg","first_name":"Tobias","full_name":"Isenberg, Tobias"},{"full_name":"Jakobs, Marie{-}Christine","first_name":"Marie{-}Christine","last_name":"Jakobs"},{"full_name":"Pauck, Felix","first_name":"Felix","last_name":"Pauck"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}]},{"citation":{"bibtex":"@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität Paderborn}, author={Leder, Lennart}, year={2016} }","ama":"Leder L. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn; 2016.","mla":"Leder, Lennart. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016.","chicago":"Leder, Lennart. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016.","short":"L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn, 2016.","ieee":"L. Leder, <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016.","apa":"Leder, L. (2016). <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn."},"supervisor":[{"id":"40384","first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:41:33Z","department":[{"_id":"63"},{"_id":"541"}],"type":"mastersthesis","author":[{"first_name":"Lennart","last_name":"Leder","full_name":"Leder, Lennart"}],"title":"Congestion Games with Mixed Objectives","status":"public","year":"2016","date_updated":"2022-01-06T06:54:42Z","_id":"210","publisher":"Universität Paderborn","user_id":"14052"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"citation":{"bibtex":"@book{Porzenheim_2016, title={Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes}, publisher={Universität Paderborn}, author={Porzenheim, Laurens}, year={2016} }","chicago":"Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn, 2016.","ama":"Porzenheim L. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn; 2016.","short":"L. Porzenheim, Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes, Universität Paderborn, 2016.","ieee":"L. Porzenheim, <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn, 2016.","apa":"Porzenheim, L. (2016). <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn.","mla":"Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn, 2016."},"department":[{"_id":"64"}],"type":"bachelorsthesis","date_created":"2017-10-17T12:41:33Z","date_updated":"2022-01-06T06:54:53Z","author":[{"first_name":"Laurens","last_name":"Porzenheim","full_name":"Porzenheim, Laurens"}],"title":"Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes","status":"public","year":"2016","user_id":"477","_id":"213","publisher":"Universität Paderborn"},{"date_created":"2017-10-17T12:41:33Z","department":[{"_id":"64"}],"type":"bachelorsthesis","citation":{"chicago":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","short":"K.S. Bemmann, Commitment Schemes - Definitions, Variants, and Security, Universität Paderborn, 2016.","apa":"Bemmann, K. S. (2016). <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn.","ieee":"K. S. Bemmann, <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","ama":"Bemmann KS. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn; 2016.","bibtex":"@book{Bemmann_2016, title={Commitment Schemes - Definitions, Variants, and Security}, publisher={Universität Paderborn}, author={Bemmann, Kai Sören}, year={2016} }","mla":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016."},"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"214","publisher":"Universität Paderborn","user_id":"477","author":[{"first_name":"Kai Sören","last_name":"Bemmann","full_name":"Bemmann, Kai Sören"}],"year":"2016","title":"Commitment Schemes - Definitions, Variants, and Security","status":"public","date_updated":"2022-01-06T06:54:58Z"},{"date_updated":"2022-01-06T06:55:02Z","year":"2016","title":"Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration","author":[{"last_name":"Drees","first_name":"Maximilian","full_name":"Drees, Maximilian"},{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"doi":"10.1145/2935764.2935783","language":[{"iso":"eng"}],"abstract":[{"text":"We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems.","lang":"eng"}],"publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","department":[{"_id":"79"},{"_id":"63"}],"file":[{"creator":"florida","date_created":"2018-03-21T10:41:40Z","date_updated":"2018-03-21T10:41:40Z","relation":"main_file","access_level":"closed","file_size":352996,"file_name":"215-SPAA16-Drees_Gmyr_Scheideler.pdf","success":1,"content_type":"application/pdf","file_id":"1518"}],"date_created":"2017-10-17T12:41:33Z","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"14955","page":"417--427","_id":"215","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-21T10:41:40Z","citation":{"ama":"Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In: <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2016:417--427. doi:<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>","bibtex":"@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}, DOI={<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}, year={2016}, pages={417--427} }","mla":"Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 417--427, doi:<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>.","chicago":"Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 417--427, 2016. <a href=\"https://doi.org/10.1145/2935764.2935783\">https://doi.org/10.1145/2935764.2935783</a>.","short":"M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.","apa":"Drees, M., Gmyr, R., &#38; Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 417--427). <a href=\"https://doi.org/10.1145/2935764.2935783\">https://doi.org/10.1145/2935764.2935783</a>","ieee":"M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 417--427."}},{"file":[{"creator":"florida","date_created":"2018-03-21T12:38:40Z","date_updated":"2018-03-21T12:38:40Z","relation":"main_file","access_level":"closed","file_size":630739,"file_name":"175-1-s2.0-S0167642316300028-main.pdf","success":1,"content_type":"application/pdf","file_id":"1536"}],"date_created":"2017-10-17T12:41:26Z","type":"journal_article","department":[{"_id":"77"}],"publication":"Science of Computer Programming","abstract":[{"text":"Today, service compositions often need to be assembled or changed on-the-fly, which leaves only little time for quality assurance. Moreover, quality assurance is complicated by service providers only giving information on their services in terms of domain specific concepts with only limited semantic meaning.In this paper, we propose a method for constructing service compositions based on pre-verified templates. Templates, given as workflow descriptions, are typed over a (domain-independent) template ontology defining concepts and predicates. Their meaning is defined by an abstract semantics, leaving the specific meaning of ontology concepts open, however, only up to given ontology rules. Templates are proven correct using a Hoare-style proof calculus, extended by a specific rule for service calls. Construction of service compositions amounts to instantiation of templates with domain-specific services. Correctness of an instantiation can then simply be checked by verifying that the domain ontology (a) adheres to the rules of the template ontology, and (b) fulfills the constraints of the employed template.","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.scico.2016.04.002","year":"2016","title":"On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs","author":[{"first_name":"Sven","last_name":"Walther","full_name":"Walther, Sven"},{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"date_updated":"2022-01-06T06:53:13Z","file_date_updated":"2018-03-21T12:38:40Z","citation":{"ama":"Walther S, Wehrheim H. On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs. <i>Science of Computer Programming</i>. 2016:2--23. doi:<a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">10.1016/j.scico.2016.04.002</a>","bibtex":"@article{Walther_Wehrheim_2016, title={On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs}, DOI={<a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">10.1016/j.scico.2016.04.002</a>}, journal={Science of Computer Programming}, publisher={Elsevier}, author={Walther, Sven and Wehrheim, Heike}, year={2016}, pages={2--23} }","mla":"Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs.” <i>Science of Computer Programming</i>, Elsevier, 2016, pp. 2--23, doi:<a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">10.1016/j.scico.2016.04.002</a>.","chicago":"Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs.” <i>Science of Computer Programming</i>, 2016, 2--23. <a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">https://doi.org/10.1016/j.scico.2016.04.002</a>.","short":"S. Walther, H. Wehrheim, Science of Computer Programming (2016) 2--23.","apa":"Walther, S., &#38; Wehrheim, H. (2016). On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs. <i>Science of Computer Programming</i>, 2--23. <a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">https://doi.org/10.1016/j.scico.2016.04.002</a>","ieee":"S. Walther and H. Wehrheim, “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs,” <i>Science of Computer Programming</i>, pp. 2--23, 2016."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"page":"2--23","_id":"175","publisher":"Elsevier","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1"},{"volume":"Volume 285: ECAI 2016","user_id":"83983","doi":"10.3233/978-1-61499-672-9-417","_id":"17655","series_title":"Frontiers in Artificial Intelligence and Applications","language":[{"iso":"eng"}],"page":"417-425","date_updated":"2022-01-06T06:53:16Z","author":[{"id":"83983","full_name":"Polevoy, Gleb","last_name":"Polevoy","first_name":"Gleb"},{"first_name":"M.M.","last_name":"de Weerdt","full_name":"de Weerdt, M.M."},{"last_name":"Jonker","first_name":"C.M.","full_name":"Jonker, C.M."}],"title":"The Game of Reciprocation Habits","status":"public","year":"2016","department":[{"_id":"63"},{"_id":"541"}],"type":"conference","keyword":["agents","action","repeated reciprocation","fixed","floating","network","Nash equilibrium","social welfare","price of anarchy","price of stability","convex combination"],"date_created":"2020-08-06T15:20:30Z","extern":"1","citation":{"chicago":"Polevoy, Gleb, M.M. de Weerdt, and C.M. Jonker. “The Game of Reciprocation Habits.” In <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i>, Volume 285: ECAI 2016:417–25. Frontiers in Artificial Intelligence and Applications, 2016. <a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">https://doi.org/10.3233/978-1-61499-672-9-417</a>.","short":"G. Polevoy, M.M. de Weerdt, C.M. Jonker, in: Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, pp. 417–425.","apa":"Polevoy, G., de Weerdt, M. M., &#38; Jonker, C. M. (2016). The Game of Reciprocation Habits. In <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i> (Vol. Volume 285: ECAI 2016, pp. 417–425). <a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">https://doi.org/10.3233/978-1-61499-672-9-417</a>","ieee":"G. Polevoy, M. M. de Weerdt, and C. M. Jonker, “The Game of Reciprocation Habits,” in <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i>, 2016, vol. Volume 285: ECAI 2016, pp. 417–425.","ama":"Polevoy G, de Weerdt MM, Jonker CM. The Game of Reciprocation Habits. In: <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i>. Vol Volume 285: ECAI 2016. Frontiers in Artificial Intelligence and Applications. ; 2016:417-425. doi:<a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">10.3233/978-1-61499-672-9-417</a>","bibtex":"@inproceedings{Polevoy_de Weerdt_Jonker_2016, series={Frontiers in Artificial Intelligence and Applications}, title={The Game of Reciprocation Habits}, volume={Volume 285: ECAI 2016}, DOI={<a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">10.3233/978-1-61499-672-9-417</a>}, booktitle={Proceedings of the 2016 European Conference on Artificial Intelligence}, author={Polevoy, Gleb and de Weerdt, M.M. and Jonker, C.M.}, year={2016}, pages={417–425}, collection={Frontiers in Artificial Intelligence and Applications} }","mla":"Polevoy, Gleb, et al. “The Game of Reciprocation Habits.” <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i>, vol. Volume 285: ECAI 2016, 2016, pp. 417–25, doi:<a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">10.3233/978-1-61499-672-9-417</a>."},"publication":"Proceedings of the 2016 European Conference on Artificial Intelligence"},{"keyword":["agent's influence","behavior","convergence","perron-frobenius","reciprocal interaction","repeated reciprocation"],"type":"conference","department":[{"_id":"63"},{"_id":"541"}],"place":"Richland, SC","date_created":"2020-08-06T15:20:45Z","extern":"1","publication":"Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems","citation":{"ama":"Polevoy G, de Weerdt M, Jonker C. The Convergence of Reciprocation. In: <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i>. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2016:1431-1432.","bibtex":"@inproceedings{Polevoy_de Weerdt_Jonker_2016, place={Richland, SC}, series={AAMAS ’16}, title={The Convergence of Reciprocation}, booktitle={Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={Polevoy, Gleb and de Weerdt, Mathijs and Jonker, Catholijn}, year={2016}, pages={1431–1432}, collection={AAMAS ’16} }","mla":"Polevoy, Gleb, et al. “The Convergence of Reciprocation.” <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i>, International Foundation for Autonomous Agents and Multiagent Systems, 2016, pp. 1431–32.","chicago":"Polevoy, Gleb, Mathijs de Weerdt, and Catholijn Jonker. “The Convergence of Reciprocation.” In <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i>, 1431–32. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2016.","short":"G. Polevoy, M. de Weerdt, C. Jonker, in: Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2016, pp. 1431–1432.","apa":"Polevoy, G., de Weerdt, M., &#38; Jonker, C. (2016). The Convergence of Reciprocation. In <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i> (pp. 1431–1432). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.","ieee":"G. Polevoy, M. de Weerdt, and C. Jonker, “The Convergence of Reciprocation,” in <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i>, 2016, pp. 1431–1432."},"user_id":"83983","page":"1431-1432","series_title":"AAMAS '16","_id":"17656","language":[{"iso":"eng"}],"publisher":"International Foundation for Autonomous Agents and Multiagent Systems","date_updated":"2022-01-06T06:53:16Z","year":"2016","title":"The Convergence of Reciprocation","status":"public","author":[{"id":"83983","full_name":"Polevoy, Gleb","last_name":"Polevoy","first_name":"Gleb"},{"last_name":"de Weerdt","first_name":"Mathijs","full_name":"de Weerdt, Mathijs"},{"first_name":"Catholijn","last_name":"Jonker","full_name":"Jonker, Catholijn"}],"publication_identifier":{"isbn":["978-1-4503-4239-1"]}},{"file":[{"file_id":"5266","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T14:15:18Z","file_name":"OnTheParameterizedParallelComp.pdf","file_size":293345,"access_level":"closed","date_created":"2018-11-02T14:15:18Z","creator":"ups"}],"date_created":"2017-10-17T12:41:26Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)","abstract":[{"text":"Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. In this paper, we propose a more restrictive class of parallelizable parameterized problems called fixed-parameter parallel-tractable (FPPT). For a problem to be in FPPT, it should possess an efficient parallel algorithm not only from a theoretical standpoint but in practice as well. The primary distinction between FPPT and FPP is the parallel processor utilization, which is bounded by a polynomial function in the case of FPPT. We initiate the study of FPPT with the well-known k-vertex cover problem. In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n), where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. We also note that a few P-complete problems fall into FPPT including the monotone circuit value problem (MCV) when the underlying graphs are bounded by a constant Euler genus.","lang":"eng"}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-48749-6_35","year":"2016","title":"On the Parameterized Parallel Complexity and the Vertex Cover Problem","author":[{"full_name":"Abu-Khzam, Faisal N.","last_name":"Abu-Khzam","first_name":"Faisal N."},{"last_name":"Li","first_name":"Shouwei","full_name":"Li, Shouwei"},{"full_name":"Markarian, Christine","last_name":"Markarian","first_name":"Christine","id":"37612"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Pavel","last_name":"Podlipyan","full_name":"Podlipyan, Pavel"}],"date_updated":"2022-01-06T06:53:17Z","file_date_updated":"2018-11-02T14:15:18Z","citation":{"short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–488.","chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” In <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 477–88. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">https://doi.org/10.1007/978-3-319-48749-6_35</a>.","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “On the Parameterized Parallel Complexity and the Vertex Cover Problem,” in <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 477–488.","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2016). On the Parameterized Parallel Complexity and the Vertex Cover Problem. In <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 477–488). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">https://doi.org/10.1007/978-3-319-48749-6_35</a>","bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={On the Parameterized Parallel Complexity and the Vertex Cover Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">10.1007/978-3-319-48749-6_35</a>}, booktitle={Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={477–488}, collection={LNCS} }","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. On the Parameterized Parallel Complexity and the Vertex Cover Problem. In: <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2016:477-488. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">10.1007/978-3-319-48749-6_35</a>","mla":"Abu-Khzam, Faisal N., et al. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 477–88, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">10.1007/978-3-319-48749-6_35</a>."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"page":"477-488","_id":"177","ddc":["000"],"user_id":"477","status":"public","has_accepted_license":"1"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"bibtex":"@book{Meyer auf der Heide_2016, title={Introduction to the Special Issue on SPAA 2014}, DOI={<a href=\"https://doi.org/10.1145/2936716\">10.1145/2936716</a>}, number={1}, journal={Transactions on Parallel Computing (TOPC)}, year={2016} }","ama":"Meyer auf der Heide F, ed. <i>Introduction to the Special Issue on SPAA 2014</i>.; 2016. doi:<a href=\"https://doi.org/10.1145/2936716\">10.1145/2936716</a>","mla":"Meyer auf der Heide, Friedhelm, editor. “Introduction to the Special Issue on SPAA 2014.” <i>Transactions on Parallel Computing (TOPC)</i>, no. 1, 2016, doi:<a href=\"https://doi.org/10.1145/2936716\">10.1145/2936716</a>.","short":"F. Meyer auf der Heide, ed., Introduction to the Special Issue on SPAA 2014, 2016.","chicago":"Meyer auf der Heide, Friedhelm, ed. <i>Introduction to the Special Issue on SPAA 2014</i>. <i>Transactions on Parallel Computing (TOPC)</i>, 2016. <a href=\"https://doi.org/10.1145/2936716\">https://doi.org/10.1145/2936716</a>.","ieee":"F. Meyer auf der Heide, Ed., <i>Introduction to the Special Issue on SPAA 2014</i>, no. 1. 2016.","apa":"Meyer auf der Heide, F. (Ed.). (2016). <i>Introduction to the Special Issue on SPAA 2014</i>. <i>Transactions on Parallel Computing (TOPC)</i>. <a href=\"https://doi.org/10.1145/2936716\">https://doi.org/10.1145/2936716</a>"},"file_date_updated":"2018-03-21T12:31:42Z","issue":"1","publication":"Transactions on Parallel Computing (TOPC)","department":[{"_id":"63"}],"type":"journal_editor","date_created":"2017-10-17T12:41:28Z","file":[{"creator":"florida","date_created":"2018-03-21T12:31:42Z","file_name":"187-a1-heide.pdf","access_level":"closed","file_size":34053,"relation":"main_file","date_updated":"2018-03-21T12:31:42Z","file_id":"1531","content_type":"application/pdf","success":1}],"has_accepted_license":"1","date_updated":"2022-01-06T06:53:51Z","title":"Introduction to the Special Issue on SPAA 2014","status":"public","year":"2016","editor":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"user_id":"15504","ddc":["040"],"doi":"10.1145/2936716","_id":"187","page":"1"}]