--- _id: '3006' author: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer - first_name: Alexander full_name: May, Alexander last_name: May citation: ama: 'Blömer J, May A. A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: EUROCRYPT 2005. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:251-267. doi:10.1007/11426639_15' apa: 'Blömer, J., & May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In EUROCRYPT 2005 (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11426639_15' 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={10.1007/11426639_15}, 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} }' chicago: 'Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” In EUROCRYPT 2005, 251–67. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. https://doi.org/10.1007/11426639_15.' ieee: 'J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.' mla: Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 251–67, doi:10.1007/11426639_15. short: 'J. Blömer, A. May, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 251–267.' date_created: 2018-06-05T08:16:47Z date_updated: 2022-01-06T06:58:50Z ddc: - '000' department: - _id: '64' doi: 10.1007/11426639_15 file: - access_level: closed content_type: application/pdf creator: feidens date_created: 2018-06-05T08:18:20Z date_updated: 2018-06-05T08:18:20Z file_id: '3008' file_name: toolkit.pdf file_size: 333655 relation: main_file success: 1 file_date_updated: 2018-06-05T08:18:20Z has_accepted_license: '1' page: 251-267 place: Berlin, Heidelberg publication: EUROCRYPT 2005 publication_identifier: isbn: - '9783540259107' - '9783540320555' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg series_title: Lecture Notes in Computer Science status: public title: A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers type: book_chapter user_id: '25078' year: '2005' ... --- _id: '3010' author: - first_name: Matthias full_name: Ernst, Matthias last_name: Ernst - first_name: Ellen full_name: Jochemsz, Ellen last_name: Jochemsz - first_name: Alexander full_name: May, Alexander last_name: May - first_name: Benne full_name: de Weger, Benne last_name: de Weger citation: ama: 'Ernst M, Jochemsz E, May A, de Weger B. Partial Key Exposure Attacks on RSA up to Full Size Exponents. In: EUROCRYPT 2005. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:371-386. doi:10.1007/11426639_22' apa: 'Ernst, M., Jochemsz, E., May, A., & de Weger, B. (2005). Partial Key Exposure Attacks on RSA up to Full Size Exponents. In EUROCRYPT 2005 (pp. 371–386). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11426639_22' 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={10.1007/11426639_22}, 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} }' chicago: 'Ernst, Matthias, Ellen Jochemsz, Alexander May, and Benne de Weger. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.” In EUROCRYPT 2005, 371–86. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. https://doi.org/10.1007/11426639_22.' ieee: 'M. Ernst, E. Jochemsz, A. May, and B. de Weger, “Partial Key Exposure Attacks on RSA up to Full Size Exponents,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 371–386.' mla: Ernst, Matthias, et al. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.” EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 371–86, doi:10.1007/11426639_22. short: 'M. Ernst, E. Jochemsz, A. May, B. de Weger, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 371–386.' date_created: 2018-06-05T08:19:48Z date_updated: 2022-01-06T06:58:51Z department: - _id: '64' doi: 10.1007/11426639_22 page: 371-386 place: Berlin, Heidelberg publication: EUROCRYPT 2005 publication_identifier: isbn: - '9783540259107' - '9783540320555' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg series_title: LNCS status: public title: Partial Key Exposure Attacks on RSA up to Full Size Exponents type: book_chapter user_id: '25078' year: '2005' ... --- _id: '26991' author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Rührup S, Schindelhauer C. Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In: Algorithms – ESA 2005. ; 2005. doi:10.1007/11561071_5' apa: Rührup, S., & Schindelhauer, C. (2005). Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In Algorithms – ESA 2005. https://doi.org/10.1007/11561071_5 bibtex: '@inbook{Rührup_Schindelhauer_2005, place={Berlin, Heidelberg}, title={Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio}, DOI={10.1007/11561071_5}, booktitle={Algorithms – ESA 2005}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2005} }' chicago: Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.” In Algorithms – ESA 2005. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11561071_5. ieee: S. Rührup and C. Schindelhauer, “Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio,” in Algorithms – ESA 2005, Berlin, Heidelberg, 2005. mla: Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.” Algorithms – ESA 2005, 2005, doi:10.1007/11561071_5. short: 'S. Rührup, C. Schindelhauer, in: Algorithms – ESA 2005, Berlin, Heidelberg, 2005.' date_created: 2021-10-28T10:22:39Z date_updated: 2022-01-06T06:57:31Z department: - _id: '63' - _id: '26' doi: 10.1007/11561071_5 language: - iso: eng place: Berlin, Heidelberg publication: Algorithms – ESA 2005 publication_identifier: issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio type: book_chapter user_id: '15415' year: '2005' ... --- _id: '18768' author: - first_name: Mihai full_name: Bădoiu, Mihai last_name: Bădoiu - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Piotr full_name: Indyk, Piotr last_name: Indyk - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Bădoiu M, Czumaj A, Indyk P, Sohler C. Facility Location in Sublinear Time. In: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP). Berlin, Heidelberg; 2005:866-877. doi:10.1007/11523468_70' apa: Bădoiu, M., Czumaj, A., Indyk, P., & Sohler, C. (2005). Facility Location in Sublinear Time. In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP) (pp. 866–877). Berlin, Heidelberg. https://doi.org/10.1007/11523468_70 bibtex: '@inproceedings{Bădoiu_Czumaj_Indyk_Sohler_2005, place={Berlin, Heidelberg}, title={Facility Location in Sublinear Time}, DOI={10.1007/11523468_70}, 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} }' chicago: Bădoiu, Mihai, Artur Czumaj, Piotr Indyk, and Christian Sohler. “Facility Location in Sublinear Time.” In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 866–77. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11523468_70. ieee: M. Bădoiu, A. Czumaj, P. Indyk, and C. Sohler, “Facility Location in Sublinear Time,” in Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 866–877. mla: Bădoiu, Mihai, et al. “Facility Location in Sublinear Time.” Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 866–77, doi:10.1007/11523468_70. 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.' date_created: 2020-09-01T11:53:19Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' doi: 10.1007/11523468_70 language: - iso: eng page: 866-877 place: Berlin, Heidelberg publication: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP) publication_identifier: isbn: - '9783540275800' - '9783540316916' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Facility Location in Sublinear Time type: conference user_id: '15415' year: '2005' ... --- _id: '18867' 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.
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. author: - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling - first_name: Jens full_name: Krokowski, Jens last_name: Krokowski citation: ama: 'Frahling G, Krokowski J. Online Occlusion Culling. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005). Vol 3669. Berlin, Heidelberg: Springer; 2005:758-769. doi:10.1007/11561071_67' apa: 'Frahling, G., & Krokowski, J. (2005). Online Occlusion Culling. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 758–769). Berlin, Heidelberg: Springer. https://doi.org/10.1007/11561071_67' bibtex: '@inproceedings{Frahling_Krokowski_2005, place={Berlin, Heidelberg}, title={Online Occlusion Culling}, volume={3669}, DOI={10.1007/11561071_67}, 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} }' chicago: 'Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 3669:758–69. Berlin, Heidelberg: Springer, 2005. https://doi.org/10.1007/11561071_67.' ieee: G. Frahling and J. Krokowski, “Online Occlusion Culling,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 758–769. mla: Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer, 2005, pp. 758–69, doi:10.1007/11561071_67. short: 'G. Frahling, J. Krokowski, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer, Berlin, Heidelberg, 2005, pp. 758–769.' date_created: 2020-09-02T13:26:52Z date_updated: 2022-01-06T06:53:53Z department: - _id: '63' doi: 10.1007/11561071_67 intvolume: ' 3669' language: - iso: eng page: 758-769 place: Berlin, Heidelberg publication: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) publication_identifier: isbn: - '9783540291183' - '9783540319511' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: Online Occlusion Culling type: conference user_id: '15415' volume: 3669 year: '2005' ... --- _id: '18912' abstract: - lang: eng 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−−√).' author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski citation: ama: 'Bienkowski M, Korzeniowski M. Dynamic Page Migration Under Brownian Motion. In: Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg; 2005. doi:10.1007/11549468_105' apa: Bienkowski, M., & Korzeniowski, M. (2005). Dynamic Page Migration Under Brownian Motion. In Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg. https://doi.org/10.1007/11549468_105 bibtex: '@inproceedings{Bienkowski_Korzeniowski_2005, place={Berlin, Heidelberg}, title={Dynamic Page Migration Under Brownian Motion}, DOI={10.1007/11549468_105}, booktitle={Proc. of the European Conference in Parallel Processing (Euro-Par)}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw}, year={2005} }' chicago: Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” In Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg, 2005. https://doi.org/10.1007/11549468_105. ieee: M. Bienkowski and M. Korzeniowski, “Dynamic Page Migration Under Brownian Motion,” in Proc. of the European Conference in Parallel Processing (Euro-Par), 2005. mla: Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” Proc. of the European Conference in Parallel Processing (Euro-Par), 2005, doi:10.1007/11549468_105. short: 'M. Bienkowski, M. Korzeniowski, in: Proc. of the European Conference in Parallel Processing (Euro-Par), Berlin, Heidelberg, 2005.' date_created: 2020-09-03T07:56:58Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/11549468_105 language: - iso: eng place: Berlin, Heidelberg publication: Proc. of the European Conference in Parallel Processing (Euro-Par) publication_identifier: isbn: - '9783540287001' - '9783540319252' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Dynamic Page Migration Under Brownian Motion type: conference user_id: '15415' year: '2005' ... --- _id: '18915' abstract: - lang: eng text: We present a simple two-person Bucket Game, based on throwing balls into buckets, and we
discuss possible players' strategies.

