[{"publication":"EUROCRYPT 2005","file":[{"file_id":"3008","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-06-05T08:18:20Z","file_name":"toolkit.pdf","access_level":"closed","file_size":333655,"date_created":"2018-06-05T08:18:20Z","creator":"feidens"}],"date_created":"2018-06-05T08:16:47Z","type":"book_chapter","department":[{"_id":"64"}],"title":"A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers","year":"2005","publication_identifier":{"isbn":["9783540259107","9783540320555"],"issn":["0302-9743","1611-3349"]},"author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"last_name":"May","first_name":"Alexander","full_name":"May, Alexander"}],"date_updated":"2022-01-06T06:58:50Z","publication_status":"published","series_title":"Lecture Notes in Computer Science","doi":"10.1007/11426639_15","file_date_updated":"2018-06-05T08:18:20Z","citation":{"mla":"Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” <i>EUROCRYPT 2005</i>, Springer Berlin Heidelberg, 2005, pp. 251–67, doi:<a href=\"https://doi.org/10.1007/11426639_15\">10.1007/11426639_15</a>.","ama":"Blömer J, May A. A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: <i>EUROCRYPT 2005</i>. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:251-267. doi:<a href=\"https://doi.org/10.1007/11426639_15\">10.1007/11426639_15</a>","bibtex":"@inbook{Blömer_May_2005, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers}, DOI={<a href=\"https://doi.org/10.1007/11426639_15\">10.1007/11426639_15</a>}, booktitle={EUROCRYPT 2005}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2005}, pages={251–267}, collection={Lecture Notes in Computer Science} }","apa":"Blömer, J., &#38; May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In <i>EUROCRYPT 2005</i> (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11426639_15\">https://doi.org/10.1007/11426639_15</a>","ieee":"J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in <i>EUROCRYPT 2005</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.","chicago":"Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” In <i>EUROCRYPT 2005</i>, 251–67. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11426639_15\">https://doi.org/10.1007/11426639_15</a>.","short":"J. Blömer, A. May, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 251–267."},"place":"Berlin, Heidelberg","status":"public","has_accepted_license":"1","page":"251-267","publisher":"Springer Berlin Heidelberg","_id":"3006","ddc":["000"],"user_id":"25078"},{"user_id":"25078","doi":"10.1007/11426639_22","_id":"3010","publisher":"Springer Berlin Heidelberg","series_title":"LNCS","page":"371-386","publication_status":"published","date_updated":"2022-01-06T06:58:51Z","author":[{"full_name":"Ernst, Matthias","last_name":"Ernst","first_name":"Matthias"},{"full_name":"Jochemsz, Ellen","first_name":"Ellen","last_name":"Jochemsz"},{"last_name":"May","first_name":"Alexander","full_name":"May, Alexander"},{"full_name":"de Weger, Benne","first_name":"Benne","last_name":"de Weger"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540259107","9783540320555"]},"status":"public","title":"Partial Key Exposure Attacks on RSA up to Full Size Exponents","year":"2005","department":[{"_id":"64"}],"type":"book_chapter","date_created":"2018-06-05T08:19:48Z","place":"Berlin, Heidelberg","citation":{"mla":"Ernst, Matthias, et al. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.” <i>EUROCRYPT 2005</i>, Springer Berlin Heidelberg, 2005, pp. 371–86, doi:<a href=\"https://doi.org/10.1007/11426639_22\">10.1007/11426639_22</a>.","ama":"Ernst M, Jochemsz E, May A, de Weger B. Partial Key Exposure Attacks on RSA up to Full Size Exponents. In: <i>EUROCRYPT 2005</i>. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:371-386. doi:<a href=\"https://doi.org/10.1007/11426639_22\">10.1007/11426639_22</a>","bibtex":"@inbook{Ernst_Jochemsz_May_de Weger_2005, place={Berlin, Heidelberg}, series={LNCS}, title={Partial Key Exposure Attacks on RSA up to Full Size Exponents}, DOI={<a href=\"https://doi.org/10.1007/11426639_22\">10.1007/11426639_22</a>}, booktitle={EUROCRYPT 2005}, publisher={Springer Berlin Heidelberg}, author={Ernst, Matthias and Jochemsz, Ellen and May, Alexander and de Weger, Benne}, year={2005}, pages={371–386}, collection={LNCS} }","apa":"Ernst, M., Jochemsz, E., May, A., &#38; de Weger, B. (2005). Partial Key Exposure Attacks on RSA up to Full Size Exponents. In <i>EUROCRYPT 2005</i> (pp. 371–386). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11426639_22\">https://doi.org/10.1007/11426639_22</a>","ieee":"M. Ernst, E. Jochemsz, A. May, and B. de Weger, “Partial Key Exposure Attacks on RSA up to Full Size Exponents,” in <i>EUROCRYPT 2005</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 371–386.","chicago":"Ernst, Matthias, Ellen Jochemsz, Alexander May, and Benne de Weger. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.” In <i>EUROCRYPT 2005</i>, 371–86. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11426639_22\">https://doi.org/10.1007/11426639_22</a>.","short":"M. Ernst, E. Jochemsz, A. May, B. de Weger, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 371–386."},"publication":"EUROCRYPT 2005"},{"language":[{"iso":"eng"}],"_id":"26991","doi":"10.1007/11561071_5","user_id":"15415","publication_identifier":{"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Rührup, Stefan","first_name":"Stefan","last_name":"Rührup"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"}],"year":"2005","status":"public","title":"Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio","date_updated":"2022-01-06T06:57:31Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2021-10-28T10:22:39Z","department":[{"_id":"63"},{"_id":"26"}],"type":"book_chapter","citation":{"ieee":"S. Rührup and C. Schindelhauer, “Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio,” in <i>Algorithms – ESA 2005</i>, Berlin, Heidelberg, 2005.","apa":"Rührup, S., &#38; Schindelhauer, C. (2005). Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In <i>Algorithms – ESA 2005</i>. <a href=\"https://doi.org/10.1007/11561071_5\">https://doi.org/10.1007/11561071_5</a>","mla":"Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.” <i>Algorithms – ESA 2005</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11561071_5\">10.1007/11561071_5</a>.","bibtex":"@inbook{Rührup_Schindelhauer_2005, place={Berlin, Heidelberg}, title={Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio}, DOI={<a href=\"https://doi.org/10.1007/11561071_5\">10.1007/11561071_5</a>}, booktitle={Algorithms – ESA 2005}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2005} }","ama":"Rührup S, Schindelhauer C. Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In: <i>Algorithms – ESA 2005</i>. ; 2005. doi:<a href=\"https://doi.org/10.1007/11561071_5\">10.1007/11561071_5</a>","short":"S. Rührup, C. Schindelhauer, in: Algorithms – ESA 2005, Berlin, Heidelberg, 2005.","chicago":"Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.” In <i>Algorithms – ESA 2005</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11561071_5\">https://doi.org/10.1007/11561071_5</a>."},"publication":"Algorithms – ESA 2005"},{"publication_identifier":{"isbn":["9783540275800","9783540316916"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Bădoiu, Mihai","last_name":"Bădoiu","first_name":"Mihai"},{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"first_name":"Piotr","last_name":"Indyk","full_name":"Indyk, Piotr"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"}],"status":"public","title":"Facility Location in Sublinear Time","year":"2005","date_updated":"2022-01-06T06:53:52Z","publication_status":"published","_id":"18768","language":[{"iso":"eng"}],"page":"866-877","doi":"10.1007/11523468_70","user_id":"15415","citation":{"ieee":"M. Bădoiu, A. Czumaj, P. Indyk, and C. Sohler, “Facility Location in Sublinear Time,” in <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2005, pp. 866–877.","apa":"Bădoiu, M., Czumaj, A., Indyk, P., &#38; Sohler, C. (2005). Facility Location in Sublinear Time. In <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i> (pp. 866–877). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11523468_70\">https://doi.org/10.1007/11523468_70</a>","chicago":"Bădoiu, Mihai, Artur Czumaj, Piotr Indyk, and Christian Sohler. “Facility Location in Sublinear Time.” In <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i>, 866–77. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11523468_70\">https://doi.org/10.1007/11523468_70</a>.","short":"M. Bădoiu, A. Czumaj, P. Indyk, C. Sohler, in: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), Berlin, Heidelberg, 2005, pp. 866–877.","mla":"Bădoiu, Mihai, et al. “Facility Location in Sublinear Time.” <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2005, pp. 866–77, doi:<a href=\"https://doi.org/10.1007/11523468_70\">10.1007/11523468_70</a>.","bibtex":"@inproceedings{Bădoiu_Czumaj_Indyk_Sohler_2005, place={Berlin, Heidelberg}, title={Facility Location in Sublinear Time}, DOI={<a href=\"https://doi.org/10.1007/11523468_70\">10.1007/11523468_70</a>}, booktitle={Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)}, author={Bădoiu, Mihai and Czumaj, Artur and Indyk, Piotr and Sohler, Christian}, year={2005}, pages={866–877} }","ama":"Bădoiu M, Czumaj A, Indyk P, Sohler C. Facility Location in Sublinear Time. In: <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i>. Berlin, Heidelberg; 2005:866-877. doi:<a href=\"https://doi.org/10.1007/11523468_70\">10.1007/11523468_70</a>"},"publication":"Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)","place":"Berlin, Heidelberg","date_created":"2020-09-01T11:53:19Z","department":[{"_id":"63"}],"type":"conference"},{"intvolume":"      3669","date_updated":"2022-01-06T06:53:53Z","publication_status":"published","publication_identifier":{"isbn":["9783540291183","9783540319511"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Frahling","first_name":"Gereon","full_name":"Frahling, Gereon"},{"full_name":"Krokowski, Jens","last_name":"Krokowski","first_name":"Jens"}],"year":"2005","title":"Online Occlusion Culling","doi":"10.1007/11561071_67","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Modern computer graphics systems are able to render sophisticated 3D szenes consisting of millions of polygons. In this paper we address the problem of occlusion culling. Aila, Miettinen, and Nordlund suggested to implement a FIFO buffer on graphics cards which is able to delay the polygons before drawing them. When one of the polygons within the buffer is occluded or masked by another polygon arriving later from the application, the rendering engine can drop the occluded one without rendering, saving important rendering time.<br>We introduce a theoretical online model to analyse these problems in theory using competitive analysis. For different cost measures addressed we invent the first competitive algorithms for online occlusion culling. Our implementation shows that these algorithms outperform known ones for real 3D scenes as well."}],"publication":"Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-02T13:26:52Z","status":"public","volume":3669,"user_id":"15415","publisher":"Springer","_id":"18867","page":"758-769","citation":{"ama":"Frahling G, Krokowski J. Online Occlusion Culling. In: <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>. Vol 3669. Berlin, Heidelberg: Springer; 2005:758-769. doi:<a href=\"https://doi.org/10.1007/11561071_67\">10.1007/11561071_67</a>","bibtex":"@inproceedings{Frahling_Krokowski_2005, place={Berlin, Heidelberg}, title={Online Occlusion Culling}, volume={3669}, DOI={<a href=\"https://doi.org/10.1007/11561071_67\">10.1007/11561071_67</a>}, booktitle={Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, publisher={Springer}, author={Frahling, Gereon and Krokowski, Jens}, year={2005}, pages={758–769} }","mla":"Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, vol. 3669, Springer, 2005, pp. 758–69, doi:<a href=\"https://doi.org/10.1007/11561071_67\">10.1007/11561071_67</a>.","chicago":"Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” In <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, 3669:758–69. Berlin, Heidelberg: Springer, 2005. <a href=\"https://doi.org/10.1007/11561071_67\">https://doi.org/10.1007/11561071_67</a>.","short":"G. Frahling, J. Krokowski, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer, Berlin, Heidelberg, 2005, pp. 758–769.","apa":"Frahling, G., &#38; Krokowski, J. (2005). Online Occlusion Culling. In <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i> (Vol. 3669, pp. 758–769). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/11561071_67\">https://doi.org/10.1007/11561071_67</a>","ieee":"G. Frahling and J. Krokowski, “Online Occlusion Culling,” in <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, 2005, vol. 3669, pp. 758–769."},"place":"Berlin, Heidelberg"},{"abstract":[{"text":"We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where access patterns to the shared object are dictated by an adversary, and each processor performs a random walk in X. We extend the previous results of [4]: we develop algorithms for the case where X is a ring, and prove that with high probability they achieve a competitive ratio of O~(min{D−−√4,n}), where D is the size of the shared object and n is the number of nodes in the network. These results hold also for any d-dimensional torus or mesh with diameter at least Ω~(D−−√).","lang":"eng"}],"publication":"Proc. of the European Conference in Parallel Processing (Euro-Par)","citation":{"apa":"Bienkowski, M., &#38; Korzeniowski, M. (2005). Dynamic Page Migration Under Brownian Motion. In <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11549468_105\">https://doi.org/10.1007/11549468_105</a>","ieee":"M. Bienkowski and M. Korzeniowski, “Dynamic Page Migration Under Brownian Motion,” in <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>, 2005.","short":"M. Bienkowski, M. Korzeniowski, in: Proc. of the European Conference in Parallel Processing (Euro-Par), Berlin, Heidelberg, 2005.","chicago":"Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” In <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11549468_105\">https://doi.org/10.1007/11549468_105</a>.","mla":"Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11549468_105\">10.1007/11549468_105</a>.","ama":"Bienkowski M, Korzeniowski M. Dynamic Page Migration Under Brownian Motion. In: <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>. Berlin, Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11549468_105\">10.1007/11549468_105</a>","bibtex":"@inproceedings{Bienkowski_Korzeniowski_2005, place={Berlin, Heidelberg}, title={Dynamic Page Migration Under Brownian Motion}, DOI={<a href=\"https://doi.org/10.1007/11549468_105\">10.1007/11549468_105</a>}, booktitle={Proc. of the European Conference in Parallel Processing (Euro-Par)}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw}, year={2005} }"},"type":"conference","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-09-03T07:56:58Z","date_updated":"2022-01-06T06:53:54Z","publication_status":"published","title":"Dynamic Page Migration Under Brownian Motion","year":"2005","status":"public","author":[{"last_name":"Bienkowski","first_name":"Marcin","full_name":"Bienkowski, Marcin"},{"first_name":"Miroslaw","last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540287001","9783540319252"]},"doi":"10.1007/11549468_105","user_id":"15415","_id":"18912","language":[{"iso":"eng"}]},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-03T08:11:11Z","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"}],"publication":"Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)","doi":"10.1007/11561071_72","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:54Z","publication_status":"published","intvolume":"      3669","year":"2005","title":"Bucket Game with Applications to Set Multicover and Dynamic Page Migration","author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"first_name":"Jarosław","last_name":"Byrka","full_name":"Byrka, Jarosław"}],"publication_identifier":{"isbn":["9783540291183","9783540319511"],"issn":["0302-9743","1611-3349"]},"place":"Berlin, Heidelberg","citation":{"short":"M. Bienkowski, J. Byrka, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer , Berlin, Heidelberg, 2005, pp. 815–826.","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>","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} }","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>.","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>","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."},"user_id":"15415","volume":3669,"page":"815-826","_id":"18915","publisher":"Springer ","status":"public"},{"status":"public","page":"413-420","_id":"18924","publisher":"Springer","user_id":"15415","volume":3420,"citation":{"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>","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} }","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>.","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.","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>","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."},"place":"Berlin, Heidelberg","year":"2005","title":"Cube Connected Cycles Based Bluetooth Scatternet Formation","author":[{"full_name":"Bienkowski, Marcin","first_name":"Marcin","last_name":"Bienkowski"},{"first_name":"André","last_name":"Brinkmann","full_name":"Brinkmann, André"},{"last_name":"Korzeniowski","first_name":"Miroslaw","full_name":"Korzeniowski, Miroslaw"},{"full_name":"Orhan, Orhan","first_name":"Orhan","last_name":"Orhan"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540253396","9783540319566"]},"publication_status":"published","date_updated":"2022-01-06T06:53:54Z","intvolume":"      3420","series_title":" Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-540-31956-6_49","publication":"Proceedings of the 4th International Conference on Networking","abstract":[{"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.","lang":"eng"}],"date_created":"2020-09-03T09:52:33Z","type":"conference","department":[{"_id":"63"}]},{"_id":"18925","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"page":"365-376","doi":"10.1007/978-3-540-31856-9_30","user_id":"15415","publication_identifier":{"isbn":["9783540249986","9783540318569"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"full_name":"Dynia, Miroslaw","first_name":"Miroslaw","last_name":"Dynia"},{"last_name":"Korzeniowski","first_name":"Miroslaw","full_name":"Korzeniowski, Miroslaw"}],"year":"2005","title":"Improved Algorithms for Dynamic Page Migration","status":"public","date_updated":"2022-01-06T06:53:54Z","publication_status":"published","date_created":"2020-09-03T10:01:03Z","department":[{"_id":"63"}],"type":"conference","citation":{"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>","short":"M. Bienkowski, M. Dynia, M. Korzeniowski, in: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 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>.","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} }","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."},"publication":"Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)","abstract":[{"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.","lang":"eng"}]},{"citation":{"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>.","short":"S. Köhler, C. Schindelhauer, M. Ziegler, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 2005.","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.","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} }","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>."},"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":[{"first_name":"Sven","last_name":"Köhler","full_name":"Köhler, Sven"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, 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","language":[{"iso":"eng"}],"_id":"17988","user_id":"15415","doi":"10.1007/11537311_40"},{"_id":"17989","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/11537311_41","title":"An Explicit Solution to Post’s Problem over the Reals","year":"2005","status":"public","author":[{"first_name":"Klaus","last_name":"Meer","full_name":"Meer, Klaus"},{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"publication_identifier":{"isbn":["9783540281931","9783540318736"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_updated":"2022-01-06T06:53:24Z","date_created":"2020-08-14T13:46:23Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}],"publication":"Fundamentals of Computation Theory","citation":{"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>.","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>","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} }","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>","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.","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."}},{"publisher":"Springer","_id":"18280","page":"562-571","volume":3526,"user_id":"15415","status":"public","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.","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.","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>.","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} }"},"language":[{"iso":"eng"}],"doi":"10.1007/11494645_68","publication_identifier":{"isbn":["9783540261797","9783540322665"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"title":"Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism","year":"2005","intvolume":"      3526","date_updated":"2022-01-06T06:53:28Z","publication_status":"published","date_created":"2020-08-25T12:38:49Z","department":[{"_id":"63"}],"type":"conference","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_updated":"2022-01-06T06:52:50Z","publication_status":"published","publication_identifier":{"isbn":["9783540290681","9783540319061"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"first_name":"Miroslaw","last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"title":"Dynamic Load Balancing in Distributed Hash Tables","status":"public","year":"2005","doi":"10.1007/11558989_20","user_id":"15415","_id":"16468","language":[{"iso":"eng"}],"citation":{"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} }","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>.","short":"M. Bienkowski, M. Korzeniowski, F. Meyer auf der Heide, in: Peer-to-Peer Systems IV, 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>.","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."},"publication":"Peer-to-Peer Systems IV","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-04-08T09:18:56Z"},{"language":[{"iso":"eng"}],"_id":"16469","user_id":"15415","doi":"10.1007/11549345_1","year":"2005","status":"public","title":"Page Migration in Dynamic Networks","publication_identifier":{"isbn":["9783540287025","9783540318675"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-08T09:23:36Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}],"publication":"Mathematical Foundations of Computer Science 2005","citation":{"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>.","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>"}},{"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","publication_identifier":{"isbn":["9783540341413","9783540341420"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Bonorden, Olaf","last_name":"Bonorden","first_name":"Olaf"},{"first_name":"Joachim","last_name":"Gehweiler","full_name":"Gehweiler, Joachim"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"year":"2005","title":"A Web Computing Environment for Parallel Algorithms in Java","status":"public","doi":"10.1007/11752578_96","user_id":"15415","language":[{"iso":"eng"}],"_id":"16470","page":"801-808","abstract":[{"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","lang":"eng"}],"citation":{"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.","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>","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.","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>.","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} }","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>"},"publication":"Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-08T09:25:44Z"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-08T09:30:12Z","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."}],"publication":"Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)","citation":{"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} }","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>","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.","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.","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>"},"user_id":"15415","doi":"10.1007/11752578_101","page":"839-846","language":[{"iso":"eng"}],"_id":"16471","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","title":"Load Balancing Strategies in a Web Computing Environment","year":"2005","status":"public","publication_identifier":{"isbn":["9783540341413","9783540341420"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Bonorden, Olaf","last_name":"Bonorden","first_name":"Olaf"},{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}]},{"citation":{"chicago":"Böttcher, Stefan, and Rita Steinmetz. “Detecting Privacy Violations in Sensitive XML Databases.” In <i>Secure Data Management, Second VLDB Workshop, SDM 2005</i>, 143–54. Springer, 2005. <a href=\"https://doi.org/10.1007/11552338_10\">https://doi.org/10.1007/11552338_10</a>.","ama":"Böttcher S, Steinmetz R. Detecting Privacy Violations in Sensitive XML Databases. In: <i>Secure Data Management, Second VLDB Workshop, SDM 2005</i>. Springer; 2005:143-154. doi:<a href=\"https://doi.org/10.1007/11552338_10\">10.1007/11552338_10</a>","short":"S. Böttcher, R. Steinmetz, in: Secure Data Management, Second VLDB Workshop, SDM 2005, Springer, 2005, pp. 143–154.","bibtex":"@inproceedings{Böttcher_Steinmetz_2005, title={Detecting Privacy Violations in Sensitive XML Databases}, DOI={<a href=\"https://doi.org/10.1007/11552338_10\">10.1007/11552338_10</a>}, booktitle={Secure Data Management, Second VLDB Workshop, SDM 2005}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2005}, pages={143–154} }","mla":"Böttcher, Stefan, and Rita Steinmetz. “Detecting Privacy Violations in Sensitive XML Databases.” <i>Secure Data Management, Second VLDB Workshop, SDM 2005</i>, Springer, 2005, pp. 143–54, doi:<a href=\"https://doi.org/10.1007/11552338_10\">10.1007/11552338_10</a>.","apa":"Böttcher, S., &#38; Steinmetz, R. (2005). Detecting Privacy Violations in Sensitive XML Databases. In <i>Secure Data Management, Second VLDB Workshop, SDM 2005</i> (pp. 143–154). Springer. <a href=\"https://doi.org/10.1007/11552338_10\">https://doi.org/10.1007/11552338_10</a>","ieee":"S. Böttcher and R. Steinmetz, “Detecting Privacy Violations in Sensitive XML Databases,” in <i>Secure Data Management, Second VLDB Workshop, SDM 2005</i>, 2005, pp. 143–154."},"publication":"Secure Data Management, Second VLDB Workshop, SDM 2005","date_created":"2019-11-22T09:27:24Z","department":[{"_id":"69"}],"type":"conference","author":[{"last_name":"Böttcher","first_name":"Stefan","full_name":"Böttcher, Stefan","id":"624"},{"last_name":"Steinmetz","first_name":"Rita","full_name":"Steinmetz, Rita","id":"14961"}],"publication_identifier":{"isbn":["9783540287988","9783540319740"],"issn":["0302-9743","1611-3349"]},"title":"Detecting Privacy Violations in Sensitive XML Databases","status":"public","year":"2005","publication_status":"published","date_updated":"2022-01-06T06:52:16Z","_id":"15156","language":[{"iso":"eng"}],"publisher":"Springer","page":"143-154","user_id":"14961","doi":"10.1007/11552338_10"},{"user_id":"238","doi":"10.1007/11578079_8","publisher":"Springer Berlin Heidelberg","_id":"66533","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2026-07-17T10:58:06Z","status":"public","title":"A Computational Approach to Illusory Contour Perception Based on the Tensor Voting Technique","year":"2005","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540298502","9783540322429"]},"author":[{"id":"238","last_name":"Hund","first_name":"Marcus","full_name":"Hund, Marcus"},{"full_name":"Mertsching, Bärbel","last_name":"Mertsching","first_name":"Bärbel"}],"conference":{"name":"10th  Ibero-American Congress on Pattern Recognition (XCIARP)"},"type":"conference","department":[{"_id":"50"}],"date_created":"2026-07-17T10:55:40Z","place":"Berlin, Heidelberg","publication":"10th  Ibero-American Congress on Pattern Recognition (XCIARP)","citation":{"ieee":"M. Hund and B. Mertsching, “A Computational Approach to Illusory Contour Perception Based on the Tensor Voting Technique,” presented at the 10th  Ibero-American Congress on Pattern Recognition (XCIARP), 2005, doi: <a href=\"https://doi.org/10.1007/11578079_8\">10.1007/11578079_8</a>.","apa":"Hund, M., &#38; Mertsching, B. (2005). A Computational Approach to Illusory Contour Perception Based on the Tensor Voting Technique. <i>10th  Ibero-American Congress on Pattern Recognition (XCIARP)</i>. 10th  Ibero-American Congress on Pattern Recognition (XCIARP). <a href=\"https://doi.org/10.1007/11578079_8\">https://doi.org/10.1007/11578079_8</a>","chicago":"Hund, Marcus, and Bärbel Mertsching. “A Computational Approach to Illusory Contour Perception Based on the Tensor Voting Technique.” In <i>10th  Ibero-American Congress on Pattern Recognition (XCIARP)</i>. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11578079_8\">https://doi.org/10.1007/11578079_8</a>.","short":"M. Hund, B. Mertsching, in: 10th  Ibero-American Congress on Pattern Recognition (XCIARP), Springer Berlin Heidelberg, Berlin, Heidelberg, 2005.","mla":"Hund, Marcus, and Bärbel Mertsching. “A Computational Approach to Illusory Contour Perception Based on the Tensor Voting Technique.” <i>10th  Ibero-American Congress on Pattern Recognition (XCIARP)</i>, Springer Berlin Heidelberg, 2005, doi:<a href=\"https://doi.org/10.1007/11578079_8\">10.1007/11578079_8</a>.","bibtex":"@inproceedings{Hund_Mertsching_2005, place={Berlin, Heidelberg}, title={A Computational Approach to Illusory Contour Perception Based on the Tensor Voting Technique}, DOI={<a href=\"https://doi.org/10.1007/11578079_8\">10.1007/11578079_8</a>}, booktitle={10th  Ibero-American Congress on Pattern Recognition (XCIARP)}, publisher={Springer Berlin Heidelberg}, author={Hund, Marcus and Mertsching, Bärbel}, year={2005} }","ama":"Hund M, Mertsching B. A Computational Approach to Illusory Contour Perception Based on the Tensor Voting Technique. In: <i>10th  Ibero-American Congress on Pattern Recognition (XCIARP)</i>. Springer Berlin Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11578079_8\">10.1007/11578079_8</a>"}},{"citation":{"ama":"Briest P, Brockhoff D, Degener B, et al. The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In: <i>Parallel Problem Solving from Nature - PPSN VIII</i>. Berlin, Heidelberg; 2004. doi:<a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">10.1007/978-3-540-30217-9_4</a>","bibtex":"@inproceedings{Briest_Brockhoff_Degener_Englert_Gunia_Heering_Jansen_Leifhelm_Plociennik_Röglin_et al._2004, place={Berlin, Heidelberg}, title={The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">10.1007/978-3-540-30217-9_4</a>}, booktitle={Parallel Problem Solving from Nature - PPSN VIII}, author={Briest, Patrick and Brockhoff, Dimo and Degener, Bastian and Englert, Matthias and Gunia, Christian and Heering, Oliver and Jansen, Thomas and Leifhelm, Michael and Plociennik, Kai and Röglin, Heiko and et al.}, year={2004} }","mla":"Briest, Patrick, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.” <i>Parallel Problem Solving from Nature - PPSN VIII</i>, 2004, doi:<a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">10.1007/978-3-540-30217-9_4</a>.","chicago":"Briest, Patrick, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.” In <i>Parallel Problem Solving from Nature - PPSN VIII</i>. Berlin, Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">https://doi.org/10.1007/978-3-540-30217-9_4</a>.","short":"P. Briest, D. Brockhoff, B. Degener, M. Englert, C. Gunia, O. Heering, T. Jansen, M. Leifhelm, K. Plociennik, H. Röglin, A. Schweer, D. Sudholt, S. Tannenbaum, I. Wegener, in: Parallel Problem Solving from Nature - PPSN VIII, Berlin, Heidelberg, 2004.","apa":"Briest, P., Brockhoff, D., Degener, B., Englert, M., Gunia, C., Heering, O., … Wegener, I. (2004). The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In <i>Parallel Problem Solving from Nature - PPSN VIII</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">https://doi.org/10.1007/978-3-540-30217-9_4</a>","ieee":"P. Briest <i>et al.</i>, “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes,” in <i>Parallel Problem Solving from Nature - PPSN VIII</i>, 2004."},"publication":"Parallel Problem Solving from Nature - PPSN VIII","department":[{"_id":"63"}],"type":"conference","place":"Berlin, Heidelberg","date_created":"2020-09-25T10:41:37Z","date_updated":"2022-01-06T06:54:10Z","publication_status":"published","publication_identifier":{"isbn":["9783540230922","9783540302179"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Patrick","last_name":"Briest","full_name":"Briest, Patrick"},{"full_name":"Brockhoff, Dimo","last_name":"Brockhoff","first_name":"Dimo"},{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"full_name":"Englert, Matthias","first_name":"Matthias","last_name":"Englert"},{"last_name":"Gunia","first_name":"Christian","full_name":"Gunia, Christian"},{"first_name":"Oliver","last_name":"Heering","full_name":"Heering, Oliver"},{"full_name":"Jansen, Thomas","first_name":"Thomas","last_name":"Jansen"},{"full_name":"Leifhelm, Michael","last_name":"Leifhelm","first_name":"Michael"},{"full_name":"Plociennik, Kai","last_name":"Plociennik","first_name":"Kai"},{"last_name":"Röglin","first_name":"Heiko","full_name":"Röglin, Heiko"},{"full_name":"Schweer, Andrea","last_name":"Schweer","first_name":"Andrea"},{"last_name":"Sudholt","first_name":"Dirk","full_name":"Sudholt, Dirk"},{"last_name":"Tannenbaum","first_name":"Stefan","full_name":"Tannenbaum, Stefan"},{"full_name":"Wegener, Ingo","first_name":"Ingo","last_name":"Wegener"}],"title":"The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes","status":"public","year":"2004","doi":"10.1007/978-3-540-30217-9_4","user_id":"15415","language":[{"iso":"eng"}],"_id":"19692"},{"date_created":"2018-06-05T08:20:20Z","place":"Berlin, Heidelberg","department":[{"_id":"64"}],"type":"book_chapter","citation":{"mla":"Blömer, Johannes, et al. “Provably Secure Masking of AES.” <i>Selected Areas in Cryptography</i>, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>.","ama":"Blömer J, Guajardo J, Krummel V. Provably Secure Masking of AES. In: <i>Selected Areas in Cryptography</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:69-83. doi:<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>","bibtex":"@inbook{Blömer_Guajardo_Krummel_2004, place={Berlin, Heidelberg}, title={Provably Secure Masking of AES}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>}, booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Guajardo, Jorge and Krummel, Volker}, year={2004}, pages={69–83} }","apa":"Blömer, J., Guajardo, J., &#38; Krummel, V. (2004). Provably Secure Masking of AES. In <i>Selected Areas in Cryptography</i> (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">https://doi.org/10.1007/978-3-540-30564-4_5</a>","ieee":"J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,” in <i>Selected Areas in Cryptography</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 69–83.","short":"J. Blömer, J. Guajardo, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 69–83.","chicago":"Blömer, Johannes, Jorge Guajardo, and Volker Krummel. “Provably Secure Masking of AES.” In <i>Selected Areas in Cryptography</i>, 69–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">https://doi.org/10.1007/978-3-540-30564-4_5</a>."},"publication":"Selected Areas in Cryptography","publisher":"Springer Berlin Heidelberg","_id":"3011","page":"69-83","user_id":"25078","doi":"10.1007/978-3-540-30564-4_5","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540243274","9783540305644"]},"author":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"},{"full_name":"Guajardo, Jorge","first_name":"Jorge","last_name":"Guajardo"},{"last_name":"Krummel","first_name":"Volker","full_name":"Krummel, Volker"}],"title":"Provably Secure Masking of AES","year":"2004","status":"public","publication_status":"published","date_updated":"2022-01-06T06:58:51Z"}]