[{"author":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"},{"id":"13291","full_name":"Brauer, Sascha","first_name":"Sascha","last_name":"Brauer"},{"first_name":"Kathrin","last_name":"Bujna","full_name":"Bujna, Kathrin"}],"year":"2016","title":"Hard-Clustering with Gaussian Mixture Models","status":"public","date_updated":"2022-01-06T06:58:49Z","_id":"2969","publisher":"Computing Research Repository","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1603.06478"}],"user_id":"25078","citation":{"mla":"Blömer, Johannes, et al. <i>Hard-Clustering with Gaussian Mixture Models</i>. Computing Research Repository, 2016.","ama":"Blömer J, Brauer S, Bujna K. Hard-Clustering with Gaussian Mixture Models. 2016.","bibtex":"@article{Blömer_Brauer_Bujna_2016, title={Hard-Clustering with Gaussian Mixture Models}, publisher={Computing Research Repository}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2016} }","apa":"Blömer, J., Brauer, S., &#38; Bujna, K. (2016). Hard-Clustering with Gaussian Mixture Models. Computing Research Repository.","ieee":"J. Blömer, S. Brauer, and K. Bujna, “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.","chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.","short":"J. Blömer, S. Brauer, K. Bujna, (2016)."},"date_created":"2018-06-04T12:26:51Z","oa":"1","department":[{"_id":"64"}],"type":"preprint"},{"user_id":"25078","doi":"10.1007/978-3-319-31750-2_24","page":"296-308","publisher":"Springer International Publishing","_id":"2970","publication_status":"published","date_updated":"2022-01-06T06:58:49Z","status":"public","year":"2016","title":"Adaptive Seeding for Gaussian Mixture Models","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319317496","9783319317502"]},"author":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"},{"last_name":"Bujna","first_name":"Kathrin","full_name":"Bujna, Kathrin"}],"type":"book_chapter","department":[{"_id":"64"}],"date_created":"2018-06-04T12:27:21Z","place":"Cham","publication":"Advances in Knowledge Discovery and Data Mining","citation":{"ieee":"J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in <i>Advances in Knowledge Discovery and Data Mining</i>, Cham: Springer International Publishing, 2016, pp. 296–308.","apa":"Blömer, J., &#38; Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture Models. In <i>Advances in Knowledge Discovery and Data Mining</i> (pp. 296–308). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">https://doi.org/10.1007/978-3-319-31750-2_24</a>","chicago":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” In <i>Advances in Knowledge Discovery and Data Mining</i>, 296–308. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">https://doi.org/10.1007/978-3-319-31750-2_24</a>.","short":"J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining, Springer International Publishing, Cham, 2016, pp. 296–308.","mla":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” <i>Advances in Knowledge Discovery and Data Mining</i>, Springer International Publishing, 2016, pp. 296–308, doi:<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>.","bibtex":"@inbook{Blömer_Bujna_2016, place={Cham}, title={Adaptive Seeding for Gaussian Mixture Models}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>}, booktitle={Advances in Knowledge Discovery and Data Mining}, publisher={Springer International Publishing}, author={Blömer, Johannes and Bujna, Kathrin}, year={2016}, pages={296–308} }","ama":"Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: <i>Advances in Knowledge Discovery and Data Mining</i>. Cham: Springer International Publishing; 2016:296-308. doi:<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>"}},{"type":"report","department":[{"_id":"64"}],"date_created":"2018-06-05T07:21:25Z","citation":{"ama":"Blömer J, Günther P. <i>Effizienz Und Sicherheit Paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops; 2016.","bibtex":"@book{Blömer_Günther_2016, title={Effizienz und Sicherheit paarungsbasierter Kryptographie}, publisher={Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops}, author={Blömer, Johannes and Günther, Peter}, year={2016} }","mla":"Blömer, Johannes, and Peter Günther. <i>Effizienz Und Sicherheit Paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","chicago":"Blömer, Johannes, and Peter Günther. <i>Effizienz Und Sicherheit Paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","short":"J. Blömer, P. Günther, Effizienz Und Sicherheit Paarungsbasierter Kryptographie, Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","apa":"Blömer, J., &#38; Günther, P. (2016). <i>Effizienz und Sicherheit paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops.","ieee":"J. Blömer and P. Günther, <i>Effizienz und Sicherheit paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016."},"user_id":"25078","publisher":"Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops","_id":"2971","date_updated":"2022-01-06T06:58:49Z","publication_status":"published","year":"2016","title":"Effizienz und Sicherheit paarungsbasierter Kryptographie","status":"public","author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"last_name":"Günther","first_name":"Peter","full_name":"Günther, Peter"}]},{"file_date_updated":"2018-10-31T08:49:27Z","citation":{"bibtex":"@article{Duman_Trockel_2016, title={On Non-Cooperative Foundation and Implementation of the Nash Solution in Subgame Perfect Equilibrium via Rubinstein’s Game}, volume={1}, DOI={<a href=\"https://doi.org/10.22574/jmid.2016.12.003\">10.22574/jmid.2016.12.003</a>}, number={1}, journal={Journal of Mechanism and Institution Design}, publisher={The Society for the Promotion of Mechanism and Institution Design}, author={Duman, Papatya and Trockel, Walter}, year={2016}, pages={83–106} }","ama":"Duman P, Trockel W. On Non-Cooperative Foundation and Implementation of the Nash Solution in Subgame Perfect Equilibrium via Rubinstein’s Game. <i>Journal of Mechanism and Institution Design</i>. 2016;1(1):83-106. doi:<a href=\"https://doi.org/10.22574/jmid.2016.12.003\">10.22574/jmid.2016.12.003</a>","mla":"Duman, Papatya, and Walter Trockel. “On Non-Cooperative Foundation and Implementation of the Nash Solution in Subgame Perfect Equilibrium via Rubinstein’s Game.” <i>Journal of Mechanism and Institution Design</i>, vol. 1, no. 1, The Society for the Promotion of Mechanism and Institution Design, 2016, pp. 83–106, doi:<a href=\"https://doi.org/10.22574/jmid.2016.12.003\">10.22574/jmid.2016.12.003</a>.","short":"P. Duman, W. Trockel, Journal of Mechanism and Institution Design 1 (2016) 83–106.","chicago":"Duman, Papatya, and Walter Trockel. “On Non-Cooperative Foundation and Implementation of the Nash Solution in Subgame Perfect Equilibrium via Rubinstein’s Game.” <i>Journal of Mechanism and Institution Design</i> 1, no. 1 (2016): 83–106. <a href=\"https://doi.org/10.22574/jmid.2016.12.003\">https://doi.org/10.22574/jmid.2016.12.003</a>.","ieee":"P. Duman and W. Trockel, “On Non-Cooperative Foundation and Implementation of the Nash Solution in Subgame Perfect Equilibrium via Rubinstein’s Game,” <i>Journal of Mechanism and Institution Design</i>, vol. 1, no. 1, pp. 83–106, 2016.","apa":"Duman, P., &#38; Trockel, W. (2016). On Non-Cooperative Foundation and Implementation of the Nash Solution in Subgame Perfect Equilibrium via Rubinstein’s Game. <i>Journal of Mechanism and Institution Design</i>, <i>1</i>(1), 83–106. <a href=\"https://doi.org/10.22574/jmid.2016.12.003\">https://doi.org/10.22574/jmid.2016.12.003</a>"},"page":"83-106","publisher":"The Society for the Promotion of Mechanism and Institution Design","_id":"3106","user_id":"65453","ddc":["040"],"volume":1,"status":"public","has_accepted_license":"1","file":[{"creator":"stela","date_created":"2018-10-31T08:49:27Z","file_name":"On Non-Cooperative Foundation and Implementation of the Nash....pdf","file_size":332414,"access_level":"closed","relation":"main_file","date_updated":"2018-10-31T08:49:27Z","file_id":"5138","success":1,"content_type":"application/pdf"}],"date_created":"2018-06-07T08:53:37Z","type":"journal_article","issue":"1","publication":"Journal of Mechanism and Institution Design","extern":"1","language":[{"iso":"eng"}],"doi":"10.22574/jmid.2016.12.003","year":"2016","title":"On Non-Cooperative Foundation and Implementation of the Nash Solution in Subgame Perfect Equilibrium via Rubinstein's Game","publication_identifier":{"issn":["2399-844X","2399-8458"]},"author":[{"id":"72752","full_name":"Duman, Papatya","first_name":"Papatya","last_name":"Duman"},{"last_name":"Trockel","first_name":"Walter","full_name":"Trockel, Walter"}],"publication_status":"published","date_updated":"2022-01-06T06:58:56Z","intvolume":"         1"},{"issue":"1","publication":"Des. Codes Cryptography","citation":{"short":"D. Hofheinz, T. Jager, Des. Codes Cryptography (2016) 29--61.","chicago":"Hofheinz, Dennis, and Tibor Jager. “Tightly Secure Signatures and Public-Key Encryption.” <i>Des. Codes Cryptography</i>, no. 1 (2016): 29--61. <a href=\"https://doi.org/10.1007/s10623-015-0062-x\">https://doi.org/10.1007/s10623-015-0062-x</a>.","apa":"Hofheinz, D., &#38; Jager, T. (2016). Tightly secure signatures and public-key encryption. <i>Des. Codes Cryptography</i>, (1), 29--61. <a href=\"https://doi.org/10.1007/s10623-015-0062-x\">https://doi.org/10.1007/s10623-015-0062-x</a>","ieee":"D. Hofheinz and T. Jager, “Tightly secure signatures and public-key encryption,” <i>Des. Codes Cryptography</i>, no. 1, pp. 29--61, 2016.","ama":"Hofheinz D, Jager T. Tightly secure signatures and public-key encryption. <i>Des Codes Cryptography</i>. 2016;(1):29--61. doi:<a href=\"https://doi.org/10.1007/s10623-015-0062-x\">10.1007/s10623-015-0062-x</a>","bibtex":"@article{Hofheinz_Jager_2016, title={Tightly secure signatures and public-key encryption}, DOI={<a href=\"https://doi.org/10.1007/s10623-015-0062-x\">10.1007/s10623-015-0062-x</a>}, number={1}, journal={Des. Codes Cryptography}, author={Hofheinz, Dennis and Jager, Tibor}, year={2016}, pages={29--61} }","mla":"Hofheinz, Dennis, and Tibor Jager. “Tightly Secure Signatures and Public-Key Encryption.” <i>Des. Codes Cryptography</i>, no. 1, 2016, pp. 29--61, doi:<a href=\"https://doi.org/10.1007/s10623-015-0062-x\">10.1007/s10623-015-0062-x</a>."},"extern":"1","date_created":"2018-06-07T09:12:15Z","type":"journal_article","department":[{"_id":"558"}],"title":"Tightly secure signatures and public-key encryption","year":"2016","status":"public","author":[{"first_name":"Dennis","last_name":"Hofheinz","full_name":"Hofheinz, Dennis"},{"last_name":"Jager","first_name":"Tibor","full_name":"Jager, Tibor","id":"64669"}],"date_updated":"2022-01-06T06:58:56Z","page":"29--61","_id":"3112","user_id":"38235","doi":"10.1007/s10623-015-0062-x"},{"extern":"1","citation":{"short":"F. Heuer, T. Jager, S. Schäge, E. Kiltz, IET Information Security (2016) 304--318.","chicago":"Heuer, Felix, Tibor Jager, Sven Schäge, and Eike Kiltz. “Selective Opening Security of Practical Public-Key Encryption Schemes.” <i>IET Information Security</i>, no. 6 (2016): 304--318. <a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">https://doi.org/10.1049/iet-ifs.2015.0507</a>.","apa":"Heuer, F., Jager, T., Schäge, S., &#38; Kiltz, E. (2016). Selective opening security of practical public-key encryption schemes. <i>IET Information Security</i>, (6), 304--318. <a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">https://doi.org/10.1049/iet-ifs.2015.0507</a>","ieee":"F. Heuer, T. Jager, S. Schäge, and E. Kiltz, “Selective opening security of practical public-key encryption schemes,” <i>IET Information Security</i>, no. 6, pp. 304--318, 2016.","ama":"Heuer F, Jager T, Schäge S, Kiltz E. Selective opening security of practical public-key encryption schemes. <i>IET Information Security</i>. 2016;(6):304--318. doi:<a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">10.1049/iet-ifs.2015.0507</a>","bibtex":"@article{Heuer_Jager_Schäge_Kiltz_2016, title={Selective opening security of practical public-key encryption schemes}, DOI={<a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">10.1049/iet-ifs.2015.0507</a>}, number={6}, journal={IET Information Security}, author={Heuer, Felix and Jager, Tibor and Schäge, Sven and Kiltz, Eike}, year={2016}, pages={304--318} }","mla":"Heuer, Felix, et al. “Selective Opening Security of Practical Public-Key Encryption Schemes.” <i>IET Information Security</i>, no. 6, 2016, pp. 304--318, doi:<a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">10.1049/iet-ifs.2015.0507</a>."},"issue":"6","publication":"IET Information Security","department":[{"_id":"558"}],"type":"journal_article","date_created":"2018-06-07T09:12:50Z","date_updated":"2022-01-06T06:58:56Z","author":[{"full_name":"Heuer, Felix","first_name":"Felix","last_name":"Heuer"},{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"last_name":"Schäge","first_name":"Sven","full_name":"Schäge, Sven"},{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"}],"title":"Selective opening security of practical public-key encryption schemes","status":"public","year":"2016","doi":"10.1049/iet-ifs.2015.0507","user_id":"38235","_id":"3113","page":"304--318"},{"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.","chicago":"Jager, Tibor, and Andy Rupp. “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way.” <i>PoPETs</i>, no. 3 (2016): 62--82.","short":"T. Jager, A. Rupp, PoPETs (2016) 62--82."},"issue":"3","publication":"PoPETs","extern":"1","date_created":"2018-06-07T09:13:15Z","department":[{"_id":"558"}],"type":"journal_article","author":[{"id":"64669","first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor"},{"full_name":"Rupp, Andy","first_name":"Andy","last_name":"Rupp"}],"title":"Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way","year":"2016","status":"public","date_updated":"2022-01-06T06:58:56Z","_id":"3114","page":"62--82","user_id":"38235"},{"author":[{"full_name":"Hofheinz, Dennis","last_name":"Hofheinz","first_name":"Dennis"},{"last_name":"Jager","first_name":"Tibor","full_name":"Jager, Tibor","id":"64669"},{"full_name":"Khurana, Dakshita","last_name":"Khurana","first_name":"Dakshita"},{"first_name":"Amit","last_name":"Sahai","full_name":"Sahai, Amit"},{"full_name":"Waters, Brent","last_name":"Waters","first_name":"Brent"},{"full_name":"Zhandry, Mark","first_name":"Mark","last_name":"Zhandry"}],"title":"How to Generate and Use Universal Samplers","year":"2016","status":"public","date_updated":"2022-01-06T06:58:57Z","_id":"3115","page":"715--744","doi":"10.1007/978-3-662-53890-6_24","user_id":"38235","citation":{"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.","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>","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.","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>","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} }","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>."},"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","extern":"1","date_created":"2018-06-07T09:13:48Z","department":[{"_id":"558"}],"type":"conference"},{"author":[{"full_name":"Horst, Matthias","first_name":"Matthias","last_name":"Horst"},{"full_name":"Grothe, Martin","last_name":"Grothe","first_name":"Martin"},{"id":"64669","first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor"},{"full_name":"Schwenk, Jörg","first_name":"Jörg","last_name":"Schwenk"}],"title":"Breaking PPTP VPNs via RADIUS Encryption","status":"public","year":"2016","date_updated":"2022-01-06T06:58:57Z","_id":"3116","page":"159--175","doi":"10.1007/978-3-319-48965-0_10","user_id":"38235","citation":{"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.","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>","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} }","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>.","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.","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>"},"publication":"Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings","extern":"1","date_created":"2018-06-07T09:14:34Z","department":[{"_id":"558"}],"type":"conference"},{"date_created":"2018-06-07T09:15:15Z","type":"conference","department":[{"_id":"558"}],"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":{"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>.","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>","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>","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>."},"extern":"1","page":"273--304","_id":"3117","user_id":"38235","doi":"10.1007/978-3-662-49896-5_10","title":"On the Impossibility of Tight Cryptographic Reductions","year":"2016","status":"public","author":[{"full_name":"Bader, Christoph","first_name":"Christoph","last_name":"Bader"},{"full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager","id":"64669"},{"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"},{"date_updated":"2022-01-06T06:58:57Z","year":"2016","title":"Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts","status":"public","author":[{"full_name":"Hofheinz, Dennis","last_name":"Hofheinz","first_name":"Dennis"},{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"},{"full_name":"Rupp, Andy","last_name":"Rupp","first_name":"Andy"}],"doi":"10.1007/978-3-662-53644-5_6","user_id":"38235","page":"146--168","_id":"3118","extern":"1","publication":"Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II","citation":{"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>.","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>","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} }","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>","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.","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>.","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."},"type":"conference","department":[{"_id":"558"}],"date_created":"2018-06-07T09:15:51Z"},{"page":"336--362","_id":"3119","user_id":"38235","doi":"10.1007/978-3-662-49096-9_14","title":"Verifiable Random Functions from Standard Assumptions","status":"public","year":"2016","author":[{"first_name":"Dennis","last_name":"Hofheinz","full_name":"Hofheinz, Dennis"},{"id":"64669","full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager"}],"date_updated":"2022-01-06T06:58:57Z","date_created":"2018-06-07T09:16:30Z","type":"conference","department":[{"_id":"558"}],"publication":"Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I","citation":{"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>.","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} }","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>","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>."},"extern":"1"},{"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-319-45943-1_13","author":[{"first_name":"Steffen","last_name":"Beringer","full_name":"Beringer, Steffen"},{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"title":"Verification of AUTOSAR Software Architectures with Timed Automata","year":"2016","date_updated":"2022-01-06T06:59:01Z","date_created":"2018-06-13T07:39:35Z","file":[{"date_updated":"2018-11-02T14:17:13Z","relation":"main_file","access_level":"closed","file_size":2640695,"file_name":"VerificationOfAUTOSARSoftwareA.pdf","success":1,"content_type":"application/pdf","file_id":"5267","creator":"ups","date_created":"2018-11-02T14:17:13Z"}],"department":[{"_id":"77"}],"type":"conference","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","_id":"3157","page":"189--204","editor":[{"full_name":"H. ter Beek, Maurice","last_name":"H. ter Beek","first_name":"Maurice"},{"last_name":"Gnesi","first_name":"Stefania","full_name":"Gnesi, Stefania"},{"full_name":"Knapp, Alexander","last_name":"Knapp","first_name":"Alexander"}],"ddc":["000"],"user_id":"477","status":"public","has_accepted_license":"1","citation":{"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>.","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.","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>","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} }","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>","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>."},"file_date_updated":"2018-11-02T14:17:13Z","project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject B3","_id":"11"}]},{"editor":[{"first_name":"Augusto","last_name":"Sampaio","full_name":"Sampaio, Augusto"},{"first_name":"Farn","last_name":"Wang","full_name":"Wang, Farn"}],"user_id":"29719","doi":"10.1007/978-3-319-46750-4_1","_id":"3158","series_title":"Lecture Notes in Computer Science","page":"3--24","date_updated":"2022-01-06T06:59:01Z","author":[{"full_name":"Travkin, Oleg","first_name":"Oleg","last_name":"Travkin"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"year":"2016","status":"public","title":"Verification of Concurrent Programs on Weak Memory Models","department":[{"_id":"77"}],"type":"conference","date_created":"2018-06-13T07:41:07Z","citation":{"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.","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>.","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>","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} }","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>.","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."},"publication":"Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings"},{"date_updated":"2022-01-06T06:59:01Z","author":[{"full_name":"Schellhorn, Gerhard","first_name":"Gerhard","last_name":"Schellhorn"},{"first_name":"Oleg","last_name":"Travkin","full_name":"Travkin, Oleg"},{"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","editor":[{"first_name":"Marieke","last_name":"Huisman","full_name":"Huisman, Marieke"}],"doi":"10.1007/978-3-319-33693-0_13","user_id":"29719","_id":"3159","series_title":"Lecture Notes in Computer Science","page":"193--209","citation":{"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>.","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.","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>","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.","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>","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} }","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>."},"publication":"Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings","department":[{"_id":"77"}],"type":"conference","date_created":"2018-06-13T07:42:34Z"},{"publication":"20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain","citation":{"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>","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>."},"project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"date_created":"2018-06-13T07:44:15Z","type":"conference","department":[{"_id":"77"}],"year":"2016","title":"Proving Opacity of a Pessimistic {STM}","status":"public","author":[{"last_name":"Doherty","first_name":"Simon","full_name":"Doherty, Simon"},{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"last_name":"Derrick","first_name":"John","full_name":"Derrick, John"},{"first_name":"Gerhard","last_name":"Schellhorn","full_name":"Schellhorn, Gerhard"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_updated":"2022-01-06T06:59:01Z","page":"35:1--35:17","series_title":"LIPIcs","_id":"3160","doi":"10.4230/LIPIcs.OPODIS.2016.35","user_id":"29719","editor":[{"first_name":"Panagiota","last_name":"Fatourou","full_name":"Fatourou, Panagiota"},{"last_name":"Jim{\\'{e}}nez","first_name":"Ernesto","full_name":"Jim{\\'{e}}nez, Ernesto"},{"full_name":"Pedone, Fernando","last_name":"Pedone","first_name":"Fernando"}]},{"author":[{"first_name":"Tobias","last_name":"Isenberg","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","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"status":"public","year":"2016","title":"Deriving approximation tolerance constraints from verification runs","date_updated":"2022-01-06T06:59:01Z","_id":"3161","user_id":"29719","citation":{"mla":"Isenberg, Tobias, et al. “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} }","ama":"Isenberg T, Jakobs M-}Christine, Pauck F, Wehrheim H. Deriving approximation tolerance constraints from verification runs. <i>CoRR</i>. 2016.","ieee":"T. Isenberg, M.-}Christine Jakobs, F. Pauck, and H. Wehrheim, “Deriving approximation tolerance constraints from verification runs,” <i>CoRR</i>, 2016.","apa":"Isenberg, T., Jakobs, M.-}Christine, Pauck, F., &#38; Wehrheim, H. (2016). Deriving approximation tolerance constraints from verification runs. <i>CoRR</i>.","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)."},"publication":"CoRR","date_created":"2018-06-13T07:45:27Z","department":[{"_id":"77"}],"type":"journal_article"},{"citation":{"chicago":"Görzen, Thomas, and Dennis Kundisch. “Can the Crowd Substitute Experts in Evaluation of Creative Ideas? An Experimental Study Using Business Models.” In <i>Proceedings of the 22nd Americas’ Conference on Information Systems (AMCIS)</i>, 2016.","short":"T. Görzen, D. Kundisch, in: Proceedings of the 22nd Americas’ Conference on Information Systems (AMCIS), 2016.","ieee":"T. Görzen and D. Kundisch, “Can the Crowd Substitute Experts in Evaluation of Creative Ideas? An Experimental Study Using Business Models,” in <i>Proceedings of the 22nd Americas’ Conference on Information Systems (AMCIS)</i>, San Diego, USA, 2016.","apa":"Görzen, T., &#38; Kundisch, D. (2016). Can the Crowd Substitute Experts in Evaluation of Creative Ideas? An Experimental Study Using Business Models. In <i>Proceedings of the 22nd Americas’ Conference on Information Systems (AMCIS)</i>. San Diego, USA.","bibtex":"@inproceedings{Görzen_Kundisch_2016, title={Can the Crowd Substitute Experts in Evaluation of Creative Ideas? An Experimental Study Using Business Models}, booktitle={Proceedings of the 22nd Americas’ Conference on Information Systems (AMCIS)}, author={Görzen, Thomas and Kundisch, Dennis}, year={2016} }","ama":"Görzen T, Kundisch D. Can the Crowd Substitute Experts in Evaluation of Creative Ideas? An Experimental Study Using Business Models. In: <i>Proceedings of the 22nd Americas’ Conference on Information Systems (AMCIS)</i>. ; 2016.","mla":"Görzen, Thomas, and Dennis Kundisch. “Can the Crowd Substitute Experts in Evaluation of Creative Ideas? An Experimental Study Using Business Models.” <i>Proceedings of the 22nd Americas’ Conference on Information Systems (AMCIS)</i>, 2016."},"publication":"Proceedings of the 22nd Americas' Conference on Information Systems (AMCIS)","date_created":"2018-05-08T12:59:00Z","department":[{"_id":"276"}],"type":"conference","conference":{"location":"San Diego, USA","name":"22nd Americas' Conference on Information Systems (AMCIS)"},"author":[{"full_name":"Görzen, Thomas","last_name":"Görzen","first_name":"Thomas","id":"47700"},{"full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis","id":"21117"}],"status":"public","year":"2016","title":"Can the Crowd Substitute Experts in Evaluation of Creative Ideas? An Experimental Study Using Business Models","date_updated":"2022-01-06T06:57:31Z","publication_status":"published","_id":"2699","language":[{"iso":"eng"}],"user_id":"16205"},{"publication":"Proceedings of the 24th European Conference on Information Systems (ECIS)","citation":{"bibtex":"@inproceedings{Görzen_Kundisch_2016, title={Can the Crowd Substitute Experts in Evaluation of Creative Jobs? The Case of Business Models}, booktitle={Proceedings of the 24th European Conference on Information Systems (ECIS)}, author={Görzen, Thomas and Kundisch, Dennis}, year={2016} }","ama":"Görzen T, Kundisch D. Can the Crowd Substitute Experts in Evaluation of Creative Jobs? The Case of Business Models. In: <i>Proceedings of the 24th European Conference on Information Systems (ECIS)</i>. ; 2016.","mla":"Görzen, Thomas, and Dennis Kundisch. “Can the Crowd Substitute Experts in Evaluation of Creative Jobs? The Case of Business Models.” <i>Proceedings of the 24th European Conference on Information Systems (ECIS)</i>, 2016.","chicago":"Görzen, Thomas, and Dennis Kundisch. “Can the Crowd Substitute Experts in Evaluation of Creative Jobs? The Case of Business Models.” In <i>Proceedings of the 24th European Conference on Information Systems (ECIS)</i>, 2016.","short":"T. Görzen, D. Kundisch, in: Proceedings of the 24th European Conference on Information Systems (ECIS), 2016.","ieee":"T. Görzen and D. Kundisch, “Can the Crowd Substitute Experts in Evaluation of Creative Jobs? The Case of Business Models,” in <i>Proceedings of the 24th European Conference on Information Systems (ECIS)</i>, Istanbul, Turkey, 2016.","apa":"Görzen, T., &#38; Kundisch, D. (2016). Can the Crowd Substitute Experts in Evaluation of Creative Jobs? The Case of Business Models. In <i>Proceedings of the 24th European Conference on Information Systems (ECIS)</i>. Istanbul, Turkey."},"date_created":"2018-05-08T13:01:15Z","type":"conference","department":[{"_id":"276"}],"year":"2016","status":"public","title":"Can the Crowd Substitute Experts in Evaluation of Creative Jobs? The Case of Business Models","conference":{"name":"24th European Conference on Information Systems (ECIS)","location":"Istanbul, Turkey"},"author":[{"id":"47700","full_name":"Görzen, Thomas","last_name":"Görzen","first_name":"Thomas"},{"id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis","last_name":"Kundisch"}],"date_updated":"2022-01-06T06:57:32Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"2700","user_id":"16205"},{"date_created":"2018-05-08T13:03:14Z","department":[{"_id":"276"}],"type":"conference","citation":{"ieee":"D. Schlangenotto and D. Kundisch, “Read this Paper! A Field Experiment on the Role of a Call-To-Action in Paid Search,” in <i>Proceedings of the 24th European Conference on Information Systems (ECIS)</i>, Istanbul, Turkey, 2016.","apa":"Schlangenotto, D., &#38; Kundisch, D. (2016). Read this Paper! A Field Experiment on the Role of a Call-To-Action in Paid Search. In <i>Proceedings of the 24th European Conference on Information Systems (ECIS)</i>. Istanbul, Turkey.","chicago":"Schlangenotto, Darius, and Dennis Kundisch. “Read This Paper! A Field Experiment on the Role of a Call-To-Action in Paid Search.” In <i>Proceedings of the 24th European Conference on Information Systems (ECIS)</i>, 2016.","short":"D. Schlangenotto, D. Kundisch, in: Proceedings of the 24th European Conference on Information Systems (ECIS), 2016.","mla":"Schlangenotto, Darius, and Dennis Kundisch. “Read This Paper! A Field Experiment on the Role of a Call-To-Action in Paid Search.” <i>Proceedings of the 24th European Conference on Information Systems (ECIS)</i>, 2016.","bibtex":"@inproceedings{Schlangenotto_Kundisch_2016, title={Read this Paper! A Field Experiment on the Role of a Call-To-Action in Paid Search}, booktitle={Proceedings of the 24th European Conference on Information Systems (ECIS)}, author={Schlangenotto, Darius and Kundisch, Dennis}, year={2016} }","ama":"Schlangenotto D, Kundisch D. Read this Paper! A Field Experiment on the Role of a Call-To-Action in Paid Search. In: <i>Proceedings of the 24th European Conference on Information Systems (ECIS)</i>. ; 2016."},"publication":"Proceedings of the 24th European Conference on Information Systems (ECIS)","language":[{"iso":"eng"}],"_id":"2701","user_id":"16205","author":[{"id":"13268","first_name":"Darius","last_name":"Schlangenotto","full_name":"Schlangenotto, Darius"},{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"}],"conference":{"location":"Istanbul, Turkey","name":"24th European Conference on Information Systems (ECIS)"},"title":"Read this Paper! A Field Experiment on the Role of a Call-To-Action in Paid Search","status":"public","year":"2016","publication_status":"published","date_updated":"2022-01-06T06:57:32Z"}]