We use these strategies to create an approximation algorithm for a generalization of
the well known Set Cover problem, where we need to cover each element by at least $k$ sets.
Furthermore, we apply these strategies to construct a randomized algorithm for Dynamic Page Migration
problem achieving the optimal competitive ratio against an oblivious adversary. author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Jarosław full_name: Byrka, Jarosław last_name: Byrka citation: ama: 'Bienkowski M, Byrka J. Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005). Vol 3669. Berlin, Heidelberg: Springer ; 2005:815-826. doi:10.1007/11561071_72' apa: 'Bienkowski, M., & Byrka, J. (2005). Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 815–826). Berlin, Heidelberg: Springer . https://doi.org/10.1007/11561071_72' bibtex: '@inproceedings{Bienkowski_Byrka_2005, place={Berlin, Heidelberg}, title={Bucket Game with Applications to Set Multicover and Dynamic Page Migration}, volume={3669}, DOI={10.1007/11561071_72}, 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} }' chicago: 'Bienkowski, Marcin, and Jarosław Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.” In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 3669:815–26. Berlin, Heidelberg: Springer , 2005. https://doi.org/10.1007/11561071_72.' ieee: M. Bienkowski and J. Byrka, “Bucket Game with Applications to Set Multicover and Dynamic Page Migration,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 815–826. mla: Bienkowski, Marcin, and Jarosław Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.” Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer , 2005, pp. 815–26, doi:10.1007/11561071_72. short: 'M. Bienkowski, J. Byrka, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer , Berlin, Heidelberg, 2005, pp. 815–826.' date_created: 2020-09-03T08:11:11Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/11561071_72 intvolume: ' 3669' language: - iso: eng page: 815-826 place: Berlin, Heidelberg publication: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) publication_identifier: isbn: - '9783540291183' - '9783540319511' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: 'Springer ' status: public title: Bucket Game with Applications to Set Multicover and Dynamic Page Migration type: conference user_id: '15415' volume: 3669 year: '2005' ... --- _id: '18924' 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. author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski - first_name: Orhan full_name: Orhan, Orhan last_name: Orhan citation: ama: 'Bienkowski M, Brinkmann A, Korzeniowski M, Orhan O. Cube Connected Cycles Based Bluetooth Scatternet Formation. In: Proceedings of the 4th International Conference on Networking. Vol 3420. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2005:413-420. doi:10.1007/978-3-540-31956-6_49' apa: 'Bienkowski, M., Brinkmann, A., Korzeniowski, M., & Orhan, O. (2005). Cube Connected Cycles Based Bluetooth Scatternet Formation. In Proceedings of the 4th International Conference on Networking (Vol. 3420, pp. 413–420). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-540-31956-6_49' 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={10.1007/978-3-540-31956-6_49}, 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} }' chicago: 'Bienkowski, Marcin, André Brinkmann, Miroslaw Korzeniowski, and Orhan Orhan. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” In Proceedings of the 4th International Conference on Networking, 3420:413–20. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2005. https://doi.org/10.1007/978-3-540-31956-6_49.' ieee: M. Bienkowski, A. Brinkmann, M. Korzeniowski, and O. Orhan, “Cube Connected Cycles Based Bluetooth Scatternet Formation,” in Proceedings of the 4th International Conference on Networking, 2005, vol. 3420, pp. 413–420. mla: Bienkowski, Marcin, et al. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” Proceedings of the 4th International Conference on Networking, vol. 3420, Springer, 2005, pp. 413–20, doi:10.1007/978-3-540-31956-6_49. 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.' date_created: 2020-09-03T09:52:33Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/978-3-540-31956-6_49 intvolume: ' 3420' language: - iso: eng page: 413-420 place: Berlin, Heidelberg publication: Proceedings of the 4th International Conference on Networking publication_identifier: isbn: - '9783540253396' - '9783540319566' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer series_title: ' Lecture Notes in Computer Science' status: public title: Cube Connected Cycles Based Bluetooth Scatternet Formation type: conference user_id: '15415' volume: 3420 year: '2005' ... --- _id: '18925' abstract: - lang: eng text: The dynamic page migration problem citedynamic-page-migration is defined in
a distributed network of $n$ mobile nodes sharing one indivisible memory page
of size $D$. During runtime, the nodes can both access a unit of data from
the page and move with a constant speed, thus changing the costs of communication.
The problem is to compute online a schedule of page movements
to minimize the total communication cost.

