[{"author":[{"full_name":"Harks, Tobias","last_name":"Harks","first_name":"Tobias"},{"full_name":"Höfer, Martin","last_name":"Höfer","first_name":"Martin"},{"full_name":"Schewior, Kevin","last_name":"Schewior","first_name":"Kevin"},{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"date_created":"2017-10-17T12:42:04Z","date_updated":"2022-01-06T06:59:30Z","doi":"10.1109/TNET.2015.2468571","title":"Routing Games with Progressive Filling","has_accepted_license":"1","citation":{"ama":"Harks T, Höfer M, Schewior K, Skopalik A. Routing Games with Progressive Filling. In: <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>. ; 2014:352-360. doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>","chicago":"Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games with Progressive Filling.” In <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>, 352–60, 2014. <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>.","ieee":"T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games with Progressive Filling,” in <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>, 2014, pp. 352–360.","mla":"Harks, Tobias, et al. “Routing Games with Progressive Filling.” <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>, 2014, pp. 352–60, doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>.","short":"T. Harks, M. Höfer, K. Schewior, A. Skopalik, in: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–360.","bibtex":"@inproceedings{Harks_Höfer_Schewior_Skopalik_2014, title={Routing Games with Progressive Filling}, DOI={<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>}, booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2014}, pages={352–360} }","apa":"Harks, T., Höfer, M., Schewior, K., &#38; Skopalik, A. (2014). Routing Games with Progressive Filling. In <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i> (pp. 352–360). <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>"},"page":"352-360","year":"2014","user_id":"477","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"370","file_date_updated":"2018-03-20T07:17:04Z","language":[{"iso":"eng"}],"ddc":["040"],"type":"conference","publication":"Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM'14)","file":[{"date_created":"2018-03-20T07:17:04Z","creator":"florida","date_updated":"2018-03-20T07:17:04Z","access_level":"closed","file_id":"1402","file_name":"370-HHSS14.pdf","file_size":179583,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"lang":"eng","text":"Max-min fairness (MMF) is a widely known approach to a fair allocation of bandwidth to each of the users in a network. This allocation can be computed by uniformly raising the bandwidths of all users without violating capacity constraints. We consider an extension of these allocations by raising the bandwidth with arbitrary and not necessarily uniform time-depending velocities (allocation rates). These allocations are used in a game-theoretic context for routing choices, which we formalize in progressive filling games (PFGs).We present a variety of results for equilibria in PFGs. We show that these games possess pure Nash and strong equilibria. While computation in general is NP-hard, there are polynomial-time algorithms for prominent classes of Max-Min-Fair Games (MMFG), including the case when all users have the same source-destination pair. We characterize prices of anarchy and stability for pure Nash and strong equilibria in PFGs and MMFGs when players have different or the same source-destination pairs. In addition, we show that when a designer can adjust allocation rates, it is possible to design games with optimal strong equilibria. Some initial results on polynomial-time algorithms in this direction are also derived. "}]},{"status":"public","file":[{"access_level":"closed","file_id":"1401","file_name":"371-RoBuSt-OPODIS.pdf","file_size":269941,"creator":"florida","date_created":"2018-03-20T07:16:32Z","date_updated":"2018-03-20T07:16:32Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"In this work we present the first distributed storage system that is provably robust against crash failures issued by an adaptive adversary, i.e., for each batch of requests the adversary can decide based on the entire system state which servers will be unavailable for that batch of requests. Despite up to \\gamma n^{1/\\log\\log n} crashed servers, with \\gamma>0 constant and n denoting the number of servers, our system can correctly process any batch of lookup and write requests (with at most a polylogarithmic number of requests issued at each non-crashed server) in at most a polylogarithmic number of communication rounds, with at most polylogarithmic time and work at each server and only a logarithmic storage overhead. Our system is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS, a distributed information system that is provably robust against the same kind of crash failures. However, IRIS is only able to serve lookup requests. Handling both lookup and write requests has turned out to require major changes in the design of IRIS."}],"publication":"Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)","type":"conference","file_date_updated":"2018-03-20T07:16:32Z","ddc":["040"],"department":[{"_id":"79"}],"series_title":"LNCS","user_id":"15504","_id":"371","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"page":"107--122","citation":{"ama":"Scheideler C, Setzer A, Eikel M. RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In: <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>. LNCS. ; 2014:107--122. doi:<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>","chicago":"Scheideler, Christian, Alexander Setzer, and Martina Eikel. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.” In <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 107--122. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">https://doi.org/10.1007/978-3-319-14472-6_8</a>.","ieee":"C. Scheideler, A. Setzer, and M. Eikel, “RoBuSt: A Crash-Failure-Resistant Distributed Storage System,” in <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2014, pp. 107--122.","apa":"Scheideler, C., Setzer, A., &#38; Eikel, M. (2014). RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i> (pp. 107--122). <a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">https://doi.org/10.1007/978-3-319-14472-6_8</a>","bibtex":"@inproceedings{Scheideler_Setzer_Eikel_2014, series={LNCS}, title={RoBuSt: A Crash-Failure-Resistant Distributed Storage System}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>}, booktitle={Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Eikel, Martina}, year={2014}, pages={107--122}, collection={LNCS} }","short":"C. Scheideler, A. Setzer, M. Eikel, in: Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.","mla":"Scheideler, Christian, et al. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.” <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2014, pp. 107--122, doi:<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>."},"year":"2014","has_accepted_license":"1","doi":"10.1007/978-3-319-14472-6_8","title":"RoBuSt: A Crash-Failure-Resistant Distributed Storage System","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Alexander","last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108"},{"last_name":"Eikel","full_name":"Eikel, Martina","first_name":"Martina"}],"date_created":"2017-10-17T12:42:04Z","date_updated":"2022-01-06T06:59:31Z"},{"file_date_updated":"2018-11-02T14:00:54Z","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"477","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"372","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-02T14:00:54Z","creator":"ups","date_updated":"2018-11-02T14:00:54Z","file_id":"5259","access_level":"closed","file_name":"p47-keller.pdf","file_size":804240}],"status":"public","abstract":[{"lang":"eng","text":"In the near future many more compute resources will be available at different geographical locations. To minimize the response time of requests, application servers closer to the user can hence be used to shorten network round trip times. However, this advantage is neutralized if the used data centre is highly loaded as the processing time of re- quests is important as well. We model the request response time as the network round trip time plus the processing time at a data centre.We present a capacitated facility location problem formal- ization where the processing time is modelled as the sojourn time of a queueing model. We discuss the Pareto trade-off between the number of used data centres and the resulting response time. For example, using fewer data centres could cut expenses but results in high utilization, high response time, and smaller revenues.Previous work presented a non-linear cost function. We prove its convexity and exploit this property in two ways: First, we transform the convex model into a linear model while controlling the maximum approximation error. Sec- ond, we used a convex solver instead of a slower non-linear solver. Numerical results on network topologies exemplify our work."}],"type":"conference","publication":"Proceedings of the SIGCOMM workshop on Distributed cloud computing","doi":"10.1145/2627566.2627570","title":"Response Time-Optimized Distributed Cloud Resource Allocation","date_created":"2017-10-17T12:42:04Z","author":[{"first_name":"Matthias","full_name":"Keller, Matthias","last_name":"Keller"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"date_updated":"2022-01-06T06:59:31Z","citation":{"apa":"Keller, M., &#38; Karl, H. (2014). Response Time-Optimized Distributed Cloud Resource Allocation. In <i>Proceedings of the SIGCOMM workshop on Distributed cloud computing</i> (pp. 47--52). <a href=\"https://doi.org/10.1145/2627566.2627570\">https://doi.org/10.1145/2627566.2627570</a>","short":"M. Keller, H. Karl, in: Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing, 2014, pp. 47--52.","bibtex":"@inproceedings{Keller_Karl_2014, title={Response Time-Optimized Distributed Cloud Resource Allocation}, DOI={<a href=\"https://doi.org/10.1145/2627566.2627570\">10.1145/2627566.2627570</a>}, booktitle={Proceedings of the SIGCOMM workshop on Distributed cloud computing}, author={Keller, Matthias and Karl, Holger}, year={2014}, pages={47--52} }","mla":"Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed Cloud Resource Allocation.” <i>Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing</i>, 2014, pp. 47--52, doi:<a href=\"https://doi.org/10.1145/2627566.2627570\">10.1145/2627566.2627570</a>.","ama":"Keller M, Karl H. Response Time-Optimized Distributed Cloud Resource Allocation. In: <i>Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing</i>. ; 2014:47--52. doi:<a href=\"https://doi.org/10.1145/2627566.2627570\">10.1145/2627566.2627570</a>","chicago":"Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed Cloud Resource Allocation.” In <i>Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing</i>, 47--52, 2014. <a href=\"https://doi.org/10.1145/2627566.2627570\">https://doi.org/10.1145/2627566.2627570</a>.","ieee":"M. Keller and H. Karl, “Response Time-Optimized Distributed Cloud Resource Allocation,” in <i>Proceedings of the SIGCOMM workshop on Distributed cloud computing</i>, 2014, pp. 47--52."},"page":"47--52","year":"2014","has_accepted_license":"1"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"373","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","year":"2014","citation":{"short":"D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität Paderborn, 2014.","bibtex":"@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen}, publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }","mla":"Pahl, David. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn, 2014.","apa":"Pahl, D. (2014). <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn.","ieee":"D. Pahl, <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn, 2014.","chicago":"Pahl, David. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn, 2014.","ama":"Pahl D. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn; 2014."},"title":"Reputationssysteme für zusammengesetzte Dienstleistungen","date_updated":"2022-01-06T06:59:31Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:04Z","supervisor":[{"last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"author":[{"full_name":"Pahl, David","last_name":"Pahl","first_name":"David"}]},{"year":"2014","citation":{"mla":"Herlich, Matthias. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014.","bibtex":"@book{Herlich_2014, title={Reducing Energy Consumption of Radio Access Networks}, publisher={Universität Paderborn}, author={Herlich, Matthias}, year={2014} }","short":"M. Herlich, Reducing Energy Consumption of Radio Access Networks, Universität Paderborn, 2014.","apa":"Herlich, M. (2014). <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn.","ama":"Herlich M. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn; 2014.","chicago":"Herlich, Matthias. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014.","ieee":"M. Herlich, <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014."},"has_accepted_license":"1","title":"Reducing Energy Consumption of Radio Access Networks","date_updated":"2022-01-06T06:59:35Z","publisher":"Universität Paderborn","supervisor":[{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"author":[{"first_name":"Matthias","full_name":"Herlich, Matthias","last_name":"Herlich"}],"date_created":"2017-10-17T12:42:05Z","abstract":[{"lang":"eng","text":"Radio access networks (RANs) have become one of the largest energy consumers of communication technology [LLH+13] and their energy consumption is predicted to increase [FFMB11]. To reduce the energy consumption of RANs different techniques have been proposed. One of the most promising techniques is the use of a low-power sleep mode. However, a sleep mode can also reduce the performance. In this dissertation, I quantify how much energy can be conserved with a sleep mode and which negative effects it has on the performance of RANs. Additionally, I analyze how a sleep mode can be enabled more often and how the performance can be kept high. First, I quantify the effect of power-cycle durations on energy consumption and latency in an abstract queuing system. This results in a trade-off between energy consumption and latency for a single base station (BS). Second, I show that considering a network as a whole (instead of each BS individually) allows the energy consumption to be reduced even further. After these analyses, which are not specific for RANs, I study RANs for the rest of the dissertation. RANs need to both detect and execute the requests of users. Because detection and execution of requests have different requirements, I analyze them independently. I quantify how the number of active BSs can be reduced if the detection ranges of BSs are increased by cooperative transmissions. Next, I analyze how more BSs can be deactivated if the remaining active BSs cooperate to transmit data to the users. However, in addition to increasing the range, cooperative transmissions also radiate more power. This results in higher interference for other users which slows their transmissions down and, thus, increases energy consumption. Therefore, I describe how the radiated power of cooperative transmissions can be reduced if instantaneous channel knowledge is available. Because the implementation in real hardware is impractical for demonstration purposes, I show the results of a simulation that incorporates all effects I studied analytically earlier. In conclusion, I show that a sleep mode can reduce the energy consumption of RANs if applied correctly. To apply a sleep mode correctly, it is necessary to consider power-cycle durations, power profiles, and the interaction of BSs. When this knowledge is combined the energy consumption of RANs can be reduced with only a slight loss of performance. Because this results in a trade-off between energy consumption and performance, each RAN operator has to decide which trade-off is preferred."}],"file":[{"file_size":1476366,"file_id":"1398","access_level":"closed","file_name":"376-Herlich-Dissertation.pdf","date_updated":"2018-03-20T07:14:52Z","date_created":"2018-03-20T07:14:52Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"dissertation","ddc":["040"],"file_date_updated":"2018-03-20T07:14:52Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"376","user_id":"477","department":[{"_id":"75"}]},{"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"378-re-chord_journal.pdf","access_level":"closed","file_id":"1396","file_size":310961,"date_created":"2018-03-20T07:13:36Z","creator":"florida","date_updated":"2018-03-20T07:13:36Z"}],"abstract":[{"lang":"eng","text":"The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems in general. Chord, in particular, has been studied thoroughly, and many variants of Chord have been presented that optimize various criteria. Also, several implementations of Chord are available on various platforms. Though Chord is known to be very efficient and scalable and it can handle churn quite well, no protocol is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network can be recovered from any initial state in which the network is still weakly connected. This is not too surprising since it is known that the Chord network is not locally checkable for its current topology. We present a slight extension of the Chord network, called Re-Chord (reactive Chord), that turns out to be locally checkable, and we present a self-stabilizing distributed protocol for it that can recover the Re-Chord network from any initial state, in which the n peers are weakly connected, in O(nlogn) communication rounds. We also show that our protocol allows a new peer to join or an old peer to leave an already stable Re-Chord network so that within O(logn)^2) communication rounds the Re-Chord network is stable again."}],"publication":"Theory of Computing Systems","type":"journal_article","file_date_updated":"2018-03-20T07:13:36Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"477","_id":"378","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"page":"591-612","citation":{"ama":"Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: A Self-stabilizing Chord Overlay Network. <i>Theory of Computing Systems</i>. 2014;(3):591-612. doi:<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>Theory of Computing Systems</i>, no. 3 (2014): 591–612. <a href=\"https://doi.org/10.1007/s00224-012-9431-2\">https://doi.org/10.1007/s00224-012-9431-2</a>.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: A Self-stabilizing Chord Overlay Network,” <i>Theory of Computing Systems</i>, no. 3, pp. 591–612, 2014.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2014). Re-Chord: A Self-stabilizing Chord Overlay Network. <i>Theory of Computing Systems</i>, (3), 591–612. <a href=\"https://doi.org/10.1007/s00224-012-9431-2\">https://doi.org/10.1007/s00224-012-9431-2</a>","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theory of Computing Systems (2014) 591–612.","bibtex":"@article{Kniesburges_Koutsopoulos_Scheideler_2014, title={Re-Chord: A Self-stabilizing Chord Overlay Network}, DOI={<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>}, number={3}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2014}, pages={591–612} }","mla":"Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>Theory of Computing Systems</i>, no. 3, Springer, 2014, pp. 591–612, doi:<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>."},"year":"2014","issue":"3","has_accepted_license":"1","doi":"10.1007/s00224-012-9431-2","title":"Re-Chord: A Self-stabilizing Chord Overlay Network","author":[{"first_name":"Sebastian","last_name":"Kniesburges","full_name":"Kniesburges, Sebastian"},{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2017-10-17T12:42:05Z","publisher":"Springer","date_updated":"2022-01-06T06:59:35Z"},{"date_updated":"2022-01-06T06:59:36Z","author":[{"full_name":"Abshoff, Sebastian","last_name":"Abshoff","first_name":"Sebastian"},{"first_name":"Christine","last_name":"Markarian","id":"37612","full_name":"Markarian, Christine"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2017-10-17T12:42:06Z","title":"Randomized Online Algorithms for Set Cover Leasing Problems","doi":"10.1007/978-3-319-12691-3_3","has_accepted_license":"1","year":"2014","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} }","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.","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>","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>","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>.","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."},"page":"25-34","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"379","user_id":"15504","series_title":"LNCS","department":[{"_id":"63"}],"ddc":["040"],"file_date_updated":"2018-03-20T07:12:57Z","type":"conference","publication":"Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","abstract":[{"lang":"eng","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."}],"file":[{"creator":"florida","date_created":"2018-03-20T07:12:57Z","date_updated":"2018-03-20T07:12:57Z","file_name":"379-COCOA14.pdf","access_level":"closed","file_id":"1395","file_size":214299,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public"},{"_id":"380","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-20T07:05:59Z","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","type":"conference","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"}],"status":"public","file":[{"creator":"florida","date_created":"2018-03-20T07:05:59Z","date_updated":"2018-03-20T07:05:59Z","access_level":"closed","file_name":"380-WINE2014.pdf","file_id":"1394","file_size":166640,"content_type":"application/pdf","relation":"main_file","success":1}],"date_updated":"2022-01-06T06:59:36Z","date_created":"2017-10-17T12:42:06Z","author":[{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"first_name":"Alexander","last_name":"Mäcker","full_name":"Mäcker, Alexander","id":"13536"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"title":"Quality of Service in Network Creation Games","doi":"10.1007/978-3-319-13129-0_34","has_accepted_license":"1","year":"2014","page":"423-428","citation":{"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>.","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.","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} }","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.","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>.","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>"}},{"_id":"3805","department":[{"_id":"600"}],"user_id":"82920","language":[{"iso":"eng"}],"publication":"Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment","type":"conference","status":"public","date_updated":"2022-01-06T06:59:36Z","author":[{"first_name":"Frank","last_name":"Brüseke","full_name":"Brüseke, Frank"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900"},{"last_name":"Engels","full_name":"Engels, Gregor","first_name":"Gregor"},{"first_name":"Steffen","full_name":"Becker, Steffen","last_name":"Becker"}],"date_created":"2018-08-02T13:38:28Z","title":"PBlaman: performance blame analysis based on Palladio contracts","issue":"12","year":"2014","page":"1975-2004","citation":{"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.","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.","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.","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).","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.","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.","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} }"}},{"type":"conference","publication":"Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)","file":[{"date_updated":"2018-11-02T13:34:46Z","date_created":"2018-11-02T13:34:46Z","creator":"ups","file_size":228172,"file_name":"06930535.pdf","file_id":"5250","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"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.","lang":"eng"}],"user_id":"477","department":[{"_id":"75"},{"_id":"205"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"382","file_date_updated":"2018-11-02T13:34:46Z","language":[{"iso":"eng"}],"ddc":["004"],"has_accepted_license":"1","citation":{"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>","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.","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>.","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>","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} }","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>.","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."},"page":"203-210","year":"2014","author":[{"first_name":"Jörn","full_name":"Künsemöller, Jörn","last_name":"Künsemöller"},{"first_name":"Sonja","last_name":"Brangewitz","full_name":"Brangewitz, Sonja"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"},{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"date_created":"2017-10-17T12:42:06Z","date_updated":"2022-01-06T06:59:37Z","doi":"10.1109/SCC.2014.35","title":"Provider Competition in Infrastructure-as-a-Service"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"383","series_title":"Lecture Notes in Informatics (LNI)","user_id":"477","department":[{"_id":"77"}],"file_date_updated":"2018-03-20T07:04:52Z","type":"conference","status":"public","date_updated":"2022-01-06T06:59:38Z","author":[{"last_name":"Wonisch","full_name":"Wonisch, Daniel","first_name":"Daniel"},{"first_name":"Alexander","full_name":"Schremmer, Alexander","last_name":"Schremmer"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"main_file_link":[{"url":"http://eprints.uni-kiel.de/23752/"}],"has_accepted_license":"1","citation":{"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.","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.","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.","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)} }","short":"D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the Software Engineering Conference (SE), 2014, 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.","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)."},"page":"67-68","ddc":["040"],"language":[{"iso":"eng"}],"publication":"Proceedings of the Software Engineering Conference (SE)","abstract":[{"lang":"eng","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."}],"file":[{"file_size":66474,"access_level":"closed","file_name":"383-programmsFromProofsSE.pdf","file_id":"1392","date_updated":"2018-03-20T07:04:52Z","creator":"florida","date_created":"2018-03-20T07:04:52Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"date_created":"2017-10-17T12:42:06Z","title":"Programs from Proofs -- Approach and Applications","year":"2014"},{"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"387","file_date_updated":"2018-03-20T07:02:33Z","ddc":["040"],"type":"journal_article","publication":"Transactions on Algorithms","file":[{"date_updated":"2018-03-20T07:02:33Z","date_created":"2018-03-20T07:02:33Z","creator":"florida","file_size":521454,"file_id":"1388","access_level":"closed","file_name":"387-a24-awerbuch_2_.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"lang":"eng","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."}],"author":[{"first_name":"Baruch","last_name":"Awerbuch","full_name":"Awerbuch, Baruch"},{"full_name":"Richa, Andrea W.","last_name":"Richa","first_name":"Andrea W."},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"last_name":"Zhang","full_name":"Zhang, Jin","first_name":"Jin"}],"date_created":"2017-10-17T12:42:07Z","date_updated":"2022-01-06T06:59:47Z","publisher":"ACM","doi":"10.1145/2635818","title":"Principles of Robust Medium Access and an Application to Leader Election","issue":"4","has_accepted_license":"1","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>.","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} }","short":"B. Awerbuch, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, Transactions on Algorithms (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>.","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>"},"year":"2014"},{"_id":"3877","department":[{"_id":"600"}],"user_id":"82920","language":[{"iso":"eng"}],"publication":"Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers","type":"conference","status":"public","date_updated":"2022-01-06T06:59:47Z","date_created":"2018-08-11T16:13:24Z","author":[{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900","first_name":"Henning"},{"first_name":"Martin","full_name":"Trenkmann, Martin","last_name":"Trenkmann"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"},{"full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"title":"Modeling Review Argumentation for Robust Sentiment Analysis","main_file_link":[{"url":"https://www.aclweb.org/anthology/C14-1053.pdf"}],"year":"2014","page":"553-564","citation":{"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).","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.","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} }","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.","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.","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.","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."}},{"issue":"3-4","year":"2014","publisher":"Springer","date_created":"2017-10-17T12:42:08Z","title":"On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains","publication":"Computer Science - Research and Development","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"}],"file":[{"file_id":"1385","file_name":"390-HGE14.pdf","access_level":"closed","file_size":4644980,"date_created":"2018-03-20T07:00:58Z","creator":"florida","date_updated":"2018-03-20T07:00:58Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"ddc":["040"],"language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"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>.","short":"Z. Huma, C. Gerth, G. Engels, Computer Science - Research and Development (2014) 333–361.","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} }","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>","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>","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>.","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."},"page":"333-361","date_updated":"2022-01-06T06:59:52Z","author":[{"last_name":"Huma","full_name":"Huma, Zille","first_name":"Zille"},{"last_name":"Gerth","full_name":"Gerth, Christian","first_name":"Christian"},{"first_name":"Gregor","last_name":"Engels","id":"107","full_name":"Engels, Gregor"}],"doi":"10.1007/s00450-014-0254-z","type":"journal_article","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"390","user_id":"477","department":[{"_id":"66"}],"file_date_updated":"2018-03-20T07:00:58Z"},{"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/7073195"}],"title":"iSoNTRE: The Social Network Transformer into Recommendation Engine","author":[{"full_name":"Abu Quba Rana, Chamsi","last_name":"Abu Quba Rana","first_name":"Chamsi"},{"full_name":"Hassas, Salima","last_name":"Hassas","first_name":"Salima"},{"first_name":"Fayyad","full_name":"Usama, Fayyad","last_name":"Usama"},{"first_name":"Milad","id":"73059","full_name":"Alshomary, Milad","last_name":"Alshomary"},{"last_name":"Gertosio","full_name":"Gertosio, Christine","first_name":"Christine"}],"date_created":"2018-08-14T13:35:39Z","date_updated":"2022-01-06T06:59:54Z","citation":{"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} }","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.","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.","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.","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.","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.","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."},"page":"169-175","year":"2014","language":[{"iso":"eng"}],"user_id":"73059","department":[{"_id":"600"}],"_id":"3905","status":"public","type":"journal_article","publication":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)"},{"title":"A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures","date_updated":"2022-01-06T06:58:44Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"date_created":"2018-05-25T09:45:38Z","author":[{"first_name":"Sascha","id":"13291","full_name":"Brauer, Sascha","last_name":"Brauer"}],"year":"2014","citation":{"apa":"Brauer, S. (2014). <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>.","short":"S. Brauer, A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures, 2014.","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} }","ieee":"S. Brauer, <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>. 2014.","chicago":"Brauer, Sascha. <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>, 2014.","ama":"Brauer S. <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>.; 2014."},"has_accepted_license":"1","ddc":["000"],"file_date_updated":"2018-05-25T09:45:33Z","_id":"2900","department":[{"_id":"64"}],"user_id":"25078","status":"public","file":[{"creator":"feidens","date_created":"2018-05-25T09:45:33Z","date_updated":"2018-05-25T09:45:33Z","file_id":"2901","access_level":"closed","file_name":"2014_Brauer_AProbabilisticExpectationMaximizationAlgorithmForMultivariateLaplacianMixtures.pdf","file_size":971935,"content_type":"application/pdf","relation":"main_file","success":1}],"type":"mastersthesis"},{"type":"journal_article","publication":"Algorithmica","status":"public","user_id":"25078","department":[{"_id":"64"}],"_id":"2976","publication_status":"published","publication_identifier":{"eissn":["0178-4617"]},"citation":{"short":"M.R. Ackermann, J. Blömer, D. Kuntze, C. Sohler, Algorithmica 69 (2014).","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} }","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>.","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>","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>.","ieee":"M. R. Ackermann, J. Blömer, D. Kuntze, and C. Sohler, “Analysis of Agglomerative Clustering,” <i>Algorithmica</i>, vol. 69, 2014.","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>"},"intvolume":"        69","year":"2014","date_created":"2018-06-05T07:28:52Z","author":[{"last_name":"Ackermann","full_name":"Ackermann, Marcel Rudolf","first_name":"Marcel Rudolf"},{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"last_name":"Kuntze","full_name":"Kuntze, Daniel","first_name":"Daniel"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"volume":69,"publisher":"Springer US","date_updated":"2022-01-06T06:58:49Z","doi":"10.1007/s00453-012-9717-4","title":"Analysis of Agglomerative Clustering"},{"_id":"2977","user_id":"25078","department":[{"_id":"64"}],"type":"conference","publication":"2014 22nd International Conference on Pattern Recognition","status":"public","date_updated":"2022-01-06T06:58:49Z","publisher":"IEEE","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"last_name":"Bujna","full_name":"Bujna, Kathrin","first_name":"Kathrin"},{"first_name":"Daniel","full_name":"Kuntze, Daniel","last_name":"Kuntze"}],"date_created":"2018-06-05T07:29:15Z","title":"A Theoretical and Experimental Comparison of the EM and SEM Algorithm","doi":"10.1109/icpr.2014.253","publication_status":"published","publication_identifier":{"isbn":["9781479952090"]},"year":"2014","citation":{"short":"J. Blömer, K. Bujna, D. Kuntze, in: 2014 22nd International Conference on Pattern Recognition, IEEE, 2014.","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} }","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>.","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>","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>","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."}},{"year":"2014","page":"445--451","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>","ieee":"T. Jager, “Die Zukunft der Kryptographie,” <i>Datenschutz und Datensicherheit</i>, no. 7, pp. 445--451, 2014.","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>.","short":"T. Jager, Datenschutz Und Datensicherheit (2014) 445--451.","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>.","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>"},"issue":"7","title":"Die Zukunft der Kryptographie","doi":"10.1007/s11623-014-0204-8","date_updated":"2022-01-06T06:58:57Z","author":[{"last_name":"Jager","full_name":"Jager, Tibor","id":"64669","first_name":"Tibor"}],"date_created":"2018-06-07T09:21:18Z","status":"public","publication":"Datenschutz und Datensicherheit","type":"journal_article","extern":"1","_id":"3127","department":[{"_id":"558"}],"user_id":"38235"},{"user_id":"38235","department":[{"_id":"558"}],"_id":"3128","extern":"1","type":"conference","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","status":"public","date_created":"2018-06-07T09:21:46Z","author":[{"last_name":"Fleischhacker","full_name":"Fleischhacker, Nils","first_name":"Nils"},{"first_name":"Tibor","last_name":"Jager","id":"64669","full_name":"Jager, Tibor"},{"full_name":"Schröder, Dominique","last_name":"Schröder","first_name":"Dominique"}],"date_updated":"2022-01-06T06:58:57Z","doi":"10.1007/978-3-662-45611-8_27","title":"On Tight Security Proofs for Schnorr Signatures","citation":{"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>","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>.","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} }","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.","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>","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>.","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."},"page":"512--531","year":"2014"}]