[{"date_created":"2018-09-03T08:04:19Z","department":[{"_id":"64"}],"type":"conference","citation":{"short":"J. Blömer, S. Brauer, K. Bujna, in: 29th International Symposium on Algorithms and Computation  (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12.","chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Coresets for Fuzzy K-Means with Applications.” In <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>, 46:1--46:12. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">https://doi.org/10.4230/LIPIcs.ISAAC.2018.46</a>.","apa":"Blömer, J., Brauer, S., &#38; Bujna, K. (2018). Coresets for Fuzzy K-Means with Applications. In <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i> (pp. 46:1--46:12). Jiaoxi, Yilan County, Taiwan: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">https://doi.org/10.4230/LIPIcs.ISAAC.2018.46</a>","ieee":"J. Blömer, S. Brauer, and K. Bujna, “Coresets for Fuzzy K-Means with Applications,” in <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>, Jiaoxi, Yilan County, Taiwan, 2018, pp. 46:1--46:12.","ama":"Blömer J, Brauer S, Bujna K. Coresets for Fuzzy K-Means with Applications. In: <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:46:1--46:12. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">10.4230/LIPIcs.ISAAC.2018.46</a>","bibtex":"@inproceedings{Blömer_Brauer_Bujna_2018, title={Coresets for Fuzzy K-Means with Applications}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">10.4230/LIPIcs.ISAAC.2018.46</a>}, booktitle={29th International Symposium on Algorithms and Computation  (ISAAC 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2018}, pages={46:1--46:12} }","mla":"Blömer, Johannes, et al. “Coresets for Fuzzy K-Means with Applications.” <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">10.4230/LIPIcs.ISAAC.2018.46</a>."},"publication":"29th International Symposium on Algorithms and Computation  (ISAAC 2018)","project":[{"_id":"45","name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen"}],"_id":"4344","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","page":"46:1--46:12","user_id":"13291","doi":"10.4230/LIPIcs.ISAAC.2018.46","publication_identifier":{"isbn":["978-3-95977-094-1"]},"author":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"},{"first_name":"Sascha","last_name":"Brauer","full_name":"Brauer, Sascha","id":"13291"},{"full_name":"Bujna, Kathrin","first_name":"Kathrin","last_name":"Bujna"}],"conference":{"location":"Jiaoxi, Yilan County, Taiwan","start_date":"2018-12-17","name":"29th International Symposium on Algorithms and Computation (ISAAC)","end_date":"2018-12-19"},"title":"Coresets for Fuzzy K-Means with Applications","year":"2018","status":"public","publication_status":"published","date_updated":"2022-01-06T07:00:57Z"},{"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","abstract":[{"lang":"eng","text":"\tWe extend the concept of monotonic searchability~\\cite{DBLP:conf/opodis/ScheidelerSS15}~\\cite{DBLP:conf/wdag/ScheidelerSS16} for self-stabilizing systems from one to multiple dimensions.\r\n\tA system is self-stabilizing if it can recover to a legitimate state from any initial illegal state.\r\n\tThese kind of systems are most often used in distributed applications.\r\n\tMonotonic searchability provides guarantees when searching for nodes while the recovery process is going on.\r\n\tMore precisely, if a search request started at some node $u$ succeeds in reaching its destination $v$, then all future search requests from $u$ to $v$ succeed as well.\r\n\tAlthough there already exists a self-stabilizing protocol for a two-dimensional topology~\\cite{DBLP:journals/tcs/JacobRSS12} and an universal approach for monotonic searchability~\\cite{DBLP:conf/wdag/ScheidelerSS16}, it is not clear how both of these concepts fit together effectively.\r\n\tThe latter concept even comes with some restrictive assumptions on messages, which is not the case for our protocol.\r\n\tWe propose a simple novel protocol for a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability.\r\n\tOur protocol can easily be extended to higher dimensions and offers routing in $\\mathcal O(\\log n)$ hops for any search request.\r\n"}],"date_created":"2018-09-04T14:15:39Z","file":[{"creator":"mfeldma2","date_created":"2018-10-31T13:24:17Z","file_name":"Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf","access_level":"closed","file_size":329823,"relation":"main_file","date_updated":"2018-10-31T13:24:17Z","file_id":"5210","success":1,"content_type":"application/pdf"}],"department":[{"_id":"79"}],"type":"conference","author":[{"id":"23538","full_name":"Feldmann, Michael","first_name":"Michael","last_name":"Feldmann"},{"full_name":"Kolb, Christina","last_name":"Kolb","first_name":"Christina","id":"43647"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"publication_identifier":{"unknown":["978-3-030-03231-9"]},"year":"2018","title":"Self-stabilizing Overlays for high-dimensional Monotonic Searchability","intvolume":"     11201","date_updated":"2022-01-06T07:00:58Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-030-03232-6_2","citation":{"apa":"Feldmann, M., Kolb, C., &#38; Scheideler, C. (2018). Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (Vol. 11201, pp. 16–31). Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">https://doi.org/10.1007/978-3-030-03232-6_2</a>","ieee":"M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional Monotonic Searchability,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2018, vol. 11201, pp. 16–31.","chicago":"Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 11201:16–31. Lecture Notes in Computer Science. Springer, Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">https://doi.org/10.1007/978-3-030-03232-6_2</a>.","short":"M. Feldmann, C. Kolb, C. Scheideler, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018, pp. 16–31.","mla":"Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, vol. 11201, Springer, Cham, 2018, pp. 16–31, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>.","ama":"Feldmann M, Kolb C, Scheideler C. Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In: <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes in Computer Science. Springer, Cham; 2018:16-31. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>","bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_2018, series={Lecture Notes in Computer Science}, title={Self-stabilizing Overlays for high-dimensional Monotonic Searchability}, volume={11201}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian}, year={2018}, pages={16–31}, collection={Lecture Notes in Computer Science} }"},"file_date_updated":"2018-10-31T13:24:17Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"external_id":{"arxiv":["1808.10300"]},"status":"public","has_accepted_license":"1","_id":"4351","publisher":"Springer, Cham","page":"16-31 ","volume":11201,"user_id":"23538","ddc":["040"]},{"date_created":"2018-09-11T05:26:59Z","file":[{"relation":"main_file","date_updated":"2018-11-27T10:03:33Z","file_name":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf","file_size":1122875,"access_level":"closed","file_id":"5863","success":1,"content_type":"application/pdf","creator":"tillk","date_created":"2018-11-27T10:03:33Z"}],"department":[{"_id":"63"},{"_id":"79"}],"keyword":["Distributed Storage","Multi-Dimensional Range Queries","Peer-to-Peer","Hilbert Curve"],"type":"conference","publication":"Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","abstract":[{"lang":"eng","text":"We present a peer-to-peer network that supports the efficient processing of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional point space.\\\\\r\nThe  network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$ is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore, if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers."}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-19759-9_4","author":[{"first_name":"Markus","last_name":"Benter","full_name":"Benter, Markus"},{"id":"39241","full_name":"Knollmann, Till","first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"11108","first_name":"Alexander","last_name":"Setzer","full_name":"Setzer, Alexander"},{"id":"38705","full_name":"Sundermeier, Jannik","first_name":"Jannik","last_name":"Sundermeier"}],"year":"2018","title":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension","date_updated":"2022-01-06T07:01:00Z","citation":{"bibtex":"@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018, title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>}, booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik}, year={2018} }","ama":"Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In: <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>","short":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.","chicago":"Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>.","ieee":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier, “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension,” in <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, Helsinki, 2018.","mla":"Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>.","apa":"Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &#38; Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. Helsinki. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>"},"file_date_updated":"2018-11-27T10:03:33Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"4375","user_id":"14955","ddc":["000"],"conference":{"start_date":"2018-08-20","name":"4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","location":"Helsinki","end_date":"2018-08-21"},"status":"public","has_accepted_license":"1"},{"file_date_updated":"2018-11-02T13:37:38Z","citation":{"bibtex":"@inproceedings{Pauck_Bodden_Wehrheim_2018, title={Do Android taint analysis tools keep their promises?}, DOI={<a href=\"https://doi.org/10.1145/3236024.3236029\">10.1145/3236024.3236029</a>}, booktitle={Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018}, publisher={ACM Press}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, year={2018} }","ama":"Pauck F, Bodden E, Wehrheim H. Do Android taint analysis tools keep their promises? In: <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3236024.3236029\">10.1145/3236024.3236029</a>","mla":"Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3236024.3236029\">10.1145/3236024.3236029</a>.","short":"F. Pauck, E. Bodden, H. Wehrheim, in: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018, ACM Press, 2018.","chicago":"Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis Tools Keep Their Promises?” In <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3236024.3236029\">https://doi.org/10.1145/3236024.3236029</a>.","ieee":"F. Pauck, E. Bodden, and H. Wehrheim, “Do Android taint analysis tools keep their promises?,” in <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>, 2018.","apa":"Pauck, F., Bodden, E., &#38; Wehrheim, H. (2018). Do Android taint analysis tools keep their promises? In <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>. ACM Press. <a href=\"https://doi.org/10.1145/3236024.3236029\">https://doi.org/10.1145/3236024.3236029</a>"},"project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901","_id":"1"}],"_id":"4999","publisher":"ACM Press","user_id":"477","ddc":["004"],"status":"public","has_accepted_license":"1","file":[{"file_id":"5251","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T13:37:38Z","file_name":"fse18main-id76-p.pdf","file_size":524169,"access_level":"closed","date_created":"2018-11-02T13:37:38Z","creator":"ups"}],"date_created":"2018-10-30T08:03:17Z","type":"conference","department":[{"_id":"77"},{"_id":"76"}],"publication":"Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018","language":[{"iso":"eng"}],"doi":"10.1145/3236024.3236029","year":"2018","title":"Do Android taint analysis tools keep their promises?","author":[{"full_name":"Pauck, Felix","first_name":"Felix","last_name":"Pauck","id":"22398"},{"id":"59256","last_name":"Bodden","first_name":"Eric","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"publication_identifier":{"isbn":["9781450355735"]},"publication_status":"published","date_updated":"2022-01-06T07:01:34Z"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"citation":{"ieee":"S. Krüger, J. Späth, K. Ali, E. Bodden, and M. Mezini, “CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs,” in <i>European Conference on Object-Oriented Programming (ECOOP)</i>, 2018, pp. 10:1-10:27.","apa":"Krüger, S., Späth, J., Ali, K., Bodden, E., &#38; Mezini, M. (2018). CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs. In <i>European Conference on Object-Oriented Programming (ECOOP)</i> (pp. 10:1-10:27).","mla":"Krüger, Stefan, et al. “CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs.” <i>European Conference on Object-Oriented Programming (ECOOP)</i>, 2018, pp. 10:1-10:27.","bibtex":"@inproceedings{Krüger_Späth_Ali_Bodden_Mezini_2018, title={CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs}, booktitle={European Conference on Object-Oriented Programming (ECOOP)}, author={Krüger, Stefan and Späth, Johannes and Ali, Karim and Bodden, Eric and Mezini, Mira}, year={2018}, pages={10:1-10:27} }","ama":"Krüger S, Späth J, Ali K, Bodden E, Mezini M. CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs. In: <i>European Conference on Object-Oriented Programming (ECOOP)</i>. ; 2018:10:1-10:27.","short":"S. Krüger, J. Späth, K. Ali, E. Bodden, M. Mezini, in: European Conference on Object-Oriented Programming (ECOOP), 2018, pp. 10:1-10:27.","chicago":"Krüger, Stefan, Johannes Späth, Karim Ali, Eric Bodden, and Mira Mezini. “CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs.” In <i>European Conference on Object-Oriented Programming (ECOOP)</i>, 10:1-10:27, 2018."},"file_date_updated":"2018-11-02T13:51:05Z","has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"477","_id":"5203","page":"10:1-10:27","publication":"European Conference on Object-Oriented Programming (ECOOP)","department":[{"_id":"76"}],"type":"conference","keyword":["ITSECWEBSITE","CROSSING"],"date_created":"2018-10-31T12:37:29Z","file":[{"creator":"ups","date_created":"2018-11-02T13:51:05Z","file_name":"ksa+18crysl.pdf","access_level":"closed","file_size":747259,"relation":"main_file","date_updated":"2018-11-02T13:51:05Z","file_id":"5255","success":1,"content_type":"application/pdf"}],"date_updated":"2022-01-06T07:01:44Z","author":[{"full_name":"Krüger, Stefan","first_name":"Stefan","last_name":"Krüger"},{"full_name":"Späth, Johannes","first_name":"Johannes","last_name":"Späth"},{"full_name":"Ali, Karim","last_name":"Ali","first_name":"Karim"},{"last_name":"Bodden","orcid":"0000-0003-3470-3647","first_name":"Eric","full_name":"Bodden, Eric","id":"59256"},{"full_name":"Mezini, Mira","last_name":"Mezini","first_name":"Mira"}],"year":"2018","title":"CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://bodden.de/pubs/ksa+18crysl.pdf"}]},{"file_date_updated":"2018-10-31T16:09:48Z","citation":{"mla":"Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">10.1007/978-3-030-03232-6_16</a>.","bibtex":"@inproceedings{Scheideler_Setzer_2018, title={Relays: A New Approach for the Finite Departure Problem in Overlay Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">10.1007/978-3-030-03232-6_16</a>}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}, author={Scheideler, Christian and Setzer, Alexander}, year={2018} }","ama":"Scheideler C, Setzer A. Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In: <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">10.1007/978-3-030-03232-6_16</a>","ieee":"C. Scheideler and A. Setzer, “Relays: A New Approach for the Finite Departure Problem in Overlay Networks,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, Tokyo, Japan, 2018.","apa":"Scheideler, C., &#38; Setzer, A. (2018). Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>. Tokyo, Japan. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">https://doi.org/10.1007/978-3-030-03232-6_16</a>","chicago":"Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">https://doi.org/10.1007/978-3-030-03232-6_16</a>.","short":"C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"5216","ddc":["040"],"user_id":"11108","status":"public","conference":{"location":"Tokyo, Japan","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)"},"has_accepted_license":"1","file":[{"relation":"main_file","date_updated":"2018-10-31T16:09:48Z","file_name":"Scheideler-Setzer2018_Chapter_RelaysANewApproachForTheFinite.pdf","file_size":369818,"access_level":"closed","file_id":"5223","content_type":"application/pdf","creator":"asetzer","date_created":"2018-10-31T15:51:45Z"}],"date_created":"2018-10-31T13:33:05Z","type":"conference","department":[{"_id":"79"}],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","abstract":[{"text":"A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. To rigorously study self-stabilizing solutions to this problem, the Finite Departure Problem (FDP) has been proposed [9]. In the FDP we are given a network of processes in an arbitrary state, and the goal is to eventually arrive at (and stay in) a state in which all leaving processes irrevocably decided to leave the system while for all weakly-connected components in the initial overlay network, all staying processes in that component will still form a weakly connected component. In the standard interconnection model, the FDP is known to be unsolvable by local control protocols, so oracles have been investigated that allow the problem to be solved [9]. To avoid the use of oracles, we introduce a new interconnection model based on relays. Despite the relay model appearing to be rather restrictive, we show that it is universal, i.e., it is possible to transform any weakly-connected topology into any other weakly-connected topology, which is important for being a useful interconnection model for overlay networks. Apart from this, our model allows processes to grant and revoke access rights, which is why we believe it to be of interest beyond the scope of this paper. We show how to implement the relay layer in a self-stabilizing way and identify properties protocols need to satisfy so that the relay layer can recover while serving protocol requests.","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-03232-6_16","year":"2018","title":"Relays: A New Approach for the Finite Departure Problem in Overlay Networks","author":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Setzer, Alexander","first_name":"Alexander","last_name":"Setzer","id":"11108"}],"date_updated":"2022-01-06T07:01:47Z","publication_status":"published"},{"file_date_updated":"2018-10-31T15:59:26Z","citation":{"ama":"Götte T, Scheideler C, Setzer A. On Underlay-Aware Self-Stabilizing Overlay Networks. In: <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>. Vol 11201. Lecture Notes in Computer Science. Springer; 2018:50-64.","bibtex":"@inproceedings{Götte_Scheideler_Setzer_2018, series={Lecture Notes in Computer Science}, title={On Underlay-Aware Self-Stabilizing Overlay Networks}, volume={11201}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}, publisher={Springer}, author={Götte, Thorsten and Scheideler, Christian and Setzer, Alexander}, year={2018}, pages={50–64}, collection={Lecture Notes in Computer Science} }","mla":"Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, vol. 11201, Springer, 2018, pp. 50–64.","short":"T. Götte, C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Springer, 2018, pp. 50–64.","chicago":"Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware Self-Stabilizing Overlay Networks.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, 11201:50–64. Lecture Notes in Computer Science. Springer, 2018.","apa":"Götte, T., Scheideler, C., &#38; Setzer, A. (2018). On Underlay-Aware Self-Stabilizing Overlay Networks. In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i> (Vol. 11201, pp. 50–64). Tokyo, Japan: Springer.","ieee":"T. Götte, C. Scheideler, and A. Setzer, “On Underlay-Aware Self-Stabilizing Overlay Networks,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, Tokyo, Japan, 2018, vol. 11201, pp. 50–64."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","conference":{"location":"Tokyo, Japan","name":" 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)"},"has_accepted_license":"1","page":"50-64","_id":"5222","publisher":"Springer","ddc":["040"],"user_id":"477","volume":11201,"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","abstract":[{"text":"We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of their shortest path in the tree. We rigorously prove that our protocol works correctly under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes after O(N^2) asynchronous rounds where N is the number of nodes in the overlay. ","lang":"eng"}],"file":[{"date_created":"2018-10-31T15:59:26Z","creator":"thgoette","success":1,"content_type":"application/pdf","file_id":"5224","date_updated":"2018-10-31T15:59:26Z","relation":"main_file","access_level":"closed","file_size":367812,"file_name":"sss18_camera.pdf"}],"date_created":"2018-10-31T15:44:30Z","type":"conference","department":[{"_id":"79"}],"title":"On Underlay-Aware Self-Stabilizing Overlay Networks","year":"2018","author":[{"id":"34727","first_name":"Thorsten","last_name":"Götte","full_name":"Götte, Thorsten"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Alexander","last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108"}],"date_updated":"2022-01-06T07:01:47Z","intvolume":"     11201","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science"},{"_id":"5368","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477","status":"public","year":"2018","title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten","author":[{"full_name":"Jochmaring, Moritz","last_name":"Jochmaring","first_name":"Moritz"}],"date_updated":"2022-01-06T07:01:50Z","date_created":"2018-11-06T06:21:37Z","type":"bachelorsthesis","department":[{"_id":"79"}],"citation":{"ieee":"M. Jochmaring, <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn, 2018.","apa":"Jochmaring, M. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn.","short":"M. Jochmaring, Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.","chicago":"Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","mla":"Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","bibtex":"@book{Jochmaring_2018, title={Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität Paderborn}, author={Jochmaring, Moritz}, year={2018} }","ama":"Jochmaring M. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn; 2018."},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}]},{"date_updated":"2022-01-06T07:01:51Z","author":[{"last_name":"Geromel","first_name":"Marcel","full_name":"Geromel, Marcel"}],"year":"2018","status":"public","title":"Mobile Facility Leasing","user_id":"477","language":[{"iso":"eng"}],"_id":"5403","publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"citation":{"ama":"Geromel M. <i>Mobile Facility Leasing</i>. Universität Paderborn; 2018.","bibtex":"@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität Paderborn}, author={Geromel, Marcel}, year={2018} }","mla":"Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","chicago":"Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","short":"M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.","apa":"Geromel, M. (2018). <i>Mobile Facility Leasing</i>. Universität Paderborn.","ieee":"M. Geromel, <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018."},"department":[{"_id":"63"}],"type":"bachelorsthesis","date_created":"2018-11-07T09:20:59Z"},{"department":[{"_id":"63"}],"type":"bachelorsthesis","date_created":"2018-11-07T09:23:17Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"citation":{"ieee":"P. I. Kolpaczki, <i>Online Algorithmen für das k-Page Migration Problem</i>. Universität Paderborn, 2018.","apa":"Kolpaczki, P. I. (2018). <i>Online Algorithmen für das k-Page Migration Problem</i>. Universität Paderborn.","short":"P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität Paderborn, 2018.","chicago":"Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn, 2018.","mla":"Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn, 2018.","bibtex":"@book{Kolpaczki_2018, title={Online Algorithmen für das k-Page Migration Problem}, publisher={Universität Paderborn}, author={Kolpaczki, Patrick Irenäus}, year={2018} }","ama":"Kolpaczki PI. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn; 2018."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"user_id":"477","language":[{"iso":"eng"}],"_id":"5404","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:51Z","author":[{"last_name":"Kolpaczki","first_name":"Patrick Irenäus","full_name":"Kolpaczki, Patrick Irenäus"}],"status":"public","year":"2018","title":"Online Algorithmen für das k-Page Migration Problem"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"14","name":"SFB 901 - Subproject C2"}],"supervisor":[{"id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian","full_name":"Plessl, Christian"}],"citation":{"apa":"Filmwala, T. (2018). <i>Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate it on FPGA Platform</i>. Universität Paderborn.","ieee":"T. Filmwala, <i>Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate it on FPGA Platform</i>. Universität Paderborn, 2018.","chicago":"Filmwala, Tasneem. <i>Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate It on FPGA Platform</i>. Universität Paderborn, 2018.","short":"T. Filmwala, Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate It on FPGA Platform, Universität Paderborn, 2018.","mla":"Filmwala, Tasneem. <i>Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate It on FPGA Platform</i>. Universität Paderborn, 2018.","ama":"Filmwala T. <i>Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate It on FPGA Platform</i>. Universität Paderborn; 2018.","bibtex":"@book{Filmwala_2018, title={Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate it on FPGA Platform}, publisher={Universität Paderborn}, author={Filmwala, Tasneem}, year={2018} }"},"department":[{"_id":"27"},{"_id":"518"}],"type":"mastersthesis","date_created":"2018-11-07T15:14:26Z","date_updated":"2022-01-06T07:01:52Z","author":[{"first_name":"Tasneem","last_name":"Filmwala","full_name":"Filmwala, Tasneem"}],"year":"2018","title":"Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate it on FPGA Platform","status":"public","user_id":"477","language":[{"iso":"eng"}],"_id":"5414","publisher":"Universität Paderborn"},{"_id":"5421","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477","year":"2018","status":"public","title":"Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL","author":[{"full_name":"Gadewar, Onkar","first_name":"Onkar","last_name":"Gadewar"}],"date_updated":"2022-01-06T07:01:53Z","date_created":"2018-11-07T16:16:56Z","type":"mastersthesis","department":[{"_id":"27"},{"_id":"518"}],"supervisor":[{"last_name":"Plessl","first_name":"Christian","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153"}],"citation":{"ama":"Gadewar O. <i>Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL</i>. Universität Paderborn; 2018.","bibtex":"@book{Gadewar_2018, title={Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL}, publisher={Universität Paderborn}, author={Gadewar, Onkar}, year={2018} }","mla":"Gadewar, Onkar. <i>Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL</i>. Universität Paderborn, 2018.","short":"O. Gadewar, Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL, Universität Paderborn, 2018.","chicago":"Gadewar, Onkar. <i>Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL</i>. Universität Paderborn, 2018.","apa":"Gadewar, O. (2018). <i>Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL</i>. Universität Paderborn.","ieee":"O. Gadewar, <i>Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL</i>. Universität Paderborn, 2018."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C2","_id":"14"}]},{"user_id":"13703","language":[{"iso":"ger"}],"_id":"5426","date_updated":"2022-01-06T07:01:53Z","author":[{"full_name":"von Heißen, Oliver","last_name":"von Heißen","first_name":"Oliver"}],"year":"2018","title":"Implementierung und Analyse von Searchable Encryption","status":"public","department":[{"_id":"64"}],"type":"bachelorsthesis","date_created":"2018-11-08T10:13:08Z","extern":"1","supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"citation":{"ieee":"O. von Heißen, <i>Implementierung und Analyse von Searchable Encryption</i>. 2018.","apa":"von Heißen, O. (2018). <i>Implementierung und Analyse von Searchable Encryption</i>.","short":"O. von Heißen, Implementierung und Analyse von Searchable Encryption, 2018.","chicago":"Heißen, Oliver von. <i>Implementierung und Analyse von Searchable Encryption</i>, 2018.","mla":"von Heißen, Oliver. <i>Implementierung und Analyse von Searchable Encryption</i>. 2018.","bibtex":"@book{von Heißen_2018, title={Implementierung und Analyse von Searchable Encryption}, author={von Heißen, Oliver}, year={2018} }","ama":"von Heißen O. <i>Implementierung und Analyse von Searchable Encryption</i>.; 2018."}},{"type":"conference","department":[{"_id":"558"}],"file":[{"date_created":"2018-11-08T12:53:03Z","creator":"abirke","content_type":"application/octet-stream","file_id":"5440","access_level":"closed","file_size":486642,"file_name":"2018-543","date_updated":"2018-11-08T12:53:03Z","relation":"main_file"}],"date_created":"2018-11-08T12:47:45Z","file_date_updated":"2018-11-08T12:53:03Z","publication":"Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II","citation":{"short":"K. Gjøsteen, T. Jager, in: Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II, 2018.","chicago":"Gjøsteen, Kristian, and Tibor Jager. “Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange.” In <i>Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II</i>, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96881-0_4\">https://doi.org/10.1007/978-3-319-96881-0_4</a>.","ieee":"K. Gjøsteen and T. Jager, “Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange,” in <i>Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II</i>, 2018.","apa":"Gjøsteen, K., &#38; Jager, T. (2018). Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange. In <i>Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II</i>. <a href=\"https://doi.org/10.1007/978-3-319-96881-0_4\">https://doi.org/10.1007/978-3-319-96881-0_4</a>","bibtex":"@inproceedings{Gjøsteen_Jager_2018, title={Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-96881-0_4\">10.1007/978-3-319-96881-0_4</a>}, booktitle={Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II}, author={Gjøsteen, Kristian and Jager, Tibor}, year={2018} }","ama":"Gjøsteen K, Jager T. Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange. In: <i>Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-319-96881-0_4\">10.1007/978-3-319-96881-0_4</a>","mla":"Gjøsteen, Kristian, and Tibor Jager. “Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange.” <i>Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-319-96881-0_4\">10.1007/978-3-319-96881-0_4</a>."},"user_id":"38235","ddc":["006"],"doi":"10.1007/978-3-319-96881-0_4","main_file_link":[{"url":"https://eprint.iacr.org/2018/543.pdf"}],"_id":"5438","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T07:01:53Z","has_accepted_license":"1","status":"public","title":"Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange","year":"2018","author":[{"last_name":"Gjøsteen","first_name":"Kristian","full_name":"Gjøsteen, Kristian"},{"last_name":"Jager","first_name":"Tibor","full_name":"Jager, Tibor","id":"64669"}]},{"ddc":["006"],"user_id":"38235","publisher":"ACM Press","_id":"5442","has_accepted_license":"1","status":"public","file_date_updated":"2018-11-08T12:57:34Z","citation":{"apa":"Jager, T., Kakvi, S., &#38; May, A. (2018). On the Security of the PKCS#1 v1.5 Signature Scheme. In <i>Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18</i>. ACM Press. <a href=\"https://doi.org/10.1145/3243734.3243798\">https://doi.org/10.1145/3243734.3243798</a>","ieee":"T. Jager, S. Kakvi, and A. May, “On the Security of the PKCS#1 v1.5 Signature Scheme,” in <i>Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18</i>, 2018.","chicago":"Jager, Tibor, Saqib Kakvi, and Alexander May. “On the Security of the PKCS#1 v1.5 Signature Scheme.” In <i>Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3243734.3243798\">https://doi.org/10.1145/3243734.3243798</a>.","short":"T. Jager, S. Kakvi, A. May, in: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18, ACM Press, 2018.","mla":"Jager, Tibor, et al. “On the Security of the PKCS#1 v1.5 Signature Scheme.” <i>Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3243734.3243798\">10.1145/3243734.3243798</a>.","ama":"Jager T, Kakvi S, May A. On the Security of the PKCS#1 v1.5 Signature Scheme. In: <i>Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3243734.3243798\">10.1145/3243734.3243798</a>","bibtex":"@inproceedings{Jager_Kakvi_May_2018, title={On the Security of the PKCS#1 v1.5 Signature Scheme}, DOI={<a href=\"https://doi.org/10.1145/3243734.3243798\">10.1145/3243734.3243798</a>}, booktitle={Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18}, publisher={ACM Press}, author={Jager, Tibor and Kakvi, Saqib and May, Alexander}, year={2018} }"},"doi":"10.1145/3243734.3243798","main_file_link":[{"url":"https://eprint.iacr.org/2018/855.pdf"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:54Z","publication_status":"published","title":"On the Security of the PKCS#1 v1.5 Signature Scheme","year":"2018","publication_identifier":{"isbn":["9781450356930"]},"author":[{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"full_name":"Kakvi, Saqib","first_name":"Saqib","last_name":"Kakvi","id":"66268"},{"full_name":"May, Alexander","first_name":"Alexander","last_name":"May"}],"type":"conference","department":[{"_id":"558"}],"file":[{"creator":"abirke","date_created":"2018-11-08T12:57:34Z","file_size":481982,"access_level":"closed","file_name":"2018-855.pdf","date_updated":"2018-11-08T12:57:34Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5443"}],"date_created":"2018-11-08T12:56:04Z","publication":"Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS '18"},{"abstract":[{"text":"In diesem Beitrag werden simulatorische und messtechnische EMV-Untersuchungen von Gleichspannungswandlern vorgestellt. Der Fokus liegt auf leitungsgeführten Störspannungen, ihre Abhängigkeit vom Schaltungslayout und ihre Unterdrückung durch Filterung. Der Simulationsprozess besteht aus kombinierten Feld- und Netzwerksimulationen. Zur Bewertung der Simulationsresultate werden zwei Prototypen gezeigt, die gute und schlechte EMV-Eigenschaften aufweisen. Bei der Beurteilung der Resultate wird insbesondere Wert auf die Untersuchung gelegt, inwieweit einfache Schaltungssimulationen ausreichen, um leitungsgeführte Störspannungen korrekt vorherzusagen und wann aufwändigere Feldsimulationen notwendig sind.","lang":"ger"}],"publication":"Elektromagnetische Verträglichkeit - Internationale Fachmesse und Kongress 2018","citation":{"chicago":"Baumgarten, Tim, Peter Scholz, Denis Sievers, and Jens Förstner. “Simulation Leitungsgeführter Störspannungen von DC-DC-Wandlern.” In <i>Elektromagnetische Verträglichkeit - Internationale Fachmesse Und Kongress 2018</i>, edited by Heyno Garbe, 47, 2018.","short":"T. Baumgarten, P. Scholz, D. Sievers, J. Förstner, in: H. Garbe (Ed.), Elektromagnetische Verträglichkeit - Internationale Fachmesse Und Kongress 2018, 2018, p. 47.","apa":"Baumgarten, T., Scholz, P., Sievers, D., &#38; Förstner, J. (2018). Simulation leitungsgeführter Störspannungen von DC-DC-Wandlern. In H. Garbe (Ed.), <i>Elektromagnetische Verträglichkeit - Internationale Fachmesse und Kongress 2018</i> (p. 47). Düsseldorf.","ieee":"T. Baumgarten, P. Scholz, D. Sievers, and J. Förstner, “Simulation leitungsgeführter Störspannungen von DC-DC-Wandlern,” in <i>Elektromagnetische Verträglichkeit - Internationale Fachmesse und Kongress 2018</i>, Düsseldorf, 2018, p. 47.","ama":"Baumgarten T, Scholz P, Sievers D, Förstner J. Simulation leitungsgeführter Störspannungen von DC-DC-Wandlern. In: Garbe H, ed. <i>Elektromagnetische Verträglichkeit - Internationale Fachmesse Und Kongress 2018</i>. ; 2018:47.","bibtex":"@inproceedings{Baumgarten_Scholz_Sievers_Förstner_2018, title={Simulation leitungsgeführter Störspannungen von DC-DC-Wandlern}, booktitle={Elektromagnetische Verträglichkeit - Internationale Fachmesse und Kongress 2018}, author={Baumgarten, Tim and Scholz, Peter and Sievers, Denis and Förstner, Jens}, editor={Garbe, HeynoEditor}, year={2018}, pages={47} }","mla":"Baumgarten, Tim, et al. “Simulation Leitungsgeführter Störspannungen von DC-DC-Wandlern.” <i>Elektromagnetische Verträglichkeit - Internationale Fachmesse Und Kongress 2018</i>, edited by Heyno Garbe, 2018, p. 47."},"type":"conference","department":[{"_id":"61"}],"date_created":"2018-11-08T23:44:10Z","date_updated":"2022-01-06T07:01:55Z","title":"Simulation leitungsgeführter Störspannungen von DC-DC-Wandlern","status":"public","year":"2018","author":[{"last_name":"Baumgarten","first_name":"Tim","full_name":"Baumgarten, Tim"},{"first_name":"Peter","last_name":"Scholz","full_name":"Scholz, Peter"},{"full_name":"Sievers, Denis","first_name":"Denis","last_name":"Sievers"},{"id":"158","full_name":"Förstner, Jens","first_name":"Jens","last_name":"Förstner","orcid":"0000-0001-7059-9862"}],"publication_identifier":{"isbn":["978-3-95735-077-0"]},"conference":{"name":"emv Internationale Fachmesse und Kongress 2018","location":"Düsseldorf"},"user_id":"158","editor":[{"full_name":"Garbe, Heyno","last_name":"Garbe","first_name":"Heyno"}],"page":"47","_id":"5469","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T07:01:57Z","author":[{"first_name":"Bahar","last_name":"Jazayeri","full_name":"Jazayeri, Bahar","id":"36399"},{"first_name":"Olaf","last_name":"Zimmermann","full_name":"Zimmermann, Olaf"},{"first_name":"Jochen","last_name":"Küster","full_name":"Küster, Jochen"},{"last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor","id":"107"},{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"},{"id":"36372","full_name":"Szopinski, Daniel","first_name":"Daniel","last_name":"Szopinski"}],"year":"2018","title":"Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options","language":[{"iso":"eng"}],"series_title":"To appear","abstract":[{"text":"Software companies nowadays create ecosystems of users and third-party providers around their platforms. They often provide online stores so that the third-party developments can be exposed to users directly. The resulting ecosystems differ significantly from each other in their architectural designs because their providers differ in terms of business goals and contexts. Until now, this architectural diversity and rationale behind it are not well-understood. Therefore, it is not clear which software features contribute to ecosystem’s success with respect to certain business goals and context. This hinders systematic creation of ecosystems in the future. Thus, decision-making becomes too risky; for future ecosystem providers, which may lead to creation of inefficient ecosystems that lack critical features, and for third-party providers to rely on ad-hoc choices while deciding on suitability of an ecosystem for their future career. In this paper, we introduce three design patterns for store- oriented software ecosystems by classifying the design decisions, business goals, and context of 111 store-oriented software ecosystems. Each design pattern provides an architectural solution to achieve a different business goal while supporting a different context. We discuss how the design patterns are applied together in order to achieve more business goals. Our work supports ecosystem and third-party providers by sharing practice-proven architectural solutions, helping them to take informed architectural decisions and reduce technical risks.","lang":"eng"}],"publication":"The Latin American Conference on Pattern Languages of Programs (SLPLoP)","department":[{"_id":"66"},{"_id":"276"}],"type":"conference","date_created":"2018-11-12T16:02:14Z","file":[{"date_created":"2018-11-29T23:41:07Z","creator":"bahareh","file_id":"5983","success":1,"content_type":"application/pdf","file_name":"Jazayerietal-SLPLoP18.pdf","file_size":514038,"access_level":"closed","relation":"main_file","date_updated":"2018-11-29T23:41:07Z"}],"has_accepted_license":"1","conference":{"start_date":"2018-11-20","end_date":"2018-11-23"},"status":"public","ddc":["000"],"user_id":"36399","publisher":"ACM. To appear","_id":"5530","project":[{"_id":"1","name":"SFB 901"},{"_id":"17","name":"SFB 901 - Subproject C5"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"ama":"Jazayeri B, Zimmermann O, Küster J, Engels G, Kundisch D, Szopinski D. Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options. In: <i>The Latin American Conference on Pattern Languages of Programs (SLPLoP)</i>. To appear. Valparaíso, Chile: ACM. To appear; 2018.","bibtex":"@inproceedings{Jazayeri_Zimmermann_Küster_Engels_Kundisch_Szopinski_2018, place={Valparaíso, Chile}, series={To appear}, title={Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options}, booktitle={The Latin American Conference on Pattern Languages of Programs (SLPLoP)}, publisher={ACM. To appear}, author={Jazayeri, Bahar and Zimmermann, Olaf and Küster, Jochen and Engels, Gregor and Kundisch, Dennis and Szopinski, Daniel}, year={2018}, collection={To appear} }","mla":"Jazayeri, Bahar, et al. “Patterns of Store-Oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options.” <i>The Latin American Conference on Pattern Languages of Programs (SLPLoP)</i>, ACM. To appear, 2018.","short":"B. Jazayeri, O. Zimmermann, J. Küster, G. Engels, D. Kundisch, D. Szopinski, in: The Latin American Conference on Pattern Languages of Programs (SLPLoP), ACM. To appear, Valparaíso, Chile, 2018.","chicago":"Jazayeri, Bahar, Olaf Zimmermann, Jochen Küster, Gregor Engels, Dennis Kundisch, and Daniel Szopinski. “Patterns of Store-Oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options.” In <i>The Latin American Conference on Pattern Languages of Programs (SLPLoP)</i>. To Appear. Valparaíso, Chile: ACM. To appear, 2018.","apa":"Jazayeri, B., Zimmermann, O., Küster, J., Engels, G., Kundisch, D., &#38; Szopinski, D. (2018). Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options. In <i>The Latin American Conference on Pattern Languages of Programs (SLPLoP)</i>. Valparaíso, Chile: ACM. To appear.","ieee":"B. Jazayeri, O. Zimmermann, J. Küster, G. Engels, D. Kundisch, and D. Szopinski, “Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options,” in <i>The Latin American Conference on Pattern Languages of Programs (SLPLoP)</i>, 2018."},"file_date_updated":"2018-11-29T23:41:07Z","place":"Valparaíso, Chile"},{"publication_status":"published","date_updated":"2022-01-06T07:01:59Z","year":"2018","title":"A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes","publication_identifier":{"isbn":["9781538674796"]},"author":[{"first_name":"Achim","last_name":"Lösch","full_name":"Lösch, Achim","id":"43646"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"}],"doi":"10.1109/asap.2018.8445098","language":[{"iso":"eng"}],"publication":"2018 IEEE 29th International Conference on Application-specific Systems, Architectures and Processors (ASAP)","type":"conference","department":[{"_id":"78"}],"file":[{"date_created":"2018-11-14T09:40:42Z","creator":"aloesch","success":1,"content_type":"application/pdf","file_id":"5552","access_level":"closed","file_size":2464949,"file_name":"loesch_asap2018.pdf","date_updated":"2018-11-14T09:40:42Z","relation":"main_file"}],"date_created":"2018-11-14T09:26:53Z","has_accepted_license":"1","status":"public","conference":{"end_date":"2018-07-12","start_date":"2018-07-10","name":"The 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors","location":"Milan, Italy"},"user_id":"43646","ddc":["040"],"publisher":"IEEE","_id":"5547","project":[{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901","_id":"1"}],"file_date_updated":"2018-11-14T09:40:42Z","citation":{"ieee":"A. Lösch and M. Platzner, “A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes,” in <i>2018 IEEE 29th International Conference on Application-specific Systems, Architectures and Processors (ASAP)</i>, Milan, Italy, 2018.","apa":"Lösch, A., &#38; Platzner, M. (2018). A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes. In <i>2018 IEEE 29th International Conference on Application-specific Systems, Architectures and Processors (ASAP)</i>. Milan, Italy: IEEE. <a href=\"https://doi.org/10.1109/asap.2018.8445098\">https://doi.org/10.1109/asap.2018.8445098</a>","chicago":"Lösch, Achim, and Marco Platzner. “A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes.” In <i>2018 IEEE 29th International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/asap.2018.8445098\">https://doi.org/10.1109/asap.2018.8445098</a>.","short":"A. Lösch, M. Platzner, in: 2018 IEEE 29th International Conference on Application-Specific Systems, Architectures and Processors (ASAP), IEEE, 2018.","mla":"Lösch, Achim, and Marco Platzner. “A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes.” <i>2018 IEEE 29th International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/asap.2018.8445098\">10.1109/asap.2018.8445098</a>.","bibtex":"@inproceedings{Lösch_Platzner_2018, title={A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes}, DOI={<a href=\"https://doi.org/10.1109/asap.2018.8445098\">10.1109/asap.2018.8445098</a>}, booktitle={2018 IEEE 29th International Conference on Application-specific Systems, Architectures and Processors (ASAP)}, publisher={IEEE}, author={Lösch, Achim and Platzner, Marco}, year={2018} }","ama":"Lösch A, Platzner M. A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes. In: <i>2018 IEEE 29th International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/asap.2018.8445098\">10.1109/asap.2018.8445098</a>"}},{"user_id":"35343","ddc":["000"],"_id":"6483","publisher":"IEEE","has_accepted_license":"1","conference":{"end_date":"2018-11-29","name":"IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp","start_date":"2018-11-27","location":"Verona"},"status":"public","oa":"1","place":"Verona","project":[{"_id":"28","grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"citation":{"short":"M. Peuster, S.B. Schneider, F. Christ, H. Karl, in: IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp, IEEE, Verona, 2018.","chicago":"Peuster, Manuel, Stefan Balthasar Schneider, Frederic Christ, and Holger Karl. “A Prototyping Platform to Validate and Verify Network Service Header-Based Service Chains.” In <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>. Verona: IEEE, 2018.","apa":"Peuster, M., Schneider, S. B., Christ, F., &#38; Karl, H. (2018). A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains. In <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>. Verona: IEEE.","ieee":"M. Peuster, S. B. Schneider, F. Christ, and H. Karl, “A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains,” in <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>, Verona, 2018.","ama":"Peuster M, Schneider SB, Christ F, Karl H. A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains. In: <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>. Verona: IEEE; 2018.","bibtex":"@inproceedings{Peuster_Schneider_Christ_Karl_2018, place={Verona}, title={A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains}, booktitle={IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp}, publisher={IEEE}, author={Peuster, Manuel and Schneider, Stefan Balthasar and Christ, Frederic and Karl, Holger}, year={2018} }","mla":"Peuster, Manuel, et al. “A Prototyping Platform to Validate and Verify Network Service Header-Based Service Chains.” <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>, IEEE, 2018."},"file_date_updated":"2019-01-04T07:46:21Z","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:07Z","author":[{"id":"13271","first_name":"Manuel","last_name":"Peuster","full_name":"Peuster, Manuel"},{"id":"35343","first_name":"Stefan Balthasar","last_name":"Schneider","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar"},{"first_name":"Frederic","last_name":"Christ","full_name":"Christ, Frederic"},{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"}],"title":"A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains","year":"2018","department":[{"_id":"75"}],"type":"conference","date_created":"2019-01-04T07:47:19Z","file":[{"date_created":"2019-01-04T07:46:21Z","creator":"peuster","file_id":"6484","content_type":"application/pdf","file_name":"main_for_ris.pdf","access_level":"open_access","file_size":541469,"relation":"main_file","date_updated":"2019-01-04T07:46:21Z"}],"publication":"IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp"},{"project":[{"_id":"28","grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps"}],"report_number":"draft-rosa-bmwg-vnfbench","citation":{"ama":"Rosa RV, Rothenberg CE, Peuster M, Karl H. <i>Methodology for VNF Benchmarking Automation</i>. IETF","bibtex":"@book{Rosa_Rothenberg_Peuster_Karl, title={Methodology for VNF Benchmarking Automation}, publisher={IETF}, author={Rosa, Raphael Vicente and Rothenberg, Christian Esteve and Peuster, Manuel and Karl, Holger} }","mla":"Rosa, Raphael Vicente, et al. <i>Methodology for VNF Benchmarking Automation</i>. IETF.","chicago":"Rosa, Raphael Vicente, Christian Esteve Rothenberg, Manuel Peuster, and Holger Karl. <i>Methodology for VNF Benchmarking Automation</i>. IETF, n.d.","short":"R.V. Rosa, C.E. Rothenberg, M. Peuster, H. Karl, Methodology for VNF Benchmarking Automation, IETF, n.d.","apa":"Rosa, R. V., Rothenberg, C. E., Peuster, M., &#38; Karl, H. (n.d.). <i>Methodology for VNF Benchmarking Automation</i>. IETF.","ieee":"R. V. Rosa, C. E. Rothenberg, M. Peuster, and H. Karl, <i>Methodology for VNF Benchmarking Automation</i>. IETF."},"type":"report","oa":"1","department":[{"_id":"75"}],"date_created":"2019-01-04T07:53:50Z","date_updated":"2022-01-06T07:03:07Z","publication_status":"draft","title":"Methodology for VNF Benchmarking Automation","year":"2018","status":"public","author":[{"full_name":"Rosa, Raphael Vicente","first_name":"Raphael Vicente","last_name":"Rosa"},{"first_name":"Christian Esteve","last_name":"Rothenberg","full_name":"Rothenberg, Christian Esteve"},{"last_name":"Peuster","first_name":"Manuel","full_name":"Peuster, Manuel","id":"13271"},{"id":"126","first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"}],"user_id":"13271","main_file_link":[{"url":"https://datatracker.ietf.org/doc/draft-rosa-bmwg-vnfbench/","open_access":"1"}],"publisher":"IETF","_id":"6485","language":[{"iso":"eng"}]}]