--- _id: '5205' author: - first_name: Johannes full_name: Späth, Johannes last_name: Späth - first_name: Lisa full_name: Nguyen Quang Do, Lisa last_name: Nguyen Quang Do - first_name: Karim full_name: Ali, Karim last_name: Ali - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 citation: ama: 'Späth J, Nguyen Quang Do L, Ali K, Bodden E. Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java. In: European Conference on Object-Oriented Programming (ECOOP). ; 2016.' apa: 'Späth, J., Nguyen Quang Do, L., Ali, K., & Bodden, E. (2016). Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java. In European Conference on Object-Oriented Programming (ECOOP).' bibtex: '@inproceedings{Späth_Nguyen Quang Do_Ali_Bodden_2016, title={Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java}, booktitle={European Conference on Object-Oriented Programming (ECOOP)}, author={Späth, Johannes and Nguyen Quang Do, Lisa and Ali, Karim and Bodden, Eric}, year={2016} }' chicago: 'Späth, Johannes, Lisa Nguyen Quang Do, Karim Ali, and Eric Bodden. “Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java.” In European Conference on Object-Oriented Programming (ECOOP), 2016.' ieee: 'J. Späth, L. Nguyen Quang Do, K. Ali, and E. Bodden, “Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java,” in European Conference on Object-Oriented Programming (ECOOP), 2016.' mla: 'Späth, Johannes, et al. “Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java.” European Conference on Object-Oriented Programming (ECOOP), 2016.' short: 'J. Späth, L. Nguyen Quang Do, K. Ali, E. Bodden, in: European Conference on Object-Oriented Programming (ECOOP), 2016.' date_created: 2018-10-31T12:51:26Z date_updated: 2022-01-06T07:01:45Z ddc: - '000' department: - _id: '76' file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:13:19Z date_updated: 2018-11-02T14:13:19Z file_id: '5265' file_name: sna+16boomerang.pdf file_size: 1921617 relation: main_file success: 1 file_date_updated: 2018-11-02T14:13:19Z has_accepted_license: '1' keyword: - ATTRACT - ITSECWEBSITE language: - iso: eng main_file_link: - url: http://www.bodden.de/pubs/sna+16boomerang.pdf project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 publication: European Conference on Object-Oriented Programming (ECOOP) status: public title: 'Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java' type: conference user_id: '477' year: '2016' ... --- _id: '5407' author: - first_name: Jörn full_name: Koepe, Jörn last_name: Koepe citation: ama: Koepe J. Price-Based Allocation Games. Universität Paderborn; 2016. apa: Koepe, J. (2016). Price-Based Allocation Games. Universität Paderborn. bibtex: '@book{Koepe_2016, title={Price-Based Allocation Games}, publisher={Universität Paderborn}, author={Koepe, Jörn}, year={2016} }' chicago: Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016. ieee: J. Koepe, Price-Based Allocation Games. Universität Paderborn, 2016. mla: Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016. short: J. Koepe, Price-Based Allocation Games, Universität Paderborn, 2016. date_created: 2018-11-07T09:45:57Z date_updated: 2022-01-06T07:01:51Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public title: Price-Based Allocation Games type: bachelorsthesis user_id: '477' year: '2016' ... --- _id: '5418' author: - first_name: Christian full_name: Tölke, Christian last_name: Tölke citation: ama: Tölke C. Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung. Universität Paderborn; 2016. apa: Tölke, C. (2016). Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung. Universität Paderborn. bibtex: '@book{Tölke_2016, title={Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung}, publisher={Universität Paderborn}, author={Tölke, Christian}, year={2016} }' chicago: Tölke, Christian. Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung. Universität Paderborn, 2016. ieee: C. Tölke, Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung. Universität Paderborn, 2016. mla: Tölke, Christian. Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung. Universität Paderborn, 2016. short: C. Tölke, Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung, Universität Paderborn, 2016. date_created: 2018-11-07T16:10:00Z date_updated: 2022-01-06T07:01:52Z department: - _id: '27' - _id: '518' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '14' name: SFB 901 - Subproject C2 publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 title: Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung type: mastersthesis user_id: '477' year: '2016' ... --- _id: '5420' author: - first_name: Gunnar full_name: Wüllrich, Gunnar last_name: Wüllrich citation: ama: Wüllrich G. Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment. Universität Paderborn; 2016. apa: Wüllrich, G. (2016). Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment. Universität Paderborn. bibtex: '@book{Wüllrich_2016, title={Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment}, publisher={Universität Paderborn}, author={Wüllrich, Gunnar}, year={2016} }' chicago: Wüllrich, Gunnar. Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment. Universität Paderborn, 2016. ieee: G. Wüllrich, Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment. Universität Paderborn, 2016. mla: Wüllrich, Gunnar. Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment. Universität Paderborn, 2016. short: G. Wüllrich, Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment, Universität Paderborn, 2016. date_created: 2018-11-07T16:15:51Z date_updated: 2022-01-06T07:01:53Z department: - _id: '27' - _id: '518' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '14' name: SFB 901 - Subproject C2 publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 title: Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment type: mastersthesis user_id: '477' year: '2016' ... --- _id: '688' author: - first_name: Damian full_name: Kutzias, Damian last_name: Kutzias citation: ama: Kutzias D. Friendship Processes in Network Creation Games. Universität Paderborn; 2016. apa: Kutzias, D. (2016). Friendship Processes in Network Creation Games. Universität Paderborn. bibtex: '@book{Kutzias_2016, title={Friendship Processes in Network Creation Games}, publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }' chicago: Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016. ieee: D. Kutzias, Friendship Processes in Network Creation Games. Universität Paderborn, 2016. mla: Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016. short: D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn, 2016. date_created: 2017-11-14T06:50:35Z date_updated: 2022-01-06T07:03:23Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Friendship Processes in Network Creation Games type: mastersthesis user_id: '477' year: '2016' ... --- _id: '689' author: - first_name: Johannes Sebastian full_name: Schaefer, Johannes Sebastian id: '30291' last_name: Schaefer citation: ama: Schaefer JS. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn; 2016. apa: Schaefer, J. S. (2016). Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn. bibtex: '@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer, Johannes Sebastian}, year={2016} }' chicago: Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016. ieee: J. S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016. mla: Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016. short: J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support, Universität Paderborn, 2016. date_created: 2017-11-14T06:51:37Z date_updated: 2022-01-06T07:03:23Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Routing Algorithms on Delayed Networks for Disaster Management Support type: mastersthesis user_id: '477' year: '2016' ... --- _id: '166' abstract: - lang: eng text: Network function virtualization and software-defined networking allow services consisting of virtual network functions to be designed and implemented with great flexibility by facilitating automatic deployments, migrations, and reconfigurations for services and their components. For extended flexibility, we go beyond seeing services as a fixed chain of functions. We present a YANG model for describing the service structure in deployment requests in a flexible way that enables changing the order of functions in case the order of traversing them does not affect the functionality of the service. Upon receiving such requests, the network orchestration system can choose the optimal composition of service components that gives the best results for placement of services in the network. This introduces new complexities to the placement problem by greatly increasing the number of possible ways a service can be composed. In this paper, we describe a heuristic solution that selects a Pareto set of the possible compositions of a service as well as possible combinations of different services, with respect to different resource requirements of the services. Our evaluations show that the selected combinations consist of representative samples of possible structures and requirements and therefore, can result in optimal or close-to-optimal placement results. author: - first_name: Sevil full_name: Dräxler, Sevil id: '31764' last_name: Dräxler - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Dräxler S, Karl H. Placement of Services with Flexible Structures Specified by a YANG Data Model. In: Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft). ; 2016:184--192. doi:10.1109/NETSOFT.2016.7502412' apa: Dräxler, S., & Karl, H. (2016). Placement of Services with Flexible Structures Specified by a YANG Data Model. In Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft) (pp. 184--192). https://doi.org/10.1109/NETSOFT.2016.7502412 bibtex: '@inproceedings{Dräxler_Karl_2016, title={Placement of Services with Flexible Structures Specified by a YANG Data Model}, DOI={10.1109/NETSOFT.2016.7502412}, booktitle={Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)}, author={Dräxler, Sevil and Karl, Holger}, year={2016}, pages={184--192} }' chicago: Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures Specified by a YANG Data Model.” In Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft), 184--192, 2016. https://doi.org/10.1109/NETSOFT.2016.7502412. ieee: S. Dräxler and H. Karl, “Placement of Services with Flexible Structures Specified by a YANG Data Model,” in Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft), 2016, pp. 184--192. mla: Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures Specified by a YANG Data Model.” Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft), 2016, pp. 184--192, doi:10.1109/NETSOFT.2016.7502412. short: 'S. Dräxler, H. Karl, in: Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft), 2016, pp. 184--192.' date_created: 2017-10-17T12:41:24Z date_updated: 2022-01-06T06:52:53Z ddc: - '040' department: - _id: '75' doi: 10.1109/NETSOFT.2016.7502412 file: - access_level: open_access content_type: application/pdf creator: sevilmeh date_created: 2018-06-25T07:53:54Z date_updated: 2018-06-25T07:53:54Z file_id: '3322' file_name: RIS.pdf file_size: 1471937 relation: main_file file_date_updated: 2018-06-25T07:53:54Z has_accepted_license: '1' main_file_link: - url: http://ieeexplore.ieee.org/search/searchresult.jsp?newsearch=true&queryText=10.1109%2FNETSOFT.2016.7502412 oa: '1' page: 184--192 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C - _id: '25' call_identifier: 5G PPP Phase 1 grant_number: '671517' name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks' publication: Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft) status: public title: Placement of Services with Flexible Structures Specified by a YANG Data Model type: conference urn: '1665' user_id: '31764' year: '2016' ... --- _id: '167' author: - first_name: Peter full_name: Günther, Peter last_name: Günther citation: ama: Günther P. Physical Attacks on Pairing-Based Cryptography. Universität Paderborn; 2016. apa: Günther, P. (2016). Physical attacks on pairing-based cryptography. Universität Paderborn. bibtex: '@book{Günther_2016, title={Physical attacks on pairing-based cryptography}, publisher={Universität Paderborn}, author={Günther, Peter}, year={2016} }' chicago: Günther, Peter. Physical Attacks on Pairing-Based Cryptography. Universität Paderborn, 2016. ieee: P. Günther, Physical attacks on pairing-based cryptography. Universität Paderborn, 2016. mla: Günther, Peter. Physical Attacks on Pairing-Based Cryptography. Universität Paderborn, 2016. short: P. Günther, Physical Attacks on Pairing-Based Cryptography, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:24Z date_updated: 2022-01-06T06:52:54Z ddc: - '040' department: - _id: '64' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:43:21Z date_updated: 2018-03-21T12:43:21Z file_id: '1542' file_name: 167-thesis_peter_guenther.pdf file_size: 9456552 relation: main_file success: 1 file_date_updated: 2018-03-21T12:43:21Z has_accepted_license: '1' main_file_link: - url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24853 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Physical attacks on pairing-based cryptography type: dissertation user_id: '25078' year: '2016' ... --- _id: '169' abstract: - lang: eng text: We apply methods of genetic programming to a general problem from software engineering, namely example-based generation of specifications. In particular, we focus on model transformation by example. The definition and implementation of model transformations is a task frequently carried out by domain experts, hence, a (semi-)automatic approach is desirable. This application is challenging because the underlying search space has rich semantics, is high-dimensional, and unstructured. Hence, a computationally brute-force approach would be unscalable and potentially infeasible. To address that problem, we develop a sophisticated approach of designing complex mutation operators. We define ‘patterns’ for constructing mutation operators and report a successful case study. Furthermore, the code of the evolved model transformation is required to have high maintainability and extensibility, that is, the code should be easily readable by domain experts. We report an evaluation of this approach in a software engineering case study. author: - first_name: Thomas full_name: Kühne, Thomas id: '49079' last_name: Kühne - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Svetlana full_name: Arifulina, Svetlana last_name: Arifulina - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'Kühne T, Hamann H, Arifulina S, Engels G. Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016). LNCS 9594. ; 2016:278--293. doi:10.1007/978-3-319-30668-1_18' apa: 'Kühne, T., Hamann, H., Arifulina, S., & Engels, G. (2016). Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016) (pp. 278--293). https://doi.org/10.1007/978-3-319-30668-1_18' bibtex: '@inproceedings{Kühne_Hamann_Arifulina_Engels_2016, series={LNCS 9594}, title={Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application}, DOI={10.1007/978-3-319-30668-1_18}, booktitle={Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)}, author={Kühne, Thomas and Hamann, Heiko and Arifulina, Svetlana and Engels, Gregor}, year={2016}, pages={278--293}, collection={LNCS 9594} }' chicago: 'Kühne, Thomas, Heiko Hamann, Svetlana Arifulina, and Gregor Engels. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” In Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 278--293. LNCS 9594, 2016. https://doi.org/10.1007/978-3-319-30668-1_18.' ieee: 'T. Kühne, H. Hamann, S. Arifulina, and G. Engels, “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application,” in Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293.' mla: 'Kühne, Thomas, et al. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293, doi:10.1007/978-3-319-30668-1_18.' short: 'T. Kühne, H. Hamann, S. Arifulina, G. Engels, in: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293.' date_created: 2017-10-17T12:41:25Z date_updated: 2022-01-06T06:52:58Z ddc: - '040' department: - _id: '66' - _id: '238' - _id: '63' doi: 10.1007/978-3-319-30668-1_18 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:41:08Z date_updated: 2018-03-21T12:41:08Z file_id: '1540' file_name: 169-kuehne.pdf file_size: 2069427 relation: main_file success: 1 file_date_updated: 2018-03-21T12:41:08Z has_accepted_license: '1' language: - iso: eng page: 278--293 project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016) series_title: LNCS 9594 status: public title: 'Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application' type: conference user_id: '57458' year: '2016' ... --- _id: '170' abstract: - lang: eng text: We present PAndA2, an extendable, static analysis tool for Android apps which examines permission related security threats like overprivilege, existence of permission redelegation and permission flows. PAndA2 comes along with a textual and graphical visualization of the analysis result and even supports the comparison of analysis results for different android app versions. author: - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Manuel full_name: Töws, Manuel id: '11315' last_name: Töws - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck citation: ama: 'Jakobs M-C, Töws M, Pauck F. PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper). In: Ishikawa F, Romanovsky A TE, ed. Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems. School of Computing Science Technical Report Series. ; 2016.' apa: 'Jakobs, M.-C., Töws, M., & Pauck, F. (2016). PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper). In T. E. Ishikawa F, Romanovsky A (Ed.), Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems.' bibtex: '@inproceedings{Jakobs_Töws_Pauck_2016, series={School of Computing Science Technical Report Series}, title={PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)}, booktitle={Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems}, author={Jakobs, Marie-Christine and Töws, Manuel and Pauck, Felix}, editor={Ishikawa F, Romanovsky A, Troubitsyna EEditor}, year={2016}, collection={School of Computing Science Technical Report Series} }' chicago: 'Jakobs, Marie-Christine, Manuel Töws, and Felix Pauck. “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper).” In Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems, edited by Troubitsyna E Ishikawa F, Romanovsky A. School of Computing Science Technical Report Series, 2016.' ieee: 'M.-C. Jakobs, M. Töws, and F. Pauck, “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper),” in Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems, 2016.' mla: 'Jakobs, Marie-Christine, et al. “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper).” Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems, edited by Troubitsyna E Ishikawa F, Romanovsky A, 2016.' short: 'M.-C. Jakobs, M. Töws, F. Pauck, in: T.E. Ishikawa F, Romanovsky A (Ed.), Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems, 2016.' date_created: 2017-10-17T12:41:25Z date_updated: 2022-01-06T06:53:01Z ddc: - '040' department: - _id: '77' editor: - first_name: Troubitsyna E full_name: Ishikawa F, Romanovsky A, Troubitsyna E last_name: Ishikawa F, Romanovsky A file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:40:27Z date_updated: 2018-03-21T12:40:27Z file_id: '1539' file_name: 170-main_04.pdf file_size: 285299 relation: main_file success: 1 file_date_updated: 2018-03-21T12:40:27Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems related_material: link: - relation: contains url: https://pdfs.semanticscholar.org/58cd/94c8b2335d16aa2558f711cf81b3f7746696.pdf series_title: School of Computing Science Technical Report Series status: public title: 'PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)' type: conference user_id: '15504' year: '2016' ... --- _id: '172' author: - first_name: Florian full_name: Stapel, Florian last_name: Stapel citation: ama: Stapel F. Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation. Universität Paderborn; 2016. apa: Stapel, F. (2016). Ontology-based representation of abstract optimization models for model formulation and system generation. Universität Paderborn. bibtex: '@book{Stapel_2016, title={Ontology-based representation of abstract optimization models for model formulation and system generation}, publisher={Universität Paderborn}, author={Stapel, Florian}, year={2016} }' chicago: Stapel, Florian. Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation. Universität Paderborn, 2016. ieee: F. Stapel, Ontology-based representation of abstract optimization models for model formulation and system generation. Universität Paderborn, 2016. mla: Stapel, Florian. Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation. Universität Paderborn, 2016. short: F. Stapel, Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:25Z date_updated: 2022-01-06T06:53:06Z ddc: - '040' department: - _id: '19' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:39:19Z date_updated: 2018-03-21T12:39:19Z file_id: '1537' file_name: 172-FStapelDissertation.pdf file_size: 9301431 relation: main_file success: 1 file_date_updated: 2018-03-21T12:39:19Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '15' name: SFB 901 - Subprojekt C3 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Lena full_name: Suhl, Lena last_name: Suhl title: Ontology-based representation of abstract optimization models for model formulation and system generation type: dissertation user_id: '477' year: '2016' ... --- _id: '1082' author: - first_name: Tobias full_name: Handirk, Tobias last_name: Handirk citation: ama: Handirk T. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn; 2016. apa: Handirk, T. (2016). Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn. bibtex: '@book{Handirk_2016, title={Über die Rolle von Informationen in Verkehrsnetzwerken}, publisher={Universität Paderborn}, author={Handirk, Tobias}, year={2016} }' chicago: Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016. ieee: T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016. mla: Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016. short: T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken, Universität Paderborn, 2016. date_created: 2017-12-19T10:10:17Z date_updated: 2022-01-06T06:50:51Z department: - _id: '63' - _id: '541' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subproject A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Über die Rolle von Informationen in Verkehrsnetzwerken type: bachelorsthesis user_id: '14052' year: '2016' ... --- _id: '1190' author: - first_name: Tobias full_name: Isenberg, Tobias last_name: Isenberg citation: ama: Isenberg T. Induction-Based Verification of Timed Systems. Universität Paderborn; 2016. apa: Isenberg, T. (2016). Induction-based Verification of Timed Systems. Universität Paderborn. bibtex: '@book{Isenberg_2016, title={Induction-based Verification of Timed Systems}, publisher={Universität Paderborn}, author={Isenberg, Tobias}, year={2016} }' chicago: Isenberg, Tobias. Induction-Based Verification of Timed Systems. Universität Paderborn, 2016. ieee: T. Isenberg, Induction-based Verification of Timed Systems. Universität Paderborn, 2016. mla: Isenberg, Tobias. Induction-Based Verification of Timed Systems. Universität Paderborn, 2016. short: T. Isenberg, Induction-Based Verification of Timed Systems, Universität Paderborn, 2016. date_created: 2018-03-05T10:11:48Z date_updated: 2022-01-06T06:51:12Z ddc: - '040' department: - _id: '77' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-08T06:23:21Z date_updated: 2018-03-08T09:14:11Z file_id: '1195' file_name: 1190-thesis_abgabeversion.pdf file_size: 3354335 relation: main_file file_date_updated: 2018-03-08T09:14:11Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subproject B4 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Induction-based Verification of Timed Systems type: dissertation user_id: '477' year: '2016' ... --- _id: '128' author: - first_name: Katharina full_name: Bernhardt, Katharina last_name: Bernhardt citation: ama: Bernhardt K. Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen. Universität Paderborn; 2016. apa: Bernhardt, K. (2016). Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen. Universität Paderborn. bibtex: '@book{Bernhardt_2016, title={Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen}, publisher={Universität Paderborn}, author={Bernhardt, Katharina}, year={2016} }' chicago: Bernhardt, Katharina. Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen. Universität Paderborn, 2016. ieee: K. Bernhardt, Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen. Universität Paderborn, 2016. mla: Bernhardt, Katharina. Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen. Universität Paderborn, 2016. short: K. Bernhardt, Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:16Z date_updated: 2022-01-06T06:51:20Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '8' name: SFB 901 - Subprojekt A4 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen type: bachelorsthesis user_id: '477' year: '2016' ... --- _id: '129' author: - first_name: Alexander full_name: Schmidt, Alexander last_name: Schmidt citation: ama: Schmidt A. Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings. Universität Paderborn; 2016. apa: Schmidt, A. (2016). Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings. Universität Paderborn. bibtex: '@book{Schmidt_2016, title={Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings}, publisher={Universität Paderborn}, author={Schmidt, Alexander}, year={2016} }' chicago: Schmidt, Alexander. Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings. Universität Paderborn, 2016. ieee: A. Schmidt, Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings. Universität Paderborn, 2016. mla: Schmidt, Alexander. Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings. Universität Paderborn, 2016. short: A. Schmidt, Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:16Z date_updated: 2022-01-06T06:51:24Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '17' name: SFB 901 - Subprojekt C5 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings type: bachelorsthesis user_id: '16205' year: '2016' ... --- _id: '130' author: - first_name: Jessica full_name: Kaczorkowski, Jessica last_name: Kaczorkowski citation: ama: Kaczorkowski J. Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce. Universität Paderborn; 2016. apa: Kaczorkowski, J. (2016). Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce. Universität Paderborn. bibtex: '@book{Kaczorkowski_2016, title={Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce}, publisher={Universität Paderborn}, author={Kaczorkowski, Jessica}, year={2016} }' chicago: Kaczorkowski, Jessica. Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce. Universität Paderborn, 2016. ieee: J. Kaczorkowski, Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce. Universität Paderborn, 2016. mla: Kaczorkowski, Jessica. Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce. Universität Paderborn, 2016. short: J. Kaczorkowski, Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:17Z date_updated: 2022-01-06T06:51:27Z department: - _id: '280' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce type: mastersthesis user_id: '42447' year: '2016' ... --- _id: '153' author: - first_name: Jürgen full_name: König, Jürgen last_name: König citation: ama: König J. Shared Resource Scheduling with Interconnected Services. Universität Paderborn; 2016. apa: König, J. (2016). Shared Resource Scheduling with Interconnected Services. Universität Paderborn. bibtex: '@book{König_2016, title={Shared Resource Scheduling with Interconnected Services}, publisher={Universität Paderborn}, author={König, Jürgen}, year={2016} }' chicago: König, Jürgen. Shared Resource Scheduling with Interconnected Services. Universität Paderborn, 2016. ieee: J. König, Shared Resource Scheduling with Interconnected Services. Universität Paderborn, 2016. mla: König, Jürgen. Shared Resource Scheduling with Interconnected Services. Universität Paderborn, 2016. short: J. König, Shared Resource Scheduling with Interconnected Services, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:21Z date_updated: 2022-01-06T06:52:20Z project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 publisher: Universität Paderborn status: public title: Shared Resource Scheduling with Interconnected Services type: mastersthesis user_id: '15504' year: '2016' ... --- _id: '154' author: - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr citation: ama: Cord-Landwehr A. Selfish Network Creation - On Variants of Network Creation Games. Vol 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2016. apa: Cord-Landwehr, A. (2016). Selfish Network Creation - On Variants of Network Creation Games (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Cord-Landwehr_2016, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Selfish Network Creation - On Variants of Network Creation Games}, volume={353}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Cord-Landwehr, Andreas}, year={2016}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network Creation Games. Vol. 353. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016. ieee: A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016. mla: Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network Creation Games. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016. short: A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016. date_created: 2017-10-17T12:41:22Z date_updated: 2022-01-06T06:52:23Z ddc: - '040' department: - _id: '63' - _id: '26' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:52:03Z date_updated: 2018-03-21T12:52:03Z file_id: '1551' file_name: 154-dissertation.pdf file_size: 800101 relation: main_file success: 1 file_date_updated: 2018-03-21T12:52:03Z has_accepted_license: '1' intvolume: ' 353' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication_identifier: isbn: - 978-3-942647-72-4 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24089 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Selfish Network Creation - On Variants of Network Creation Games type: dissertation user_id: '5786' volume: 353 year: '2016' ... --- _id: '155' abstract: - lang: eng text: We present a self-stabilizing algorithm for overlay networks that, for an arbitrary metric given by a distance oracle, constructs the graph representing that metric. The graph representing a metric is the unique minimal undirected graph such that for any pair of nodes the length of a shortest path between the nodes corresponds to the distance between the nodes according to the metric. The algorithm works under both an asynchronous and a synchronous daemon. In the synchronous case, the algorithm stablizes in time O(n) and it is almost silent in that after stabilization a node sends and receives a constant number of messages per round. author: - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Jonas full_name: Lefèvre, Jonas last_name: Lefèvre - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Gmyr R, Lefèvre J, Scheideler C. Self-stabilizing Metric Graphs. In: Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). LNCS. ; 2016:248--262. doi:10.1007/978-3-319-49259-9_20' apa: Gmyr, R., Lefèvre, J., & Scheideler, C. (2016). Self-stabilizing Metric Graphs. In Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 248--262). https://doi.org/10.1007/978-3-319-49259-9_20 bibtex: '@inproceedings{Gmyr_Lefèvre_Scheideler_2016, series={LNCS}, title={Self-stabilizing Metric Graphs}, DOI={10.1007/978-3-319-49259-9_20}, booktitle={Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Gmyr, Robert and Lefèvre, Jonas and Scheideler, Christian}, year={2016}, pages={248--262}, collection={LNCS} }' chicago: Gmyr, Robert, Jonas Lefèvre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” In Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 248--262. LNCS, 2016. https://doi.org/10.1007/978-3-319-49259-9_20. ieee: R. Gmyr, J. Lefèvre, and C. Scheideler, “Self-stabilizing Metric Graphs,” in Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, pp. 248--262. mla: Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, pp. 248--262, doi:10.1007/978-3-319-49259-9_20. short: 'R. Gmyr, J. Lefèvre, C. Scheideler, in: Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, pp. 248--262.' date_created: 2017-10-17T12:41:22Z date_updated: 2022-01-06T06:52:28Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-319-49259-9_20 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:51:24Z date_updated: 2018-03-21T12:51:24Z file_id: '1550' file_name: 155-SSS16-GLS.pdf file_size: 389136 relation: main_file success: 1 file_date_updated: 2018-03-21T12:51:24Z has_accepted_license: '1' page: 248--262 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) series_title: LNCS status: public title: Self-stabilizing Metric Graphs type: conference user_id: '15504' year: '2016' ... --- _id: '157' abstract: - lang: eng text: Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in parallel. The goal is to find a schedule that minimizes the makespan and in which communication demands of all jobs are satisfied.We show that this problem is NP-hard in the strong sense even if the number of processors and the maximum degree of the underlying tree is constant.Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio of 5/2 in case of arbitrary trees. author: - first_name: Jürgen full_name: König, Jürgen last_name: König - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: ama: 'König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with Interjob Communication on Parallel Processors. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:563--577. doi:10.1007/978-3-319-48749-6_41' apa: König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2016). Scheduling with Interjob Communication on Parallel Processors. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 563--577). https://doi.org/10.1007/978-3-319-48749-6_41 bibtex: '@inproceedings{König_Mäcker_Meyer auf der Heide_Riechers_2016, series={LNCS}, title={Scheduling with Interjob Communication on Parallel Processors}, DOI={10.1007/978-3-319-48749-6_41}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={563--577}, collection={LNCS} }' chicago: König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 563--577. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_41. ieee: J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with Interjob Communication on Parallel Processors,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577. mla: König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577, doi:10.1007/978-3-319-48749-6_41. short: 'J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577.' date_created: 2017-10-17T12:41:22Z date_updated: 2022-01-06T06:52:32Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-319-48749-6_41 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:50:29Z date_updated: 2018-03-21T12:50:29Z file_id: '1549' file_name: 157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf file_size: 753147 relation: main_file success: 1 file_date_updated: 2018-03-21T12:50:29Z has_accepted_license: '1' page: 563--577 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) series_title: LNCS status: public title: Scheduling with Interjob Communication on Parallel Processors type: conference user_id: '15504' year: '2016' ...