[{"publication":"Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)","type":"conference","abstract":[{"lang":"eng","text":"Dynamics in networks is caused by a variety of reasons, like nodes moving in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer networks, evolution in social networks, and many others. In order to understand such kinds of dynamics, and to design distributed algorithms that behave well under dynamics, many ways to model dynamics are introduced and analyzed w.r.t. correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman have introduced a very general, worst case type model of dynamics: The edge set of the network may change arbitrarily from step to step, the only restriction is that it is connected at all times and the set of nodes does not change. An extended model demands that a xed connected subnetwork is maintained over each time interval of length T (T-interval dynamics). They have presented, among others, algorithms for counting the number of nodes under such general models of dynamics.In this paper, we generalize their models and algorithms by adding random edge faults, i.e., we consider fault-prone dynamic networks: We assume that an edge currently existing may fail to transmit data with some probability p. We rst observe that strong counting, i.e., each node knows the correct count and stops, is not possible in a model with random edge faults. Our main two positive results are feasibility and runtime bounds for weak counting, i.e., stopping is no longer required (but still a correct count in each node), and for strong counting with an upper bound, i.e., an upper bound N on n is known to all nodes."}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1244","access_level":"closed","file_name":"619-Brandes_MadHTADDS12_01.pdf","file_size":346044,"creator":"florida","date_created":"2018-03-15T06:47:15Z","date_updated":"2018-03-15T06:47:15Z"}],"_id":"619","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"}],"user_id":"15504","series_title":"ICPS","ddc":["040"],"file_date_updated":"2018-03-15T06:47:15Z","has_accepted_license":"1","year":"2012","page":"9-14","citation":{"bibtex":"@inproceedings{Brandes_Meyer auf der Heide_2012, series={ICPS}, title={Distributed Computing in Fault-Prone Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1145/2414815.2414818\">10.1145/2414815.2414818</a>}, booktitle={Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)}, author={Brandes, Philipp and Meyer auf der Heide, Friedhelm}, year={2012}, pages={9–14}, collection={ICPS} }","mla":"Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>, 2012, pp. 9–14, doi:<a href=\"https://doi.org/10.1145/2414815.2414818\">10.1145/2414815.2414818</a>.","short":"P. Brandes, F. Meyer auf der Heide, in: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.","apa":"Brandes, P., &#38; Meyer auf der Heide, F. (2012). Distributed Computing in Fault-Prone Dynamic Networks. In <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i> (pp. 9–14). <a href=\"https://doi.org/10.1145/2414815.2414818\">https://doi.org/10.1145/2414815.2414818</a>","ama":"Brandes P, Meyer auf der Heide F. Distributed Computing in Fault-Prone Dynamic Networks. In: <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>. ICPS. ; 2012:9-14. doi:<a href=\"https://doi.org/10.1145/2414815.2414818\">10.1145/2414815.2414818</a>","ieee":"P. Brandes and F. Meyer auf der Heide, “Distributed Computing in Fault-Prone Dynamic Networks,” in <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>, 2012, pp. 9–14.","chicago":"Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” In <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>, 9–14. ICPS, 2012. <a href=\"https://doi.org/10.1145/2414815.2414818\">https://doi.org/10.1145/2414815.2414818</a>."},"date_updated":"2022-01-06T07:02:56Z","author":[{"last_name":"Brandes","full_name":"Brandes, Philipp","first_name":"Philipp"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2017-10-17T12:42:52Z","title":"Distributed Computing in Fault-Prone Dynamic Networks","doi":"10.1145/2414815.2414818"},{"user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"620","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","date_created":"2017-10-17T12:42:52Z","author":[{"first_name":"Robert","full_name":"Mittendorf, Robert","last_name":"Mittendorf"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:56Z","title":"Datenschutzgerechtes DRM im Cloud Computing","citation":{"mla":"Mittendorf, Robert. <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn, 2012.","short":"R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing, Universität Paderborn, 2012.","bibtex":"@book{Mittendorf_2012, title={Datenschutzgerechtes DRM im Cloud Computing}, publisher={Universität Paderborn}, author={Mittendorf, Robert}, year={2012} }","apa":"Mittendorf, R. (2012). <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn.","ama":"Mittendorf R. <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn; 2012.","ieee":"R. Mittendorf, <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn, 2012.","chicago":"Mittendorf, Robert. <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn, 2012."},"year":"2012"},{"title":"Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:57Z","author":[{"first_name":"Stephan","full_name":"Sekula, Stephan","last_name":"Sekula"}],"date_created":"2017-10-17T12:42:53Z","year":"2012","citation":{"short":"S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing, Universität Paderborn, 2012.","bibtex":"@book{Sekula_2012, title={Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing}, publisher={Universität Paderborn}, author={Sekula, Stephan}, year={2012} }","mla":"Sekula, Stephan. <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn, 2012.","apa":"Sekula, S. (2012). <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn.","chicago":"Sekula, Stephan. <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn, 2012.","ieee":"S. Sekula, <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn, 2012.","ama":"Sekula S. <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn; 2012."},"language":[{"iso":"ger"}],"_id":"621","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"user_id":"477","status":"public","type":"bachelorsthesis"},{"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T06:46:40Z","ddc":["040"],"department":[{"_id":"66"}],"user_id":"14955","series_title":"Electronic Communications of the EASST","_id":"622","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","file":[{"file_id":"1243","file_name":"622-gtvmt2012-Arifulina_01.pdf","access_level":"closed","file_size":301602,"creator":"florida","date_created":"2018-03-15T06:46:40Z","date_updated":"2018-03-15T06:46:40Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"text":"Behavioral modeling languages are most useful if their behavior is specified formally such that it can e.g. be analyzed and executed automatically. Obviously, the quality of such behavior specifications is crucial. The rule-based semantics specification technique Dynamic Meta Modeling (DMM) honors this by using the approach of Test-driven Semantics Specification (TDSS), which makes sure that the specification at hand at least describes the correct behavior for a suite of test models. However, in its current state TDSS does not provide any means to measure the quality of such a test suite. In this paper, we describe how we have applied the idea of test coverage to TDSS. Similar to common approaches of defining test coverage criteria, we describe a data structure called invocation graph containing possible orders of applications ofDMM rules. Then we define different coverage criteria based on that data structure, taking the rule applications caused by the test suite’s models into account. Our implementation of the described approach gives the language engineer using DMM a means to reason about the quality of the language’s test suite, and also provides hints on how to improve that quality by adding dedicated test models to the test suite.","lang":"eng"}],"publication":"Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)","type":"conference","doi":"10.14279/tuj.eceasst.47.718","title":"Coverage Criteria for Testing DMM Specifications","author":[{"full_name":"Arifulina, Svetlana","last_name":"Arifulina","first_name":"Svetlana"},{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"},{"first_name":"Christian","id":"1737","full_name":"Soltenborn, Christian","orcid":"0000-0002-0342-8227","last_name":"Soltenborn"}],"date_created":"2017-10-17T12:42:53Z","date_updated":"2022-01-06T07:02:57Z","citation":{"bibtex":"@inproceedings{Arifulina_Engels_Soltenborn_2012, series={Electronic Communications of the EASST}, title={Coverage Criteria for Testing DMM Specifications}, DOI={<a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">10.14279/tuj.eceasst.47.718</a>}, booktitle={Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)}, author={Arifulina, Svetlana and Engels, Gregor and Soltenborn, Christian}, year={2012}, collection={Electronic Communications of the EASST} }","mla":"Arifulina, Svetlana, et al. “Coverage Criteria for Testing DMM Specifications.” <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>, 2012, doi:<a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">10.14279/tuj.eceasst.47.718</a>.","short":"S. Arifulina, G. Engels, C. Soltenborn, in: Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012.","apa":"Arifulina, S., Engels, G., &#38; Soltenborn, C. (2012). Coverage Criteria for Testing DMM Specifications. In <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>. <a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">https://doi.org/10.14279/tuj.eceasst.47.718</a>","ama":"Arifulina S, Engels G, Soltenborn C. Coverage Criteria for Testing DMM Specifications. In: <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>. Electronic Communications of the EASST. ; 2012. doi:<a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">10.14279/tuj.eceasst.47.718</a>","ieee":"S. Arifulina, G. Engels, and C. Soltenborn, “Coverage Criteria for Testing DMM Specifications,” in <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>, 2012.","chicago":"Arifulina, Svetlana, Gregor Engels, and Christian Soltenborn. “Coverage Criteria for Testing DMM Specifications.” In <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>. Electronic Communications of the EASST, 2012. <a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">https://doi.org/10.14279/tuj.eceasst.47.718</a>."},"year":"2012","has_accepted_license":"1"},{"has_accepted_license":"1","year":"2012","page":"291-300","citation":{"apa":"Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i> (pp. 291–300). <a href=\"https://doi.org/10.1145/2332432.2332488\">https://doi.org/10.1145/2332432.2332488</a>","bibtex":"@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and fair throughput for co-existing networks under adversarial interference}, DOI={<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>}, booktitle={Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin }, year={2012}, pages={291–300} }","mla":"Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 2012, pp. 291–300, doi:<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>.","short":"A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.","chicago":"Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin  Zhang. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” In <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 291–300, 2012. <a href=\"https://doi.org/10.1145/2332432.2332488\">https://doi.org/10.1145/2332432.2332488</a>.","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair throughput for co-existing networks under adversarial interference,” in <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 2012, pp. 291–300.","ama":"Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput for co-existing networks under adversarial interference. In: <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>. ; 2012:291-300. doi:<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>"},"date_updated":"2022-01-06T07:02:58Z","date_created":"2017-10-17T12:42:53Z","author":[{"full_name":"Richa, Andrea W.","last_name":"Richa","first_name":"Andrea W."},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"},{"first_name":"Jin ","last_name":"Zhang","full_name":"Zhang, Jin "}],"title":"Competitive and fair throughput for co-existing networks under adversarial interference","doi":"10.1145/2332432.2332488","publication":"Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)","type":"conference","abstract":[{"text":"This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed.","lang":"eng"}],"status":"public","file":[{"date_created":"2018-03-15T06:45:25Z","creator":"florida","date_updated":"2018-03-15T06:45:25Z","file_id":"1241","file_name":"623-PODC-2012_01.pdf","access_level":"closed","file_size":210382,"content_type":"application/pdf","relation":"main_file","success":1}],"_id":"623","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"79"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-15T06:45:25Z"},{"title":"Change and Validity Analysis in Deductive Program Verification","_id":"624","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:58Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"author":[{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"}],"date_created":"2017-10-17T12:42:53Z","user_id":"15504","year":"2012","status":"public","citation":{"apa":"Jakobs, M.-C. (2012). <i>Change and Validity Analysis in Deductive Program Verification</i>. Universität Paderborn.","mla":"Jakobs, Marie-Christine. <i>Change and Validity Analysis in Deductive Program Verification</i>. Universität Paderborn, 2012.","short":"M.-C. Jakobs, Change and Validity Analysis in Deductive Program Verification, Universität Paderborn, 2012.","bibtex":"@book{Jakobs_2012, title={Change and Validity Analysis in Deductive Program Verification}, publisher={Universität Paderborn}, author={Jakobs, Marie-Christine}, year={2012} }","ieee":"M.-C. Jakobs, <i>Change and Validity Analysis in Deductive Program Verification</i>. Universität Paderborn, 2012.","chicago":"Jakobs, Marie-Christine. <i>Change and Validity Analysis in Deductive Program Verification</i>. Universität Paderborn, 2012.","ama":"Jakobs M-C. <i>Change and Validity Analysis in Deductive Program Verification</i>. Universität Paderborn; 2012."},"type":"mastersthesis"},{"department":[{"_id":"79"}],"series_title":"LNCS","user_id":"15504","_id":"625","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-15T06:44:09Z","ddc":["040"],"publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","type":"conference","status":"public","file":[{"date_updated":"2018-03-15T06:44:09Z","creator":"florida","date_created":"2018-03-15T06:44:09Z","file_size":717284,"file_name":"625-disc12adjBAshort.pdf","access_level":"closed","file_id":"1240","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties."}],"date_created":"2017-10-17T12:42:53Z","author":[{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"last_name":"Avin","full_name":"Avin, Chen","first_name":"Chen"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"first_name":"Bernhard","last_name":"Häupler","full_name":"Häupler, Bernhard"},{"first_name":"Zvi","full_name":"Lotker, Zvi","last_name":"Lotker"}],"date_updated":"2022-01-06T07:02:58Z","doi":"10.1007/978-3-642-33651-5_47","title":"Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures","has_accepted_license":"1","page":"439-440","citation":{"chicago":"Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 439–40. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">https://doi.org/10.1007/978-3-642-33651-5_47</a>.","ieee":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures,” in <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 439–440.","ama":"Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In: <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2012:439-440. doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>","apa":"Schmid, S., Avin, C., Scheideler, C., Häupler, B., &#38; Lotker, Z. (2012). Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i> (pp. 439–440). <a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">https://doi.org/10.1007/978-3-642-33651-5_47</a>","mla":"Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 439–40, doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>.","short":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440.","bibtex":"@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS}, title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler, Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }"},"year":"2012"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"626","user_id":"15504","series_title":"LNCS","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-15T06:42:40Z","type":"conference","publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","abstract":[{"lang":"eng","text":"The design of ecient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of nding the predecessor in a key set and present an ecient data structure called hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses when u is the size of the universe of the keys. That is the costs only depend on u and not the size of the data structure. One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT)."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1239","file_name":"626-Predecessor-Kniesburges_Scheideler.pdf","file_size":184095,"date_created":"2018-03-15T06:42:40Z","creator":"florida","date_updated":"2018-03-15T06:42:40Z"}],"status":"public","date_updated":"2022-01-06T07:02:59Z","date_created":"2017-10-17T12:42:54Z","author":[{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"title":"Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems","doi":"10.1007/978-3-642-33651-5_45","has_accepted_license":"1","year":"2012","citation":{"short":"S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.","bibtex":"@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012}, pages={435–436}, collection={LNCS} }","mla":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 435–36, doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>.","apa":"Kniesburges, S., &#38; Scheideler, C. (2012). Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i> (pp. 435–436). <a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">https://doi.org/10.1007/978-3-642-33651-5_45</a>","chicago":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 435–36. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">https://doi.org/10.1007/978-3-642-33651-5_45</a>.","ieee":"S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems,” in <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 435–436.","ama":"Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In: <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2012:435-436. doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>"},"page":"435-436"},{"has_accepted_license":"1","page":"531-533","citation":{"apa":"Wonisch, D. (2012). Block Abstraction Memoization for CPAchecker. In <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i> (pp. 531–533). <a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">https://doi.org/10.1007/978-3-642-28756-5_41</a>","bibtex":"@inproceedings{Wonisch_2012, series={LNCS}, title={Block Abstraction Memoization for CPAchecker}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">10.1007/978-3-642-28756-5_41</a>}, booktitle={Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)}, author={Wonisch, Daniel}, year={2012}, pages={531–533}, collection={LNCS} }","short":"D. Wonisch, in: Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp. 531–533.","mla":"Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i>, 2012, pp. 531–33, doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">10.1007/978-3-642-28756-5_41</a>.","ama":"Wonisch D. Block Abstraction Memoization for CPAchecker. In: <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i>. LNCS. ; 2012:531-533. doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">10.1007/978-3-642-28756-5_41</a>","chicago":"Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” In <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i>, 531–33. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">https://doi.org/10.1007/978-3-642-28756-5_41</a>.","ieee":"D. Wonisch, “Block Abstraction Memoization for CPAchecker,” in <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i>, 2012, pp. 531–533."},"author":[{"full_name":"Wonisch, Daniel","last_name":"Wonisch","first_name":"Daniel"}],"date_updated":"2022-01-06T07:02:59Z","doi":"10.1007/978-3-642-28756-5_41","type":"conference","status":"public","department":[{"_id":"77"}],"user_id":"477","series_title":"LNCS","_id":"627","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file_date_updated":"2018-03-15T06:46:05Z","year":"2012","date_created":"2017-10-17T12:42:54Z","title":"Block Abstraction Memoization for CPAchecker","publication":"Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"627-WonischSV-Comp2012_01.pdf","file_id":"1242","access_level":"closed","file_size":184000,"date_created":"2018-03-15T06:46:05Z","creator":"florida","date_updated":"2018-03-15T06:46:05Z"}],"abstract":[{"lang":"eng","text":"Block Abstraction Memoization (ABM) is a technique in software model checking that exploits the modularity of programs during verification by caching. To this end, ABM records the results of block analyses and reuses them if possible when revisiting the same block again. In this paper we present an implementation of ABM into the predicate-analysis component of the software-verification framework CPAchecker. With our participation at the Competition on Software Verification we aim at providing evidence that ABM can not only substantially increase the efficiency of predicate analysis but also enables verification of a wider range of programs."}],"language":[{"iso":"eng"}],"ddc":["040"]},{"author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"last_name":"Huellmann (married name: Eikel)","full_name":"Huellmann (married name: Eikel), Martina","first_name":"Martina"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"first_name":"Alexander","last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108"}],"date_created":"2017-10-17T12:42:54Z","date_updated":"2022-01-06T07:02:59Z","doi":"10.1007/978-3-642-33996-7_7","title":"Basic Network Creation Games with Communication Interests","has_accepted_license":"1","page":"72--83","citation":{"mla":"Cord-Landwehr, Andreas, et al. “Basic Network Creation Games with Communication Interests.” <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 72--83, doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>.","short":"A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, A. Setzer, in: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83.","bibtex":"@inproceedings{Cord-Landwehr_Huellmann (married name: Eikel)_Kling_Setzer_2012, series={LNCS}, title={Basic Network Creation Games with Communication Interests}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>}, booktitle={Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)}, author={Cord-Landwehr, Andreas and Huellmann (married name: Eikel), Martina and Kling, Peter and Setzer, Alexander}, year={2012}, pages={72--83}, collection={LNCS} }","apa":"Cord-Landwehr, A., Huellmann (married name: Eikel), M., Kling, P., &#38; Setzer, A. (2012). Basic Network Creation Games with Communication Interests. In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i> (pp. 72--83). <a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">https://doi.org/10.1007/978-3-642-33996-7_7</a>","ama":"Cord-Landwehr A, Huellmann (married name: Eikel) M, Kling P, Setzer A. Basic Network Creation Games with Communication Interests. In: <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS. ; 2012:72--83. doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>","ieee":"A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, and A. Setzer, “Basic Network Creation Games with Communication Interests,” in <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 72--83.","chicago":"Cord-Landwehr, Andreas, Martina Huellmann (married name: Eikel), Peter Kling, and Alexander Setzer. “Basic Network Creation Games with Communication Interests.” In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 72--83. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">https://doi.org/10.1007/978-3-642-33996-7_7</a>."},"year":"2012","department":[{"_id":"79"},{"_id":"63"}],"series_title":"LNCS","user_id":"477","_id":"628","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T06:42:01Z","ddc":["040"],"publication":"Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)","type":"conference","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-15T06:42:01Z","creator":"florida","date_updated":"2018-03-15T06:42:01Z","file_name":"628-FULL_paper_bncs_with_interests.pdf","access_level":"closed","file_id":"1238","file_size":300591}],"abstract":[{"lang":"eng","text":"Network creation games model the creation and usage costs of networks formed by a set of selfish peers.Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links.In doing so, a peer can reduce its individual communication cost.Typically, these costs are modeled by the maximum or average distance in the network.We introduce a generalized version of the basic network creation game (BNCG).In the BNCG (by Alon et al., SPAA 2010), each peer may replace one of its incident links by a link to an arbitrary peer.This is done in a selfish way in order to minimize either the maximum or average distance to all other peers.That is, each peer works towards a network structure that allows himself to communicate efficiently with all other peers.However, participants of large networks are seldom interested in all peers.Rather, they want to communicate efficiently with a small subset only.Our model incorporates these (communication) interests explicitly.Given peers with interests and a communication network forming a tree, we prove several results on the structure and quality of equilibria in our model.We focus on the MAX-version, i.e., each node tries to minimize the maximum distance to nodes it is interested in, and give an upper bound of O(\\sqrt(n)) for the private costs in an equilibrium of n peers.Moreover, we give an equilibrium for a circular interest graph where a node has private cost Omega(\\sqrt(n)), showing that our bound is tight.This example can be extended such that we get a tight bound of Theta(\\sqrt(n)) for the price of anarchy.For the case of general networks we show the price of anarchy to be Theta(n).Additionally, we prove an interesting connection between a maximum independent set in the interest graph and the private costs of the peers."}]},{"year":"2012","citation":{"bibtex":"@book{Schleiter_2012, title={Attribute-basierte Verschlüsselung}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={2012} }","short":"P. Schleiter, Attribute-basierte Verschlüsselung, Universität Paderborn, 2012.","mla":"Schleiter, Patrick. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012.","apa":"Schleiter, P. (2012). <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn.","ama":"Schleiter P. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn; 2012.","chicago":"Schleiter, Patrick. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012.","ieee":"P. Schleiter, <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012."},"title":"Attribute-basierte Verschlüsselung","date_updated":"2022-01-06T07:03:00Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:54Z","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"first_name":"Patrick","full_name":"Schleiter, Patrick","last_name":"Schleiter"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}],"_id":"629","user_id":"477","department":[{"_id":"64"}]},{"has_accepted_license":"1","year":"2012","citation":{"apa":"Platenius, M. C., von Detten, M., &#38; Becker, S. (2012). Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies. In <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i> (pp. 255–264). <a href=\"https://doi.org/10.1109/CSMR.2012.33\">https://doi.org/10.1109/CSMR.2012.33</a>","mla":"Platenius, Marie Christin, et al. “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies.” <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i>, 2012, pp. 255–64, doi:<a href=\"https://doi.org/10.1109/CSMR.2012.33\">10.1109/CSMR.2012.33</a>.","bibtex":"@inproceedings{Platenius_von Detten_Becker_2012, title={Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies}, DOI={<a href=\"https://doi.org/10.1109/CSMR.2012.33\">10.1109/CSMR.2012.33</a>}, booktitle={Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)}, author={Platenius, Marie Christin and von Detten, Markus and Becker, Steffen}, year={2012}, pages={255–264} }","short":"M.C. Platenius, M. von Detten, S. Becker, in: Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR), 2012, pp. 255–264.","ieee":"M. C. Platenius, M. von Detten, and S. Becker, “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies,” in <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i>, 2012, pp. 255–264.","chicago":"Platenius, Marie Christin, Markus von Detten, and Steffen Becker. “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies.” In <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i>, 255–64, 2012. <a href=\"https://doi.org/10.1109/CSMR.2012.33\">https://doi.org/10.1109/CSMR.2012.33</a>.","ama":"Platenius MC, von Detten M, Becker S. Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies. In: <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i>. ; 2012:255-264. doi:<a href=\"https://doi.org/10.1109/CSMR.2012.33\">10.1109/CSMR.2012.33</a>"},"page":"255-264","date_updated":"2022-01-06T07:03:00Z","date_created":"2017-10-17T12:42:54Z","author":[{"full_name":"Platenius, Marie Christin","last_name":"Platenius","first_name":"Marie Christin"},{"first_name":"Markus","last_name":"von Detten","full_name":"von Detten, Markus"},{"first_name":"Steffen","full_name":"Becker, Steffen","last_name":"Becker"}],"title":"Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies","doi":"10.1109/CSMR.2012.33","type":"conference","publication":"Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)","abstract":[{"lang":"eng","text":"Maintaining software systems requires up-to-date models of these systems to systematically plan, analyse and execute the necessary reengineering steps. Often, no or only outdated models of such systems exist. Thus, a reverse engineering step is needed that recovers the system’s components, subsystems and connectors. However, reverse engineering methods are severely impacted by design deficiencies in the system’s code base, e.g., they lead to wrong component structures. Several approaches exist today for the reverse engineering of component-based systems, however, none of them explicitly integrates a systematic design deficiency removal into the process to improve the quality of the reverse engineered architecture. Therefore, in our Archimetrix approach, we propose to regard the most relevant deficiencies with respect to the reverse engineered component-based architecture and support reengineers by presenting the architectural consequences of removing a given deficiency. We validate our approach on the Common Component Modeling Example and show that we are able to identify relevant deficiencies and that their removal leads to an improved reengineered architecture."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-15T06:37:13Z","creator":"florida","date_updated":"2018-03-15T06:37:13Z","access_level":"closed","file_name":"630-CSMR2012-PlateniusDettenBecker.pdf","file_id":"1236","file_size":723739}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"630","user_id":"477","department":[{"_id":"76"}],"ddc":["040"],"file_date_updated":"2018-03-15T06:37:13Z","language":[{"iso":"eng"}]},{"publication":"Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)","type":"conference","abstract":[{"lang":"eng","text":"Maintaining software systems requires up-to-date models of these systems to systematically plan, analyze, and execute the necessary reengineering steps. Often, no or only outdated models of such systems exist.Thus, a reverse engineering step is needed that recovers the system's components, subsystems, and connectors. However, reverse engineering methods are severely impacted by design deficiencies in the system's code base, e.g., they lead to wrong component structures.Therefore, Archimetrix enables the reengineer to detect the most relevant deficiencies with respect to a reverseengineered component-based architecture and supports him by presenting the architectural consequences of removinga given deficiency."}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":258563,"file_id":"1235","file_name":"631-WCRE2012-vonDetten.pdf","access_level":"closed","date_updated":"2018-03-15T06:36:37Z","date_created":"2018-03-15T06:36:37Z","creator":"florida"}],"_id":"631","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"3","name":"SFB 901 - Project Area B"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-15T06:36:37Z","has_accepted_license":"1","year":"2012","page":"503 - 504 ","citation":{"ieee":"M. von Detten, “Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction,” in <i>Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)</i>, 2012, pp. 503–504.","chicago":"Detten, Markus von. “Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction.” In <i>Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)</i>, 503–4, 2012. <a href=\"https://doi.org/10.1109/WCRE.2012.61\">https://doi.org/10.1109/WCRE.2012.61</a>.","ama":"von Detten M. Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction. In: <i>Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)</i>. ; 2012:503-504. doi:<a href=\"https://doi.org/10.1109/WCRE.2012.61\">10.1109/WCRE.2012.61</a>","apa":"von Detten, M. (2012). Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction. In <i>Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)</i> (pp. 503–504). <a href=\"https://doi.org/10.1109/WCRE.2012.61\">https://doi.org/10.1109/WCRE.2012.61</a>","bibtex":"@inproceedings{von Detten_2012, title={Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction}, DOI={<a href=\"https://doi.org/10.1109/WCRE.2012.61\">10.1109/WCRE.2012.61</a>}, booktitle={Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)}, author={von Detten, Markus}, year={2012}, pages={503–504} }","mla":"von Detten, Markus. “Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction.” <i>Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)</i>, 2012, pp. 503–04, doi:<a href=\"https://doi.org/10.1109/WCRE.2012.61\">10.1109/WCRE.2012.61</a>.","short":"M. von Detten, in: Proceedings of the 19th Working Conference on Reverse Engineering (WCRE), 2012, pp. 503–504."},"date_updated":"2022-01-06T07:03:01Z","author":[{"first_name":"Markus","last_name":"von Detten","full_name":"von Detten, Markus"}],"date_created":"2017-10-17T12:42:55Z","title":"Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction","doi":"10.1109/WCRE.2012.61"},{"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":220213,"file_name":"632-SODA2012-Scheideler_01.pdf","access_level":"closed","file_id":"1234","date_updated":"2018-03-15T06:35:58Z","creator":"florida","date_created":"2018-03-15T06:35:58Z"}],"status":"public","abstract":[{"text":"Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals, an h-route cut is a set F µ E of edges such that after the removal of the edges in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural generalization of the classical cut problem for multicommodity °ows (take h = 1). The main result of this paper is an O(h722h log2 k)-approximation algorithm for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicom-modity °ows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)","file_date_updated":"2018-03-15T06:35:58Z","ddc":["040"],"user_id":"15504","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"632","citation":{"ama":"Kolman P, Scheideler C. Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In: <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>. ; 2012:800-810. doi:<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>","chicago":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” In <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 800–810, 2012. <a href=\"https://doi.org/10.1137/1.9781611973099.64\">https://doi.org/10.1137/1.9781611973099.64</a>.","ieee":"P. Kolman and C. Scheideler, “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case,” in <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 2012, pp. 800–810.","bibtex":"@inproceedings{Kolman_Scheideler_2012, title={Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}, DOI={<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>}, booktitle={Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)}, author={Kolman, Petr and Scheideler, Christian}, year={2012}, pages={800–810} }","mla":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 2012, pp. 800–10, doi:<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>.","short":"P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.","apa":"Kolman, P., &#38; Scheideler, C. (2012). Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i> (pp. 800–810). <a href=\"https://doi.org/10.1137/1.9781611973099.64\">https://doi.org/10.1137/1.9781611973099.64</a>"},"page":"800-810","year":"2012","has_accepted_license":"1","doi":"10.1137/1.9781611973099.64","title":"Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case","date_created":"2017-10-17T12:42:55Z","author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_updated":"2022-01-06T07:03:01Z"},{"citation":{"apa":"Pischel, D. (2012). <i>Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze</i>. Universität Paderborn.","short":"D. Pischel, Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze, Universität Paderborn, 2012.","mla":"Pischel, Daniel. <i>Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze</i>. Universität Paderborn, 2012.","bibtex":"@book{Pischel_2012, title={Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze}, publisher={Universität Paderborn}, author={Pischel, Daniel}, year={2012} }","ama":"Pischel D. <i>Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze</i>. Universität Paderborn; 2012.","ieee":"D. Pischel, <i>Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze</i>. Universität Paderborn, 2012.","chicago":"Pischel, Daniel. <i>Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze</i>. Universität Paderborn, 2012."},"status":"public","year":"2012","type":"mastersthesis","language":[{"iso":"ger"}],"title":"Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze","date_created":"2017-10-17T12:42:55Z","author":[{"full_name":"Pischel, Daniel","last_name":"Pischel","first_name":"Daniel"}],"user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"name":"SFB 901 - Project Area C","_id":"4"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:01Z","_id":"633"},{"language":[{"iso":"ger"}],"user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"634","status":"public","type":"bachelorsthesis","title":"Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen","author":[{"first_name":"Julian","last_name":"Kratzmann","full_name":"Kratzmann, Julian"}],"date_created":"2017-10-17T12:42:55Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:01Z","citation":{"apa":"Kratzmann, J. (2012). <i>Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen</i>. Universität Paderborn.","bibtex":"@book{Kratzmann_2012, title={Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen}, publisher={Universität Paderborn}, author={Kratzmann, Julian}, year={2012} }","mla":"Kratzmann, Julian. <i>Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen</i>. Universität Paderborn, 2012.","short":"J. Kratzmann, Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen, Universität Paderborn, 2012.","ieee":"J. Kratzmann, <i>Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen</i>. Universität Paderborn, 2012.","chicago":"Kratzmann, Julian. <i>Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen</i>. Universität Paderborn, 2012.","ama":"Kratzmann J. <i>Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen</i>. Universität Paderborn; 2012."},"year":"2012"},{"title":"An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems","date_created":"2017-10-17T12:42:55Z","author":[{"last_name":"Dohle (married name: Hallmann) ","full_name":"Dohle (married name: Hallmann) , Corinna","first_name":"Corinna"},{"full_name":"Suhl, Leena","last_name":"Suhl","first_name":"Leena"}],"date_updated":"2022-01-06T07:03:02Z","citation":{"bibtex":"@inproceedings{Dohle (married name: Hallmann) _Suhl_2012, title={An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems}, booktitle={Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)}, author={Dohle (married name: Hallmann) , Corinna and Suhl, Leena}, year={2012}, pages={404–408} }","short":"C. Dohle (married name: Hallmann) , L. Suhl, in: Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD), 2012, pp. 404–408.","mla":"Dohle (married name: Hallmann) , Corinna, and Leena Suhl. “An Optimization Model for the Optimal Usage of Water Tanks in Water Supply Systems.” <i>Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)</i>, 2012, pp. 404–08.","apa":"Dohle (married name: Hallmann) , C., &#38; Suhl, L. (2012). An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems. In <i>Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)</i> (pp. 404–408).","ama":"Dohle (married name: Hallmann)  C, Suhl L. An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems. In: <i>Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)</i>. ; 2012:404-408.","ieee":"C. Dohle (married name: Hallmann)  and L. Suhl, “An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems,” in <i>Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)</i>, 2012, pp. 404–408.","chicago":"Dohle (married name: Hallmann) , Corinna, and Leena Suhl. “An Optimization Model for the Optimal Usage of Water Tanks in Water Supply Systems.” In <i>Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)</i>, 404–8, 2012."},"page":"404-408","year":"2012","has_accepted_license":"1","file_date_updated":"2018-03-14T14:15:10Z","ddc":["040"],"user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"635","file":[{"file_name":"635-Dohle_Apmod_2012.pdf","access_level":"closed","file_id":"1233","file_size":164455,"date_created":"2018-03-14T14:15:10Z","creator":"florida","date_updated":"2018-03-14T14:15:10Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"In Germany, the optimization of water supply systems has gained more and more attention due to a growing cost pressure for German municipal utilities. In this work, a model is presented which optimizes the usage of water tanks. On the one hand locations of new tanks are identified, and on the other hand the size of existing tanks is optimized, subject to satisfying the demand of clients and providing the necessary amount of fire water during all time periods. The main difficulty is the consideration of the head loss equation which is required to model the hydraulic properties of a water supply system. As this equation is non-convex and quadratic the optimization model becomes a non-convex Mixed Integer Quadratically Constrained Program (MIQCP). To solve this MIQCP different solution methods are applied."}],"type":"conference","publication":"Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)"},{"citation":{"short":"F. Meyer auf der Heide, P. Pietrzyk, P. Kling, in: Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO), 2012, pp. 61–72.","bibtex":"@inproceedings{Meyer auf der Heide_Pietrzyk_Kling_2012, series={LNCS}, title={An Algorithm for Facility Leasing}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">10.1007/978-3-642-31104-8_6</a>}, booktitle={Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)}, author={Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Kling, Peter}, year={2012}, pages={61–72}, collection={LNCS} }","mla":"Meyer auf der Heide, Friedhelm, et al. “An Algorithm for Facility Leasing.” <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>, 2012, pp. 61–72, doi:<a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">10.1007/978-3-642-31104-8_6</a>.","apa":"Meyer auf der Heide, F., Pietrzyk, P., &#38; Kling, P. (2012). An Algorithm for Facility Leasing. In <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i> (pp. 61–72). <a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">https://doi.org/10.1007/978-3-642-31104-8_6</a>","ama":"Meyer auf der Heide F, Pietrzyk P, Kling P. An Algorithm for Facility Leasing. In: <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>. LNCS. ; 2012:61-72. doi:<a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">10.1007/978-3-642-31104-8_6</a>","ieee":"F. Meyer auf der Heide, P. Pietrzyk, and P. Kling, “An Algorithm for Facility Leasing,” in <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>, 2012, pp. 61–72.","chicago":"Meyer auf der Heide, Friedhelm, Peter Pietrzyk, and Peter Kling. “An Algorithm for Facility Leasing.” In <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>, 61–72. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">https://doi.org/10.1007/978-3-642-31104-8_6</a>."},"page":"61-72","year":"2012","has_accepted_license":"1","doi":"10.1007/978-3-642-31104-8_6","title":"An Algorithm for Facility Leasing","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Peter","full_name":"Pietrzyk, Peter","last_name":"Pietrzyk"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"}],"date_created":"2017-10-17T12:42:56Z","date_updated":"2022-01-06T07:03:02Z","file":[{"file_name":"636-Online_Facility_Location.pdf","access_level":"closed","file_id":"1232","file_size":173049,"date_created":"2018-03-14T14:14:21Z","creator":"florida","date_updated":"2018-03-14T14:14:21Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"We consider an online facility location problem where clients arrive over time and their demands have to be served by opening facilities and assigning the clients to opened facilities. When opening a facility we must choose one of K different lease types to use. A lease type k has a certain lease length lk. Opening a facility i using lease type k causes a cost of f k i and ensures that i is open for the next lk time steps. In addition to costs for opening facilities, we have to take connection costs ci j into account when assigning a client j to facility i. We develop and analyze the first online algorithm for this problem that has a time-independent competitive factor.This variant of the online facility location problem was introduced by Nagarajan and Williamson [7] and is strongly related to both the online facility problem by Meyerson [5] and the parking permit problem by Meyerson [6]. Nagarajan and Williamson gave a 3-approximation algorithm for the offline problem and an O(Klogn)-competitive algorithm for the online variant. Here, n denotes the total number of clients arriving over time. We extend their result by removing the dependency on n (and thereby on the time). In general, our algorithm is O(lmax log(lmax))-competitive. Here lmax denotes the maximum lease length. Moreover, we prove that it is O(log2(lmax))-competitive for many “natural” cases. Such cases include, for example, situations where the number of clients arriving in each time step does not vary too much, or is non-increasing, or is polynomially bounded in lmax."}],"type":"conference","publication":"Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO)","file_date_updated":"2018-03-14T14:14:21Z","ddc":["040"],"user_id":"15504","series_title":"LNCS","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"636"},{"citation":{"ieee":"F. Dawirs, <i>Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index</i>. Universität Paderborn, 2012.","chicago":"Dawirs, Friederike. <i>Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index</i>. Universität Paderborn, 2012.","ama":"Dawirs F. <i>Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index</i>. Universität Paderborn; 2012.","mla":"Dawirs, Friederike. <i>Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index</i>. Universität Paderborn, 2012.","bibtex":"@book{Dawirs_2012, title={Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index}, publisher={Universität Paderborn}, author={Dawirs, Friederike}, year={2012} }","short":"F. Dawirs, Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index, Universität Paderborn, 2012.","apa":"Dawirs, F. (2012). <i>Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index</i>. Universität Paderborn."},"year":"2012","date_created":"2017-10-17T12:42:56Z","author":[{"first_name":"Friederike","full_name":"Dawirs, Friederike","last_name":"Dawirs"}],"date_updated":"2022-01-06T07:03:02Z","publisher":"Universität Paderborn","title":"Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index","type":"bachelorsthesis","status":"public","user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"637","language":[{"iso":"ger"}]},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"638","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"}],"user_id":"477","year":"2012","citation":{"ama":"Eidens F. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn; 2012.","ieee":"F. Eidens, <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012.","chicago":"Eidens, Fabian. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012.","apa":"Eidens, F. (2012). <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn.","short":"F. Eidens, Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken, Universität Paderborn, 2012.","bibtex":"@book{Eidens_2012, title={Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2012} }","mla":"Eidens, Fabian. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012."},"title":"Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken","date_updated":"2022-01-06T07:03:03Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:56Z","author":[{"full_name":"Eidens, Fabian","id":"25078","last_name":"Eidens","first_name":"Fabian"}]}]