In this paper we construct and analyze the first deterministic algorithm for this problem.
We prove that it achieves an (up to a constant factor) optimal competitive ratio
$O(n cdot sqrtD)$. We show that the randomization of this algorithm
improves this ratio to $O(sqrtD cdot log n)$ (against an oblivious adversary).
This substantially improves an $O(n cdot sqrtD)$ upper bound from citedynamic-page-migration.
We also give an almost matching lower bound of $Omega(sqrtD cdot sqrtlog n)$ for this problem. author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Miroslaw full_name: Dynia, Miroslaw last_name: Dynia - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski citation: ama: 'Bienkowski M, Dynia M, Korzeniowski M. Improved Algorithms for Dynamic Page Migration. In: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science. ; 2005:365-376. doi:10.1007/978-3-540-31856-9_30' apa: Bienkowski, M., Dynia, M., & Korzeniowski, M. (2005). Improved Algorithms for Dynamic Page Migration. In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 365–376). https://doi.org/10.1007/978-3-540-31856-9_30 bibtex: '@inproceedings{Bienkowski_Dynia_Korzeniowski_2005, series={Lecture Notes in Computer Science}, title={Improved Algorithms for Dynamic Page Migration}, DOI={10.1007/978-3-540-31856-9_30}, 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} }' chicago: Bienkowski, Marcin, Miroslaw Dynia, and Miroslaw Korzeniowski. “Improved Algorithms for Dynamic Page Migration.” In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 365–76. Lecture Notes in Computer Science, 2005. https://doi.org/10.1007/978-3-540-31856-9_30. ieee: M. Bienkowski, M. Dynia, and M. Korzeniowski, “Improved Algorithms for Dynamic Page Migration,” in Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–376. mla: Bienkowski, Marcin, et al. “Improved Algorithms for Dynamic Page Migration.” Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–76, doi:10.1007/978-3-540-31856-9_30. short: 'M. Bienkowski, M. Dynia, M. Korzeniowski, in: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–376.' date_created: 2020-09-03T10:01:03Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/978-3-540-31856-9_30 language: - iso: eng page: 365-376 publication: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) publication_identifier: isbn: - '9783540249986' - '9783540318569' issn: - 0302-9743 - 1611-3349 publication_status: published series_title: Lecture Notes in Computer Science status: public title: Improved Algorithms for Dynamic Page Migration type: conference user_id: '15415' year: '2005' ... --- _id: '17988' author: - first_name: Sven full_name: Köhler, Sven last_name: Köhler - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Köhler S, Schindelhauer C, Ziegler M. On Approximating Real-World Halting Problems. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 2005. doi:10.1007/11537311_40' apa: Köhler, S., Schindelhauer, C., & Ziegler, M. (2005). On Approximating Real-World Halting Problems. In Fundamentals of Computation Theory. Berlin, Heidelberg. https://doi.org/10.1007/11537311_40 bibtex: '@inbook{Köhler_Schindelhauer_Ziegler_2005, place={Berlin, Heidelberg}, title={On Approximating Real-World Halting Problems}, DOI={10.1007/11537311_40}, booktitle={Fundamentals of Computation Theory}, author={Köhler, Sven and Schindelhauer, Christian and Ziegler, Martin}, year={2005} }' chicago: Köhler, Sven, Christian Schindelhauer, and Martin Ziegler. “On Approximating Real-World Halting Problems.” In Fundamentals of Computation Theory. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11537311_40. ieee: S. Köhler, C. Schindelhauer, and M. Ziegler, “On Approximating Real-World Halting Problems,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 2005. mla: Köhler, Sven, et al. “On Approximating Real-World Halting Problems.” Fundamentals of Computation Theory, 2005, doi:10.1007/11537311_40. short: 'S. Köhler, C. Schindelhauer, M. Ziegler, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 2005.' date_created: 2020-08-14T13:44:48Z date_updated: 2022-01-06T06:53:24Z department: - _id: '63' doi: 10.1007/11537311_40 language: - iso: eng place: Berlin, Heidelberg publication: Fundamentals of Computation Theory publication_identifier: isbn: - '9783540281931' - '9783540318736' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: On Approximating Real-World Halting Problems type: book_chapter user_id: '15415' year: '2005' ... --- _id: '17989' author: - first_name: Klaus full_name: Meer, Klaus last_name: Meer - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Meer K, Ziegler M. An Explicit Solution to Post’s Problem over the Reals. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 2005. doi:10.1007/11537311_41' apa: Meer, K., & Ziegler, M. (2005). An Explicit Solution to Post’s Problem over the Reals. In Fundamentals of Computation Theory. Berlin, Heidelberg. https://doi.org/10.1007/11537311_41 bibtex: '@inbook{Meer_Ziegler_2005, place={Berlin, Heidelberg}, title={An Explicit Solution to Post’s Problem over the Reals}, DOI={10.1007/11537311_41}, booktitle={Fundamentals of Computation Theory}, author={Meer, Klaus and Ziegler, Martin}, year={2005} }' chicago: Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.” In Fundamentals of Computation Theory. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11537311_41. ieee: K. Meer and M. Ziegler, “An Explicit Solution to Post’s Problem over the Reals,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 2005. mla: Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.” Fundamentals of Computation Theory, 2005, doi:10.1007/11537311_41. short: 'K. Meer, M. Ziegler, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 2005.' date_created: 2020-08-14T13:46:23Z date_updated: 2022-01-06T06:53:24Z department: - _id: '63' doi: 10.1007/11537311_41 language: - iso: eng place: Berlin, Heidelberg publication: Fundamentals of Computation Theory publication_identifier: isbn: - '9783540281931' - '9783540318736' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: An Explicit Solution to Post’s Problem over the Reals type: book_chapter user_id: '15415' year: '2005' ... --- _id: '18280' 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:
*) non-deterministic computation;
*) relativized computation, specifically given access to oracles like 0' or 0'';
*) encoding input x and/or output y=f(x) in weaker ways according to the Real Arithmetic Hierarchy.
It turns out that, among these approaches, only the first one provides the required power. author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Ziegler M. Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In: Proc. CiE 2005: New Computational Paradigms. Vol 3526. Springer; 2005:562-571. doi:10.1007/11494645_68' apa: 'Ziegler, M. (2005). Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In Proc. CiE 2005: New Computational Paradigms (Vol. 3526, pp. 562–571). Springer. https://doi.org/10.1007/11494645_68' bibtex: '@inproceedings{Ziegler_2005, title={Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism}, volume={3526}, DOI={10.1007/11494645_68}, booktitle={Proc. CiE 2005: New Computational Paradigms}, publisher={Springer}, author={Ziegler, Martin}, year={2005}, pages={562–571} }' chicago: 'Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.” In Proc. CiE 2005: New Computational Paradigms, 3526:562–71. Springer, 2005. https://doi.org/10.1007/11494645_68.' ieee: 'M. Ziegler, “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism,” in Proc. CiE 2005: New Computational Paradigms, 2005, vol. 3526, pp. 562–571.' mla: 'Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.” Proc. CiE 2005: New Computational Paradigms, vol. 3526, Springer, 2005, pp. 562–71, doi:10.1007/11494645_68.' short: 'M. Ziegler, in: Proc. CiE 2005: New Computational Paradigms, Springer, 2005, pp. 562–571.' date_created: 2020-08-25T12:38:49Z date_updated: 2022-01-06T06:53:28Z department: - _id: '63' doi: 10.1007/11494645_68 intvolume: ' 3526' language: - iso: eng page: 562-571 publication: 'Proc. CiE 2005: New Computational Paradigms' publication_identifier: isbn: - '9783540261797' - '9783540322665' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism type: conference user_id: '15415' volume: 3526 year: '2005' ... --- _id: '16468' author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Bienkowski M, Korzeniowski M, Meyer auf der Heide F. Dynamic Load Balancing in Distributed Hash Tables. In: Peer-to-Peer Systems IV. Berlin, Heidelberg; 2005. doi:10.1007/11558989_20' apa: Bienkowski, M., Korzeniowski, M., & Meyer auf der Heide, F. (2005). Dynamic Load Balancing in Distributed Hash Tables. In Peer-to-Peer Systems IV. Berlin, Heidelberg. https://doi.org/10.1007/11558989_20 bibtex: '@inbook{Bienkowski_Korzeniowski_Meyer auf der Heide_2005, place={Berlin, Heidelberg}, title={Dynamic Load Balancing in Distributed Hash Tables}, DOI={10.1007/11558989_20}, booktitle={Peer-to-Peer Systems IV}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, year={2005} }' chicago: Bienkowski, Marcin, Miroslaw Korzeniowski, and Friedhelm Meyer auf der Heide. “Dynamic Load Balancing in Distributed Hash Tables.” In Peer-to-Peer Systems IV. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11558989_20. ieee: M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Dynamic Load Balancing in Distributed Hash Tables,” in Peer-to-Peer Systems IV, Berlin, Heidelberg, 2005. mla: Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.” Peer-to-Peer Systems IV, 2005, doi:10.1007/11558989_20. short: 'M. Bienkowski, M. Korzeniowski, F. Meyer auf der Heide, in: Peer-to-Peer Systems IV, Berlin, Heidelberg, 2005.' date_created: 2020-04-08T09:18:56Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/11558989_20 language: - iso: eng place: Berlin, Heidelberg publication: Peer-to-Peer Systems IV publication_identifier: isbn: - '9783540290681' - '9783540319061' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Dynamic Load Balancing in Distributed Hash Tables type: book_chapter user_id: '15415' year: '2005' ... --- _id: '16469' author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Bienkowski M, Meyer auf der Heide F. Page Migration in Dynamic Networks. In: Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg; 2005. doi:10.1007/11549345_1' apa: Bienkowski, M., & Meyer auf der Heide, F. (2005). Page Migration in Dynamic Networks. In Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg. https://doi.org/10.1007/11549345_1 bibtex: '@inbook{Bienkowski_Meyer auf der Heide_2005, place={Berlin, Heidelberg}, title={Page Migration in Dynamic Networks}, DOI={10.1007/11549345_1}, booktitle={Mathematical Foundations of Computer Science 2005}, author={Bienkowski, Marcin and Meyer auf der Heide, Friedhelm}, year={2005} }' chicago: Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” In Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11549345_1. ieee: M. Bienkowski and F. Meyer auf der Heide, “Page Migration in Dynamic Networks,” in Mathematical Foundations of Computer Science 2005, Berlin, Heidelberg, 2005. mla: Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” Mathematical Foundations of Computer Science 2005, 2005, doi:10.1007/11549345_1. short: 'M. Bienkowski, F. Meyer auf der Heide, in: Mathematical Foundations of Computer Science 2005, Berlin, Heidelberg, 2005.' date_created: 2020-04-08T09:23:36Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/11549345_1 language: - iso: eng place: Berlin, Heidelberg publication: Mathematical Foundations of Computer Science 2005 publication_identifier: isbn: - '9783540287025' - '9783540318675' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Page Migration in Dynamic Networks type: book_chapter user_id: '15415' year: '2005' ... --- _id: '16470' 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" author: - first_name: Olaf full_name: Bonorden, Olaf last_name: Bonorden - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Bonorden O, Gehweiler J, Meyer auf der Heide F. A Web Computing Environment for Parallel Algorithms in Java. In: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM). ; 2005:801-808. doi:10.1007/11752578_96' apa: Bonorden, O., Gehweiler, J., & Meyer auf der Heide, F. (2005). A Web Computing Environment for Parallel Algorithms in Java. In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 801–808). https://doi.org/10.1007/11752578_96 bibtex: '@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={A Web Computing Environment for Parallel Algorithms in Java}, DOI={10.1007/11752578_96}, 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} }' chicago: Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “A Web Computing Environment for Parallel Algorithms in Java.” In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 801–8, 2005. https://doi.org/10.1007/11752578_96. ieee: O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “A Web Computing Environment for Parallel Algorithms in Java,” 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.” Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–08, doi:10.1007/11752578_96. 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.' date_created: 2020-04-08T09:25:44Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/11752578_96 language: - iso: eng page: 801-808 publication: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) publication_identifier: isbn: - '9783540341413' - '9783540341420' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: A Web Computing Environment for Parallel Algorithms in Java type: conference user_id: '15415' year: '2005' ... --- _id: '16471' 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." author: - first_name: Olaf full_name: Bonorden, Olaf last_name: Bonorden - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Bonorden O, Gehweiler J, Meyer auf der Heide F. Load Balancing Strategies in a Web Computing Environment. In: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM). ; 2005:839-846. doi:10.1007/11752578_101' apa: Bonorden, O., Gehweiler, J., & Meyer auf der Heide, F. (2005). Load Balancing Strategies in a Web Computing Environment. In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 839–846). https://doi.org/10.1007/11752578_101 bibtex: '@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={Load Balancing Strategies in a Web Computing Environment}, DOI={10.1007/11752578_101}, 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} }' chicago: Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “Load Balancing Strategies in a Web Computing Environment.” In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 839–46, 2005. https://doi.org/10.1007/11752578_101. ieee: O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “Load Balancing Strategies in a Web Computing Environment,” in Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–846. mla: Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.” Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–46, doi:10.1007/11752578_101. 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.' date_created: 2020-04-08T09:30:12Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/11752578_101 language: - iso: eng page: 839-846 publication: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) publication_identifier: isbn: - '9783540341413' - '9783540341420' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Load Balancing Strategies in a Web Computing Environment type: conference user_id: '15415' year: '2005' ... --- _id: '15156' author: - first_name: Stefan full_name: Böttcher, Stefan id: '624' last_name: Böttcher - first_name: Rita full_name: Steinmetz, Rita id: '14961' last_name: Steinmetz citation: ama: 'Böttcher S, Steinmetz R. Detecting Privacy Violations in Sensitive XML Databases. In: Secure Data Management, Second VLDB Workshop, SDM 2005. Springer; 2005:143-154. doi:10.1007/11552338_10' apa: Böttcher, S., & Steinmetz, R. (2005). Detecting Privacy Violations in Sensitive XML Databases. In Secure Data Management, Second VLDB Workshop, SDM 2005 (pp. 143–154). Springer. https://doi.org/10.1007/11552338_10 bibtex: '@inproceedings{Böttcher_Steinmetz_2005, title={Detecting Privacy Violations in Sensitive XML Databases}, DOI={10.1007/11552338_10}, booktitle={Secure Data Management, Second VLDB Workshop, SDM 2005}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2005}, pages={143–154} }' chicago: Böttcher, Stefan, and Rita Steinmetz. “Detecting Privacy Violations in Sensitive XML Databases.” In Secure Data Management, Second VLDB Workshop, SDM 2005, 143–54. Springer, 2005. https://doi.org/10.1007/11552338_10. ieee: S. Böttcher and R. Steinmetz, “Detecting Privacy Violations in Sensitive XML Databases,” in Secure Data Management, Second VLDB Workshop, SDM 2005, 2005, pp. 143–154. mla: Böttcher, Stefan, and Rita Steinmetz. “Detecting Privacy Violations in Sensitive XML Databases.” Secure Data Management, Second VLDB Workshop, SDM 2005, Springer, 2005, pp. 143–54, doi:10.1007/11552338_10. short: 'S. Böttcher, R. Steinmetz, in: Secure Data Management, Second VLDB Workshop, SDM 2005, Springer, 2005, pp. 143–154.' date_created: 2019-11-22T09:27:24Z date_updated: 2022-01-06T06:52:16Z department: - _id: '69' doi: 10.1007/11552338_10 language: - iso: eng page: 143-154 publication: Secure Data Management, Second VLDB Workshop, SDM 2005 publication_identifier: isbn: - '9783540287988' - '9783540319740' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: Detecting Privacy Violations in Sensitive XML Databases type: conference user_id: '14961' year: '2005' ... --- _id: '66533' author: - first_name: Marcus full_name: Hund, Marcus id: '238' last_name: Hund - first_name: Bärbel full_name: Mertsching, Bärbel last_name: Mertsching citation: ama: 'Hund M, Mertsching B. A Computational Approach to Illusory Contour Perception Based on the Tensor Voting Technique. In: 10th  Ibero-American Congress on Pattern Recognition (XCIARP). Springer Berlin Heidelberg; 2005. doi:10.1007/11578079_8' apa: Hund, M., & Mertsching, B. (2005). A Computational Approach to Illusory Contour Perception Based on the Tensor Voting Technique. 10th  Ibero-American Congress on Pattern Recognition (XCIARP). 10th  Ibero-American Congress on Pattern Recognition (XCIARP). https://doi.org/10.1007/11578079_8 bibtex: '@inproceedings{Hund_Mertsching_2005, place={Berlin, Heidelberg}, title={A Computational Approach to Illusory Contour Perception Based on the Tensor Voting Technique}, DOI={10.1007/11578079_8}, booktitle={10th  Ibero-American Congress on Pattern Recognition (XCIARP)}, publisher={Springer Berlin Heidelberg}, author={Hund, Marcus and Mertsching, Bärbel}, year={2005} }' chicago: 'Hund, Marcus, and Bärbel Mertsching. “A Computational Approach to Illusory Contour Perception Based on the Tensor Voting Technique.” In 10th  Ibero-American Congress on Pattern Recognition (XCIARP). Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. https://doi.org/10.1007/11578079_8.' 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: 10.1007/11578079_8.' mla: Hund, Marcus, and Bärbel Mertsching. “A Computational Approach to Illusory Contour Perception Based on the Tensor Voting Technique.” 10th  Ibero-American Congress on Pattern Recognition (XCIARP), Springer Berlin Heidelberg, 2005, doi:10.1007/11578079_8. short: 'M. Hund, B. Mertsching, in: 10th  Ibero-American Congress on Pattern Recognition (XCIARP), Springer Berlin Heidelberg, Berlin, Heidelberg, 2005.' conference: name: 10th Ibero-American Congress on Pattern Recognition (XCIARP) date_created: 2026-07-17T10:55:40Z date_updated: 2026-07-17T10:58:06Z department: - _id: '50' doi: 10.1007/11578079_8 language: - iso: eng place: Berlin, Heidelberg publication: 10th Ibero-American Congress on Pattern Recognition (XCIARP) publication_identifier: isbn: - '9783540298502' - '9783540322429' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg status: public title: A Computational Approach to Illusory Contour Perception Based on the Tensor Voting Technique type: conference user_id: '238' year: '2005' ... --- _id: '19692' author: - first_name: Patrick full_name: Briest, Patrick last_name: Briest - first_name: Dimo full_name: Brockhoff, Dimo last_name: Brockhoff - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Matthias full_name: Englert, Matthias last_name: Englert - first_name: Christian full_name: Gunia, Christian last_name: Gunia - first_name: Oliver full_name: Heering, Oliver last_name: Heering - first_name: Thomas full_name: Jansen, Thomas last_name: Jansen - first_name: Michael full_name: Leifhelm, Michael last_name: Leifhelm - first_name: Kai full_name: Plociennik, Kai last_name: Plociennik - first_name: Heiko full_name: Röglin, Heiko last_name: Röglin - first_name: Andrea full_name: Schweer, Andrea last_name: Schweer - first_name: Dirk full_name: Sudholt, Dirk last_name: Sudholt - first_name: Stefan full_name: Tannenbaum, Stefan last_name: Tannenbaum - first_name: Ingo full_name: Wegener, Ingo last_name: Wegener citation: ama: 'Briest P, Brockhoff D, Degener B, et al. The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In: Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30217-9_4' 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 Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30217-9_4' 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={10.1007/978-3-540-30217-9_4}, 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} }' 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 Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg, 2004. https://doi.org/10.1007/978-3-540-30217-9_4.' ieee: 'P. Briest et al., “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes,” in Parallel Problem Solving from Nature - PPSN VIII, 2004.' mla: 'Briest, Patrick, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.” Parallel Problem Solving from Nature - PPSN VIII, 2004, doi:10.1007/978-3-540-30217-9_4.' 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.' date_created: 2020-09-25T10:41:37Z date_updated: 2022-01-06T06:54:10Z department: - _id: '63' doi: 10.1007/978-3-540-30217-9_4 language: - iso: eng place: Berlin, Heidelberg publication: Parallel Problem Solving from Nature - PPSN VIII publication_identifier: isbn: - '9783540230922' - '9783540302179' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: 'The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes' type: conference user_id: '15415' year: '2004' ... --- _id: '3011' author: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer - first_name: Jorge full_name: Guajardo, Jorge last_name: Guajardo - first_name: Volker full_name: Krummel, Volker last_name: Krummel citation: ama: 'Blömer J, Guajardo J, Krummel V. Provably Secure Masking of AES. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:69-83. doi:10.1007/978-3-540-30564-4_5' apa: 'Blömer, J., Guajardo, J., & Krummel, V. (2004). Provably Secure Masking of AES. In Selected Areas in Cryptography (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-30564-4_5' bibtex: '@inbook{Blömer_Guajardo_Krummel_2004, place={Berlin, Heidelberg}, title={Provably Secure Masking of AES}, DOI={10.1007/978-3-540-30564-4_5}, booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Guajardo, Jorge and Krummel, Volker}, year={2004}, pages={69–83} }' chicago: 'Blömer, Johannes, Jorge Guajardo, and Volker Krummel. “Provably Secure Masking of AES.” In Selected Areas in Cryptography, 69–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-30564-4_5.' ieee: 'J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 69–83.' mla: Blömer, Johannes, et al. “Provably Secure Masking of AES.” Selected Areas in Cryptography, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:10.1007/978-3-540-30564-4_5. short: 'J. Blömer, J. Guajardo, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 69–83.' date_created: 2018-06-05T08:20:20Z date_updated: 2022-01-06T06:58:51Z department: - _id: '64' doi: 10.1007/978-3-540-30564-4_5 page: 69-83 place: Berlin, Heidelberg publication: Selected Areas in Cryptography publication_identifier: isbn: - '9783540243274' - '9783540305644' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg status: public title: Provably Secure Masking of AES type: book_chapter user_id: '25078' year: '2004' ...