[{"issue":"1","publication":"Formal Asp. Comput.","citation":{"bibtex":"@article{Fränzle_Kapur_Wehrheim_Zhan_2019, title={Editorial}, volume={31}, DOI={<a href=\"https://doi.org/10.1007/s00165-018-00477-6\">10.1007/s00165-018-00477-6</a>}, number={1}, journal={Formal Asp. Comput.}, author={Fränzle, Martin and Kapur, Deepak and Wehrheim, Heike and Zhan, Naijun}, year={2019}, pages={1} }","chicago":"Fränzle, Martin, Deepak Kapur, Heike Wehrheim, and Naijun Zhan. “Editorial.” <i>Formal Asp. Comput.</i> 31, no. 1 (2019): 1. <a href=\"https://doi.org/10.1007/s00165-018-00477-6\">https://doi.org/10.1007/s00165-018-00477-6</a>.","ama":"Fränzle M, Kapur D, Wehrheim H, Zhan N. Editorial. <i>Formal Asp Comput</i>. 2019;31(1):1. doi:<a href=\"https://doi.org/10.1007/s00165-018-00477-6\">10.1007/s00165-018-00477-6</a>","short":"M. Fränzle, D. Kapur, H. Wehrheim, N. Zhan, Formal Asp. Comput. 31 (2019) 1.","ieee":"M. Fränzle, D. Kapur, H. Wehrheim, and N. Zhan, “Editorial,” <i>Formal Asp. Comput.</i>, vol. 31, no. 1, p. 1, 2019.","mla":"Fränzle, Martin, et al. “Editorial.” <i>Formal Asp. Comput.</i>, vol. 31, no. 1, 2019, p. 1, doi:<a href=\"https://doi.org/10.1007/s00165-018-00477-6\">10.1007/s00165-018-00477-6</a>.","apa":"Fränzle, M., Kapur, D., Wehrheim, H., &#38; Zhan, N. (2019). Editorial. <i>Formal Asp. Comput.</i>, <i>31</i>(1), 1. <a href=\"https://doi.org/10.1007/s00165-018-00477-6\">https://doi.org/10.1007/s00165-018-00477-6</a>"},"date_created":"2019-05-28T06:32:57Z","type":"journal_article","department":[{"_id":"77"}],"title":"Editorial","status":"public","year":"2019","author":[{"full_name":"Fränzle, Martin","first_name":"Martin","last_name":"Fränzle"},{"full_name":"Kapur, Deepak","first_name":"Deepak","last_name":"Kapur"},{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"},{"full_name":"Zhan, Naijun","first_name":"Naijun","last_name":"Zhan"}],"date_updated":"2022-01-06T06:50:22Z","intvolume":"        31","page":"1","_id":"10011","language":[{"iso":"eng"}],"doi":"10.1007/s00165-018-00477-6","user_id":"29719","volume":31},{"citation":{"ama":"König J, Wehrheim H. Data Independence for Software Transactional Memory. In: M. Badger J, Yvonne Rozier K, eds. <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i>. Vol 11460. Lecture Notes in Computer Science. Springer; 2019:263-279. doi:<a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">10.1007/978-3-030-20652-9\\_18</a>","bibtex":"@inproceedings{König_Wehrheim_2019, series={Lecture Notes in Computer Science}, title={Data Independence for Software Transactional Memory}, volume={11460}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">10.1007/978-3-030-20652-9\\_18</a>}, booktitle={{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings}, publisher={Springer}, author={König, Jürgen and Wehrheim, Heike}, editor={M. Badger, Julia and Yvonne Rozier, KristinEditors}, year={2019}, pages={263–279}, collection={Lecture Notes in Computer Science} }","mla":"König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional Memory.” <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i>, edited by Julia M. Badger and Kristin Yvonne Rozier, vol. 11460, Springer, 2019, pp. 263–79, doi:<a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">10.1007/978-3-030-20652-9\\_18</a>.","short":"J. König, H. Wehrheim, in: J. M. Badger, K. Yvonne Rozier (Eds.), {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings, Springer, 2019, pp. 263–279.","chicago":"König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional Memory.” In <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i>, edited by Julia M. Badger and Kristin Yvonne Rozier, 11460:263–79. Lecture Notes in Computer Science. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">https://doi.org/10.1007/978-3-030-20652-9\\_18</a>.","apa":"König, J., &#38; Wehrheim, H. (2019). Data Independence for Software Transactional Memory. In J. M. Badger &#38; K. Yvonne Rozier (Eds.), <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i> (Vol. 11460, pp. 263–279). Springer. <a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">https://doi.org/10.1007/978-3-030-20652-9\\_18</a>","ieee":"J. König and H. Wehrheim, “Data Independence for Software Transactional Memory,” in <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i>, 2019, vol. 11460, pp. 263–279."},"project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"page":"263-279","_id":"10091","publisher":"Springer","user_id":"22358","volume":11460,"editor":[{"last_name":"M. Badger","first_name":"Julia","full_name":"M. Badger, Julia"},{"full_name":"Yvonne Rozier, Kristin","first_name":"Kristin","last_name":"Yvonne Rozier"}],"status":"public","date_created":"2019-06-03T07:51:26Z","type":"conference","department":[{"_id":"77"}],"publication":"{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-20652-9\\_18","year":"2019","title":"Data Independence for Software Transactional Memory","author":[{"id":"22358","full_name":"König, Jürgen","last_name":"König","first_name":"Jürgen"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_updated":"2022-01-06T06:50:28Z","intvolume":"     11460"},{"type":"conference","department":[{"_id":"77"}],"date_created":"2019-06-03T07:59:36Z","project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"publication":"Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019","citation":{"bibtex":"@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2019, title={Verifying C11 programs operationally}, DOI={<a href=\"https://doi.org/10.1145/3293883.3295702\">10.1145/3293883.3295702</a>}, booktitle={Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019}, publisher={{ACM}}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, editor={K. Hollingsworth, Jeffrey and Keidar, IditEditors}, year={2019}, pages={355–365} }","chicago":"Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Verifying C11 Programs Operationally.” In <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i>, edited by Jeffrey K. Hollingsworth and Idit Keidar, 355–65. {ACM}, 2019. <a href=\"https://doi.org/10.1145/3293883.3295702\">https://doi.org/10.1145/3293883.3295702</a>.","ama":"Doherty S, Dongol B, Wehrheim H, Derrick J. Verifying C11 programs operationally. In: K. Hollingsworth J, Keidar I, eds. <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i>. {ACM}; 2019:355-365. doi:<a href=\"https://doi.org/10.1145/3293883.3295702\">10.1145/3293883.3295702</a>","short":"S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: J. K. Hollingsworth, I. Keidar (Eds.), Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019, {ACM}, 2019, pp. 355–365.","ieee":"S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Verifying C11 programs operationally,” in <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i>, 2019, pp. 355–365.","apa":"Doherty, S., Dongol, B., Wehrheim, H., &#38; Derrick, J. (2019). Verifying C11 programs operationally. In J. K. Hollingsworth &#38; I. Keidar (Eds.), <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i> (pp. 355–365). {ACM}. <a href=\"https://doi.org/10.1145/3293883.3295702\">https://doi.org/10.1145/3293883.3295702</a>","mla":"Doherty, Simon, et al. “Verifying C11 Programs Operationally.” <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i>, edited by Jeffrey K. Hollingsworth and Idit Keidar, {ACM}, 2019, pp. 355–65, doi:<a href=\"https://doi.org/10.1145/3293883.3295702\">10.1145/3293883.3295702</a>."},"doi":"10.1145/3293883.3295702","user_id":"29719","editor":[{"last_name":"K. Hollingsworth","first_name":"Jeffrey","full_name":"K. Hollingsworth, Jeffrey"},{"last_name":"Keidar","first_name":"Idit","full_name":"Keidar, Idit"}],"page":"355-365","_id":"10092","language":[{"iso":"eng"}],"publisher":"{ACM}","date_updated":"2022-01-06T06:50:28Z","year":"2019","title":"Verifying C11 programs operationally","status":"public","author":[{"full_name":"Doherty, Simon","first_name":"Simon","last_name":"Doherty"},{"first_name":"Brijesh","last_name":"Dongol","full_name":"Dongol, Brijesh"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"},{"full_name":"Derrick, John","last_name":"Derrick","first_name":"John"}]},{"status":"public","has_accepted_license":"1","page":"151--152","_id":"10093","publisher":"GI","ddc":["004"],"user_id":"477","editor":[{"full_name":"Becker, Steffen","last_name":"Becker","first_name":"Steffen"},{"full_name":"Bogicevic, Ivan","last_name":"Bogicevic","first_name":"Ivan"},{"first_name":"Georg","last_name":"Herzwurm","full_name":"Herzwurm, Georg"},{"last_name":"Wagner","first_name":"Stefan","full_name":"Wagner, Stefan"}],"volume":"P-292","file_date_updated":"2019-08-26T09:31:55Z","citation":{"bibtex":"@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2019, series={LNI}, title={Combining Verifiers in Conditional Model Checking via Reducers}, volume={P-292}, DOI={<a href=\"https://doi.org/10.18420/se2019-46\">10.18420/se2019-46</a>}, booktitle={Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019}, publisher={GI}, author={Beyer, Dirk and Jakobs, Marie-Christine and Lemberger, Thomas and Wehrheim, Heike}, editor={Becker, Steffen and Bogicevic, Ivan and Herzwurm, Georg and Wagner, StefanEditors}, year={2019}, pages={151--152}, collection={LNI} }","short":"D. Beyer, M.-C. Jakobs, T. Lemberger, H. Wehrheim, in: S. Becker, I. Bogicevic, G. Herzwurm, S. Wagner (Eds.), Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019, GI, 2019, pp. 151--152.","ama":"Beyer D, Jakobs M-C, Lemberger T, Wehrheim H. Combining Verifiers in Conditional Model Checking via Reducers. In: Becker S, Bogicevic I, Herzwurm G, Wagner S, eds. <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>. Vol P-292. LNI. GI; 2019:151--152. doi:<a href=\"https://doi.org/10.18420/se2019-46\">10.18420/se2019-46</a>","chicago":"Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim. “Combining Verifiers in Conditional Model Checking via Reducers.” In <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>, edited by Steffen Becker, Ivan Bogicevic, Georg Herzwurm, and Stefan Wagner, P-292:151--152. LNI. GI, 2019. <a href=\"https://doi.org/10.18420/se2019-46\">https://doi.org/10.18420/se2019-46</a>.","ieee":"D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Combining Verifiers in Conditional Model Checking via Reducers,” in <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>, 2019, vol. P-292, pp. 151--152.","apa":"Beyer, D., Jakobs, M.-C., Lemberger, T., &#38; Wehrheim, H. (2019). Combining Verifiers in Conditional Model Checking via Reducers. In S. Becker, I. Bogicevic, G. Herzwurm, &#38; S. Wagner (Eds.), <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i> (Vol. P-292, pp. 151--152). GI. <a href=\"https://doi.org/10.18420/se2019-46\">https://doi.org/10.18420/se2019-46</a>","mla":"Beyer, Dirk, et al. “Combining Verifiers in Conditional Model Checking via Reducers.” <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>, edited by Steffen Becker et al., vol. P-292, GI, 2019, pp. 151--152, doi:<a href=\"https://doi.org/10.18420/se2019-46\">10.18420/se2019-46</a>."},"project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"title":"Combining Verifiers in Conditional Model Checking via Reducers","year":"2019","author":[{"last_name":"Beyer","first_name":"Dirk","full_name":"Beyer, Dirk"},{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"},{"full_name":"Lemberger, Thomas","last_name":"Lemberger","first_name":"Thomas"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_updated":"2022-01-06T06:50:28Z","series_title":"LNI","language":[{"iso":"eng"}],"doi":"10.18420/se2019-46","publication":"Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019","file":[{"file_id":"12956","success":1,"content_type":"application/pdf","file_name":"46.pdf","file_size":472426,"access_level":"closed","relation":"main_file","date_updated":"2019-08-26T09:31:55Z","date_created":"2019-08-26T09:31:55Z","creator":"ups"}],"date_created":"2019-06-03T08:08:39Z","type":"conference","department":[{"_id":"77"}]},{"publication":"Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019","citation":{"chicago":"Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” In <i>Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019</i>, edited by Steffen Becker, Ivan Bogicevic, Georg Herzwurm, and Stefan Wagner, {P-292}:157–58. {LNI}. {GI}, 2019. <a href=\"https://doi.org/10.18420/se2019-48\">https://doi.org/10.18420/se2019-48</a>.","short":"A. Sharma, H. Wehrheim, in: S. Becker, I. Bogicevic, G. Herzwurm, S. Wagner (Eds.), Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019, {GI}, 2019, pp. 157–158.","apa":"Sharma, A., &#38; Wehrheim, H. (2019). Testing Balancedness of ML Algorithms. In S. Becker, I. Bogicevic, G. Herzwurm, &#38; S. Wagner (Eds.), <i>Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019</i> (Vol. {P-292}, pp. 157–158). {GI}. <a href=\"https://doi.org/10.18420/se2019-48\">https://doi.org/10.18420/se2019-48</a>","ieee":"A. Sharma and H. Wehrheim, “Testing Balancedness of ML Algorithms,” in <i>Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019</i>, 2019, vol. {P-292}, pp. 157–158.","ama":"Sharma A, Wehrheim H. Testing Balancedness of ML Algorithms. In: Becker S, Bogicevic I, Herzwurm G, Wagner S, eds. <i>Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019</i>. Vol {P-292}. {LNI}. {GI}; 2019:157-158. doi:<a href=\"https://doi.org/10.18420/se2019-48\">10.18420/se2019-48</a>","bibtex":"@inproceedings{Sharma_Wehrheim_2019, series={{LNI}}, title={Testing Balancedness of ML Algorithms}, volume={{P-292}}, DOI={<a href=\"https://doi.org/10.18420/se2019-48\">10.18420/se2019-48</a>}, booktitle={Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019}, publisher={{GI}}, author={Sharma, Arnab and Wehrheim, Heike}, editor={Becker, Steffen and Bogicevic, Ivan and Herzwurm, Georg and Wagner, StefanEditors}, year={2019}, pages={157–158}, collection={{LNI}} }","mla":"Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” <i>Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019</i>, edited by Steffen Becker et al., vol. {P-292}, {GI}, 2019, pp. 157–58, doi:<a href=\"https://doi.org/10.18420/se2019-48\">10.18420/se2019-48</a>."},"type":"conference","department":[{"_id":"77"}],"date_created":"2019-06-03T08:10:55Z","date_updated":"2022-01-06T06:50:28Z","status":"public","title":"Testing Balancedness of ML Algorithms","year":"2019","author":[{"id":"67200","last_name":"Sharma","first_name":"Arnab","full_name":"Sharma, Arnab"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"doi":"10.18420/se2019-48","user_id":"29719","editor":[{"full_name":"Becker, Steffen","last_name":"Becker","first_name":"Steffen"},{"last_name":"Bogicevic","first_name":"Ivan","full_name":"Bogicevic, Ivan"},{"last_name":"Herzwurm","first_name":"Georg","full_name":"Herzwurm, Georg"},{"full_name":"Wagner, Stefan","first_name":"Stefan","last_name":"Wagner"}],"volume":"{P-292}","page":"157-158","series_title":"{LNI}","_id":"10094","publisher":"{GI}","language":[{"iso":"eng"}]},{"doi":"10.1007/978-3-030-17502-3_19","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"intvolume":"     11429","date_updated":"2022-01-06T06:50:29Z","author":[{"full_name":"Richter, Cedric","first_name":"Cedric","last_name":"Richter","id":"50003"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"year":"2019","title":"PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)","department":[{"_id":"77"}],"type":"conference","date_created":"2019-06-03T08:12:55Z","file":[{"date_created":"2019-08-26T11:01:00Z","creator":"ups","file_id":"12961","success":1,"content_type":"application/pdf","file_name":"PeSCo.pdf","file_size":254772,"access_level":"closed","relation":"main_file","date_updated":"2019-08-26T11:01:00Z"}],"publication":"Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}","volume":11429,"editor":[{"full_name":"Beyer, Dirk","last_name":"Beyer","first_name":"Dirk"},{"first_name":"Marieke","last_name":"Huisman","full_name":"Huisman, Marieke"},{"full_name":"Kordon, Fabrice","last_name":"Kordon","first_name":"Fabrice"},{"full_name":"Steffen, Bernhard","last_name":"Steffen","first_name":"Bernhard"}],"user_id":"29719","ddc":["004"],"publisher":"Springer","_id":"10095","page":"229-233","has_accepted_license":"1","status":"public","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"bibtex":"@inproceedings{Richter_Wehrheim_2019, series={Lecture Notes in Computer Science}, title={PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)}, volume={11429}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">10.1007/978-3-030-17502-3_19</a>}, booktitle={Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}}, publisher={Springer}, author={Richter, Cedric and Wehrheim, Heike}, editor={Beyer, Dirk and Huisman, Marieke and Kordon, Fabrice and Steffen, BernhardEditors}, year={2019}, pages={229–233}, collection={Lecture Notes in Computer Science} }","ama":"Richter C, Wehrheim H. PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution). In: Beyer D, Huisman M, Kordon F, Steffen B, eds. <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>. Vol 11429. Lecture Notes in Computer Science. Springer; 2019:229-233. doi:<a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">10.1007/978-3-030-17502-3_19</a>","mla":"Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution).” <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>, edited by Dirk Beyer et al., vol. 11429, Springer, 2019, pp. 229–33, doi:<a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">10.1007/978-3-030-17502-3_19</a>.","chicago":"Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution).” In <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>, edited by Dirk Beyer, Marieke Huisman, Fabrice Kordon, and Bernhard Steffen, 11429:229–33. Lecture Notes in Computer Science. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">https://doi.org/10.1007/978-3-030-17502-3_19</a>.","short":"C. Richter, H. Wehrheim, in: D. Beyer, M. Huisman, F. Kordon, B. Steffen (Eds.), Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}, Springer, 2019, pp. 229–233.","ieee":"C. Richter and H. Wehrheim, “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution),” in <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>, 2019, vol. 11429, pp. 229–233.","apa":"Richter, C., &#38; Wehrheim, H. (2019). PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution). In D. Beyer, M. Huisman, F. Kordon, &#38; B. Steffen (Eds.), <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i> (Vol. 11429, pp. 229–233). Springer. <a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">https://doi.org/10.1007/978-3-030-17502-3_19</a>"},"file_date_updated":"2019-08-26T11:01:00Z"},{"publisher":"Universität Paderborn","_id":"10105","language":[{"iso":"eng"}],"user_id":"477","author":[{"first_name":"Jan","last_name":"Haltermann","full_name":"Haltermann, Jan"}],"title":"Analyzing Data Usage in Array Programs","year":"2019","status":"public","date_updated":"2022-01-06T06:50:29Z","date_created":"2019-06-04T10:54:08Z","department":[{"_id":"7"},{"_id":"77"}],"type":"mastersthesis","supervisor":[{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"citation":{"chicago":"Haltermann, Jan. <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn, 2019.","short":"J. Haltermann, Analyzing Data Usage in Array Programs, Universität Paderborn, 2019.","ieee":"J. Haltermann, <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn, 2019.","apa":"Haltermann, J. (2019). <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn.","bibtex":"@book{Haltermann_2019, title={Analyzing Data Usage in Array Programs}, publisher={Universität Paderborn}, author={Haltermann, Jan}, year={2019} }","ama":"Haltermann J. <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn; 2019.","mla":"Haltermann, Jan. <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn, 2019."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}]},{"year":"2019","title":"Automating Multi-Label Classification Extending ML-Plan","status":"public","conference":{"end_date":"2019-06-15","location":"Long Beach, CA, USA","name":"6th ICML Workshop on Automated Machine Learning (AutoML 2019)","start_date":"2019-06-09"},"author":[{"id":"33176","full_name":"Wever, Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik"},{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"id":"38209","first_name":"Alexander","last_name":"Tornede","full_name":"Tornede, Alexander"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"date_updated":"2022-01-06T06:50:33Z","has_accepted_license":"1","_id":"10232","language":[{"iso":"eng"}],"ddc":["006"],"user_id":"33176","file_date_updated":"2019-09-10T08:20:44Z","citation":{"ama":"Wever MD, Mohr F, Tornede A, Hüllermeier E. Automating Multi-Label Classification Extending ML-Plan. In: ; 2019.","short":"M.D. Wever, F. Mohr, A. Tornede, E. Hüllermeier, in: 2019.","chicago":"Wever, Marcel Dominik, Felix Mohr, Alexander Tornede, and Eyke Hüllermeier. “Automating Multi-Label Classification Extending ML-Plan,” 2019.","bibtex":"@inproceedings{Wever_Mohr_Tornede_Hüllermeier_2019, title={Automating Multi-Label Classification Extending ML-Plan}, author={Wever, Marcel Dominik and Mohr, Felix and Tornede, Alexander and Hüllermeier, Eyke}, year={2019} }","apa":"Wever, M. D., Mohr, F., Tornede, A., &#38; Hüllermeier, E. (2019). Automating Multi-Label Classification Extending ML-Plan. Presented at the 6th ICML Workshop on Automated Machine Learning (AutoML 2019), Long Beach, CA, USA.","mla":"Wever, Marcel Dominik, et al. <i>Automating Multi-Label Classification Extending ML-Plan</i>. 2019.","ieee":"M. D. Wever, F. Mohr, A. Tornede, and E. Hüllermeier, “Automating Multi-Label Classification Extending ML-Plan,” presented at the 6th ICML Workshop on Automated Machine Learning (AutoML 2019), Long Beach, CA, USA, 2019."},"abstract":[{"lang":"eng","text":"Existing tools for automated machine learning, such as Auto-WEKA, TPOT, auto-sklearn, and more recently ML-Plan, have shown impressive results for the tasks of single-label classification and regression. Yet, there is only little work on other types of machine learning problems so far. In particular, there is almost no work on automating the engineering of machine learning solutions for multi-label classification (MLC). We show how the scope of ML-Plan, an AutoML-tool for multi-class classification, can be extended towards MLC using MEKA, which is a multi-label extension of the well-known Java library WEKA. The resulting approach recursively refines MEKA's multi-label classifiers, nesting other multi-label classifiers for meta algorithms and single-label classifiers provided by WEKA as base learners. In our evaluation, we find that the proposed approach yields strong results and performs significantly better than a set of baselines we compare with."}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"file":[{"file_id":"13177","content_type":"application/pdf","relation":"main_file","date_updated":"2019-09-10T08:20:44Z","file_name":"Automating_MultiLabel_Classification_Extending_ML-Plan.pdf","access_level":"open_access","file_size":388191,"date_created":"2019-09-10T08:19:01Z","creator":"wever"}],"date_created":"2019-06-11T21:33:06Z","type":"conference","oa":"1","department":[{"_id":"355"}]},{"user_id":"477","language":[{"iso":"eng"}],"_id":"10271","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:33Z","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"status":"public","title":"Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves","year":"2019","department":[{"_id":"79"}],"type":"mastersthesis","date_created":"2019-06-19T11:31:38Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"citation":{"mla":"N., N. <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.","ama":"N. N. <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn; 2019.","bibtex":"@book{N._2019, title={Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","apa":"N., N. (2019). <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn.","ieee":"N. N., <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.","chicago":"N., N. <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.","short":"N. N., Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves, Universität Paderborn, 2019."}},{"publisher":"International Foundation for Autonomous Agents and Multiagent Systems","_id":"10281","page":"1949--1951","ddc":["004"],"user_id":"477","conference":{"name":"18th International Conference on Autonomous Agents and MultiAgent Systems","location":"Montreal QC, Canada"},"status":"public","has_accepted_license":"1","citation":{"ama":"Feldotto M, Lenzner P, Molitor L, Skopalik A.  From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. In: <i>Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems</i>. International Foundation for Autonomous Agents and Multiagent Systems; 2019:1949--1951.","bibtex":"@inproceedings{Feldotto_Lenzner_Molitor_Skopalik_2019, title={ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation}, booktitle={Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={Feldotto, Matthias and Lenzner, Pascal  and Molitor, Louise and Skopalik, Alexander}, year={2019}, pages={1949--1951} }","mla":"Feldotto, Matthias, et al. “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” <i>Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems</i>, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.","short":"M. Feldotto, P. Lenzner, L. Molitor, A. Skopalik, in: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.","chicago":"Feldotto, Matthias, Pascal  Lenzner, Louise Molitor, and Alexander Skopalik. “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” In <i>Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems</i>, 1949--1951. International Foundation for Autonomous Agents and Multiagent Systems, 2019.","apa":"Feldotto, M., Lenzner, P., Molitor, L., &#38; Skopalik, A. (2019).  From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. In <i>Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems</i> (pp. 1949--1951). Montreal QC, Canada: International Foundation for Autonomous Agents and Multiagent Systems.","ieee":"M. Feldotto, P. Lenzner, L. Molitor, and A. Skopalik, “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation,” in <i>Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems</i>, Montreal QC, Canada, 2019, pp. 1949--1951."},"file_date_updated":"2019-08-26T11:10:02Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://dl.acm.org/citation.cfm?id=3331973"}],"author":[{"id":"14052","orcid":"0000-0003-1348-6516","last_name":"Feldotto","first_name":"Matthias","full_name":"Feldotto, Matthias"},{"full_name":"Lenzner, Pascal ","first_name":"Pascal ","last_name":"Lenzner"},{"full_name":"Molitor, Louise","last_name":"Molitor","first_name":"Louise"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"year":"2019","title":" From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation","date_updated":"2022-01-06T06:50:33Z","publication_status":"published","date_created":"2019-06-20T14:46:08Z","file":[{"content_type":"application/pdf","success":1,"file_id":"12962","date_updated":"2019-08-26T11:10:02Z","relation":"main_file","access_level":"closed","file_size":698599,"file_name":"1903.04265.pdf","date_created":"2019-08-26T11:10:02Z","creator":"ups"}],"department":[{"_id":"541"},{"_id":"63"}],"type":"conference","publication":"Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems","abstract":[{"text":"Competing firms tend to select similar locations for their stores. This phenomenon, called the principle of minimum differentiation, was captured by Hotelling with a landmark model of spatial competition but is still the object of an ongoing scientific debate. Although consistently observed in practice, many more realistic variants of Hotelling's model fail to support minimum differentiation or do not have pure equilibria at all. In particular, it was recently proven for a generalized model which incorporates negative network externalities and which contains Hotelling's model and classical selfish load balancing as special cases, that the unique equilibria do not adhere to minimum differentiation. Furthermore, it was shown that for a significant parameter range pure equilibria do not exist. We derive a sharp contrast to these previous results by investigating Hotelling's model with negative network externalities from an entirely new angle: approximate pure subgame perfect equilibria. This approach allows us to prove analytically and via agent-based simulations that approximate equilibria having good approximation guarantees and that adhere to minimum differentiation exist for the full parameter range of the model. Moreover, we show that the obtained approximate equilibria have high social welfare.","lang":"eng"}]},{"department":[{"_id":"600"}],"type":"conference","place":"Cham","date_created":"2019-06-21T08:59:32Z","abstract":[{"lang":"eng","text":"We study text reuse related to Wikipedia at scale by compiling the first corpus of text reuse cases within Wikipedia as well as without (i.e., reuse of Wikipedia text in a sample of the Common Crawl). To discover reuse beyond verbatim copy and paste, we employ state-of-the-art text reuse detection technology, scaling it for the first time to process the entire Wikipedia as part of a distributed retrieval pipeline. We further report on a pilot analysis of the 100 million reuse cases inside, and the 1.6 million reuse cases outside Wikipedia that we discovered. Text reuse inside Wikipedia gives rise to new tasks such as article template induction, fixing quality flaws, or complementing Wikipedia's ontology. Text reuse outside Wikipedia yields a tangible metric for the emerging field of quantifying Wikipedia's influence on the web. To foster future research into these tasks, and for reproducibility's sake, the Wikipedia text reuse corpus and the retrieval pipeline are made freely available."}],"citation":{"mla":"Alshomary, Milad, et al. “Wikipedia Text Reuse: Within and Without.” <i>Advances in Information Retrieval</i>, edited by Leif Azzopardi et al., Springer International Publishing, 2019, pp. 747–54.","ama":"Alshomary M, Völske M, Licht T, et al. Wikipedia Text Reuse: Within and Without. In: Azzopardi L, Stein B, Fuhr N, Mayr P, Hauff C, Hiemstra D, eds. <i>Advances in Information Retrieval</i>. Cham: Springer International Publishing; 2019:747-754.","bibtex":"@inproceedings{Alshomary_Völske_Licht_Wachsmuth_Stein_Hagen_Potthast_2019, place={Cham}, title={Wikipedia Text Reuse: Within and Without}, booktitle={Advances in Information Retrieval}, publisher={Springer International Publishing}, author={Alshomary, Milad and Völske, Michael and Licht, Tristan and Wachsmuth, Henning and Stein, Benno and Hagen, Matthias and Potthast, Martin}, editor={Azzopardi, Leif and Stein, Benno and Fuhr, Norbert and Mayr, Philipp and Hauff, Claudia and Hiemstra, DjoerdEditors}, year={2019}, pages={747–754} }","apa":"Alshomary, M., Völske, M., Licht, T., Wachsmuth, H., Stein, B., Hagen, M., &#38; Potthast, M. (2019). Wikipedia Text Reuse: Within and Without. In L. Azzopardi, B. Stein, N. Fuhr, P. Mayr, C. Hauff, &#38; D. Hiemstra (Eds.), <i>Advances in Information Retrieval</i> (pp. 747–754). Cham: Springer International Publishing.","ieee":"M. Alshomary <i>et al.</i>, “Wikipedia Text Reuse: Within and Without,” in <i>Advances in Information Retrieval</i>, 2019, pp. 747–754.","short":"M. Alshomary, M. Völske, T. Licht, H. Wachsmuth, B. Stein, M. Hagen, M. Potthast, in: L. Azzopardi, B. Stein, N. Fuhr, P. Mayr, C. Hauff, D. Hiemstra (Eds.), Advances in Information Retrieval, Springer International Publishing, Cham, 2019, pp. 747–754.","chicago":"Alshomary, Milad, Michael Völske, Tristan Licht, Henning Wachsmuth, Benno Stein, Matthias Hagen, and Martin Potthast. “Wikipedia Text Reuse: Within and Without.” In <i>Advances in Information Retrieval</i>, edited by Leif Azzopardi, Benno Stein, Norbert Fuhr, Philipp Mayr, Claudia Hauff, and Djoerd Hiemstra, 747–54. Cham: Springer International Publishing, 2019."},"publication":"Advances in Information Retrieval","editor":[{"first_name":"Leif","last_name":"Azzopardi","full_name":"Azzopardi, Leif"},{"last_name":"Stein","first_name":"Benno","full_name":"Stein, Benno"},{"full_name":"Fuhr, Norbert","first_name":"Norbert","last_name":"Fuhr"},{"first_name":"Philipp","last_name":"Mayr","full_name":"Mayr, Philipp"},{"last_name":"Hauff","first_name":"Claudia","full_name":"Hauff, Claudia"},{"full_name":"Hiemstra, Djoerd","last_name":"Hiemstra","first_name":"Djoerd"}],"user_id":"82920","_id":"10284","language":[{"iso":"eng"}],"publisher":"Springer International Publishing","page":"747-754","main_file_link":[{"url":"https://webis.de/downloads/publications/papers/stein_2019c.pdf"}],"date_updated":"2022-01-06T06:50:34Z","author":[{"last_name":"Alshomary","first_name":"Milad","full_name":"Alshomary, Milad","id":"73059"},{"last_name":"Völske","first_name":"Michael","full_name":"Völske, Michael"},{"full_name":"Licht, Tristan","last_name":"Licht","first_name":"Tristan"},{"id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"},{"full_name":"Hagen, Matthias","first_name":"Matthias","last_name":"Hagen"},{"full_name":"Potthast, Martin","last_name":"Potthast","first_name":"Martin"}],"publication_identifier":{"isbn":["978-3-030-15712-8"]},"status":"public","year":"2019","title":"Wikipedia Text Reuse: Within and Without"},{"language":[{"iso":"eng"}],"_id":"10306","user_id":"47434","ddc":["000"],"status":"public","year":"2019","title":"Post-Quantum Secure Group Signatures","author":[{"full_name":"Porzenheim, Laurens Alexander","first_name":"Laurens Alexander","last_name":"Porzenheim","id":"47434"}],"date_updated":"2022-01-06T06:50:36Z","has_accepted_license":"1","file":[{"content_type":"application/pdf","file_id":"10307","file_size":899233,"access_level":"open_access","file_name":"thesis_final.pdf","date_updated":"2019-06-26T09:19:15Z","relation":"main_file","date_created":"2019-06-26T09:08:23Z","creator":"laurensp"}],"date_created":"2019-06-26T09:12:47Z","type":"mastersthesis","department":[{"_id":"64"}],"oa":"1","file_date_updated":"2019-06-26T09:19:15Z","citation":{"chicago":"Porzenheim, Laurens Alexander. <i>Post-Quantum Secure Group Signatures</i>, 2019.","short":"L.A. Porzenheim, Post-Quantum Secure Group Signatures, 2019.","apa":"Porzenheim, L. A. (2019). <i>Post-Quantum Secure Group Signatures</i>.","ieee":"L. A. Porzenheim, <i>Post-Quantum Secure Group Signatures</i>. 2019.","ama":"Porzenheim LA. <i>Post-Quantum Secure Group Signatures</i>.; 2019.","bibtex":"@book{Porzenheim_2019, title={Post-Quantum Secure Group Signatures}, author={Porzenheim, Laurens Alexander}, year={2019} }","mla":"Porzenheim, Laurens Alexander. <i>Post-Quantum Secure Group Signatures</i>. 2019."},"supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}]},{"_id":"10325","publisher":"Springer","ddc":["004"],"user_id":"477","status":"public","has_accepted_license":"1","oa":"1","citation":{"mla":"Peuster, Manuel, et al. “Automated Testing of NFV Orchestrators against Carrier-Grade Multi-PoP Scenarios Using Emulation-Based Smoke Testing.” <i>EURASIP Journal on Wireless Communications and Networking</i>, Springer, 2019, doi:<a href=\"https://doi.org/10.1186/s13638-019-1493-2\">10.1186/s13638-019-1493-2</a>.","apa":"Peuster, M., Marchetti, M., García de Blas, G., &#38; Karl, H. (2019). Automated testing of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based smoke testing. <i>EURASIP Journal on Wireless Communications and Networking</i>. <a href=\"https://doi.org/10.1186/s13638-019-1493-2\">https://doi.org/10.1186/s13638-019-1493-2</a>","ieee":"M. Peuster, M. Marchetti, G. García de Blas, and H. Karl, “Automated testing of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based smoke testing,” <i>EURASIP Journal on Wireless Communications and Networking</i>, 2019.","ama":"Peuster M, Marchetti M, García de Blas G, Karl H. Automated testing of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based smoke testing. <i>EURASIP Journal on Wireless Communications and Networking</i>. 2019. doi:<a href=\"https://doi.org/10.1186/s13638-019-1493-2\">10.1186/s13638-019-1493-2</a>","short":"M. Peuster, M. Marchetti, G. García de Blas, H. Karl, EURASIP Journal on Wireless Communications and Networking (2019).","chicago":"Peuster, Manuel, Michael Marchetti, Gerardo García de Blas, and Holger Karl. “Automated Testing of NFV Orchestrators against Carrier-Grade Multi-PoP Scenarios Using Emulation-Based Smoke Testing.” <i>EURASIP Journal on Wireless Communications and Networking</i>, 2019. <a href=\"https://doi.org/10.1186/s13638-019-1493-2\">https://doi.org/10.1186/s13638-019-1493-2</a>.","bibtex":"@article{Peuster_Marchetti_García de Blas_Karl_2019, title={Automated testing of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based smoke testing}, DOI={<a href=\"https://doi.org/10.1186/s13638-019-1493-2\">10.1186/s13638-019-1493-2</a>}, journal={EURASIP Journal on Wireless Communications and Networking}, publisher={Springer}, author={Peuster, Manuel and Marchetti, Michael and García de Blas, Gerardo and Karl, Holger}, year={2019} }"},"file_date_updated":"2019-08-26T11:13:00Z","project":[{"name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28","grant_number":"761493"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://jwcn-eurasipjournals.springeropen.com/articles/10.1186/s13638-019-1493-2"}],"doi":"10.1186/s13638-019-1493-2","author":[{"first_name":"Manuel","last_name":"Peuster","full_name":"Peuster, Manuel","id":"13271"},{"last_name":"Marchetti","first_name":"Michael","full_name":"Marchetti, Michael"},{"full_name":"García de Blas, Gerardo","last_name":"García de Blas","first_name":"Gerardo"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"publication_identifier":{"issn":["1687-1499"]},"year":"2019","title":"Automated testing of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based smoke testing","date_updated":"2022-01-06T06:50:37Z","publication_status":"published","date_created":"2019-06-27T06:42:38Z","file":[{"file_id":"12963","content_type":"application/pdf","success":1,"file_name":"s13638-019-1493-2.pdf","access_level":"closed","file_size":1750901,"relation":"main_file","date_updated":"2019-08-26T11:13:00Z","date_created":"2019-08-26T11:13:00Z","creator":"ups"}],"department":[{"_id":"75"}],"type":"journal_article","publication":"EURASIP Journal on Wireless Communications and Networking"},{"author":[{"last_name":"Pukrop","first_name":"Simon","full_name":"Pukrop, Simon"}],"year":"2019","status":"public","title":"Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine","date_updated":"2022-01-06T06:50:37Z","_id":"10344","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"477","citation":{"bibtex":"@book{Pukrop_2019, title={Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine}, publisher={Universität Paderborn}, author={Pukrop, Simon}, year={2019} }","ama":"Pukrop S. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine</i>. Universität Paderborn; 2019.","mla":"Pukrop, Simon. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine</i>. Universität Paderborn, 2019.","chicago":"Pukrop, Simon. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine</i>. Universität Paderborn, 2019.","short":"S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine, Universität Paderborn, 2019.","ieee":"S. Pukrop, <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine</i>. Universität Paderborn, 2019.","apa":"Pukrop, S. (2019). <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine</i>. Universität Paderborn."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"date_created":"2019-07-04T07:21:19Z","department":[{"_id":"63"}],"type":"mastersthesis"},{"user_id":"13703","ddc":["000"],"volume":11738,"_id":"13554","has_accepted_license":"1","status":"public","conference":{"name":"Security and Trust Management, STM 2019"},"oa":"1","file_date_updated":"2019-10-01T07:45:17Z","citation":{"apa":"Blömer, J., &#38; Löken, N. (2019). Personal Cross-Platform Reputation. In <i>Security and Trust Management, STM 2019</i> (Vol. 11738). <a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">https://doi.org/10.1007/978-3-030-31511-5_9</a>","ieee":"J. Blömer and N. Löken, “Personal Cross-Platform Reputation,” in <i>Security and Trust Management, STM 2019</i>, 2019, vol. 11738.","short":"J. Blömer, N. Löken, in: Security and Trust Management, STM 2019, 2019.","chicago":"Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.” In <i>Security and Trust Management, STM 2019</i>, Vol. 11738. LNCS, 2019. <a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">https://doi.org/10.1007/978-3-030-31511-5_9</a>.","mla":"Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.” <i>Security and Trust Management, STM 2019</i>, vol. 11738, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">10.1007/978-3-030-31511-5_9</a>.","ama":"Blömer J, Löken N. Personal Cross-Platform Reputation. In: <i>Security and Trust Management, STM 2019</i>. Vol 11738. LNCS. ; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">10.1007/978-3-030-31511-5_9</a>","bibtex":"@inproceedings{Blömer_Löken_2019, series={LNCS}, title={Personal Cross-Platform Reputation}, volume={11738}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">10.1007/978-3-030-31511-5_9</a>}, booktitle={Security and Trust Management, STM 2019}, author={Blömer, Johannes and Löken, Nils}, year={2019}, collection={LNCS} }"},"doi":"10.1007/978-3-030-31511-5_9","series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:38Z","intvolume":"     11738","title":"Personal Cross-Platform Reputation","year":"2019","author":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"},{"id":"13703","full_name":"Löken, Nils","first_name":"Nils","last_name":"Löken"}],"type":"conference","department":[{"_id":"568"},{"_id":"64"}],"file":[{"file_size":507736,"relation":"main_file","date_updated":"2019-10-01T07:45:17Z","file_id":"13555","content_type":"application/pdf","title":"Personal cross-platform reputation, author's version","creator":"nilo","description":"This is an author's version of the paper presented at STM 2019.","file_name":"informal.pdf","access_level":"open_access","date_created":"2019-10-01T07:45:17Z"}],"date_created":"2019-10-01T07:50:03Z","abstract":[{"lang":"eng","text":"We propose a novel personal reputation system for cross-platform reputation. We observe that, in certain usage scenarios, e.g. crowd work, the rater anonymity property typically imposed on reputation systems is not necessary. Instead, we propose a relaxed notion of rater anonymity that is more applicable in the crowd work scenario. This allows us to construct a secure personal reputation system from simple cryptographic primitives."}],"publication":"Security and Trust Management, STM 2019"},{"author":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"},{"last_name":"Löken","first_name":"Nils","full_name":"Löken, Nils","id":"13703"}],"title":"Dynamic Searchable Encryption with Access Control","year":"2019","status":"public","intvolume":"     12056","date_updated":"2022-01-06T06:51:38Z","_id":"13557","language":[{"iso":"eng"}],"publisher":"Springer","series_title":"LNCS","main_file_link":[{"url":"http://eprint.iacr.org/2019/1038","open_access":"1"}],"volume":12056,"user_id":"13703","citation":{"mla":"Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access Control.” <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i>, vol. 12056, Springer, 2019.","bibtex":"@inproceedings{Blömer_Löken_2019, series={LNCS}, title={Dynamic Searchable Encryption with Access Control}, volume={12056}, booktitle={12th International Symposium on Foundations and Practice of Security, FPS 2019}, publisher={Springer}, author={Blömer, Johannes and Löken, Nils}, year={2019}, collection={LNCS} }","ama":"Blömer J, Löken N. Dynamic Searchable Encryption with Access Control. In: <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i>. Vol 12056. LNCS. Springer; 2019.","ieee":"J. Blömer and N. Löken, “Dynamic Searchable Encryption with Access Control,” in <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i>, 2019, vol. 12056.","apa":"Blömer, J., &#38; Löken, N. (2019). Dynamic Searchable Encryption with Access Control. In <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i> (Vol. 12056). Springer.","chicago":"Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access Control.” In <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i>, Vol. 12056. LNCS. Springer, 2019.","short":"J. Blömer, N. Löken, in: 12th International Symposium on Foundations and Practice of Security, FPS 2019, Springer, 2019."},"publication":"12th International Symposium on Foundations and Practice of Security, FPS 2019","abstract":[{"lang":"eng","text":"We present a searchable encryption scheme for dynamic document collections in a multi-user scenario. Our scheme features fine-grained access control to search results, as well as access control to operations such as adding documents to the document collection, or changing individual documents. The scheme features verifiability of search results. Our scheme also satisfies the forward privacy notion crucial for the security of dynamic searchable encryption schemes."}],"date_created":"2019-10-01T08:05:31Z","oa":"1","department":[{"_id":"64"},{"_id":"568"}],"type":"conference"},{"title":"Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java","status":"public","year":"2019","author":[{"full_name":"Pilot, Matthias","last_name":"Pilot","first_name":"Matthias"}],"date_updated":"2022-01-06T06:51:40Z","_id":"13592","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"477","citation":{"short":"M. Pilot, Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java, Universität Paderborn, 2019.","chicago":"Pilot, Matthias. <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. Universität Paderborn, 2019.","apa":"Pilot, M. (2019). <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. Universität Paderborn.","ieee":"M. Pilot, <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. Universität Paderborn, 2019.","ama":"Pilot M. <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. Universität Paderborn; 2019.","bibtex":"@book{Pilot_2019, title={Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java}, publisher={Universität Paderborn}, author={Pilot, Matthias}, year={2019} }","mla":"Pilot, Matthias. <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. Universität Paderborn, 2019."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"extern":"1","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"date_created":"2019-10-03T12:30:24Z","type":"bachelorsthesis","department":[{"_id":"7"},{"_id":"64"}]},{"date_updated":"2022-01-06T06:51:41Z","title":"Implementation and Comparison of Elliptic Curve Algorithms in Java","year":"2019","author":[{"full_name":"Scholz, Swante","last_name":"Scholz","first_name":"Swante"}],"language":[{"iso":"eng"}],"extern":"1","type":"mastersthesis","department":[{"_id":"7"},{"_id":"64"}],"file":[{"date_created":"2020-04-27T10:32:00Z","creator":"jbobolz","file_id":"16871","content_type":"application/pdf","file_name":"sscholz-MA-thesis-final.pdf","access_level":"open_access","file_size":1714805,"relation":"main_file","date_updated":"2020-04-27T10:33:59Z"}],"date_created":"2019-10-07T09:56:58Z","has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"477","_id":"13648","publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"file_date_updated":"2020-04-27T10:33:59Z","supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"citation":{"apa":"Scholz, S. (2019). <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. Universität Paderborn.","ieee":"S. Scholz, <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. Universität Paderborn, 2019.","chicago":"Scholz, Swante. <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. Universität Paderborn, 2019.","short":"S. Scholz, Implementation and Comparison of Elliptic Curve Algorithms in Java, Universität Paderborn, 2019.","mla":"Scholz, Swante. <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. Universität Paderborn, 2019.","ama":"Scholz S. <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. Universität Paderborn; 2019.","bibtex":"@book{Scholz_2019, title={Implementation and Comparison of Elliptic Curve Algorithms in Java}, publisher={Universität Paderborn}, author={Scholz, Swante}, year={2019} }"},"oa":"1"},{"date_updated":"2022-01-06T06:51:41Z","author":[{"full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal","first_name":"Kristian","id":"32229"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Struijs, Martijn","first_name":"Martijn","last_name":"Struijs"}],"status":"public","year":"2019","title":"Fast Distributed Algorithms for LP-Type Problems of Low Dimension","doi":"10.4230/LIPICS.DISC.2019.23","user_id":"32229","language":[{"iso":"eng"}],"_id":"13652","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"citation":{"apa":"Hinnenthal, K., Scheideler, C., &#38; Struijs, M. (2019). Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>. <a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">https://doi.org/10.4230/LIPICS.DISC.2019.23</a>","ieee":"K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms for LP-Type Problems of Low Dimension,” in <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>, 2019.","chicago":"Hinnenthal, Kristian, Christian Scheideler, and Martijn Struijs. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” In <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>, 2019. <a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">https://doi.org/10.4230/LIPICS.DISC.2019.23</a>.","short":"K. Hinnenthal, C. Scheideler, M. Struijs, in: 33rd International Symposium on Distributed Computing (DISC 2019), 2019.","mla":"Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">10.4230/LIPICS.DISC.2019.23</a>.","ama":"Hinnenthal K, Scheideler C, Struijs M. Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In: <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>. ; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">10.4230/LIPICS.DISC.2019.23</a>","bibtex":"@inproceedings{Hinnenthal_Scheideler_Struijs_2019, title={Fast Distributed Algorithms for LP-Type Problems of Low Dimension}, DOI={<a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">10.4230/LIPICS.DISC.2019.23</a>}, booktitle={33rd International Symposium on Distributed Computing (DISC 2019)}, author={Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn}, year={2019} }"},"publication":"33rd International Symposium on Distributed Computing (DISC 2019)","department":[{"_id":"79"}],"type":"conference","date_created":"2019-10-08T11:53:38Z"},{"supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}],"citation":{"bibtex":"@book{Brauer_2019, place={Paderborn}, title={Classification and Approximation of Geometric Location Problems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-816\">10.17619/UNIPB/1-816</a>}, author={Brauer, Sascha}, year={2019} }","chicago":"Brauer, Sascha. <i>Classification and Approximation of Geometric Location Problems</i>. Paderborn, 2019. <a href=\"https://doi.org/10.17619/UNIPB/1-816\">https://doi.org/10.17619/UNIPB/1-816</a>.","ama":"Brauer S. <i>Classification and Approximation of Geometric Location Problems</i>. Paderborn; 2019. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-816\">10.17619/UNIPB/1-816</a>","short":"S. Brauer, Classification and Approximation of Geometric Location Problems, Paderborn, 2019.","ieee":"S. Brauer, <i>Classification and Approximation of Geometric Location Problems</i>. Paderborn, 2019.","mla":"Brauer, Sascha. <i>Classification and Approximation of Geometric Location Problems</i>. 2019, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-816\">10.17619/UNIPB/1-816</a>.","apa":"Brauer, S. (2019). <i>Classification and Approximation of Geometric Location Problems</i>. Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-816\">https://doi.org/10.17619/UNIPB/1-816</a>"},"project":[{"_id":"45","name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen"}],"place":"Paderborn","date_created":"2019-10-09T10:00:53Z","type":"dissertation","department":[{"_id":"64"}],"title":"Classification and Approximation of Geometric Location Problems","year":"2019","status":"public","author":[{"id":"13291","full_name":"Brauer, Sascha","first_name":"Sascha","last_name":"Brauer"}],"date_updated":"2022-01-06T06:51:41Z","_id":"13679","language":[{"iso":"eng"}],"doi":"10.17619/UNIPB/1-816","user_id":"13291"}]