[{"citation":{"ama":"Bienkowski M, Byrka J. Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In: <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>. Vol 3669. Berlin, Heidelberg: Springer ; 2005:815-826. doi:<a href=\"https://doi.org/10.1007/11561071_72\">10.1007/11561071_72</a>","short":"M. Bienkowski, J. Byrka, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer , Berlin, Heidelberg, 2005, pp. 815–826.","chicago":"Bienkowski, Marcin, and Jarosław Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.” In <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, 3669:815–26. Berlin, Heidelberg: Springer , 2005. <a href=\"https://doi.org/10.1007/11561071_72\">https://doi.org/10.1007/11561071_72</a>.","bibtex":"@inproceedings{Bienkowski_Byrka_2005, place={Berlin, Heidelberg}, title={Bucket Game with Applications to Set Multicover and Dynamic Page Migration}, volume={3669}, DOI={<a href=\"https://doi.org/10.1007/11561071_72\">10.1007/11561071_72</a>}, booktitle={Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, publisher={Springer }, author={Bienkowski, Marcin and Byrka, Jarosław}, year={2005}, pages={815–826} }","apa":"Bienkowski, M., &#38; Byrka, J. (2005). Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i> (Vol. 3669, pp. 815–826). Berlin, Heidelberg: Springer . <a href=\"https://doi.org/10.1007/11561071_72\">https://doi.org/10.1007/11561071_72</a>","mla":"Bienkowski, Marcin, and Jarosław Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.” <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, vol. 3669, Springer , 2005, pp. 815–26, doi:<a href=\"https://doi.org/10.1007/11561071_72\">10.1007/11561071_72</a>.","ieee":"M. Bienkowski and J. Byrka, “Bucket Game with Applications to Set Multicover and Dynamic Page Migration,” in <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, 2005, vol. 3669, pp. 815–826."},"place":"Berlin, Heidelberg","status":"public","page":"815-826","publisher":"Springer ","_id":"18915","user_id":"15415","volume":3669,"publication":"Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)","abstract":[{"text":"We present a simple two-person Bucket Game, based on throwing balls into buckets, and we<br>discuss possible players' strategies.<br><br>We use these strategies to create an approximation algorithm for a generalization of<br>the well known Set Cover problem, where we need to cover each element by at least $k$ sets.<br>Furthermore, we apply these strategies to construct a randomized algorithm for Dynamic Page Migration <br>problem achieving the optimal competitive ratio against an oblivious adversary.","lang":"eng"}],"date_created":"2020-09-03T08:11:11Z","type":"conference","department":[{"_id":"63"}],"year":"2005","title":"Bucket Game with Applications to Set Multicover and Dynamic Page Migration","author":[{"full_name":"Bienkowski, Marcin","first_name":"Marcin","last_name":"Bienkowski"},{"first_name":"Jarosław","last_name":"Byrka","full_name":"Byrka, Jarosław"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540291183","9783540319511"]},"publication_status":"published","date_updated":"2022-01-06T06:53:54Z","intvolume":"      3669","language":[{"iso":"eng"}],"doi":"10.1007/11561071_72"},{"page":"270-278","publisher":"ACM Press, NY, USA","_id":"18917","language":[{"iso":"eng"}],"user_id":"15415","title":"Dynamic Page Migration with Stochastic Requests","status":"public","year":"2005","author":[{"last_name":"Bienkowski","first_name":"Marcin","full_name":"Bienkowski, Marcin"}],"conference":{"location":"Las Vegas, Nevada, USA"},"date_updated":"2022-01-06T06:53:54Z","date_created":"2020-09-03T08:19:31Z","type":"conference","department":[{"_id":"63"}],"publication":"Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)","citation":{"bibtex":"@inproceedings{Bienkowski_2005, title={Dynamic Page Migration with Stochastic Requests}, booktitle={Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)}, publisher={ACM Press, NY, USA}, author={Bienkowski, Marcin}, year={2005}, pages={270–278} }","ama":"Bienkowski M. Dynamic Page Migration with Stochastic Requests. In: <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i>. ACM Press, NY, USA; 2005:270-278.","short":"M. Bienkowski, in: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), ACM Press, NY, USA, 2005, pp. 270–278.","chicago":"Bienkowski, Marcin. “Dynamic Page Migration with Stochastic Requests.” In <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i>, 270–78. ACM Press, NY, USA, 2005.","ieee":"M. Bienkowski, “Dynamic Page Migration with Stochastic Requests,” in <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i>, Las Vegas, Nevada, USA, 2005, pp. 270–278.","apa":"Bienkowski, M. (2005). Dynamic Page Migration with Stochastic Requests. In <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i> (pp. 270–278). Las Vegas, Nevada, USA: ACM Press, NY, USA.","mla":"Bienkowski, Marcin. “Dynamic Page Migration with Stochastic Requests.” <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i>, ACM Press, NY, USA, 2005, pp. 270–78."},"abstract":[{"text":"The page migration problem is one of subproblems of data management in networks. It occurs<br>in a distributed network of processors sharing one indivisible memory page of size D. During runtime,<br>the processors access a unit of data from the page, and the system is allowed to migrate the page <br>between the processors. The problem is to compute (on-line) a schedule of page movements <br>to minimize the total communication cost. <br><br>The Dynamic Page Migration problem is an extension to the page migration. <br>It attempts to model the network dynamics, occurring, for example, in mobile networks.<br>However, the pace of changes is restricted, i.e. the distances between processors can <br>change only by a constant per round.  <br><br>The movement of the nodes induce changes in the communication cost between each pair of nodes,  <br>which is proportional to the distance between them raised to some power $alpha$.<br>This is typical for mobile wireless networks, where nodes can move with a constant speed,<br>and the cost of communication is measured in terms of energy used for sending the data.<br>Thus, by setting $alpha$ equal to the propagation exponent of the medium, <br>cost minimization becomes minimizing the total energy consumption in the system. <br><br>However, as proven in citedynamic-page-migration, if both network mobility and <br>request sequence are created by an adversary, then the competitive ratio is polynomially large in D and <br>in the number of the nodes. In our search for a reasonable, close-to-reality model, in this paper we <br>consider a scenario in which the network mobility is adversarial, but the requests are <br>generated randomly by a stochastic process. We design an algorithm MTFR for this scenario,<br>and prove that it is O(1)-competitive, on expectation and with high probability.","lang":"eng"}]},{"doi":"10.1007/978-3-540-31956-6_49","language":[{"iso":"eng"}],"series_title":" Lecture Notes in Computer Science","intvolume":"      3420","date_updated":"2022-01-06T06:53:54Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540253396","9783540319566"]},"author":[{"last_name":"Bienkowski","first_name":"Marcin","full_name":"Bienkowski, Marcin"},{"full_name":"Brinkmann, André","last_name":"Brinkmann","first_name":"André"},{"full_name":"Korzeniowski, Miroslaw","last_name":"Korzeniowski","first_name":"Miroslaw"},{"full_name":"Orhan, Orhan","last_name":"Orhan","first_name":"Orhan"}],"year":"2005","title":"Cube Connected Cycles Based Bluetooth Scatternet Formation","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-03T09:52:33Z","abstract":[{"lang":"eng","text":"Bluetooth is a wireless communication standard developed for personal area networks (PAN) that gained popularity in the last years. It was designed to connect a few devices together, however nowadays there is a need to build larger networks. Construction and maintenance algorithms have great effect on performance of the network. We present an algorithm based on Cube Connected Cycles (CCC) topology and show how to maintain the network so that it is easily scalable. Our design guarantees good properties such as constant degree and logarithmic dilation. Besides, the construction costs are proven to be at most constant times larger than any other algorithm would need."}],"publication":"Proceedings of the 4th International Conference on Networking","volume":3420,"user_id":"15415","publisher":"Springer","_id":"18924","page":"413-420","status":"public","place":"Berlin, Heidelberg","citation":{"chicago":"Bienkowski, Marcin, André Brinkmann, Miroslaw Korzeniowski, and Orhan Orhan. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” In <i>Proceedings of the 4th International Conference on Networking</i>, 3420:413–20.  Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2005. <a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">https://doi.org/10.1007/978-3-540-31956-6_49</a>.","short":"M. Bienkowski, A. Brinkmann, M. Korzeniowski, O. Orhan, in: Proceedings of the 4th International Conference on Networking, Springer, Berlin, Heidelberg, 2005, pp. 413–420.","ieee":"M. Bienkowski, A. Brinkmann, M. Korzeniowski, and O. Orhan, “Cube Connected Cycles Based Bluetooth Scatternet Formation,” in <i>Proceedings of the 4th International Conference on Networking</i>, 2005, vol. 3420, pp. 413–420.","apa":"Bienkowski, M., Brinkmann, A., Korzeniowski, M., &#38; Orhan, O. (2005). Cube Connected Cycles Based Bluetooth Scatternet Formation. In <i>Proceedings of the 4th International Conference on Networking</i> (Vol. 3420, pp. 413–420). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">https://doi.org/10.1007/978-3-540-31956-6_49</a>","bibtex":"@inproceedings{Bienkowski_Brinkmann_Korzeniowski_Orhan_2005, place={Berlin, Heidelberg}, series={ Lecture Notes in Computer Science}, title={Cube Connected Cycles Based Bluetooth Scatternet Formation}, volume={3420}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">10.1007/978-3-540-31956-6_49</a>}, booktitle={Proceedings of the 4th International Conference on Networking}, publisher={Springer}, author={Bienkowski, Marcin and Brinkmann, André and Korzeniowski, Miroslaw and Orhan, Orhan}, year={2005}, pages={413–420}, collection={ Lecture Notes in Computer Science} }","ama":"Bienkowski M, Brinkmann A, Korzeniowski M, Orhan O. Cube Connected Cycles Based Bluetooth Scatternet Formation. In: <i>Proceedings of the 4th International Conference on Networking</i>. Vol 3420.  Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2005:413-420. doi:<a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">10.1007/978-3-540-31956-6_49</a>","mla":"Bienkowski, Marcin, et al. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” <i>Proceedings of the 4th International Conference on Networking</i>, vol. 3420, Springer, 2005, pp. 413–20, doi:<a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">10.1007/978-3-540-31956-6_49</a>."}},{"date_updated":"2022-01-06T06:53:54Z","publication_status":"published","status":"public","title":"Improved Algorithms for Dynamic Page Migration","year":"2005","author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"last_name":"Dynia","first_name":"Miroslaw","full_name":"Dynia, Miroslaw"},{"full_name":"Korzeniowski, Miroslaw","first_name":"Miroslaw","last_name":"Korzeniowski"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540249986","9783540318569"]},"doi":"10.1007/978-3-540-31856-9_30","user_id":"15415","page":"365-376","language":[{"iso":"eng"}],"_id":"18925","series_title":"Lecture Notes in Computer Science","abstract":[{"lang":"eng","text":"The dynamic page migration problem citedynamic-page-migration is defined in <br>a distributed network of $n$ mobile nodes sharing one indivisible memory page <br>of size $D$. During runtime, the nodes can both access a unit of data from<br>the page and move with a constant speed, thus changing the costs of communication.<br>The problem is to compute <em> online</em> a schedule of page movements<br>to minimize the total communication cost.<br><br>In this paper we construct and analyze the first deterministic algorithm for this problem. <br>We prove that it achieves an (up to a constant factor) optimal competitive ratio <br>$O(n cdot sqrtD)$. We show that the randomization of this algorithm <br>improves this ratio to $O(sqrtD cdot log n)$ (against an oblivious adversary). <br>This substantially improves an $O(n cdot sqrtD)$ upper bound from citedynamic-page-migration.<br>We also give an almost matching lower bound of $Omega(sqrtD cdot sqrtlog n)$ for this problem."}],"publication":"Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)","citation":{"mla":"Bienkowski, Marcin, et al. “Improved Algorithms for Dynamic Page Migration.” <i>Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2005, pp. 365–76, doi:<a href=\"https://doi.org/10.1007/978-3-540-31856-9_30\">10.1007/978-3-540-31856-9_30</a>.","apa":"Bienkowski, M., Dynia, M., &#38; Korzeniowski, M. (2005). Improved Algorithms for Dynamic Page Migration. In <i>Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)</i> (pp. 365–376). <a href=\"https://doi.org/10.1007/978-3-540-31856-9_30\">https://doi.org/10.1007/978-3-540-31856-9_30</a>","ieee":"M. Bienkowski, M. Dynia, and M. Korzeniowski, “Improved Algorithms for Dynamic Page Migration,” in <i>Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2005, pp. 365–376.","chicago":"Bienkowski, Marcin, Miroslaw Dynia, and Miroslaw Korzeniowski. “Improved Algorithms for Dynamic Page Migration.” In <i>Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 365–76. Lecture Notes in Computer Science, 2005. <a href=\"https://doi.org/10.1007/978-3-540-31856-9_30\">https://doi.org/10.1007/978-3-540-31856-9_30</a>.","short":"M. Bienkowski, M. Dynia, M. Korzeniowski, in: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–376.","ama":"Bienkowski M, Dynia M, Korzeniowski M. Improved Algorithms for Dynamic Page Migration. In: <i>Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)</i>. Lecture Notes in Computer Science. ; 2005:365-376. doi:<a href=\"https://doi.org/10.1007/978-3-540-31856-9_30\">10.1007/978-3-540-31856-9_30</a>","bibtex":"@inproceedings{Bienkowski_Dynia_Korzeniowski_2005, series={Lecture Notes in Computer Science}, title={Improved Algorithms for Dynamic Page Migration}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-31856-9_30\">10.1007/978-3-540-31856-9_30</a>}, booktitle={Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Bienkowski, Marcin and Dynia, Miroslaw and Korzeniowski, Miroslaw}, year={2005}, pages={365–376}, collection={Lecture Notes in Computer Science} }"},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-03T10:01:03Z"},{"citation":{"mla":"Räcke, Harald. <i>Data Management and Routing in General Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","bibtex":"@book{Räcke_2005, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Data Management and Routing in General Networks}, volume={154}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Räcke, Harald}, year={2005}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Räcke H. <i>Data Management and Routing in General Networks</i>. Vol 154. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005.","ieee":"H. Räcke, <i>Data Management and Routing in General Networks</i>, vol. 154. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","apa":"Räcke, H. (2005). <i>Data Management and Routing in General Networks</i> (Vol. 154). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","chicago":"Räcke, Harald. <i>Data Management and Routing in General Networks</i>. Vol. 154. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","short":"H. Räcke, Data Management and Routing in General Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20030101262"}]},"date_created":"2020-09-03T14:44:08Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"status":"public","title":"Data Management and Routing in General Networks","year":"2005","author":[{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"}],"publication_identifier":{"isbn":["3-935433-63-8"]},"date_updated":"2022-01-06T06:53:56Z","intvolume":"       154","_id":"18967","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","volume":154},{"abstract":[{"text":"A dynamic geometric data stream is a sequence of m Add/Remove operations of points from a discrete geometric space (1,...,Δ)d [21]. Add(p) inserts a point p from (1,...,Δ)d into the current point set, Remove(p) deletes p from P. We develop low-storage data structures to (i) maintain ε-approximations of range spaces of P with constant VC-dimension and (ii) maintain an ε-approximation of the weight of the Euclidean minimum spanning tree of P. Our data structures use O(log3ε • log3(1/ε) • log(1/ε)/ε2) and O(log (1/δ) • (log Δ/ε)O(d)) bits of memory, respectively (we assume that the dimension d is a constant), and they are correct with probability 1-δ. These results are based on a new data structure that maintains a set of elements chosen (almost) uniformly at random from P.","lang":"eng"}],"citation":{"mla":"Frahling, Gereon, et al. “Sampling in Dynamic Data Streams and Applications.” <i>Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05</i>, 2005, doi:<a href=\"https://doi.org/10.1145/1064092.1064116\">10.1145/1064092.1064116</a>.","bibtex":"@inproceedings{Frahling_Indyk_Sohler_2005, title={Sampling in dynamic data streams and applications}, DOI={<a href=\"https://doi.org/10.1145/1064092.1064116\">10.1145/1064092.1064116</a>}, booktitle={Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05}, author={Frahling, Gereon and Indyk, Piotr and Sohler, Christian}, year={2005} }","ama":"Frahling G, Indyk P, Sohler C. Sampling in dynamic data streams and applications. In: <i>Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05</i>. ; 2005. doi:<a href=\"https://doi.org/10.1145/1064092.1064116\">10.1145/1064092.1064116</a>","ieee":"G. Frahling, P. Indyk, and C. Sohler, “Sampling in dynamic data streams and applications,” in <i>Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05</i>, 2005.","apa":"Frahling, G., Indyk, P., &#38; Sohler, C. (2005). Sampling in dynamic data streams and applications. In <i>Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05</i>. <a href=\"https://doi.org/10.1145/1064092.1064116\">https://doi.org/10.1145/1064092.1064116</a>","chicago":"Frahling, Gereon, Piotr Indyk, and Christian Sohler. “Sampling in Dynamic Data Streams and Applications.” In <i>Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05</i>, 2005. <a href=\"https://doi.org/10.1145/1064092.1064116\">https://doi.org/10.1145/1064092.1064116</a>.","short":"G. Frahling, P. Indyk, C. Sohler, in: Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05, 2005."},"publication":"Proceedings of the twenty-first annual symposium on Computational geometry  - SCG '05","department":[{"_id":"63"}],"type":"conference","date_created":"2021-09-07T13:10:15Z","publication_status":"published","date_updated":"2022-01-06T06:56:02Z","author":[{"last_name":"Frahling","first_name":"Gereon","full_name":"Frahling, Gereon"},{"first_name":"Piotr","last_name":"Indyk","full_name":"Indyk, Piotr"},{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"}],"status":"public","year":"2005","title":"Sampling in dynamic data streams and applications","user_id":"15415","doi":"10.1145/1064092.1064116","_id":"23883","language":[{"iso":"eng"}]},{"citation":{"apa":"Köhler, S., Schindelhauer, C., &#38; Ziegler, M. (2005). On Approximating Real-World Halting Problems. In <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11537311_40\">https://doi.org/10.1007/11537311_40</a>","ieee":"S. Köhler, C. Schindelhauer, and M. Ziegler, “On Approximating Real-World Halting Problems,” in <i>Fundamentals of Computation Theory</i>, Berlin, Heidelberg, 2005.","short":"S. Köhler, C. Schindelhauer, M. Ziegler, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 2005.","chicago":"Köhler, Sven, Christian Schindelhauer, and Martin Ziegler. “On Approximating Real-World Halting Problems.” In <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11537311_40\">https://doi.org/10.1007/11537311_40</a>.","mla":"Köhler, Sven, et al. “On Approximating Real-World Halting Problems.” <i>Fundamentals of Computation Theory</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11537311_40\">10.1007/11537311_40</a>.","ama":"Köhler S, Schindelhauer C, Ziegler M. On Approximating Real-World Halting Problems. In: <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11537311_40\">10.1007/11537311_40</a>","bibtex":"@inbook{Köhler_Schindelhauer_Ziegler_2005, place={Berlin, Heidelberg}, title={On Approximating Real-World Halting Problems}, DOI={<a href=\"https://doi.org/10.1007/11537311_40\">10.1007/11537311_40</a>}, booktitle={Fundamentals of Computation Theory}, author={Köhler, Sven and Schindelhauer, Christian and Ziegler, Martin}, year={2005} }"},"publication":"Fundamentals of Computation Theory","date_created":"2020-08-14T13:44:48Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"book_chapter","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540281931","9783540318736"]},"author":[{"full_name":"Köhler, Sven","first_name":"Sven","last_name":"Köhler"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"},{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"title":"On Approximating Real-World Halting Problems","status":"public","year":"2005","publication_status":"published","date_updated":"2022-01-06T06:53:24Z","_id":"17988","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/11537311_40"},{"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-08-14T13:46:23Z","place":"Berlin, Heidelberg","publication":"Fundamentals of Computation Theory","citation":{"bibtex":"@inbook{Meer_Ziegler_2005, place={Berlin, Heidelberg}, title={An Explicit Solution to Post’s Problem over the Reals}, DOI={<a href=\"https://doi.org/10.1007/11537311_41\">10.1007/11537311_41</a>}, booktitle={Fundamentals of Computation Theory}, author={Meer, Klaus and Ziegler, Martin}, year={2005} }","ama":"Meer K, Ziegler M. An Explicit Solution to Post’s Problem over the Reals. In: <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11537311_41\">10.1007/11537311_41</a>","mla":"Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.” <i>Fundamentals of Computation Theory</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11537311_41\">10.1007/11537311_41</a>.","chicago":"Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.” In <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11537311_41\">https://doi.org/10.1007/11537311_41</a>.","short":"K. Meer, M. Ziegler, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 2005.","ieee":"K. Meer and M. Ziegler, “An Explicit Solution to Post’s Problem over the Reals,” in <i>Fundamentals of Computation Theory</i>, Berlin, Heidelberg, 2005.","apa":"Meer, K., &#38; Ziegler, M. (2005). An Explicit Solution to Post’s Problem over the Reals. In <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11537311_41\">https://doi.org/10.1007/11537311_41</a>"},"user_id":"15415","doi":"10.1007/11537311_41","language":[{"iso":"eng"}],"_id":"17989","publication_status":"published","date_updated":"2022-01-06T06:53:24Z","status":"public","title":"An Explicit Solution to Post’s Problem over the Reals","year":"2005","author":[{"last_name":"Meer","first_name":"Klaus","full_name":"Meer, Klaus"},{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"publication_identifier":{"isbn":["9783540281931","9783540318736"],"issn":["0302-9743","1611-3349"]}},{"status":"public","_id":"18280","publisher":"Springer","page":"562-571","volume":3526,"user_id":"15415","citation":{"mla":"Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.” <i>Proc. CiE 2005: New Computational Paradigms</i>, vol. 3526, Springer, 2005, pp. 562–71, doi:<a href=\"https://doi.org/10.1007/11494645_68\">10.1007/11494645_68</a>.","apa":"Ziegler, M. (2005). Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In <i>Proc. CiE 2005: New Computational Paradigms</i> (Vol. 3526, pp. 562–571). Springer. <a href=\"https://doi.org/10.1007/11494645_68\">https://doi.org/10.1007/11494645_68</a>","ieee":"M. Ziegler, “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism,” in <i>Proc. CiE 2005: New Computational Paradigms</i>, 2005, vol. 3526, pp. 562–571.","chicago":"Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.” In <i>Proc. CiE 2005: New Computational Paradigms</i>, 3526:562–71. Springer, 2005. <a href=\"https://doi.org/10.1007/11494645_68\">https://doi.org/10.1007/11494645_68</a>.","ama":"Ziegler M. Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In: <i>Proc. CiE 2005: New Computational Paradigms</i>. Vol 3526. Springer; 2005:562-571. doi:<a href=\"https://doi.org/10.1007/11494645_68\">10.1007/11494645_68</a>","short":"M. Ziegler, in: Proc. CiE 2005: New Computational Paradigms, Springer, 2005, pp. 562–571.","bibtex":"@inproceedings{Ziegler_2005, title={Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism}, volume={3526}, DOI={<a href=\"https://doi.org/10.1007/11494645_68\">10.1007/11494645_68</a>}, booktitle={Proc. CiE 2005: New Computational Paradigms}, publisher={Springer}, author={Ziegler, Martin}, year={2005}, pages={562–571} }"},"publication_identifier":{"isbn":["9783540261797","9783540322665"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"year":"2005","title":"Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism","intvolume":"      3526","publication_status":"published","date_updated":"2022-01-06T06:53:28Z","language":[{"iso":"eng"}],"doi":"10.1007/11494645_68","publication":"Proc. CiE 2005: New Computational Paradigms","abstract":[{"lang":"eng","text":"The sometimes so-called Main Theorem of Recursive Analysis implies that any computable real function is necessarily continuous. We consider three relaxations of this common notion of real computability for the purpose of treating also discontinuous functions f:R->R:<br>*) non-deterministic computation;<br>*) relativized computation, specifically given access to oracles like 0' or 0'';<br>*) encoding input x and/or output y=f(x) in weaker ways according to the Real Arithmetic Hierarchy.<br>It turns out that, among these approaches, only the first one provides the required power."}],"date_created":"2020-08-25T12:38:49Z","department":[{"_id":"63"}],"type":"conference"},{"volume":44,"user_id":"15415","_id":"18282","page":"2059-2071","status":"public","citation":{"bibtex":"@article{Ziegler_2005, title={Computational Power of Infinite Quantum Parallelism}, volume={44}, DOI={<a href=\"https://doi.org/10.1007/s10773-005-8984-0\">10.1007/s10773-005-8984-0</a>}, number={11}, journal={International Journal of Theoretical Physics}, author={Ziegler, Martin}, year={2005}, pages={2059–2071} }","ama":"Ziegler M. Computational Power of Infinite Quantum Parallelism. <i>International Journal of Theoretical Physics</i>. 2005;44(11):2059-2071. doi:<a href=\"https://doi.org/10.1007/s10773-005-8984-0\">10.1007/s10773-005-8984-0</a>","mla":"Ziegler, Martin. “Computational Power of Infinite Quantum Parallelism.” <i>International Journal of Theoretical Physics</i>, vol. 44, no. 11, 2005, pp. 2059–71, doi:<a href=\"https://doi.org/10.1007/s10773-005-8984-0\">10.1007/s10773-005-8984-0</a>.","chicago":"Ziegler, Martin. “Computational Power of Infinite Quantum Parallelism.” <i>International Journal of Theoretical Physics</i> 44, no. 11 (2005): 2059–71. <a href=\"https://doi.org/10.1007/s10773-005-8984-0\">https://doi.org/10.1007/s10773-005-8984-0</a>.","short":"M. Ziegler, International Journal of Theoretical Physics 44 (2005) 2059–2071.","ieee":"M. Ziegler, “Computational Power of Infinite Quantum Parallelism,” <i>International Journal of Theoretical Physics</i>, vol. 44, no. 11, pp. 2059–2071, 2005.","apa":"Ziegler, M. (2005). Computational Power of Infinite Quantum Parallelism. <i>International Journal of Theoretical Physics</i>, <i>44</i>(11), 2059–2071. <a href=\"https://doi.org/10.1007/s10773-005-8984-0\">https://doi.org/10.1007/s10773-005-8984-0</a>"},"doi":"10.1007/s10773-005-8984-0","language":[{"iso":"eng"}],"intvolume":"        44","publication_status":"published","date_updated":"2022-01-06T06:53:28Z","author":[{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"publication_identifier":{"issn":["0020-7748","1572-9575"]},"title":"Computational Power of Infinite Quantum Parallelism","year":"2005","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-08-25T12:47:12Z","issue":"11","publication":"International Journal of Theoretical Physics"},{"user_id":"15415","page":"267-270","_id":"18366","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:30Z","status":"public","title":"Methods to lead the user to significant processes in a 3D material flow simulation","year":"2005","author":[{"first_name":"Wilhelm","last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm"},{"full_name":"Mueck, Bengt","first_name":"Bengt","last_name":"Mueck"},{"last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias","id":"146"},{"full_name":"Mahajan, Kiran","first_name":"Kiran","last_name":"Mahajan"},{"full_name":" Laroque, Christoph","last_name":" Laroque","first_name":"Christoph"}],"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-26T12:36:33Z","publication":"Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005","citation":{"mla":"Dangelmaier, Wilhelm, et al. “Methods to Lead the User to Significant Processes in a 3D Material Flow Simulation.” <i>Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i>, 2005, pp. 267–70.","ama":"Dangelmaier W, Mueck B, Fischer M, Mahajan K,  Laroque C. Methods to lead the user to significant processes in a 3D material flow simulation. In: <i>Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i>. ; 2005:267-270.","bibtex":"@inproceedings{Dangelmaier_Mueck_Fischer_Mahajan_ Laroque_2005, title={Methods to lead the user to significant processes in a 3D material flow simulation}, booktitle={Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005}, author={Dangelmaier, Wilhelm and Mueck, Bengt and Fischer, Matthias and Mahajan, Kiran and  Laroque, Christoph}, year={2005}, pages={267–270} }","apa":"Dangelmaier, W., Mueck, B., Fischer, M., Mahajan, K., &#38;  Laroque, C. (2005). Methods to lead the user to significant processes in a 3D material flow simulation. In <i>Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i> (pp. 267–270).","ieee":"W. Dangelmaier, B. Mueck, M. Fischer, K. Mahajan, and C.  Laroque, “Methods to lead the user to significant processes in a 3D material flow simulation,” in <i>Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i>, 2005, pp. 267–270.","short":"W. Dangelmaier, B. Mueck, M. Fischer, K. Mahajan, C.  Laroque, in: Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005, 2005, pp. 267–270.","chicago":"Dangelmaier, Wilhelm, Bengt Mueck, Matthias Fischer, Kiran Mahajan, and Christoph  Laroque. “Methods to Lead the User to Significant Processes in a 3D Material Flow Simulation.” In <i>Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i>, 267–70, 2005."}},{"date_updated":"2022-01-06T06:53:32Z","author":[{"full_name":"Loeser, Christoph","last_name":"Loeser","first_name":"Christoph"},{"full_name":"Drüke, Isabell","last_name":"Drüke","first_name":"Isabell"},{"last_name":"Oesterdiekhoff","first_name":"Brigitte","full_name":"Oesterdiekhoff, Brigitte"}],"year":"2005","title":" Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario","status":"public","user_id":"15415","language":[{"iso":"eng"}],"_id":"18449","citation":{"apa":"Loeser, C., Drüke, I., &#38; Oesterdiekhoff, B. (2005).  Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario. In <i>IEEE International Conference on Industrial Informatics (INDIN)</i>.","ieee":"C. Loeser, I. Drüke, and B. Oesterdiekhoff, “ Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario,” in <i>IEEE International Conference on Industrial Informatics (INDIN)</i>, 2005.","chicago":"Loeser, Christoph, Isabell Drüke, and Brigitte Oesterdiekhoff. “ Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario.” In <i>IEEE International Conference on Industrial Informatics (INDIN)</i>, 2005.","short":"C. Loeser, I. Drüke, B. Oesterdiekhoff, in: IEEE International Conference on Industrial Informatics (INDIN), 2005.","mla":"Loeser, Christoph, et al. “ Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario.” <i>IEEE International Conference on Industrial Informatics (INDIN)</i>, 2005.","ama":"Loeser C, Drüke I, Oesterdiekhoff B.  Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario. In: <i>IEEE International Conference on Industrial Informatics (INDIN)</i>. ; 2005.","bibtex":"@inproceedings{Loeser_Drüke_Oesterdiekhoff_2005, title={ Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario}, booktitle={IEEE International Conference on Industrial Informatics (INDIN)}, author={Loeser, Christoph and Drüke, Isabell and Oesterdiekhoff, Brigitte}, year={2005} }"},"publication":"IEEE International Conference on Industrial Informatics (INDIN)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-08-27T12:04:12Z"},{"citation":{"ieee":"B. Oesterdiekhoff, “Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices,” in <i>IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)</i>, 2005.","apa":"Oesterdiekhoff, B. (2005). Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices. In <i>IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)</i>.","mla":"Oesterdiekhoff, Brigitte. “Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices.” <i>IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)</i>, 2005.","bibtex":"@inproceedings{Oesterdiekhoff_2005, title={Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices}, booktitle={IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)}, author={Oesterdiekhoff, Brigitte}, year={2005} }","chicago":"Oesterdiekhoff, Brigitte. “Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices.” In <i>IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)</i>, 2005.","ama":"Oesterdiekhoff B. Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices. In: <i>IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)</i>. ; 2005.","short":"B. Oesterdiekhoff, in: IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 2005."},"publication":"IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-08-27T12:06:59Z","date_updated":"2022-01-06T06:53:32Z","author":[{"first_name":"Brigitte","last_name":"Oesterdiekhoff","full_name":"Oesterdiekhoff, Brigitte"}],"title":"Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices","status":"public","year":"2005","user_id":"15415","_id":"18450","language":[{"iso":"eng"}]},{"publication":"Peer-to-Peer Systems IV","citation":{"apa":"Bienkowski, M., Korzeniowski, M., &#38; Meyer auf der Heide, F. (2005). Dynamic Load Balancing in Distributed Hash Tables. In <i>Peer-to-Peer Systems IV</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11558989_20\">https://doi.org/10.1007/11558989_20</a>","ieee":"M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Dynamic Load Balancing in Distributed Hash Tables,” in <i>Peer-to-Peer Systems IV</i>, Berlin, Heidelberg, 2005.","chicago":"Bienkowski, Marcin, Miroslaw Korzeniowski, and Friedhelm Meyer auf der Heide. “Dynamic Load Balancing in Distributed Hash Tables.” In <i>Peer-to-Peer Systems IV</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11558989_20\">https://doi.org/10.1007/11558989_20</a>.","short":"M. Bienkowski, M. Korzeniowski, F. Meyer auf der Heide, in: Peer-to-Peer Systems IV, Berlin, Heidelberg, 2005.","mla":"Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.” <i>Peer-to-Peer Systems IV</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11558989_20\">10.1007/11558989_20</a>.","ama":"Bienkowski M, Korzeniowski M, Meyer auf der Heide F. Dynamic Load Balancing in Distributed Hash Tables. In: <i>Peer-to-Peer Systems IV</i>. Berlin, Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11558989_20\">10.1007/11558989_20</a>","bibtex":"@inbook{Bienkowski_Korzeniowski_Meyer auf der Heide_2005, place={Berlin, Heidelberg}, title={Dynamic Load Balancing in Distributed Hash Tables}, DOI={<a href=\"https://doi.org/10.1007/11558989_20\">10.1007/11558989_20</a>}, booktitle={Peer-to-Peer Systems IV}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, year={2005} }"},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-08T09:18:56Z","place":"Berlin, Heidelberg","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","title":"Dynamic Load Balancing in Distributed Hash Tables","year":"2005","status":"public","author":[{"last_name":"Bienkowski","first_name":"Marcin","full_name":"Bienkowski, Marcin"},{"last_name":"Korzeniowski","first_name":"Miroslaw","full_name":"Korzeniowski, Miroslaw"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540290681","9783540319061"]},"user_id":"15415","doi":"10.1007/11558989_20","_id":"16468","language":[{"iso":"eng"}]},{"publication":"Mathematical Foundations of Computer Science 2005","citation":{"chicago":"Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” In <i>Mathematical Foundations of Computer Science 2005</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11549345_1\">https://doi.org/10.1007/11549345_1</a>.","short":"M. Bienkowski, F. Meyer auf der Heide, in: Mathematical Foundations of Computer Science 2005, Berlin, Heidelberg, 2005.","ieee":"M. Bienkowski and F. Meyer auf der Heide, “Page Migration in Dynamic Networks,” in <i>Mathematical Foundations of Computer Science 2005</i>, Berlin, Heidelberg, 2005.","apa":"Bienkowski, M., &#38; Meyer auf der Heide, F. (2005). Page Migration in Dynamic Networks. In <i>Mathematical Foundations of Computer Science 2005</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11549345_1\">https://doi.org/10.1007/11549345_1</a>","bibtex":"@inbook{Bienkowski_Meyer auf der Heide_2005, place={Berlin, Heidelberg}, title={Page Migration in Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1007/11549345_1\">10.1007/11549345_1</a>}, booktitle={Mathematical Foundations of Computer Science 2005}, author={Bienkowski, Marcin and Meyer auf der Heide, Friedhelm}, year={2005} }","ama":"Bienkowski M, Meyer auf der Heide F. Page Migration in Dynamic Networks. In: <i>Mathematical Foundations of Computer Science 2005</i>. Berlin, Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11549345_1\">10.1007/11549345_1</a>","mla":"Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” <i>Mathematical Foundations of Computer Science 2005</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11549345_1\">10.1007/11549345_1</a>."},"place":"Berlin, Heidelberg","date_created":"2020-04-08T09:23:36Z","type":"book_chapter","department":[{"_id":"63"}],"year":"2005","status":"public","title":"Page Migration in Dynamic Networks","publication_identifier":{"isbn":["9783540287025","9783540318675"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Bienkowski, Marcin","last_name":"Bienkowski","first_name":"Marcin"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16469","doi":"10.1007/11549345_1","user_id":"15415"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-08T09:25:44Z","abstract":[{"lang":"eng","text":"We present a web computing library (PUBWCL) in Java that allows to execute strongly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed over the internet whose owners are willing to donate their unused computation power.\r\nPUBWCL is realized as a peer-to-peer system and features migration and restoration of BSP processes executed on it.\r\nThe use of Java guarantees a high level of security and makes PUBWCL platform independent. In order to estimate the loss of efficiency inherent in such a Java-based system, we have compared it to our C-based PUB-Library.\r\n"}],"publication":"Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)","citation":{"ama":"Bonorden O, Gehweiler J, Meyer auf der Heide F. A Web Computing Environment for Parallel Algorithms in Java. In: <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>. ; 2005:801-808. doi:<a href=\"https://doi.org/10.1007/11752578_96\">10.1007/11752578_96</a>","bibtex":"@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={A Web Computing Environment for Parallel Algorithms in Java}, DOI={<a href=\"https://doi.org/10.1007/11752578_96\">10.1007/11752578_96</a>}, booktitle={Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, year={2005}, pages={801–808} }","mla":"Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.” <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 801–08, doi:<a href=\"https://doi.org/10.1007/11752578_96\">10.1007/11752578_96</a>.","chicago":"Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “A Web Computing Environment for Parallel Algorithms in Java.” In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 801–8, 2005. <a href=\"https://doi.org/10.1007/11752578_96\">https://doi.org/10.1007/11752578_96</a>.","short":"O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, in: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–808.","apa":"Bonorden, O., Gehweiler, J., &#38; Meyer auf der Heide, F. (2005). A Web Computing Environment for Parallel Algorithms in Java. In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i> (pp. 801–808). <a href=\"https://doi.org/10.1007/11752578_96\">https://doi.org/10.1007/11752578_96</a>","ieee":"O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “A Web Computing Environment for Parallel Algorithms in Java,” in <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 801–808."},"doi":"10.1007/11752578_96","user_id":"15415","page":"801-808","_id":"16470","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","year":"2005","title":"A Web Computing Environment for Parallel Algorithms in Java","status":"public","author":[{"first_name":"Olaf","last_name":"Bonorden","full_name":"Bonorden, Olaf"},{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540341413","9783540341420"]}},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540341413","9783540341420"]},"author":[{"full_name":"Bonorden, Olaf","first_name":"Olaf","last_name":"Bonorden"},{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"title":"Load Balancing Strategies in a Web Computing Environment","year":"2005","status":"public","date_updated":"2022-01-06T06:52:50Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16471","page":"839-846","doi":"10.1007/11752578_101","user_id":"15415","citation":{"ama":"Bonorden O, Gehweiler J, Meyer auf der Heide F. Load Balancing Strategies in a Web Computing Environment. In: <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>. ; 2005:839-846. doi:<a href=\"https://doi.org/10.1007/11752578_101\">10.1007/11752578_101</a>","bibtex":"@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={Load Balancing Strategies in a Web Computing Environment}, DOI={<a href=\"https://doi.org/10.1007/11752578_101\">10.1007/11752578_101</a>}, booktitle={Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, year={2005}, pages={839–846} }","mla":"Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.” <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 839–46, doi:<a href=\"https://doi.org/10.1007/11752578_101\">10.1007/11752578_101</a>.","chicago":"Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “Load Balancing Strategies in a Web Computing Environment.” In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 839–46, 2005. <a href=\"https://doi.org/10.1007/11752578_101\">https://doi.org/10.1007/11752578_101</a>.","short":"O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, in: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–846.","apa":"Bonorden, O., Gehweiler, J., &#38; Meyer auf der Heide, F. (2005). Load Balancing Strategies in a Web Computing Environment. In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i> (pp. 839–846). <a href=\"https://doi.org/10.1007/11752578_101\">https://doi.org/10.1007/11752578_101</a>","ieee":"O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “Load Balancing Strategies in a Web Computing Environment,” in <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 839–846."},"publication":"Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)","abstract":[{"lang":"eng","text":"We compare different load balancing strategies for Bulk-Synchronous Parallel (BSP) programs in a web computing environment. In order to handle the influence of the fluctuating available computation power, we classify the external work load.\r\n\r\nWe evaluate the load balancing algorithms using our web computing library for BSP programs in Java (PUBWCL). Thereby we simulated the external work load in order to have repeatable testing conditions.\r\n\r\nWith the best performing load balancing strategy we could save 39% of the execution time averaged and even up to 50% in particular cases."}],"date_created":"2020-04-08T09:30:12Z","department":[{"_id":"63"}],"type":"conference"},{"related_material":{"link":[{"relation":"confirmation","url":"http://www.win.tue.nl/EWCG2005/Proceedings/43.pdf"}]},"publication":"Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005","citation":{"ieee":"M. Bienkowski, V. Damerow, F. Meyer auf der Heide, and C. Sohler, “Average case complexity of Voronoi diagrams of n sites from the unit cube,” in <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>, 2005.","mla":"Bienkowski, Marcin, et al. “Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.” <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>, Technische Universiteit Eindhoven, 2005.","apa":"Bienkowski, M., Damerow, V., Meyer auf der Heide, F., &#38; Sohler, C. (2005). Average case complexity of Voronoi diagrams of n sites from the unit cube. In <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>. Technische Universiteit Eindhoven.","bibtex":"@inproceedings{Bienkowski_Damerow_Meyer auf der Heide_Sohler_2005, title={Average case complexity of Voronoi diagrams of n sites from the unit cube}, booktitle={Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005}, publisher={Technische Universiteit Eindhoven}, author={Bienkowski, Marcin and Damerow, Valentina and Meyer auf der Heide, Friedhelm and Sohler, Christian}, year={2005} }","short":"M. Bienkowski, V. Damerow, F. Meyer auf der Heide, C. Sohler, in: Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005, Technische Universiteit Eindhoven, 2005.","ama":"Bienkowski M, Damerow V, Meyer auf der Heide F, Sohler C. Average case complexity of Voronoi diagrams of n sites from the unit cube. In: <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>. Technische Universiteit Eindhoven; 2005.","chicago":"Bienkowski, Marcin, Valentina Damerow, Friedhelm Meyer auf der Heide, and Christian Sohler. “Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.” In <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>. Technische Universiteit Eindhoven, 2005."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-06-22T13:22:22Z","date_updated":"2022-01-06T06:53:05Z","title":"Average case complexity of Voronoi diagrams of n sites from the unit cube","year":"2005","status":"public","author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"last_name":"Damerow","first_name":"Valentina","full_name":"Damerow, Valentina"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"}],"user_id":"15415","language":[{"iso":"eng"}],"_id":"17112","publisher":"Technische Universiteit Eindhoven"},{"citation":{"bibtex":"@book{Leonardi_Meyer auf der Heide_Wagner_2005, series={Dagstuhl Seminar Proceedings}, title={Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks}, volume={05361}, year={2005}, collection={Dagstuhl Seminar Proceedings} }","ama":"Leonardi S, Meyer auf der Heide F, Wagner D, eds. <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i>. Vol 05361.; 2005.","mla":"Leonardi, Stefano, et al., editors. <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i>. Vol. 05361, 2005.","short":"S. Leonardi, F. Meyer auf der Heide, D. Wagner, eds., Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks, 2005.","chicago":"Leonardi, Stefano, Friedhelm Meyer auf der Heide, and Dorothea Wagner, eds. <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i>. Vol. 05361. Dagstuhl Seminar Proceedings, 2005.","ieee":"S. Leonardi, F. Meyer auf der Heide, and D. Wagner, Eds., <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i>, vol. 05361. 2005.","apa":"Leonardi, S., Meyer auf der Heide, F., &#38; Wagner, D. (Eds.). (2005). <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i> (Vol. 05361). Presented at the Dagstuhl Seminar Proceedings, Schloss Dagstuhl, Germany."},"related_material":{"link":[{"url":"https://drops.dagstuhl.de/opus/volltexte/2006/570/","relation":"confirmation"}]},"date_created":"2020-06-22T13:52:52Z","department":[{"_id":"63"}],"type":"conference_editor","conference":{"end_date":"2005-09-09","start_date":"2005-09-04","name":"Dagstuhl Seminar Proceedings","location":"Schloss Dagstuhl, Germany"},"status":"public","year":"2005","title":"Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks","intvolume":"      5361","date_updated":"2022-01-06T06:53:05Z","_id":"17113","series_title":"Dagstuhl Seminar Proceedings","language":[{"iso":"eng"}],"editor":[{"first_name":"Stefano","last_name":"Leonardi","full_name":"Leonardi, Stefano"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Dorothea","last_name":"Wagner","full_name":"Wagner, Dorothea"}],"volume":"05361","user_id":"15415"},{"doi":"10.1016/j.tcs.2005.09.053","user_id":"15415","page":"14-26","language":[{"iso":"eng"}],"_id":"15058","date_updated":"2022-01-06T06:52:15Z","publication_status":"published","year":"2005","title":"Stability versus speed in a computable algebraic model","status":"public","publication_identifier":{"issn":["0304-3975"]},"author":[{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"type":"journal_article","department":[{"_id":"63"}],"date_created":"2019-11-20T13:22:22Z","publication":"Theoretical Computer Science","citation":{"bibtex":"@article{Ziegler_2005, title={Stability versus speed in a computable algebraic model}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2005.09.053\">10.1016/j.tcs.2005.09.053</a>}, journal={Theoretical Computer Science}, author={Ziegler, Martin}, year={2005}, pages={14–26} }","chicago":"Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.” <i>Theoretical Computer Science</i>, 2005, 14–26. <a href=\"https://doi.org/10.1016/j.tcs.2005.09.053\">https://doi.org/10.1016/j.tcs.2005.09.053</a>.","ama":"Ziegler M. Stability versus speed in a computable algebraic model. <i>Theoretical Computer Science</i>. 2005:14-26. doi:<a href=\"https://doi.org/10.1016/j.tcs.2005.09.053\">10.1016/j.tcs.2005.09.053</a>","short":"M. Ziegler, Theoretical Computer Science (2005) 14–26.","ieee":"M. Ziegler, “Stability versus speed in a computable algebraic model,” <i>Theoretical Computer Science</i>, pp. 14–26, 2005.","apa":"Ziegler, M. (2005). Stability versus speed in a computable algebraic model. <i>Theoretical Computer Science</i>, 14–26. <a href=\"https://doi.org/10.1016/j.tcs.2005.09.053\">https://doi.org/10.1016/j.tcs.2005.09.053</a>","mla":"Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.” <i>Theoretical Computer Science</i>, 2005, pp. 14–26, doi:<a href=\"https://doi.org/10.1016/j.tcs.2005.09.053\">10.1016/j.tcs.2005.09.053</a>."}}]