[{"date_updated":"2022-01-06T06:59:36Z","title":"Randomized Online Algorithms for Set Cover Leasing Problems","year":"2014","author":[{"last_name":"Abshoff","first_name":"Sebastian","full_name":"Abshoff, Sebastian"},{"id":"37612","first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"doi":"10.1007/978-3-319-12691-3_3","series_title":"LNCS","abstract":[{"text":"In the leasing variant of Set Cover presented by Anthony et al.[1], elements U arrive over time and must be covered by sets from a familyF of subsets of U. Each set can be leased for K different periods of time.Let |U| = n and |F| = m. Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements for the next lk time steps. The objectiveis to minimize the total cost of the sets leased, such that elements arrivingat any time t are covered by sets which contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log n)-approximation forthe problem in the offline setting, unless P = NP [22]. In this paper, wegive randomized algorithms for variants of Set Cover Leasing in the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented by Alon et al. [2], where elements appear multiple times andmust be covered by a different set at each arrival. Our results improve theO(log2(mn)) competitive factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)), where d is the maximum numberof sets an element belongs to.","lang":"eng"}],"publication":"Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","type":"conference","department":[{"_id":"63"}],"file":[{"date_created":"2018-03-20T07:12:57Z","creator":"florida","file_id":"1395","content_type":"application/pdf","success":1,"file_name":"379-COCOA14.pdf","file_size":214299,"access_level":"closed","relation":"main_file","date_updated":"2018-03-20T07:12:57Z"}],"date_created":"2017-10-17T12:42:06Z","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"15504","page":"25-34","_id":"379","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-20T07:12:57Z","citation":{"mla":"Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing Problems.” <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2014, pp. 25–34, doi:<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>.","bibtex":"@inproceedings{Abshoff_Markarian_Meyer auf der Heide_2014, series={LNCS}, title={Randomized Online Algorithms for Set Cover Leasing Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>}, booktitle={Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Abshoff, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2014}, pages={25–34}, collection={LNCS} }","ama":"Abshoff S, Markarian C, Meyer auf der Heide F. Randomized Online Algorithms for Set Cover Leasing Problems. In: <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2014:25-34. doi:<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>","ieee":"S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms for Set Cover Leasing Problems,” in <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2014, pp. 25–34.","apa":"Abshoff, S., Markarian, C., &#38; Meyer auf der Heide, F. (2014). Randomized Online Algorithms for Set Cover Leasing Problems. In <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 25–34). <a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">https://doi.org/10.1007/978-3-319-12691-3_3</a>","chicago":"Abshoff, Sebastian, Christine Markarian, and Friedhelm Meyer auf der Heide. “Randomized Online Algorithms for Set Cover Leasing Problems.” In <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 25–34. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">https://doi.org/10.1007/978-3-319-12691-3_3</a>.","short":"S. Abshoff, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34."}},{"user_id":"15504","doi":"10.1007/978-3-319-13129-0_34","ddc":["040"],"_id":"380","page":"423-428","has_accepted_license":"1","date_updated":"2022-01-06T06:59:36Z","author":[{"last_name":"Cord-Landwehr","first_name":"Andreas","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Mäcker, Alexander","last_name":"Mäcker","first_name":"Alexander","id":"13536"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"title":"Quality of Service in Network Creation Games","status":"public","year":"2014","department":[{"_id":"63"}],"type":"conference","date_created":"2017-10-17T12:42:06Z","file":[{"date_created":"2018-03-20T07:05:59Z","creator":"florida","content_type":"application/pdf","success":1,"file_id":"1394","date_updated":"2018-03-20T07:05:59Z","relation":"main_file","file_size":166640,"access_level":"closed","file_name":"380-WINE2014.pdf"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"abstract":[{"text":"Network creation games model the creation and usage costs of networks formed by n selfish nodes. Each node v can buy a set of edges, each for a fixed price α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances from v to all other nodes plus the prices of the bought edges. The above papers show the existence of Nash equilibria as well as upper and lower bounds for the prices of anarchy and stability. In several subsequent papers, these bounds were improved for a wide range of prices α. In this paper, we extend these models by incorporating quality-of-service aspects: Each edge cannot only be bought at a fixed quality (edge length one) for a fixed price α. Instead, we assume that quality levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series = {LNCS}","lang":"eng"}],"citation":{"short":"A. Cord-Landwehr, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 423–428.","chicago":"Cord-Landwehr, Andreas, Alexander Mäcker, and Friedhelm Meyer auf der Heide. “Quality of Service in Network Creation Games.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 423–28, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">https://doi.org/10.1007/978-3-319-13129-0_34</a>.","apa":"Cord-Landwehr, A., Mäcker, A., &#38; Meyer auf der Heide, F. (2014). Quality of Service in Network Creation Games. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 423–428). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">https://doi.org/10.1007/978-3-319-13129-0_34</a>","ieee":"A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service in Network Creation Games,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 423–428.","ama":"Cord-Landwehr A, Mäcker A, Meyer auf der Heide F. Quality of Service in Network Creation Games. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. ; 2014:423-428. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>","bibtex":"@inproceedings{Cord-Landwehr_Mäcker_Meyer auf der Heide_2014, title={Quality of Service in Network Creation Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}, year={2014}, pages={423–428} }","mla":"Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 423–28, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>."},"file_date_updated":"2018-03-20T07:05:59Z","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)"},{"type":"conference","department":[{"_id":"600"}],"date_created":"2018-08-02T13:38:28Z","issue":"12","publication":"Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment","citation":{"bibtex":"@inproceedings{Brüseke_Wachsmuth_Engels_Becker_2014, title={PBlaman: performance blame analysis based on Palladio contracts}, number={12}, booktitle={Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment}, author={Brüseke, Frank and Wachsmuth, Henning and Engels, Gregor and Becker, Steffen}, year={2014}, pages={1975–2004} }","ama":"Brüseke F, Wachsmuth H, Engels G, Becker S. PBlaman: performance blame analysis based on Palladio contracts. In: <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>. ; 2014:1975-2004.","mla":"Brüseke, Frank, et al. “PBlaman: Performance Blame Analysis Based on Palladio Contracts.” <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, no. 12, 2014, pp. 1975–2004.","chicago":"Brüseke, Frank, Henning Wachsmuth, Gregor Engels, and Steffen Becker. “PBlaman: Performance Blame Analysis Based on Palladio Contracts.” In <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, 1975–2004, 2014.","short":"F. Brüseke, H. Wachsmuth, G. Engels, S. Becker, in: Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment, 2014, pp. 1975–2004.","ieee":"F. Brüseke, H. Wachsmuth, G. Engels, and S. Becker, “PBlaman: performance blame analysis based on Palladio contracts,” in <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, 2014, no. 12, pp. 1975–2004.","apa":"Brüseke, F., Wachsmuth, H., Engels, G., &#38; Becker, S. (2014). PBlaman: performance blame analysis based on Palladio contracts. In <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i> (pp. 1975–2004)."},"user_id":"82920","page":"1975-2004","_id":"3805","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:36Z","year":"2014","status":"public","title":"PBlaman: performance blame analysis based on Palladio contracts","author":[{"last_name":"Brüseke","first_name":"Frank","full_name":"Brüseke, Frank"},{"full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth","id":"3900"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"},{"full_name":"Becker, Steffen","first_name":"Steffen","last_name":"Becker"}]},{"file_date_updated":"2018-11-02T13:34:46Z","citation":{"ieee":"J. Künsemöller, S. Brangewitz, H. Karl, and C.-J. Haake, “Provider Competition in Infrastructure-as-a-Service,” in <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 2014, pp. 203–210.","apa":"Künsemöller, J., Brangewitz, S., Karl, H., &#38; Haake, C.-J. (2014). Provider Competition in Infrastructure-as-a-Service. In <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i> (pp. 203–210). <a href=\"https://doi.org/10.1109/SCC.2014.35\">https://doi.org/10.1109/SCC.2014.35</a>","mla":"Künsemöller, Jörn, et al. “Provider Competition in Infrastructure-as-a-Service.” <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 2014, pp. 203–10, doi:<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>.","bibtex":"@inproceedings{Künsemöller_Brangewitz_Karl_Haake_2014, title={Provider Competition in Infrastructure-as-a-Service}, DOI={<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>}, booktitle={Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)}, author={Künsemöller, Jörn and Brangewitz, Sonja and Karl, Holger and Haake, Claus-Jochen}, year={2014}, pages={203–210} }","chicago":"Künsemöller, Jörn, Sonja Brangewitz, Holger Karl, and Claus-Jochen Haake. “Provider Competition in Infrastructure-as-a-Service.” In <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 203–10, 2014. <a href=\"https://doi.org/10.1109/SCC.2014.35\">https://doi.org/10.1109/SCC.2014.35</a>.","short":"J. Künsemöller, S. Brangewitz, H. Karl, C.-J. Haake, in: Proceedings of the 2014 IEEE International Conference on Services Computing (SCC), 2014, pp. 203–210.","ama":"Künsemöller J, Brangewitz S, Karl H, Haake C-J. Provider Competition in Infrastructure-as-a-Service. In: <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>. ; 2014:203-210. doi:<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>"},"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","has_accepted_license":"1","page":"203-210","_id":"382","ddc":["004"],"user_id":"477","publication":"Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)","abstract":[{"lang":"eng","text":"This paper explores how cloud provider competition influences instance pricing in an IaaS (Infrastructure-as-a-Service) market. When reserved instance pricing includes an on-demand price component in addition to a reservation fee (two-part tariffs), different providers might offer different price combinations, where the client’s choice depends on its load profile. We investigate a duopoly of providers and analyze stable market prices in two-part tariffs. Further, we study offers that allow a specified amount of included usage (three-part tariffs). Neither two-part nor three-part tariffs produce an equilibrium market outcome other than a service pricing that equals production cost, i.e., complex price structures do not significantly affect the results from ordinary Bertrand competition."}],"file":[{"file_name":"06930535.pdf","access_level":"closed","file_size":228172,"relation":"main_file","date_updated":"2018-11-02T13:34:46Z","file_id":"5250","content_type":"application/pdf","success":1,"creator":"ups","date_created":"2018-11-02T13:34:46Z"}],"date_created":"2017-10-17T12:42:06Z","type":"conference","department":[{"_id":"75"},{"_id":"205"}],"title":"Provider Competition in Infrastructure-as-a-Service","year":"2014","author":[{"first_name":"Jörn","last_name":"Künsemöller","full_name":"Künsemöller, Jörn"},{"full_name":"Brangewitz, Sonja","last_name":"Brangewitz","first_name":"Sonja"},{"full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger","id":"126"},{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"date_updated":"2022-01-06T06:59:37Z","language":[{"iso":"eng"}],"doi":"10.1109/SCC.2014.35"},{"type":"conference","department":[{"_id":"77"}],"file":[{"date_created":"2018-03-20T07:04:52Z","creator":"florida","content_type":"application/pdf","success":1,"file_id":"1392","date_updated":"2018-03-20T07:04:52Z","relation":"main_file","file_size":66474,"access_level":"closed","file_name":"383-programmsFromProofsSE.pdf"}],"date_created":"2017-10-17T12:42:06Z","abstract":[{"text":"Proof-carrying code approaches aim at safe execution of untrusted code by having the code producer attach a safety proof to the code which the code consumer only has to validate. Depending on the type of safety property, proofs can however become quite large and their validation - though faster than their construction - still time consuming. In this paper we introduce a new concept for safe execution of untrusted code. It keeps the idea of putting the time consuming part of proving on the side of the code producer, however, attaches no proofs to code anymore but instead uses the proof to transform the program into an equivalent but more efficiently verifiable program. Code consumers thus still do proving themselves, however, on a computationally inexpensive level only. Experimental results show that the proof effort can be reduced by several orders of magnitude, both with respect to time and space.","lang":"eng"}],"publication":"Proceedings of the Software Engineering Conference (SE)","main_file_link":[{"url":"http://eprints.uni-kiel.de/23752/"}],"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Informatics (LNI)","date_updated":"2022-01-06T06:59:38Z","year":"2014","title":"Programs from Proofs -- Approach and Applications","author":[{"full_name":"Wonisch, Daniel","first_name":"Daniel","last_name":"Wonisch"},{"full_name":"Schremmer, Alexander","last_name":"Schremmer","first_name":"Alexander"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file_date_updated":"2018-03-20T07:04:52Z","citation":{"bibtex":"@inproceedings{Wonisch_Schremmer_Wehrheim_2014, series={Lecture Notes in Informatics (LNI)}, title={Programs from Proofs -- Approach and Applications}, booktitle={Proceedings of the Software Engineering Conference (SE)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2014}, pages={67–68}, collection={Lecture Notes in Informatics (LNI)} }","ama":"Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs -- Approach and Applications. In: <i>Proceedings of the Software Engineering Conference (SE)</i>. Lecture Notes in Informatics (LNI). ; 2014:67-68.","short":"D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the Software Engineering Conference (SE), 2014, pp. 67–68.","chicago":"Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from Proofs -- Approach and Applications.” In <i>Proceedings of the Software Engineering Conference (SE)</i>, 67–68. Lecture Notes in Informatics (LNI), 2014.","ieee":"D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs -- Approach and Applications,” in <i>Proceedings of the Software Engineering Conference (SE)</i>, 2014, pp. 67–68.","apa":"Wonisch, D., Schremmer, A., &#38; Wehrheim, H. (2014). Programs from Proofs -- Approach and Applications. In <i>Proceedings of the Software Engineering Conference (SE)</i> (pp. 67–68).","mla":"Wonisch, Daniel, et al. “Programs from Proofs -- Approach and Applications.” <i>Proceedings of the Software Engineering Conference (SE)</i>, 2014, pp. 67–68."},"ddc":["040"],"user_id":"477","page":"67-68","_id":"383","has_accepted_license":"1","status":"public"},{"has_accepted_license":"1","status":"public","user_id":"477","ddc":["040"],"publisher":"ACM","_id":"387","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"chicago":"Awerbuch, Baruch, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Principles of Robust Medium Access and an Application to Leader Election.” <i>Transactions on Algorithms</i>, no. 4 (2014). <a href=\"https://doi.org/10.1145/2635818\">https://doi.org/10.1145/2635818</a>.","short":"B. Awerbuch, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, Transactions on Algorithms (2014).","apa":"Awerbuch, B., Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2014). Principles of Robust Medium Access and an Application to Leader Election. <i>Transactions on Algorithms</i>, (4). <a href=\"https://doi.org/10.1145/2635818\">https://doi.org/10.1145/2635818</a>","ieee":"B. Awerbuch, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Principles of Robust Medium Access and an Application to Leader Election,” <i>Transactions on Algorithms</i>, no. 4, 2014.","ama":"Awerbuch B, Richa AW, Scheideler C, Schmid S, Zhang J. Principles of Robust Medium Access and an Application to Leader Election. <i>Transactions on Algorithms</i>. 2014;(4). doi:<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>","bibtex":"@article{Awerbuch_Richa_Scheideler_Schmid_Zhang_2014, title={Principles of Robust Medium Access and an Application to Leader Election}, DOI={<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>}, number={4}, journal={Transactions on Algorithms}, publisher={ACM}, author={Awerbuch, Baruch and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2014} }","mla":"Awerbuch, Baruch, et al. “Principles of Robust Medium Access and an Application to Leader Election.” <i>Transactions on Algorithms</i>, no. 4, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>."},"file_date_updated":"2018-03-20T07:02:33Z","date_updated":"2022-01-06T06:59:47Z","author":[{"full_name":"Awerbuch, Baruch","last_name":"Awerbuch","first_name":"Baruch"},{"full_name":"Richa, Andrea W.","first_name":"Andrea W.","last_name":"Richa"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"last_name":"Zhang","first_name":"Jin","full_name":"Zhang, Jin"}],"year":"2014","title":"Principles of Robust Medium Access and an Application to Leader Election","doi":"10.1145/2635818","abstract":[{"text":"This article studies the design of medium access control (MAC) protocols for wireless networks that are provably robust against arbitrary and unpredictable disruptions (e.g., due to unintentional external interference from co-existing networks or due to jamming). We consider a wireless network consisting of a set of n honest and reliable nodes within transmission (and interference) range of each other, and we model the external disruptions with a powerful adaptive adversary. This adversary may know the protocol and its entire history and can use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 − )-fraction of the timesteps, for an arbitrary constant > 0 unknown to the nodes. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant (asymptotically optimal) throughput for the nonjammed time periods under any of the aforementioned adversarial strategies. The derived principles are also useful to build robust applications on top of the MAC layer, and we present an exemplary study for leader election, one of the most fundamental tasks in distributed computing.","lang":"eng"}],"publication":"Transactions on Algorithms","issue":"4","department":[{"_id":"79"}],"type":"journal_article","date_created":"2017-10-17T12:42:07Z","file":[{"date_created":"2018-03-20T07:02:33Z","creator":"florida","file_id":"1388","content_type":"application/pdf","success":1,"file_name":"387-a24-awerbuch_2_.pdf","access_level":"closed","file_size":521454,"relation":"main_file","date_updated":"2018-03-20T07:02:33Z"}]},{"date_updated":"2022-01-06T06:59:47Z","author":[{"id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"},{"last_name":"Trenkmann","first_name":"Martin","full_name":"Trenkmann, Martin"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"}],"title":"Modeling Review Argumentation for Robust Sentiment Analysis","year":"2014","status":"public","user_id":"82920","_id":"3877","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.aclweb.org/anthology/C14-1053.pdf"}],"page":"553-564","citation":{"mla":"Wachsmuth, Henning, et al. “Modeling Review Argumentation for Robust Sentiment Analysis.” <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i>, 2014, pp. 553–64.","ama":"Wachsmuth H, Trenkmann M, Stein B, Engels G. Modeling Review Argumentation for Robust Sentiment Analysis. In: <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i>. ; 2014:553-564.","bibtex":"@inproceedings{Wachsmuth_Trenkmann_Stein_Engels_2014, title={Modeling Review Argumentation for Robust Sentiment Analysis}, booktitle={Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers}, author={Wachsmuth, Henning and Trenkmann, Martin and Stein, Benno and Engels, Gregor}, year={2014}, pages={553–564} }","apa":"Wachsmuth, H., Trenkmann, M., Stein, B., &#38; Engels, G. (2014). Modeling Review Argumentation for Robust Sentiment Analysis. In <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i> (pp. 553–564).","ieee":"H. Wachsmuth, M. Trenkmann, B. Stein, and G. Engels, “Modeling Review Argumentation for Robust Sentiment Analysis,” in <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i>, 2014, pp. 553–564.","chicago":"Wachsmuth, Henning, Martin Trenkmann, Benno Stein, and Gregor Engels. “Modeling Review Argumentation for Robust Sentiment Analysis.” In <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i>, 553–64, 2014.","short":"H. Wachsmuth, M. Trenkmann, B. Stein, G. Engels, in: Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers, 2014, pp. 553–564."},"publication":"Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers","department":[{"_id":"600"}],"type":"conference","date_created":"2018-08-11T16:13:24Z"},{"article_type":"original","intvolume":"       338","publication_status":"published","date_updated":"2022-01-06T06:59:50Z","publication_identifier":{"issn":["0030-4018"]},"author":[{"id":"48077","last_name":"Hammer","orcid":"0000-0002-6331-9348","first_name":"Manfred","full_name":"Hammer, Manfred"}],"title":"Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver","year":"2014","doi":"10.1016/j.optcom.2014.09.087","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The incidenceofthin-film-guided, in-planeunguidedwavesatobliqueanglesonstraightdiscontinuities of dielectricslabwaveguides,anearlyproblemofintegratedoptics,isbeingre-considered.The3-D frequencydomainMaxwellequationsreducetoaparametrizedinhomogeneousvectorialproblemona\r\n2-D computationaldomain,withtransparent-influx boundaryconditions.Weproposearigorousvec-\r\ntorial solverbasedonsimultaneousexpansionsintopolarizedlocalslabeigenmodesalongthetwo\r\northogonal crosssectioncoordinates(quadridirectionaleigenmodepropagationQUEP).Thequasi-ana-\r\nlytical schemeisapplicabletoconfigurations with — in principle — arbitrary crosssectiongeometries.\r\nExamples forahigh-contrastfacetofanasymmetricslabwaveguide,forthelateralexcitationofa\r\nchannel waveguide,andforastepdiscontinuitybetweenslabwaveguidesofdifferentthicknessesare\r\ndiscussed."}],"publication":"Optics Communications","department":[{"_id":"61"}],"type":"journal_article","keyword":["tet_topic_waveguide","tet_topic_numerics"],"date_created":"2018-08-13T09:28:01Z","file":[{"creator":"hclaudia","date_created":"2018-08-13T09:29:14Z","file_name":"2015 Hammer_Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities_A vectorial QUEP solver_Optics communications.pdf","access_level":"closed","file_size":1872449,"relation":"main_file","date_updated":"2018-08-13T09:29:14Z","file_id":"3891","content_type":"application/pdf","success":1}],"has_accepted_license":"1","status":"public","volume":338,"user_id":"55706","ddc":["530"],"publisher":"Elsevier BV","_id":"3890","page":"447-456","citation":{"chicago":"Hammer, Manfred. “Oblique Incidence of Semi-Guided Waves on Rectangular Slab Waveguide Discontinuities: A Vectorial QUEP Solver.” <i>Optics Communications</i> 338 (2014): 447–56. <a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">https://doi.org/10.1016/j.optcom.2014.09.087</a>.","short":"M. Hammer, Optics Communications 338 (2014) 447–456.","ieee":"M. Hammer, “Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver,” <i>Optics Communications</i>, vol. 338, pp. 447–456, 2014.","apa":"Hammer, M. (2014). Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver. <i>Optics Communications</i>, <i>338</i>, 447–456. <a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">https://doi.org/10.1016/j.optcom.2014.09.087</a>","bibtex":"@article{Hammer_2014, title={Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver}, volume={338}, DOI={<a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">10.1016/j.optcom.2014.09.087</a>}, journal={Optics Communications}, publisher={Elsevier BV}, author={Hammer, Manfred}, year={2014}, pages={447–456} }","ama":"Hammer M. Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver. <i>Optics Communications</i>. 2014;338:447-456. doi:<a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">10.1016/j.optcom.2014.09.087</a>","mla":"Hammer, Manfred. “Oblique Incidence of Semi-Guided Waves on Rectangular Slab Waveguide Discontinuities: A Vectorial QUEP Solver.” <i>Optics Communications</i>, vol. 338, Elsevier BV, 2014, pp. 447–56, doi:<a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">10.1016/j.optcom.2014.09.087</a>."},"file_date_updated":"2018-08-13T09:29:14Z"},{"has_accepted_license":"1","status":"public","user_id":"477","ddc":["040"],"_id":"390","publisher":"Springer","page":"333-361","project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"ama":"Huma Z, Gerth C, Engels G. On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains. <i>Computer Science - Research and Development</i>. 2014;(3-4):333-361. doi:<a href=\"https://doi.org/10.1007/s00450-014-0254-z\">10.1007/s00450-014-0254-z</a>","bibtex":"@article{Huma_Gerth_Engels_2014, title={On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains}, DOI={<a href=\"https://doi.org/10.1007/s00450-014-0254-z\">10.1007/s00450-014-0254-z</a>}, number={3–4}, journal={Computer Science - Research and Development}, publisher={Springer}, author={Huma, Zille and Gerth, Christian and Engels, Gregor}, year={2014}, pages={333–361} }","mla":"Huma, Zille, et al. “On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains.” <i>Computer Science - Research and Development</i>, no. 3–4, Springer, 2014, pp. 333–61, doi:<a href=\"https://doi.org/10.1007/s00450-014-0254-z\">10.1007/s00450-014-0254-z</a>.","chicago":"Huma, Zille, Christian Gerth, and Gregor Engels. “On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains.” <i>Computer Science - Research and Development</i>, no. 3–4 (2014): 333–61. <a href=\"https://doi.org/10.1007/s00450-014-0254-z\">https://doi.org/10.1007/s00450-014-0254-z</a>.","short":"Z. Huma, C. Gerth, G. Engels, Computer Science - Research and Development (2014) 333–361.","apa":"Huma, Z., Gerth, C., &#38; Engels, G. (2014). On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains. <i>Computer Science - Research and Development</i>, (3–4), 333–361. <a href=\"https://doi.org/10.1007/s00450-014-0254-z\">https://doi.org/10.1007/s00450-014-0254-z</a>","ieee":"Z. Huma, C. Gerth, and G. Engels, “On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains,” <i>Computer Science - Research and Development</i>, no. 3–4, pp. 333–361, 2014."},"file_date_updated":"2018-03-20T07:00:58Z","date_updated":"2022-01-06T06:59:52Z","author":[{"full_name":"Huma, Zille","first_name":"Zille","last_name":"Huma"},{"full_name":"Gerth, Christian","last_name":"Gerth","first_name":"Christian"},{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"}],"year":"2014","title":"On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains","doi":"10.1007/s00450-014-0254-z","language":[{"iso":"eng"}],"abstract":[{"text":"In software markets of the future, customer-specific software will be developed on demand based on distributed software and hardware services. Based on a customer-specific request, available service offers have to be discovered and composed into sophisticated IT services that fulfill the customer's request.A prerequisite of this vision are rich service descriptions, which comprise structural as well as behavioral aspects of the services, otherwise an accurate service discovery and composition is not possible. However, automatic matching of service requests and offers specified in rich service descriptions for the purpose of service discovery is a complex task, due to the multifaceted heterogeneity of the service partners. This heterogeneity includes the use of different specification languages, different underlying ontologies, or different levels of granularity in the specification itself.In this article, we present a comprehensive approach for service discovery and composition, which overcomes the underlying heterogeneity of the service partners. Based on a realistic case study of our industrial partner from the e-tourism domain, we first introduce an automatic matching mechanism for service requests and offers specified in a rich service description language. In addition, we propose an automatic service composition approach, which determines possible service compositions by composing the service protocols through a composition strategy based on labeled transition systems. ","lang":"eng"}],"publication":"Computer Science - Research and Development","issue":"3-4","department":[{"_id":"66"}],"type":"journal_article","date_created":"2017-10-17T12:42:08Z","file":[{"success":1,"content_type":"application/pdf","file_id":"1385","file_size":4644980,"access_level":"closed","file_name":"390-HGE14.pdf","date_updated":"2018-03-20T07:00:58Z","relation":"main_file","date_created":"2018-03-20T07:00:58Z","creator":"florida"}]},{"language":[{"iso":"eng"}],"_id":"3905","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/7073195"}],"page":"169-175","user_id":"73059","author":[{"last_name":"Abu Quba Rana","first_name":"Chamsi","full_name":"Abu Quba Rana, Chamsi"},{"last_name":"Hassas","first_name":"Salima","full_name":"Hassas, Salima"},{"full_name":"Usama, Fayyad","first_name":"Fayyad","last_name":"Usama"},{"id":"73059","full_name":"Alshomary, Milad","last_name":"Alshomary","first_name":"Milad"},{"full_name":"Gertosio, Christine","last_name":"Gertosio","first_name":"Christine"}],"title":"iSoNTRE: The Social Network Transformer into Recommendation Engine","year":"2014","status":"public","date_updated":"2022-01-06T06:59:54Z","date_created":"2018-08-14T13:35:39Z","department":[{"_id":"600"}],"type":"journal_article","citation":{"mla":"Abu Quba Rana, Chamsi, et al. “ISoNTRE: The Social Network Transformer into Recommendation Engine.” <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>, 2014, pp. 169–75.","bibtex":"@article{Abu Quba Rana_Hassas_Usama_Alshomary_Gertosio_2014, title={iSoNTRE: The Social Network Transformer into Recommendation Engine}, journal={2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)}, author={Abu Quba Rana, Chamsi and Hassas, Salima and Usama, Fayyad and Alshomary, Milad and Gertosio, Christine}, year={2014}, pages={169–175} }","ama":"Abu Quba Rana C, Hassas S, Usama F, Alshomary M, Gertosio C. iSoNTRE: The Social Network Transformer into Recommendation Engine. <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>. 2014:169-175.","ieee":"C. Abu Quba Rana, S. Hassas, F. Usama, M. Alshomary, and C. Gertosio, “iSoNTRE: The Social Network Transformer into Recommendation Engine,” <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>, pp. 169–175, 2014.","apa":"Abu Quba Rana, C., Hassas, S., Usama, F., Alshomary, M., &#38; Gertosio, C. (2014). iSoNTRE: The Social Network Transformer into Recommendation Engine. <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>, 169–175.","short":"C. Abu Quba Rana, S. Hassas, F. Usama, M. Alshomary, C. Gertosio, 2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA) (2014) 169–175.","chicago":"Abu Quba Rana, Chamsi, Salima Hassas, Fayyad Usama, Milad Alshomary, and Christine Gertosio. “ISoNTRE: The Social Network Transformer into Recommendation Engine.” <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>, 2014, 169–75."},"publication":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)"},{"_id":"2900","ddc":["000"],"user_id":"25078","author":[{"first_name":"Sascha","last_name":"Brauer","full_name":"Brauer, Sascha","id":"13291"}],"title":"A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures","status":"public","year":"2014","has_accepted_license":"1","date_updated":"2022-01-06T06:58:44Z","date_created":"2018-05-25T09:45:38Z","file":[{"date_created":"2018-05-25T09:45:33Z","creator":"feidens","content_type":"application/pdf","success":1,"file_id":"2901","file_size":971935,"access_level":"closed","file_name":"2014_Brauer_AProbabilisticExpectationMaximizationAlgorithmForMultivariateLaplacianMixtures.pdf","date_updated":"2018-05-25T09:45:33Z","relation":"main_file"}],"department":[{"_id":"64"}],"type":"mastersthesis","supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"citation":{"mla":"Brauer, Sascha. <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>. 2014.","bibtex":"@book{Brauer_2014, title={A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures}, author={Brauer, Sascha}, year={2014} }","ama":"Brauer S. <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>.; 2014.","ieee":"S. Brauer, <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>. 2014.","apa":"Brauer, S. (2014). <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>.","chicago":"Brauer, Sascha. <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>, 2014.","short":"S. Brauer, A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures, 2014."},"file_date_updated":"2018-05-25T09:45:33Z"},{"date_created":"2018-06-05T07:28:52Z","department":[{"_id":"64"}],"type":"journal_article","citation":{"mla":"Ackermann, Marcel Rudolf, et al. “Analysis of Agglomerative Clustering.” <i>Algorithmica</i>, vol. 69, Springer US, 2014, doi:<a href=\"https://doi.org/10.1007/s00453-012-9717-4\">10.1007/s00453-012-9717-4</a>.","ama":"Ackermann MR, Blömer J, Kuntze D, Sohler C. Analysis of Agglomerative Clustering. <i>Algorithmica</i>. 2014;69. doi:<a href=\"https://doi.org/10.1007/s00453-012-9717-4\">10.1007/s00453-012-9717-4</a>","bibtex":"@article{Ackermann_Blömer_Kuntze_Sohler_2014, title={Analysis of Agglomerative Clustering}, volume={69}, DOI={<a href=\"https://doi.org/10.1007/s00453-012-9717-4\">10.1007/s00453-012-9717-4</a>}, journal={Algorithmica}, publisher={Springer US}, author={Ackermann, Marcel Rudolf and Blömer, Johannes and Kuntze, Daniel and Sohler, Christian}, year={2014} }","apa":"Ackermann, M. R., Blömer, J., Kuntze, D., &#38; Sohler, C. (2014). Analysis of Agglomerative Clustering. <i>Algorithmica</i>, <i>69</i>. <a href=\"https://doi.org/10.1007/s00453-012-9717-4\">https://doi.org/10.1007/s00453-012-9717-4</a>","ieee":"M. R. Ackermann, J. Blömer, D. Kuntze, and C. Sohler, “Analysis of Agglomerative Clustering,” <i>Algorithmica</i>, vol. 69, 2014.","chicago":"Ackermann, Marcel Rudolf, Johannes Blömer, Daniel Kuntze, and Christian Sohler. “Analysis of Agglomerative Clustering.” <i>Algorithmica</i> 69 (2014). <a href=\"https://doi.org/10.1007/s00453-012-9717-4\">https://doi.org/10.1007/s00453-012-9717-4</a>.","short":"M.R. Ackermann, J. Blömer, D. Kuntze, C. Sohler, Algorithmica 69 (2014)."},"publication":"Algorithmica","_id":"2976","publisher":"Springer US","volume":69,"user_id":"25078","doi":"10.1007/s00453-012-9717-4","author":[{"full_name":"Ackermann, Marcel Rudolf","last_name":"Ackermann","first_name":"Marcel Rudolf"},{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"},{"last_name":"Kuntze","first_name":"Daniel","full_name":"Kuntze, Daniel"},{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"}],"publication_identifier":{"eissn":["0178-4617"]},"year":"2014","title":"Analysis of Agglomerative Clustering","status":"public","intvolume":"        69","publication_status":"published","date_updated":"2022-01-06T06:58:49Z"},{"publication":"2014 22nd International Conference on Pattern Recognition","citation":{"bibtex":"@inproceedings{Blömer_Bujna_Kuntze_2014, title={A Theoretical and Experimental Comparison of the EM and SEM Algorithm}, DOI={<a href=\"https://doi.org/10.1109/icpr.2014.253\">10.1109/icpr.2014.253</a>}, booktitle={2014 22nd International Conference on Pattern Recognition}, publisher={IEEE}, author={Blömer, Johannes and Bujna, Kathrin and Kuntze, Daniel}, year={2014} }","ama":"Blömer J, Bujna K, Kuntze D. A Theoretical and Experimental Comparison of the EM and SEM Algorithm. In: <i>2014 22nd International Conference on Pattern Recognition</i>. IEEE; 2014. doi:<a href=\"https://doi.org/10.1109/icpr.2014.253\">10.1109/icpr.2014.253</a>","mla":"Blömer, Johannes, et al. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.” <i>2014 22nd International Conference on Pattern Recognition</i>, IEEE, 2014, doi:<a href=\"https://doi.org/10.1109/icpr.2014.253\">10.1109/icpr.2014.253</a>.","short":"J. Blömer, K. Bujna, D. Kuntze, in: 2014 22nd International Conference on Pattern Recognition, IEEE, 2014.","chicago":"Blömer, Johannes, Kathrin Bujna, and Daniel Kuntze. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.” In <i>2014 22nd International Conference on Pattern Recognition</i>. IEEE, 2014. <a href=\"https://doi.org/10.1109/icpr.2014.253\">https://doi.org/10.1109/icpr.2014.253</a>.","ieee":"J. Blömer, K. Bujna, and D. Kuntze, “A Theoretical and Experimental Comparison of the EM and SEM Algorithm,” in <i>2014 22nd International Conference on Pattern Recognition</i>, 2014.","apa":"Blömer, J., Bujna, K., &#38; Kuntze, D. (2014). A Theoretical and Experimental Comparison of the EM and SEM Algorithm. In <i>2014 22nd International Conference on Pattern Recognition</i>. IEEE. <a href=\"https://doi.org/10.1109/icpr.2014.253\">https://doi.org/10.1109/icpr.2014.253</a>"},"type":"conference","department":[{"_id":"64"}],"date_created":"2018-06-05T07:29:15Z","date_updated":"2022-01-06T06:58:49Z","publication_status":"published","year":"2014","title":"A Theoretical and Experimental Comparison of the EM and SEM Algorithm","status":"public","author":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"},{"last_name":"Bujna","first_name":"Kathrin","full_name":"Bujna, Kathrin"},{"full_name":"Kuntze, Daniel","first_name":"Daniel","last_name":"Kuntze"}],"publication_identifier":{"isbn":["9781479952090"]},"doi":"10.1109/icpr.2014.253","user_id":"25078","_id":"2977","publisher":"IEEE"},{"author":[{"id":"64669","full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager"}],"title":"Die Zukunft der Kryptographie","year":"2014","status":"public","date_updated":"2022-01-06T06:58:57Z","_id":"3127","page":"445--451","doi":"10.1007/s11623-014-0204-8","user_id":"38235","citation":{"ama":"Jager T. Die Zukunft der Kryptographie. <i>Datenschutz und Datensicherheit</i>. 2014;(7):445--451. doi:<a href=\"https://doi.org/10.1007/s11623-014-0204-8\">10.1007/s11623-014-0204-8</a>","bibtex":"@article{Jager_2014, title={Die Zukunft der Kryptographie}, DOI={<a href=\"https://doi.org/10.1007/s11623-014-0204-8\">10.1007/s11623-014-0204-8</a>}, number={7}, journal={Datenschutz und Datensicherheit}, author={Jager, Tibor}, year={2014}, pages={445--451} }","mla":"Jager, Tibor. “Die Zukunft Der Kryptographie.” <i>Datenschutz Und Datensicherheit</i>, no. 7, 2014, pp. 445--451, doi:<a href=\"https://doi.org/10.1007/s11623-014-0204-8\">10.1007/s11623-014-0204-8</a>.","short":"T. Jager, Datenschutz Und Datensicherheit (2014) 445--451.","chicago":"Jager, Tibor. “Die Zukunft Der Kryptographie.” <i>Datenschutz Und Datensicherheit</i>, no. 7 (2014): 445--451. <a href=\"https://doi.org/10.1007/s11623-014-0204-8\">https://doi.org/10.1007/s11623-014-0204-8</a>.","apa":"Jager, T. (2014). Die Zukunft der Kryptographie. <i>Datenschutz Und Datensicherheit</i>, (7), 445--451. <a href=\"https://doi.org/10.1007/s11623-014-0204-8\">https://doi.org/10.1007/s11623-014-0204-8</a>","ieee":"T. Jager, “Die Zukunft der Kryptographie,” <i>Datenschutz und Datensicherheit</i>, no. 7, pp. 445--451, 2014."},"issue":"7","publication":"Datenschutz und Datensicherheit","extern":"1","date_created":"2018-06-07T09:21:18Z","department":[{"_id":"558"}],"type":"journal_article"},{"date_created":"2018-06-07T09:21:46Z","department":[{"_id":"558"}],"type":"conference","citation":{"chicago":"Fleischhacker, Nils, Tibor Jager, and Dominique Schröder. “On Tight Security Proofs for Schnorr Signatures.” In <i>Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I</i>, 512--531, 2014. <a href=\"https://doi.org/10.1007/978-3-662-45611-8_27\">https://doi.org/10.1007/978-3-662-45611-8_27</a>.","short":"N. Fleischhacker, T. Jager, D. Schröder, in: Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I, 2014, pp. 512--531.","ieee":"N. Fleischhacker, T. Jager, and D. Schröder, “On Tight Security Proofs for Schnorr Signatures,” in <i>Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I</i>, 2014, pp. 512--531.","apa":"Fleischhacker, N., Jager, T., &#38; Schröder, D. (2014). On Tight Security Proofs for Schnorr Signatures. In <i>Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I</i> (pp. 512--531). <a href=\"https://doi.org/10.1007/978-3-662-45611-8_27\">https://doi.org/10.1007/978-3-662-45611-8_27</a>","bibtex":"@inproceedings{Fleischhacker_Jager_Schröder_2014, title={On Tight Security Proofs for Schnorr Signatures}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-45611-8_27\">10.1007/978-3-662-45611-8_27</a>}, booktitle={Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I}, author={Fleischhacker, Nils and Jager, Tibor and Schröder, Dominique}, year={2014}, pages={512--531} }","ama":"Fleischhacker N, Jager T, Schröder D. On Tight Security Proofs for Schnorr Signatures. In: <i>Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I</i>. ; 2014:512--531. doi:<a href=\"https://doi.org/10.1007/978-3-662-45611-8_27\">10.1007/978-3-662-45611-8_27</a>","mla":"Fleischhacker, Nils, et al. “On Tight Security Proofs for Schnorr Signatures.” <i>Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I</i>, 2014, pp. 512--531, doi:<a href=\"https://doi.org/10.1007/978-3-662-45611-8_27\">10.1007/978-3-662-45611-8_27</a>."},"publication":"Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I","extern":"1","_id":"3128","page":"512--531","user_id":"38235","doi":"10.1007/978-3-662-45611-8_27","author":[{"last_name":"Fleischhacker","first_name":"Nils","full_name":"Fleischhacker, Nils"},{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"full_name":"Schröder, Dominique","last_name":"Schröder","first_name":"Dominique"}],"title":"On Tight Security Proofs for Schnorr Signatures","status":"public","year":"2014","date_updated":"2022-01-06T06:58:57Z"},{"date_updated":"2022-01-06T06:59:01Z","author":[{"full_name":"Schneider, Steve","first_name":"Steve","last_name":"Schneider"},{"full_name":"Treharne, Helen","first_name":"Helen","last_name":"Treharne"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"year":"2014","title":"The behavioural semantics of Event-B refinement","status":"public","doi":"10.1007/s00165-012-0265-0","user_id":"29719","_id":"3167","page":"251--280","citation":{"bibtex":"@article{Schneider_Treharne_Wehrheim_2014, title={The behavioural semantics of Event-B refinement}, DOI={<a href=\"https://doi.org/10.1007/s00165-012-0265-0\">10.1007/s00165-012-0265-0</a>}, number={2}, journal={Formal Asp. Comput.}, author={Schneider, Steve and Treharne, Helen and Wehrheim, Heike}, year={2014}, pages={251--280} }","ama":"Schneider S, Treharne H, Wehrheim H. The behavioural semantics of Event-B refinement. <i>Formal Asp Comput</i>. 2014;(2):251--280. doi:<a href=\"https://doi.org/10.1007/s00165-012-0265-0\">10.1007/s00165-012-0265-0</a>","mla":"Schneider, Steve, et al. “The Behavioural Semantics of Event-B Refinement.” <i>Formal Asp. Comput.</i>, no. 2, 2014, pp. 251--280, doi:<a href=\"https://doi.org/10.1007/s00165-012-0265-0\">10.1007/s00165-012-0265-0</a>.","short":"S. Schneider, H. Treharne, H. Wehrheim, Formal Asp. Comput. (2014) 251--280.","chicago":"Schneider, Steve, Helen Treharne, and Heike Wehrheim. “The Behavioural Semantics of Event-B Refinement.” <i>Formal Asp. Comput.</i>, no. 2 (2014): 251--280. <a href=\"https://doi.org/10.1007/s00165-012-0265-0\">https://doi.org/10.1007/s00165-012-0265-0</a>.","ieee":"S. Schneider, H. Treharne, and H. Wehrheim, “The behavioural semantics of Event-B refinement,” <i>Formal Asp. Comput.</i>, no. 2, pp. 251--280, 2014.","apa":"Schneider, S., Treharne, H., &#38; Wehrheim, H. (2014). The behavioural semantics of Event-B refinement. <i>Formal Asp. Comput.</i>, (2), 251--280. <a href=\"https://doi.org/10.1007/s00165-012-0265-0\">https://doi.org/10.1007/s00165-012-0265-0</a>"},"publication":"Formal Asp. Comput.","issue":"2","department":[{"_id":"77"}],"type":"journal_article","date_created":"2018-06-13T07:55:10Z"},{"department":[{"_id":"77"}],"type":"journal_article","date_created":"2018-06-13T07:56:12Z","citation":{"ieee":"B. Tofan, O. Travkin, G. Schellhorn, and H. Wehrheim, “Two approaches for proving linearizability of multiset,” <i>Sci. Comput. Program.</i>, pp. 297--314, 2014.","apa":"Tofan, B., Travkin, O., Schellhorn, G., &#38; Wehrheim, H. (2014). Two approaches for proving linearizability of multiset. <i>Sci. Comput. Program.</i>, 297--314. <a href=\"https://doi.org/10.1016/j.scico.2014.04.001\">https://doi.org/10.1016/j.scico.2014.04.001</a>","short":"B. Tofan, O. Travkin, G. Schellhorn, H. Wehrheim, Sci. Comput. Program. (2014) 297--314.","chicago":"Tofan, Bogdan, Oleg Travkin, Gerhard Schellhorn, and Heike Wehrheim. “Two Approaches for Proving Linearizability of Multiset.” <i>Sci. Comput. Program.</i>, 2014, 297--314. <a href=\"https://doi.org/10.1016/j.scico.2014.04.001\">https://doi.org/10.1016/j.scico.2014.04.001</a>.","mla":"Tofan, Bogdan, et al. “Two Approaches for Proving Linearizability of Multiset.” <i>Sci. Comput. Program.</i>, 2014, pp. 297--314, doi:<a href=\"https://doi.org/10.1016/j.scico.2014.04.001\">10.1016/j.scico.2014.04.001</a>.","bibtex":"@article{Tofan_Travkin_Schellhorn_Wehrheim_2014, title={Two approaches for proving linearizability of multiset}, DOI={<a href=\"https://doi.org/10.1016/j.scico.2014.04.001\">10.1016/j.scico.2014.04.001</a>}, journal={Sci. Comput. Program.}, author={Tofan, Bogdan and Travkin, Oleg and Schellhorn, Gerhard and Wehrheim, Heike}, year={2014}, pages={297--314} }","ama":"Tofan B, Travkin O, Schellhorn G, Wehrheim H. Two approaches for proving linearizability of multiset. <i>Sci Comput Program</i>. 2014:297--314. doi:<a href=\"https://doi.org/10.1016/j.scico.2014.04.001\">10.1016/j.scico.2014.04.001</a>"},"publication":"Sci. Comput. Program.","user_id":"29719","doi":"10.1016/j.scico.2014.04.001","_id":"3168","page":"297--314","date_updated":"2022-01-06T06:59:01Z","author":[{"full_name":"Tofan, Bogdan","first_name":"Bogdan","last_name":"Tofan"},{"full_name":"Travkin, Oleg","first_name":"Oleg","last_name":"Travkin"},{"last_name":"Schellhorn","first_name":"Gerhard","full_name":"Schellhorn, Gerhard"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"status":"public","title":"Two approaches for proving linearizability of multiset","year":"2014"},{"type":"journal_article","department":[{"_id":"77"}],"date_created":"2018-06-13T07:57:31Z","issue":"4","publication":"{ACM} Trans. Comput. Log.","citation":{"mla":"Schellhorn, Gerhard, et al. “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures.” <i>{ACM} Trans. Comput. Log.</i>, no. 4, 2014, pp. 31:1--31:37, doi:<a href=\"https://doi.org/10.1145/2629496\">10.1145/2629496</a>.","ama":"Schellhorn G, Derrick J, Wehrheim H. A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures. <i>{ACM} Trans Comput Log</i>. 2014;(4):31:1--31:37. doi:<a href=\"https://doi.org/10.1145/2629496\">10.1145/2629496</a>","bibtex":"@article{Schellhorn_Derrick_Wehrheim_2014, title={A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures}, DOI={<a href=\"https://doi.org/10.1145/2629496\">10.1145/2629496</a>}, number={4}, journal={{ACM} Trans. Comput. Log.}, author={Schellhorn, Gerhard and Derrick, John and Wehrheim, Heike}, year={2014}, pages={31:1--31:37} }","apa":"Schellhorn, G., Derrick, J., &#38; Wehrheim, H. (2014). A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures. <i>{ACM} Trans. Comput. Log.</i>, (4), 31:1--31:37. <a href=\"https://doi.org/10.1145/2629496\">https://doi.org/10.1145/2629496</a>","ieee":"G. Schellhorn, J. Derrick, and H. Wehrheim, “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures,” <i>{ACM} Trans. Comput. Log.</i>, no. 4, pp. 31:1--31:37, 2014.","short":"G. Schellhorn, J. Derrick, H. Wehrheim, {ACM} Trans. Comput. Log. (2014) 31:1--31:37.","chicago":"Schellhorn, Gerhard, John Derrick, and Heike Wehrheim. “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures.” <i>{ACM} Trans. Comput. Log.</i>, no. 4 (2014): 31:1--31:37. <a href=\"https://doi.org/10.1145/2629496\">https://doi.org/10.1145/2629496</a>."},"user_id":"29719","doi":"10.1145/2629496","page":"31:1--31:37","_id":"3169","date_updated":"2022-01-06T06:59:01Z","status":"public","year":"2014","title":"A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures","author":[{"full_name":"Schellhorn, Gerhard","first_name":"Gerhard","last_name":"Schellhorn"},{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}]},{"date_created":"2018-06-13T07:58:40Z","type":"conference","department":[{"_id":"77"}],"publication":"{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings","citation":{"short":"J. Derrick, B. Dongol, G. Schellhorn, B. Tofan, O. Travkin, H. Wehrheim, in: C. B. Jones, P. Pihlajasaari, J. Sun (Eds.), {FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings, 2014, pp. 200--214.","ama":"Derrick J, Dongol B, Schellhorn G, Tofan B, Travkin O, Wehrheim H. Quiescent Consistency: Defining and Verifying Relaxed Linearizability. In: B. Jones C, Pihlajasaari P, Sun J, eds. <i>{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings</i>. Lecture Notes in Computer Science. ; 2014:200--214. doi:<a href=\"https://doi.org/10.1007/978-3-319-06410-9_15\">10.1007/978-3-319-06410-9_15</a>","chicago":"Derrick, John, Brijesh Dongol, Gerhard Schellhorn, Bogdan Tofan, Oleg Travkin, and Heike Wehrheim. “Quiescent Consistency: Defining and Verifying Relaxed Linearizability.” In <i>{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings</i>, edited by Cliff B. Jones, Pekka Pihlajasaari, and Jun Sun, 200--214. Lecture Notes in Computer Science, 2014. <a href=\"https://doi.org/10.1007/978-3-319-06410-9_15\">https://doi.org/10.1007/978-3-319-06410-9_15</a>.","bibtex":"@inproceedings{Derrick_Dongol_Schellhorn_Tofan_Travkin_Wehrheim_2014, series={Lecture Notes in Computer Science}, title={Quiescent Consistency: Defining and Verifying Relaxed Linearizability}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-06410-9_15\">10.1007/978-3-319-06410-9_15</a>}, booktitle={{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings}, author={Derrick, John and Dongol, Brijesh and Schellhorn, Gerhard and Tofan, Bogdan and Travkin, Oleg and Wehrheim, Heike}, editor={B. Jones, Cliff and Pihlajasaari, Pekka and Sun, JunEditors}, year={2014}, pages={200--214}, collection={Lecture Notes in Computer Science} }","apa":"Derrick, J., Dongol, B., Schellhorn, G., Tofan, B., Travkin, O., &#38; Wehrheim, H. (2014). Quiescent Consistency: Defining and Verifying Relaxed Linearizability. In C. B. Jones, P. Pihlajasaari, &#38; J. Sun (Eds.), <i>{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings</i> (pp. 200--214). <a href=\"https://doi.org/10.1007/978-3-319-06410-9_15\">https://doi.org/10.1007/978-3-319-06410-9_15</a>","mla":"Derrick, John, et al. “Quiescent Consistency: Defining and Verifying Relaxed Linearizability.” <i>{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings</i>, edited by Cliff B. Jones et al., 2014, pp. 200--214, doi:<a href=\"https://doi.org/10.1007/978-3-319-06410-9_15\">10.1007/978-3-319-06410-9_15</a>.","ieee":"J. Derrick, B. Dongol, G. Schellhorn, B. Tofan, O. Travkin, and H. Wehrheim, “Quiescent Consistency: Defining and Verifying Relaxed Linearizability,” in <i>{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings</i>, 2014, pp. 200--214."},"page":"200--214","_id":"3170","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-319-06410-9_15","user_id":"29719","editor":[{"first_name":"Cliff","last_name":"B. Jones","full_name":"B. Jones, Cliff"},{"last_name":"Pihlajasaari","first_name":"Pekka","full_name":"Pihlajasaari, Pekka"},{"last_name":"Sun","first_name":"Jun","full_name":"Sun, Jun"}],"status":"public","title":"Quiescent Consistency: Defining and Verifying Relaxed Linearizability","year":"2014","author":[{"full_name":"Derrick, John","last_name":"Derrick","first_name":"John"},{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"first_name":"Gerhard","last_name":"Schellhorn","full_name":"Schellhorn, Gerhard"},{"full_name":"Tofan, Bogdan","first_name":"Bogdan","last_name":"Tofan"},{"full_name":"Travkin, Oleg","last_name":"Travkin","first_name":"Oleg"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_updated":"2022-01-06T06:59:02Z"},{"doi":"10.1007/978-3-319-13338-6_11","user_id":"29719","editor":[{"first_name":"Eran","last_name":"Yahav","full_name":"Yahav, Eran"}],"page":"132--147","series_title":"Lecture Notes in Computer Science","_id":"3171","date_updated":"2022-01-06T06:59:02Z","title":"Handling {TSO} in Mechanized Linearizability Proofs","status":"public","year":"2014","author":[{"full_name":"Travkin, Oleg","last_name":"Travkin","first_name":"Oleg"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"type":"conference","department":[{"_id":"77"}],"date_created":"2018-06-13T07:59:46Z","publication":"Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings","citation":{"short":"O. Travkin, H. Wehrheim, in: E. Yahav (Ed.), Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings, 2014, pp. 132--147.","ama":"Travkin O, Wehrheim H. Handling {TSO} in Mechanized Linearizability Proofs. In: Yahav E, ed. <i>Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings</i>. Lecture Notes in Computer Science. ; 2014:132--147. doi:<a href=\"https://doi.org/10.1007/978-3-319-13338-6_11\">10.1007/978-3-319-13338-6_11</a>","chicago":"Travkin, Oleg, and Heike Wehrheim. “Handling {TSO} in Mechanized Linearizability Proofs.” In <i>Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings</i>, edited by Eran Yahav, 132--147. Lecture Notes in Computer Science, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13338-6_11\">https://doi.org/10.1007/978-3-319-13338-6_11</a>.","bibtex":"@inproceedings{Travkin_Wehrheim_2014, series={Lecture Notes in Computer Science}, title={Handling {TSO} in Mechanized Linearizability Proofs}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13338-6_11\">10.1007/978-3-319-13338-6_11</a>}, booktitle={Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings}, author={Travkin, Oleg and Wehrheim, Heike}, editor={Yahav, EranEditor}, year={2014}, pages={132--147}, collection={Lecture Notes in Computer Science} }","mla":"Travkin, Oleg, and Heike Wehrheim. “Handling {TSO} in Mechanized Linearizability Proofs.” <i>Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings</i>, edited by Eran Yahav, 2014, pp. 132--147, doi:<a href=\"https://doi.org/10.1007/978-3-319-13338-6_11\">10.1007/978-3-319-13338-6_11</a>.","apa":"Travkin, O., &#38; Wehrheim, H. (2014). Handling {TSO} in Mechanized Linearizability Proofs. In E. Yahav (Ed.), <i>Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings</i> (pp. 132--147). <a href=\"https://doi.org/10.1007/978-3-319-13338-6_11\">https://doi.org/10.1007/978-3-319-13338-6_11</a>","ieee":"O. Travkin and H. Wehrheim, “Handling {TSO} in Mechanized Linearizability Proofs,” in <i>Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings</i>, 2014, pp. 132--147."}}]