[{"type":"conference","publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","status":"public","abstract":[{"text":"In this paper, we solve the local gathering problem of a swarm of n indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time O(n) in the fully synchronous FSYNC time model. Given an arbitrarily distributed (yet connected) swarm of robots, the gathering problem on the grid is to locate all robots within a 2x2- sized area that is not known beforehand. Two robots are connected if they are vertical or horizontal neighbors on the grid. The locality constraint means that no global control, no compass, no global communication and only local vision is available; hence, a robot can only see its grid neighbors up to a constant L1-distance, which also limits its movements. A robot can move to one of its eight neighboring grid cells and if two or more robots move to the same location they are merged to be only one robot. The locality constraint is the significant challenging issue here, since robot move- ments must not harm the (only globally checkable) swarm connectivity. For solving the gathering problem, we provide a synchronous algorithm { executed by every robot { which ensures that robots merge without breaking the swarm con- nectivity. In our model, robots can obtain a special state, which marks such a robot to be performing specific connec- tivity preserving movements in order to allow later merge operations of the swarm. Compared to the grid, for gath- ering in the Euclidean plane for the same robot and time model the best known upper bound is O(n^2).","lang":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16359","language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically Optimal Gathering on a Grid}, DOI={<a href=\"https://doi.org/10.1145/2935764.2935789\">10.1145/2935764.2935789</a>}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016}, pages={301–312} }","short":"A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–312.","mla":"Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM, 2016, pp. 301–12, doi:<a href=\"https://doi.org/10.1145/2935764.2935789\">10.1145/2935764.2935789</a>.","apa":"Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 301–312). ACM. <a href=\"https://doi.org/10.1145/2935764.2935789\">https://doi.org/10.1145/2935764.2935789</a>","ama":"Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. In: <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM; 2016:301-312. doi:<a href=\"https://doi.org/10.1145/2935764.2935789\">10.1145/2935764.2935789</a>","chicago":"Cord-Landwehr, Andreas, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 301–12. ACM, 2016. <a href=\"https://doi.org/10.1145/2935764.2935789\">https://doi.org/10.1145/2935764.2935789</a>.","ieee":"A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” in <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 301–312."},"page":"301-312","year":"2016","author":[{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"},{"first_name":"Daniel","last_name":"Jung","id":"37827","full_name":"Jung, Daniel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-01T12:46:35Z","publisher":"ACM","date_updated":"2022-01-06T06:52:49Z","doi":"10.1145/2935764.2935789","title":"Asymptotically Optimal Gathering on a Grid"},{"department":[{"_id":"63"}],"user_id":"15415","_id":"16360","language":[{"iso":"eng"}],"publication":"Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)","type":"conference","status":"public","abstract":[{"text":"We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of n indistinguishable, point shaped robots on a two dimensional grid. Initially, the robots form a closed chain on the grid and must keep this connectivity during the whole process of their gathering. Connectivity means, that neighboring robots of the chain need to be positioned at the same or neighboring points of the grid. In our model, gathering means to keep shortening the chain until the robots are located inside a 2*2 subgrid. Our model is completely local (no global control, no global coordinates, no compass, no global communication or vision, ...). Each robot can only see its next constant number of left and right neighbors on the chain. This fixed constant is called the viewing path length. All its operations and detections are restricted to this constant number of robots. Other robots, even if located at neighboring or the same grid point cannot be detected. Only based on the relative positions of its detectable chain neighbors, a robot can decide to obtain a certain state. Based on this state and their local knowledge, the robots do local modifications to the chain by moving to neighboring grid points without breaking the chain. These modifications are performed without the knowledge whether they lead to a global progress or not. We assume the fully synchronous FSYNC model. For this problem, we present a gathering algorithm which needs linear time. This result generalizes a result, where an open chain with specified distinguishable (and fixed) endpoints is considered. ","lang":"eng"}],"date_created":"2020-04-01T12:56:43Z","author":[{"first_name":"Sebastian","last_name":"Abshoff","full_name":"Abshoff, Sebastian"},{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"last_name":"Fischer","full_name":"Fischer, Matthias","id":"146","first_name":"Matthias"},{"first_name":"Daniel","last_name":"Jung","id":"37827","full_name":"Jung, Daniel"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publisher":"IEEE","date_updated":"2022-01-06T06:52:49Z","doi":"10.1109/IPDPS.2016.51","title":"Gathering a Closed Chain of Robots on a Grid","page":"689-699","citation":{"short":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–699.","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Gathering a Closed Chain of Robots on a Grid}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2016.51\">10.1109/IPDPS.2016.51</a>}, booktitle={Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016}, pages={689–699} }","mla":"Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i>, IEEE, 2016, pp. 689–99, doi:<a href=\"https://doi.org/10.1109/IPDPS.2016.51\">10.1109/IPDPS.2016.51</a>.","apa":"Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2016). Gathering a Closed Chain of Robots on a Grid. In <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 689–699). IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2016.51\">https://doi.org/10.1109/IPDPS.2016.51</a>","ieee":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering a Closed Chain of Robots on a Grid,” in <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2016, pp. 689–699.","chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” In <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i>, 689–99. IEEE, 2016. <a href=\"https://doi.org/10.1109/IPDPS.2016.51\">https://doi.org/10.1109/IPDPS.2016.51</a>.","ama":"Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. In: <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE; 2016:689-699. doi:<a href=\"https://doi.org/10.1109/IPDPS.2016.51\">10.1109/IPDPS.2016.51</a>"},"year":"2016"},{"language":[{"iso":"eng"}],"_id":"16364","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"conference","publication":"2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","title":"On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams","doi":"10.1109/ipdps.2016.91","date_updated":"2022-01-06T06:52:49Z","date_created":"2020-04-02T10:14:25Z","author":[{"first_name":"Alexander","last_name":"Macker","full_name":"Macker, Alexander"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","first_name":"Manuel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"year":"2016","citation":{"short":"A. Macker, M. Malatyali, F. Meyer auf der Heide, in: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016.","bibtex":"@inproceedings{Macker_Malatyali_Meyer auf der Heide_2016, title={On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams}, DOI={<a href=\"https://doi.org/10.1109/ipdps.2016.91\">10.1109/ipdps.2016.91</a>}, booktitle={2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Macker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2016} }","mla":"Macker, Alexander, et al. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.” <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/ipdps.2016.91\">10.1109/ipdps.2016.91</a>.","apa":"Macker, A., Malatyali, M., &#38; Meyer auf der Heide, F. (2016). On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. In <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. <a href=\"https://doi.org/10.1109/ipdps.2016.91\">https://doi.org/10.1109/ipdps.2016.91</a>","ieee":"A. Macker, M. Malatyali, and F. Meyer auf der Heide, “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams,” in <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2016.","chicago":"Macker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.” In <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2016. <a href=\"https://doi.org/10.1109/ipdps.2016.91\">https://doi.org/10.1109/ipdps.2016.91</a>.","ama":"Macker A, Malatyali M, Meyer auf der Heide F. On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. In: <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/ipdps.2016.91\">10.1109/ipdps.2016.91</a>"},"publication_status":"published","publication_identifier":{"isbn":["9781509021406"]}},{"doi":"10.1109/vnc.2015.7385550","title":"IEEE 802.11p unicast considered harmful","date_created":"2020-04-02T15:41:34Z","author":[{"first_name":"Florian","full_name":"Klingler, Florian","last_name":"Klingler"},{"last_name":"Dressler","full_name":"Dressler, Falko","first_name":"Falko"},{"first_name":"Christoph","last_name":"Sommer","full_name":"Sommer, Christoph"}],"date_updated":"2022-01-06T06:52:50Z","citation":{"ieee":"F. Klingler, F. Dressler, and C. Sommer, “IEEE 802.11p unicast considered harmful,” in <i>2015 IEEE Vehicular Networking Conference (VNC)</i>, 2016.","chicago":"Klingler, Florian, Falko Dressler, and Christoph Sommer. “IEEE 802.11p Unicast Considered Harmful.” In <i>2015 IEEE Vehicular Networking Conference (VNC)</i>, 2016. <a href=\"https://doi.org/10.1109/vnc.2015.7385550\">https://doi.org/10.1109/vnc.2015.7385550</a>.","ama":"Klingler F, Dressler F, Sommer C. IEEE 802.11p unicast considered harmful. In: <i>2015 IEEE Vehicular Networking Conference (VNC)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/vnc.2015.7385550\">10.1109/vnc.2015.7385550</a>","mla":"Klingler, Florian, et al. “IEEE 802.11p Unicast Considered Harmful.” <i>2015 IEEE Vehicular Networking Conference (VNC)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/vnc.2015.7385550\">10.1109/vnc.2015.7385550</a>.","short":"F. Klingler, F. Dressler, C. Sommer, in: 2015 IEEE Vehicular Networking Conference (VNC), 2016.","bibtex":"@inproceedings{Klingler_Dressler_Sommer_2016, title={IEEE 802.11p unicast considered harmful}, DOI={<a href=\"https://doi.org/10.1109/vnc.2015.7385550\">10.1109/vnc.2015.7385550</a>}, booktitle={2015 IEEE Vehicular Networking Conference (VNC)}, author={Klingler, Florian and Dressler, Falko and Sommer, Christoph}, year={2016} }","apa":"Klingler, F., Dressler, F., &#38; Sommer, C. (2016). IEEE 802.11p unicast considered harmful. In <i>2015 IEEE Vehicular Networking Conference (VNC)</i>. <a href=\"https://doi.org/10.1109/vnc.2015.7385550\">https://doi.org/10.1109/vnc.2015.7385550</a>"},"year":"2016","publication_status":"published","publication_identifier":{"isbn":["9781467394116"]},"user_id":"49153","_id":"16386","status":"public","type":"conference","publication":"2015 IEEE Vehicular Networking Conference (VNC)"},{"type":"preprint","publication":"arXiv:1609.01184","status":"public","abstract":[{"text":"We consider a scheduling problem where machines need to be rented from the\r\ncloud in order to process jobs. There are two types of machines available which\r\ncan be rented for machine-type dependent prices and for arbitrary durations.\r\nHowever, a machine-type dependent setup time is required before a machine is\r\navailable for processing. Jobs arrive online over time, have machine-type\r\ndependent sizes and have individual deadlines. The objective is to rent\r\nmachines and schedule jobs so as to meet all deadlines while minimizing the\r\nrental cost.\r\n  Since we observe the slack of jobs to have a fundamental influence on the\r\ncompetitiveness, we study the model when instances are parameterized by their\r\n(minimum) slack. An instance is called to have a slack of $\\beta$ if, for all\r\njobs, the difference between the job's release time and the latest point in\r\ntime at which it needs to be started is at least $\\beta$. While for $\\beta < s$\r\nno finite competitiveness is possible, our main result is an\r\n$O(\\frac{c}{\\varepsilon} + \\frac{1}{\\varepsilon^3})$-competitive online\r\nalgorithm for $\\beta = (1+\\varepsilon)s$ with $\\frac{1}{s} \\leq \\varepsilon\r\n\\leq 1$, where $s$ and $c$ denotes the largest setup time and the cost ratio of\r\nthe machine-types, respectively. It is complemented by a lower bound of\r\n$\\Omega(\\frac{c}{\\varepsilon})$.","lang":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16396","external_id":{"arxiv":["1609.01184"]},"language":[{"iso":"eng"}],"citation":{"ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. <i>arXiv:160901184</i>. 2016.","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>ArXiv:1609.01184</i>, 2016.","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” <i>arXiv:1609.01184</i>. 2016.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. <i>ArXiv:1609.01184</i>.","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, ArXiv:1609.01184 (2016).","mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>ArXiv:1609.01184</i>, 2016.","bibtex":"@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient Scheduling on Machines from the Cloud}, journal={arXiv:1609.01184}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016} }"},"year":"2016","date_created":"2020-04-03T09:24:28Z","author":[{"last_name":"Mäcker","full_name":"Mäcker, Alexander","id":"13536","first_name":"Alexander"},{"full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}],"date_updated":"2022-01-06T06:52:50Z","title":"Cost-efficient Scheduling on Machines from the Cloud"},{"user_id":"15504","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"164","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","date_created":"2017-10-17T12:41:24Z","author":[{"full_name":"Czech, Mike","last_name":"Czech","first_name":"Mike"}],"supervisor":[{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:50Z","title":"Predicting Rankings of Software Verification Tools Using Kernels for Structured Data","citation":{"apa":"Czech, M. (2016). <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn.","bibtex":"@book{Czech_2016, title={Predicting Rankings of Software Verification Tools Using Kernels for Structured Data}, publisher={Universität Paderborn}, author={Czech, Mike}, year={2016} }","mla":"Czech, Mike. <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn, 2016.","short":"M. Czech, Predicting Rankings of Software Verification Tools Using Kernels for Structured Data, Universität Paderborn, 2016.","ieee":"M. Czech, <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn, 2016.","chicago":"Czech, Mike. <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn, 2016.","ama":"Czech M. <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn; 2016."},"year":"2016"},{"type":"dissertation","status":"public","_id":"13860","user_id":"15911","department":[{"_id":"49"}],"language":[{"iso":"eng"}],"year":"2016","citation":{"mla":"Bause, Fabian. <i>Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren</i>. Universität Paderborn, 2016.","short":"F. Bause, Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren, Universität Paderborn, 2016.","bibtex":"@book{Bause_2016, title={Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren}, publisher={Universität Paderborn}, author={Bause, Fabian}, year={2016} }","apa":"Bause, F. (2016). <i>Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren</i>. Universität Paderborn.","ieee":"F. Bause, <i>Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren</i>. Universität Paderborn, 2016.","chicago":"Bause, Fabian. <i>Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren</i>. Universität Paderborn, 2016.","ama":"Bause F. <i>Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren</i>. Universität Paderborn; 2016."},"date_updated":"2022-01-06T06:51:45Z","publisher":"Universität Paderborn","date_created":"2019-10-15T10:38:36Z","author":[{"full_name":"Bause, Fabian","last_name":"Bause","first_name":"Fabian"}],"title":"Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren"},{"language":[{"iso":"eng"}],"_id":"13864","department":[{"_id":"49"}],"user_id":"15911","status":"public","type":"conference","title":"5.3.1 - Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren","doi":"10.5162/SENSOREN2016/5.3.1","publisher":"LibreCat University","date_updated":"2022-01-06T06:51:45Z","date_created":"2019-10-15T11:03:43Z","author":[{"last_name":"Bause","full_name":"Bause, F.","first_name":"F."},{"id":"213","full_name":"Henning, Bernd","last_name":"Henning","first_name":"Bernd"}],"year":"2016","citation":{"apa":"Bause, F., &#38; Henning, B. (2016). 5.3.1 - Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren. LibreCat University. <a href=\"https://doi.org/10.5162/SENSOREN2016/5.3.1\">https://doi.org/10.5162/SENSOREN2016/5.3.1</a>","short":"F. Bause, B. Henning, in: LibreCat University, 2016.","bibtex":"@inproceedings{Bause_Henning_2016, title={5.3.1 - Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren}, DOI={<a href=\"https://doi.org/10.5162/SENSOREN2016/5.3.1\">10.5162/SENSOREN2016/5.3.1</a>}, publisher={LibreCat University}, author={Bause, F. and Henning, Bernd}, year={2016} }","mla":"Bause, F., and Bernd Henning. <i>5.3.1 - Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren</i>. LibreCat University, 2016, doi:<a href=\"https://doi.org/10.5162/SENSOREN2016/5.3.1\">10.5162/SENSOREN2016/5.3.1</a>.","ama":"Bause F, Henning B. 5.3.1 - Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren. In: LibreCat University; 2016. doi:<a href=\"https://doi.org/10.5162/SENSOREN2016/5.3.1\">10.5162/SENSOREN2016/5.3.1</a>","chicago":"Bause, F., and Bernd Henning. “5.3.1 - Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren.” LibreCat University, 2016. <a href=\"https://doi.org/10.5162/SENSOREN2016/5.3.1\">https://doi.org/10.5162/SENSOREN2016/5.3.1</a>.","ieee":"F. Bause and B. Henning, “5.3.1 - Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren,” 2016."}},{"language":[{"iso":"eng"}],"_id":"13865","user_id":"15911","department":[{"_id":"49"}],"status":"public","type":"conference","title":"3.2.3 - Direktgravimetrischer Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung","doi":"10.5162/SENSOREN2016/3.2.3","date_updated":"2022-01-06T06:51:45Z","publisher":"LibreCat University","date_created":"2019-10-15T11:04:18Z","author":[{"first_name":"S.","full_name":"Ester, S.","last_name":"Ester"},{"first_name":"M.","full_name":"Struschka, M.","last_name":"Struschka"},{"first_name":"Bernd","last_name":"Henning","full_name":"Henning, Bernd","id":"213"}],"year":"2016","citation":{"chicago":"Ester, S., M. Struschka, and Bernd Henning. “3.2.3 - Direktgravimetrischer Partikelmasse-Sensor Zur Quasikontinuierlichen Emissionsmessung.” LibreCat University, 2016. <a href=\"https://doi.org/10.5162/SENSOREN2016/3.2.3\">https://doi.org/10.5162/SENSOREN2016/3.2.3</a>.","ieee":"S. Ester, M. Struschka, and B. Henning, “3.2.3 - Direktgravimetrischer Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung,” 2016.","ama":"Ester S, Struschka M, Henning B. 3.2.3 - Direktgravimetrischer Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung. In: LibreCat University; 2016. doi:<a href=\"https://doi.org/10.5162/SENSOREN2016/3.2.3\">10.5162/SENSOREN2016/3.2.3</a>","bibtex":"@inproceedings{Ester_Struschka_Henning_2016, title={3.2.3 - Direktgravimetrischer Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung}, DOI={<a href=\"https://doi.org/10.5162/SENSOREN2016/3.2.3\">10.5162/SENSOREN2016/3.2.3</a>}, publisher={LibreCat University}, author={Ester, S. and Struschka, M. and Henning, Bernd}, year={2016} }","mla":"Ester, S., et al. <i>3.2.3 - Direktgravimetrischer Partikelmasse-Sensor Zur Quasikontinuierlichen Emissionsmessung</i>. LibreCat University, 2016, doi:<a href=\"https://doi.org/10.5162/SENSOREN2016/3.2.3\">10.5162/SENSOREN2016/3.2.3</a>.","short":"S. Ester, M. Struschka, B. Henning, in: LibreCat University, 2016.","apa":"Ester, S., Struschka, M., &#38; Henning, B. (2016). 3.2.3 - Direktgravimetrischer Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung. LibreCat University. <a href=\"https://doi.org/10.5162/SENSOREN2016/3.2.3\">https://doi.org/10.5162/SENSOREN2016/3.2.3</a>"}},{"title":"Towards the price of leasing online","date_created":"2017-10-17T12:41:18Z","publisher":"Springer","year":"2016","issue":"4","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":654903,"file_id":"5318","access_level":"closed","file_name":"Abshoff-TowardsThePriceOfLeasingOnline.pdf","date_updated":"2018-11-02T15:57:25Z","date_created":"2018-11-02T15:57:25Z","creator":"ups"}],"abstract":[{"text":"We consider online optimization problems in which certain goods have to be acquired in order to provide a service or infrastructure. Classically, decisions for such problems are considered as final: one buys the goods. However, in many real world applications, there is a shift away from the idea of buying goods. Instead, leasing is often a more flexible and lucrative business model. Research has realized this shift and recently initiated the theoretical study of leasing models (Anthony and Gupta in Proceedings of the integer programming and combinatorial optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27, 2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work and suggest a more systematic study of leasing aspects for a class of online optimization problems. We provide two major technical results. We introduce the leasing variant of online set multicover and give an O(log(mK)logn)-competitive algorithm (with n, m, and K being the number of elements, sets, and leases, respectively). Our results also imply improvements for the non-leasing variant of online set cover. Moreover, we extend results for the leasing variant of online facility location. Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive algorithm for this problem (with n and K being the number of clients and leases, respectively). We remove the dependency on n (and, thereby, on time). In general, this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax). For many natural problem instances, the bound improves to O(K2).","lang":"eng"}],"publication":"Journal of Combinatorial Optimization","doi":"10.1007/s10878-015-9915-5","author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastian","first_name":"Sebastian"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"id":"37612","full_name":"Markarian, Christine","last_name":"Markarian","first_name":"Christine"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"full_name":"Pietrzyk, Peter ","last_name":"Pietrzyk","first_name":"Peter "}],"date_updated":"2022-01-06T06:51:46Z","citation":{"apa":"Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., &#38; Pietrzyk, P. (2016). Towards the price of leasing online. <i>Journal of Combinatorial Optimization</i>, (4), 1197--1216. <a href=\"https://doi.org/10.1007/s10878-015-9915-5\">https://doi.org/10.1007/s10878-015-9915-5</a>","bibtex":"@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards the price of leasing online}, DOI={<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer}, author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216} }","short":"S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk, Journal of Combinatorial Optimization (2016) 1197--1216.","mla":"Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” <i>Journal of Combinatorial Optimization</i>, no. 4, Springer, 2016, pp. 1197--1216, doi:<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>.","chicago":"Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer auf der Heide, and Peter  Pietrzyk. “Towards the Price of Leasing Online.” <i>Journal of Combinatorial Optimization</i>, no. 4 (2016): 1197--1216. <a href=\"https://doi.org/10.1007/s10878-015-9915-5\">https://doi.org/10.1007/s10878-015-9915-5</a>.","ieee":"S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk, “Towards the price of leasing online,” <i>Journal of Combinatorial Optimization</i>, no. 4, pp. 1197--1216, 2016.","ama":"Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards the price of leasing online. <i>Journal of Combinatorial Optimization</i>. 2016;(4):1197--1216. doi:<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>"},"page":" 1197--1216","has_accepted_license":"1","file_date_updated":"2018-11-02T15:57:25Z","user_id":"477","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"139","status":"public","type":"journal_article"},{"has_accepted_license":"1","year":"2016","citation":{"ieee":"A. Jungmann, <i>Towards On-The-Fly Image Processing</i>. Universität Paderborn, 2016.","chicago":"Jungmann, Alexander. <i>Towards On-The-Fly Image Processing</i>. Universität Paderborn, 2016.","ama":"Jungmann A. <i>Towards On-The-Fly Image Processing</i>. Universität Paderborn; 2016.","apa":"Jungmann, A. (2016). <i>Towards On-The-Fly Image Processing</i>. Universität Paderborn.","short":"A. Jungmann, Towards On-The-Fly Image Processing, Universität Paderborn, 2016.","mla":"Jungmann, Alexander. <i>Towards On-The-Fly Image Processing</i>. Universität Paderborn, 2016.","bibtex":"@book{Jungmann_2016, title={Towards On-The-Fly Image Processing}, publisher={Universität Paderborn}, author={Jungmann, Alexander}, year={2016} }"},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:49Z","date_created":"2017-10-17T12:41:18Z","supervisor":[{"first_name":"Franz","last_name":"Rammig","full_name":"Rammig, Franz"}],"author":[{"full_name":"Jungmann, Alexander","last_name":"Jungmann","first_name":"Alexander"}],"title":"Towards On-The-Fly Image Processing","type":"dissertation","status":"public","file":[{"file_name":"140-Dissertation-Alexander_Jungmann.pdf","access_level":"closed","file_id":"1559","file_size":8006614,"creator":"florida","date_created":"2018-03-21T13:00:24Z","date_updated":"2018-03-21T13:00:24Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"_id":"140","project":[{"_id":"1","name":"SFB 901"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"70"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-03-21T13:00:24Z"},{"citation":{"ama":"Mohr F. <i>Towards Automated Service Composition Under Quality Constraints</i>. Universität Paderborn; 2016. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-171\">10.17619/UNIPB/1-171</a>","ieee":"F. Mohr, <i>Towards Automated Service Composition Under Quality Constraints</i>. Universität Paderborn, 2016.","chicago":"Mohr, Felix. <i>Towards Automated Service Composition Under Quality Constraints</i>. Universität Paderborn, 2016. <a href=\"https://doi.org/10.17619/UNIPB/1-171\">https://doi.org/10.17619/UNIPB/1-171</a>.","bibtex":"@book{Mohr_2016, title={Towards Automated Service Composition Under Quality Constraints}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-171\">10.17619/UNIPB/1-171</a>}, publisher={Universität Paderborn}, author={Mohr, Felix}, year={2016} }","short":"F. Mohr, Towards Automated Service Composition Under Quality Constraints, Universität Paderborn, 2016.","mla":"Mohr, Felix. <i>Towards Automated Service Composition Under Quality Constraints</i>. Universität Paderborn, 2016, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-171\">10.17619/UNIPB/1-171</a>.","apa":"Mohr, F. (2016). <i>Towards Automated Service Composition Under Quality Constraints</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-171\">https://doi.org/10.17619/UNIPB/1-171</a>"},"year":"2016","supervisor":[{"full_name":"Kleine Büning, Hans","last_name":"Kleine Büning","first_name":"Hans"}],"date_created":"2017-10-17T12:41:19Z","author":[{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:55Z","doi":"10.17619/UNIPB/1-171","title":"Towards Automated Service Composition Under Quality Constraints","type":"dissertation","status":"public","user_id":"477","department":[{"_id":"355"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"141"},{"date_updated":"2022-01-06T06:51:56Z","author":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander","first_name":"Alexander"},{"first_name":"Thim Frederik","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319"}],"date_created":"2017-10-17T12:41:19Z","title":"Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks","doi":"10.1007/978-3-662-53426-7_6","has_accepted_license":"1","year":"2016","citation":{"mla":"Scheideler, Christian, et al. “Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks.” <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>, 2016, pp. 71--84, doi:<a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">10.1007/978-3-662-53426-7_6</a>.","bibtex":"@inproceedings{Scheideler_Setzer_Strothmann_2016, series={LNCS}, title={Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">10.1007/978-3-662-53426-7_6</a>}, booktitle={Proceedings of the 30th International Symposium on Distributed Computing (DISC)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann, Thim Frederik}, year={2016}, pages={71--84}, collection={LNCS} }","short":"C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 30th International Symposium on Distributed Computing (DISC), 2016, pp. 71--84.","apa":"Scheideler, C., Setzer, A., &#38; Strothmann, T. F. (2016). Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i> (pp. 71--84). <a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">https://doi.org/10.1007/978-3-662-53426-7_6</a>","ieee":"C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks,” in <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>, 2016, pp. 71--84.","chicago":"Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann. “Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks.” In <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>, 71--84. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">https://doi.org/10.1007/978-3-662-53426-7_6</a>.","ama":"Scheideler C, Setzer A, Strothmann TF. Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In: <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2016:71--84. doi:<a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">10.1007/978-3-662-53426-7_6</a>"},"page":"71--84","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"142","user_id":"477","series_title":"LNCS","department":[{"_id":"79"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T12:59:29Z","type":"conference","publication":"Proceedings of the 30th International Symposium on Distributed Computing (DISC)","abstract":[{"lang":"eng","text":"For overlay networks, the ability to recover from a variety of problems like membership changes or faults is a key element to preserve their functionality. In recent years, various self-stabilizing overlay networks have been proposed that have the advantage of being able to recover from any illegal state. However, the vast majority of these networks cannot give any guarantees on its functionality while the recovery process is going on. We are especially interested in searchability, i.e., the functionality that search messages for a specific identifier are answered successfully if a node with that identifier exists in the network. We investigate overlay networks that are not only self-stabilizing but that also ensure that monotonic searchability is maintained while the recovery process is going on, as long as there are no corrupted messages in the system. More precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well. Monotonic searchability was recently introduced in OPODIS 2015, in which the authors provide a solution for a simple line topology.We present the first universal approach to maintain monotonic searchability that is applicable to a wide range of topologies. As the base for our approach, we introduce a set of primitives for manipulating overlay networks that allows us to maintain searchability and show how existing protocols can be transformed to use theses primitives.We complement this result with a generic search protocol that together with the use of our primitives guarantees monotonic searchability.As an additional feature, searching existing nodes with the generic search protocol is as fast as searching a node with any other fixed routing protocol once the topology has stabilized."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"142-SchSetStrDISC16.pdf","access_level":"closed","file_id":"1558","file_size":209638,"creator":"florida","date_created":"2018-03-21T12:59:29Z","date_updated":"2018-03-21T12:59:29Z"}],"status":"public"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"143","user_id":"477","series_title":"LNCS","department":[{"_id":"63"}],"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T14:20:45Z","type":"conference","publication":"Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)","abstract":[{"text":"We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying graph of bounded genus k. Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP with toroidal embedding (genus 1) is in NC when the input contains a toroidal embedding of the circuit. In addition to extending this result from genus 1 to any bounded genus k, and unlike the work reported by Limaye et al., we do not require a precomputed embedding to be given. Most importantly, our results imply that given a P-complete problem, it is possible to find an algorithm that makes the problem fall into NC by fixing one or more parameters. Hence, we deduce the interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work that uses treewidth as parameter was also presented by Elberfeld et al. in [6].","lang":"eng"}],"file":[{"creator":"ups","date_created":"2018-11-02T14:20:45Z","date_updated":"2018-11-02T14:20:45Z","file_id":"5269","access_level":"closed","file_name":"TheMonotoneCircuitValueProblem.pdf","file_size":234587,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","date_updated":"2022-01-06T06:51:57Z","author":[{"full_name":"Abu-Khzam, Faisal N. ","last_name":"Abu-Khzam","first_name":"Faisal N. "},{"first_name":"Shouwei","last_name":"Li","full_name":"Li, Shouwei"},{"last_name":"Markarian","full_name":"Markarian, Christine","id":"37612","first_name":"Christine"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Pavel","full_name":"Podlipyan, Pavel","last_name":"Podlipyan"}],"date_created":"2017-10-17T12:41:19Z","title":"The Monotone Circuit Value Problem with Bounded Genus Is in NC","doi":"10.1007/978-3-319-42634-1_8","has_accepted_license":"1","year":"2016","citation":{"bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={The Monotone Circuit Value Problem with Bounded Genus Is in NC}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>}, booktitle={Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)}, author={Abu-Khzam, Faisal N.  and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={92–102}, collection={LNCS} }","mla":"Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 2016, pp. 92–102, doi:<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>.","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102.","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2016). The Monotone Circuit Value Problem with Bounded Genus Is in NC. In <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i> (pp. 92–102). <a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">https://doi.org/10.1007/978-3-319-42634-1_8</a>","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. The Monotone Circuit Value Problem with Bounded Genus Is in NC. In: <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>. LNCS. ; 2016:92-102. doi:<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>","chicago":"Abu-Khzam, Faisal N. , Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” In <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 92–102. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">https://doi.org/10.1007/978-3-319-42634-1_8</a>.","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 2016, pp. 92–102."},"page":"92-102"},{"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T12:58:42Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"144","user_id":"42447","abstract":[{"lang":"eng","text":"Following the direction pioneered by Fiat and Papadimitriou in their 2010 paper [12], we study the complexity of deciding the existence of mixed equilibria for minimization games where players use valuations other than expectation to evaluate their costs. We consider risk-averse players seeking to minimize the sum V=E+R of expectationE and a risk valuationR of their costs; R is non-negative and vanishes exactly when the cost incurred to a player is constant over all choices of strategies by the other players. In a V-equilibrium, no player could unilaterally reduce her cost.Say that V has the Weak-Equilibrium-for-Expectation property if all strategies supported in a player's best-response mixed strategy incur the same conditional expectation of her cost. We introduce E-strict concavity and observe that every E-strictly concave valuation has the Weak-Equilibrium-for-Expectation property. We focus on a broad class of valuations shown to have the Weak-Equilibrium-for-Expectation property, which we exploit to prove two main complexity results, the first of their kind, for the two simplest cases of the problem:• Two strategies: Deciding the existence of a V-equilibrium is strongly NP-hard for the restricted class of player-specific scheduling games on two ordered links [22], when choosing R as (1)Var (variance), or (2)SD (standard deviation), or (3) a concave linear sum of even moments of small order.• Two players: Deciding the existence of a V-equilibrium is strongly NP-hard when choosing R as (1)γ⋅Var, or (2)γ⋅SD, where γ>0 is the risk-coefficient, or choosing V as (3) a convex combination of E+γ⋅Var and the concave ν-valuationν−1(E(ν(⋅))), where ν(x)=xr, with r≥2. This is a concrete consequence of a general strong NP-hardness result that only needs the Weak-Equilibrium-for-Expectation property and a few additional properties for V; its proof involves a reduction with a single parameter, which can be chosen efficiently so that each valuation satisfies the additional properties."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":633599,"access_level":"closed","file_name":"144-Monien_Mavronicolas-TCS2016_01.pdf","file_id":"1557","date_updated":"2018-03-21T12:58:42Z","date_created":"2018-03-21T12:58:42Z","creator":"florida"}],"status":"public","type":"journal_article","publication":"Theoretical Computer Science","title":"The complexity of equilibria for risk-modeling valuations","doi":"10.1016/j.tcs.2016.04.013","date_updated":"2022-01-06T06:51:59Z","publisher":"Elsevier","date_created":"2017-10-17T12:41:20Z","author":[{"last_name":"Monien","full_name":"Monien, Burkhard","first_name":"Burkhard"},{"full_name":"Mavronicolas, Marios","last_name":"Mavronicolas","first_name":"Marios"}],"volume":634,"year":"2016","citation":{"bibtex":"@article{Monien_Mavronicolas_2016, title={The complexity of equilibria for risk-modeling valuations}, volume={634}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">10.1016/j.tcs.2016.04.013</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Monien, Burkhard and Mavronicolas, Marios}, year={2016}, pages={67–96} }","short":"B. Monien, M. Mavronicolas, Theoretical Computer Science 634 (2016) 67–96.","mla":"Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria for Risk-Modeling Valuations.” <i>Theoretical Computer Science</i>, vol. 634, Elsevier, 2016, pp. 67–96, doi:<a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">10.1016/j.tcs.2016.04.013</a>.","apa":"Monien, B., &#38; Mavronicolas, M. (2016). The complexity of equilibria for risk-modeling valuations. <i>Theoretical Computer Science</i>, <i>634</i>, 67–96. <a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">https://doi.org/10.1016/j.tcs.2016.04.013</a>","chicago":"Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria for Risk-Modeling Valuations.” <i>Theoretical Computer Science</i> 634 (2016): 67–96. <a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">https://doi.org/10.1016/j.tcs.2016.04.013</a>.","ieee":"B. Monien and M. Mavronicolas, “The complexity of equilibria for risk-modeling valuations,” <i>Theoretical Computer Science</i>, vol. 634, pp. 67–96, 2016.","ama":"Monien B, Mavronicolas M. The complexity of equilibria for risk-modeling valuations. <i>Theoretical Computer Science</i>. 2016;634:67-96. doi:<a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">10.1016/j.tcs.2016.04.013</a>"},"intvolume":"       634","page":"67-96","has_accepted_license":"1"},{"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":3121363,"file_name":"145-Feldotto_et_al-2016-Concurrency_and_Computation-_Practice_and_Experience.pdf","file_id":"1556","access_level":"closed","date_updated":"2018-03-21T12:57:57Z","date_created":"2018-03-21T12:57:57Z","creator":"florida"}],"abstract":[{"lang":"eng","text":"Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we present the peer-to-peer system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM comes with an extensive layer model to support various facets and protocols of peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show how it can be used for detailed measurements of large-scale peer-to-peer networks. We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated, and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. An immediate comparison of different configurations and overlays under different aspects is possible directly after the execution without any manual post-processing. "}],"publication":"Concurrency and Computation: Practice and Experience","ddc":["040"],"year":"2016","issue":"5","title":"Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM","date_created":"2017-10-17T12:41:20Z","publisher":"Wiley Online Library","status":"public","type":"journal_article","file_date_updated":"2018-03-21T12:57:57Z","department":[{"_id":"79"},{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"145","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"page":"1655-1677","intvolume":"        28","citation":{"chicago":"Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” <i>Concurrency and Computation: Practice and Experience</i> 28, no. 5 (2016): 1655–77. <a href=\"https://doi.org/10.1002/cpe.3716\">https://doi.org/10.1002/cpe.3716</a>.","ieee":"M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM,” <i>Concurrency and Computation: Practice and Experience</i>, vol. 28, no. 5, pp. 1655–1677, 2016.","ama":"Feldotto M, Graffi K. Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. <i>Concurrency and Computation: Practice and Experience</i>. 2016;28(5):1655-1677. doi:<a href=\"https://doi.org/10.1002/cpe.3716\">10.1002/cpe.3716</a>","apa":"Feldotto, M., &#38; Graffi, K. (2016). Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. <i>Concurrency and Computation: Practice and Experience</i>, <i>28</i>(5), 1655–1677. <a href=\"https://doi.org/10.1002/cpe.3716\">https://doi.org/10.1002/cpe.3716</a>","short":"M. Feldotto, K. Graffi, Concurrency and Computation: Practice and Experience 28 (2016) 1655–1677.","bibtex":"@article{Feldotto_Graffi_2016, title={Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM}, volume={28}, DOI={<a href=\"https://doi.org/10.1002/cpe.3716\">10.1002/cpe.3716</a>}, number={5}, journal={Concurrency and Computation: Practice and Experience}, publisher={Wiley Online Library}, author={Feldotto, Matthias and Graffi, Kalman}, year={2016}, pages={1655–1677} }","mla":"Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” <i>Concurrency and Computation: Practice and Experience</i>, vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:<a href=\"https://doi.org/10.1002/cpe.3716\">10.1002/cpe.3716</a>."},"has_accepted_license":"1","publication_status":"published","doi":"10.1002/cpe.3716","volume":28,"author":[{"last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","id":"14052","first_name":"Matthias"},{"full_name":"Graffi, Kalman","last_name":"Graffi","first_name":"Kalman"}],"date_updated":"2022-01-06T06:52:00Z"},{"publication":"Applied Health Economics and Health Policy","type":"journal_article","status":"public","_id":"1450","department":[{"_id":"186"},{"_id":"578"}],"user_id":"67265","extern":"1","publication_identifier":{"issn":["1175-5652","1179-1896"]},"publication_status":"published","issue":"3","year":"2016","page":"293-312","intvolume":"        14","citation":{"apa":"Pelster, M., Hagemann, V., &#38; Laporte Uribe, F. (2016). Key Aspects of a Sustainable Health Insurance System in Germany. <i>Applied Health Economics and Health Policy</i>, <i>14</i>(3), 293–312. <a href=\"https://doi.org/10.1007/s40258-016-0223-8\">https://doi.org/10.1007/s40258-016-0223-8</a>","mla":"Pelster, Matthias, et al. “Key Aspects of a Sustainable Health Insurance System in Germany.” <i>Applied Health Economics and Health Policy</i>, vol. 14, no. 3, Springer Nature, 2016, pp. 293–312, doi:<a href=\"https://doi.org/10.1007/s40258-016-0223-8\">10.1007/s40258-016-0223-8</a>.","short":"M. Pelster, V. Hagemann, F. Laporte Uribe, Applied Health Economics and Health Policy 14 (2016) 293–312.","bibtex":"@article{Pelster_Hagemann_Laporte Uribe_2016, title={Key Aspects of a Sustainable Health Insurance System in Germany}, volume={14}, DOI={<a href=\"https://doi.org/10.1007/s40258-016-0223-8\">10.1007/s40258-016-0223-8</a>}, number={3}, journal={Applied Health Economics and Health Policy}, publisher={Springer Nature}, author={Pelster, Matthias and Hagemann, Vera and Laporte Uribe, Franziska}, year={2016}, pages={293–312} }","ama":"Pelster M, Hagemann V, Laporte Uribe F. Key Aspects of a Sustainable Health Insurance System in Germany. <i>Applied Health Economics and Health Policy</i>. 2016;14(3):293-312. doi:<a href=\"https://doi.org/10.1007/s40258-016-0223-8\">10.1007/s40258-016-0223-8</a>","ieee":"M. Pelster, V. Hagemann, and F. Laporte Uribe, “Key Aspects of a Sustainable Health Insurance System in Germany,” <i>Applied Health Economics and Health Policy</i>, vol. 14, no. 3, pp. 293–312, 2016.","chicago":"Pelster, Matthias, Vera Hagemann, and Franziska Laporte Uribe. “Key Aspects of a Sustainable Health Insurance System in Germany.” <i>Applied Health Economics and Health Policy</i> 14, no. 3 (2016): 293–312. <a href=\"https://doi.org/10.1007/s40258-016-0223-8\">https://doi.org/10.1007/s40258-016-0223-8</a>."},"publisher":"Springer Nature","date_updated":"2022-01-06T06:52:00Z","volume":14,"author":[{"first_name":"Matthias","id":"67265","full_name":"Pelster, Matthias","orcid":" https://orcid.org/0000-0001-5740-2420","last_name":"Pelster"},{"full_name":"Hagemann, Vera","last_name":"Hagemann","first_name":"Vera"},{"first_name":"Franziska","last_name":"Laporte Uribe","full_name":"Laporte Uribe, Franziska"}],"date_created":"2018-03-20T11:32:44Z","title":"Key Aspects of a Sustainable Health Insurance System in Germany","doi":"10.1007/s40258-016-0223-8"},{"year":"2016","page":"163-164","intvolume":"        47","citation":{"ama":"Zentgraf T. Doppler-Effekt für rotierende Objekte. <i>Physik in unserer Zeit</i>. 2016;47(4):163-164. doi:<a href=\"https://doi.org/10.1002/piuz.201690063\">10.1002/piuz.201690063</a>","ieee":"T. Zentgraf, “Doppler-Effekt für rotierende Objekte,” <i>Physik in unserer Zeit</i>, vol. 47, no. 4, pp. 163–164, 2016.","chicago":"Zentgraf, Thomas. “Doppler-Effekt Für Rotierende Objekte.” <i>Physik in Unserer Zeit</i> 47, no. 4 (2016): 163–64. <a href=\"https://doi.org/10.1002/piuz.201690063\">https://doi.org/10.1002/piuz.201690063</a>.","apa":"Zentgraf, T. (2016). Doppler-Effekt für rotierende Objekte. <i>Physik in Unserer Zeit</i>, <i>47</i>(4), 163–164. <a href=\"https://doi.org/10.1002/piuz.201690063\">https://doi.org/10.1002/piuz.201690063</a>","short":"T. Zentgraf, Physik in Unserer Zeit 47 (2016) 163–164.","bibtex":"@article{Zentgraf_2016, title={Doppler-Effekt für rotierende Objekte}, volume={47}, DOI={<a href=\"https://doi.org/10.1002/piuz.201690063\">10.1002/piuz.201690063</a>}, number={4}, journal={Physik in unserer Zeit}, publisher={Wiley-Blackwell}, author={Zentgraf, Thomas}, year={2016}, pages={163–164} }","mla":"Zentgraf, Thomas. “Doppler-Effekt Für Rotierende Objekte.” <i>Physik in Unserer Zeit</i>, vol. 47, no. 4, Wiley-Blackwell, 2016, pp. 163–64, doi:<a href=\"https://doi.org/10.1002/piuz.201690063\">10.1002/piuz.201690063</a>."},"publication_identifier":{"issn":["0031-9252"]},"publication_status":"published","issue":"4","title":"Doppler-Effekt für rotierende Objekte","doi":"10.1002/piuz.201690063","publisher":"Wiley-Blackwell","date_updated":"2022-01-06T06:52:02Z","volume":47,"date_created":"2018-03-20T18:20:07Z","author":[{"first_name":"Thomas","orcid":"0000-0002-8662-1101","last_name":"Zentgraf","id":"30525","full_name":"Zentgraf, Thomas"}],"status":"public","publication":"Physik in unserer Zeit","type":"journal_article","_id":"1455","department":[{"_id":"15"},{"_id":"230"}],"user_id":"30525"},{"_id":"131","date_updated":"2022-01-06T06:51:28Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"8","name":"SFB 901 - Subprojekt A4"},{"name":"SFB 901 - Project Area A","_id":"2"}],"publisher":"Universität Paderborn","author":[{"full_name":"Holzmann, Annabel","last_name":"Holzmann","first_name":"Annabel"}],"date_created":"2017-10-17T12:41:17Z","user_id":"477","title":"Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren","language":[{"iso":"ger"}],"type":"bachelorsthesis","year":"2016","status":"public","citation":{"ieee":"A. Holzmann, <i>Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren</i>. Universität Paderborn, 2016.","chicago":"Holzmann, Annabel. <i>Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren</i>. Universität Paderborn, 2016.","ama":"Holzmann A. <i>Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren</i>. Universität Paderborn; 2016.","mla":"Holzmann, Annabel. <i>Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren</i>. Universität Paderborn, 2016.","bibtex":"@book{Holzmann_2016, title={Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren}, publisher={Universität Paderborn}, author={Holzmann, Annabel}, year={2016} }","short":"A. Holzmann, Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren, Universität Paderborn, 2016.","apa":"Holzmann, A. (2016). <i>Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren</i>. Universität Paderborn."}},{"department":[{"_id":"78"}],"user_id":"398","_id":"13151","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"language":[{"iso":"eng"}],"publication":"Computer and Games","type":"conference","status":"public","date_created":"2019-09-09T09:01:09Z","author":[{"first_name":"Tobias","last_name":"Graf","full_name":"Graf, Tobias"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"date_updated":"2022-01-06T06:51:29Z","title":"Using Deep Convolutional Neural Networks in Monte Carlo Tree Search","citation":{"chicago":"Graf, Tobias, and Marco Platzner. “Using Deep Convolutional Neural Networks in Monte Carlo Tree Search.” In <i>Computer and Games</i>, 2016.","ieee":"T. Graf and M. Platzner, “Using Deep Convolutional Neural Networks in Monte Carlo Tree Search,” in <i>Computer and Games</i>, 2016.","ama":"Graf T, Platzner M. Using Deep Convolutional Neural Networks in Monte Carlo Tree Search. In: <i>Computer and Games</i>. ; 2016.","apa":"Graf, T., &#38; Platzner, M. (2016). Using Deep Convolutional Neural Networks in Monte Carlo Tree Search. In <i>Computer and Games</i>.","mla":"Graf, Tobias, and Marco Platzner. “Using Deep Convolutional Neural Networks in Monte Carlo Tree Search.” <i>Computer and Games</i>, 2016.","bibtex":"@inproceedings{Graf_Platzner_2016, title={Using Deep Convolutional Neural Networks in Monte Carlo Tree Search}, booktitle={Computer and Games}, author={Graf, Tobias and Platzner, Marco}, year={2016} }","short":"T. Graf, M. Platzner, in: Computer and Games, 2016."},"year":"2016"}]