--- _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: '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' ... --- _id: '3012' 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 Generalized Wiener Attack on RSA. In: Public Key Cryptography – PKC 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:1-13. doi:10.1007/978-3-540-24632-9_1' apa: 'Blömer, J., & May, A. (2004). A Generalized Wiener Attack on RSA. In Public Key Cryptography – PKC 2004 (pp. 1–13). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24632-9_1' bibtex: '@inbook{Blömer_May_2004, place={Berlin, Heidelberg}, title={A Generalized Wiener Attack on RSA}, DOI={10.1007/978-3-540-24632-9_1}, booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2004}, pages={1–13} }' chicago: 'Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” In Public Key Cryptography – PKC 2004, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-24632-9_1.' ieee: 'J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 1–13.' mla: Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, 2004, pp. 1–13, doi:10.1007/978-3-540-24632-9_1. short: 'J. Blömer, A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 1–13.' date_created: 2018-06-05T08:20:59Z date_updated: 2022-01-06T06:58:51Z ddc: - '000' department: - _id: '64' doi: 10.1007/978-3-540-24632-9_1 file: - access_level: closed content_type: application/pdf creator: feidens date_created: 2018-06-05T08:21:31Z date_updated: 2018-06-05T08:21:31Z file_id: '3013' file_name: keys.pdf file_size: 198120 relation: main_file success: 1 file_date_updated: 2018-06-05T08:21:31Z has_accepted_license: '1' page: 1-13 place: Berlin, Heidelberg publication: Public Key Cryptography – PKC 2004 publication_identifier: isbn: - '9783540210184' - '9783540246329' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg status: public title: A Generalized Wiener Attack on RSA type: book_chapter user_id: '25078' year: '2004' ... --- _id: '3014' author: - first_name: Alexander full_name: May, Alexander last_name: May citation: ama: 'May A. Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q. In: Public Key Cryptography – PKC 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:218-230. doi:10.1007/978-3-540-24632-9_16' apa: 'May, A. (2004). Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q. In Public Key Cryptography – PKC 2004 (pp. 218–230). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24632-9_16' bibtex: '@inbook{May_2004, place={Berlin, Heidelberg}, title={Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q}, DOI={10.1007/978-3-540-24632-9_16}, booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg}, author={May, Alexander}, year={2004}, pages={218–230} }' chicago: 'May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^{r}q.” In Public Key Cryptography – PKC 2004, 218–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-24632-9_16.' ieee: 'A. May, “Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q,” in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 218–230.' mla: May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^{r}q.” Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, 2004, pp. 218–30, doi:10.1007/978-3-540-24632-9_16. short: 'A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 218–230.' date_created: 2018-06-05T08:22:02Z date_updated: 2022-01-06T06:58:51Z department: - _id: '64' doi: 10.1007/978-3-540-24632-9_16 page: 218-230 place: Berlin, Heidelberg publication: Public Key Cryptography – PKC 2004 publication_identifier: isbn: - '9783540210184' - '9783540246329' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg status: public title: Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q type: book_chapter user_id: '25078' year: '2004' ... --- _id: '3015' author: - first_name: Alexander full_name: May, Alexander last_name: May citation: ama: 'May A. Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In: Advances in Cryptology – CRYPTO 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:213-219. doi:10.1007/978-3-540-28628-8_13' apa: 'May, A. (2004). Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In Advances in Cryptology – CRYPTO 2004 (pp. 213–219). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-28628-8_13' bibtex: '@inbook{May_2004, place={Berlin, Heidelberg}, title={Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring}, DOI={10.1007/978-3-540-28628-8_13}, booktitle={Advances in Cryptology – CRYPTO 2004}, publisher={Springer Berlin Heidelberg}, author={May, Alexander}, year={2004}, pages={213–219} }' chicago: 'May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.” In Advances in Cryptology – CRYPTO 2004, 213–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-28628-8_13.' ieee: 'A. May, “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring,” in Advances in Cryptology – CRYPTO 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 213–219.' mla: May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.” Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, 2004, pp. 213–19, doi:10.1007/978-3-540-28628-8_13. short: 'A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 213–219.' date_created: 2018-06-05T08:23:43Z date_updated: 2022-01-06T06:58:51Z department: - _id: '64' doi: 10.1007/978-3-540-28628-8_13 page: 213-219 place: Berlin, Heidelberg publication: Advances in Cryptology – CRYPTO 2004 publication_identifier: isbn: - '9783540226680' - '9783540286288' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg status: public title: Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring type: book_chapter user_id: '25078' year: '2004' ... --- _id: '18778' abstract: - lang: eng text: Given a point set P in the d-dimensional unit hypercube, we give upper bounds on the maximal expected number of extreme points when each point is perturbed by small random noise chosen independently for each point from the same noise distribution Δ. Our results are parametrized by the variance of the noise distribution. For large variance we essentially consider the average case for distribution Δ while for variance 0 we consider the worst case. Hence our results give upper bounds on the number of extreme points where our input distributions range from average case to worst case.
Our main contribution is a rather general lemma that can be used to obtain upper bounds on the expected number of extreme points for a large class of noise distributions. We then apply this lemma to obtain explicit bounds for random noise coming from the Gaussian normal distribution of variance σ² and the uniform distribution in a hypercube of side length &epsilon. For these noise distributions we show upper bounds of O( (1/ σ )^d * log^3/2 * d - 1 n ) and O( ( (n log n) / ε )^d/(d+1) ), respectively. Besides its theoretical motivation our model is also motivated by the observation that in many applications of convex hull algorithms the input data is inherently noisy, e.g. when the data comes from physical measurement or imprecise arithmetic is used. author: - first_name: Valentina full_name: Damerow, Valentina last_name: Damerow - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Damerow V, Sohler C. Extreme Points Under Random Noise. In: Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30140-0_25' apa: Damerow, V., & Sohler, C. (2004). Extreme Points Under Random Noise. In Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_25 bibtex: '@inproceedings{Damerow_Sohler_2004, place={Berlin, Heidelberg}, title={Extreme Points Under Random Noise}, DOI={10.1007/978-3-540-30140-0_25}, booktitle={Proceedings of the 12th European Symposium on Algorithms (ESA’04)}, author={Damerow, Valentina and Sohler, Christian}, year={2004} }' chicago: Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random Noise.” In Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg, 2004. https://doi.org/10.1007/978-3-540-30140-0_25. ieee: V. Damerow and C. Sohler, “Extreme Points Under Random Noise,” in Proceedings of the 12th European Symposium on Algorithms (ESA’04), 2004. mla: Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random Noise.” Proceedings of the 12th European Symposium on Algorithms (ESA’04), 2004, doi:10.1007/978-3-540-30140-0_25. short: 'V. Damerow, C. Sohler, in: Proceedings of the 12th European Symposium on Algorithms (ESA’04), Berlin, Heidelberg, 2004.' date_created: 2020-09-01T12:26:47Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' doi: 10.1007/978-3-540-30140-0_25 language: - iso: eng place: Berlin, Heidelberg publication: Proceedings of the 12th European Symposium on Algorithms (ESA'04) publication_identifier: isbn: - '9783540230250' - '9783540301400' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Extreme Points Under Random Noise type: conference user_id: '15415' year: '2004' ... --- _id: '18263' abstract: - lang: eng text: We generalize univariate multipoint evaluation of polynomials of degree n at sublinear amortized cost per point. More precisely, it is shown how to evaluate a bivariate polynomial p of maximum degree less than n, specified by its n^2 coefficients, simultaneously at n^2 given points using a total of O(n^2.667) arithmetic operations. In terms of the input size N being quadratic in n, this amounts to an amortized cost of O(N^0.334) per point. author: - first_name: Michael full_name: Nüsken, Michael last_name: Nüsken - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Nüsken M, Ziegler M. Fast Multipoint Evaluation of Bivariate Polynomials. In: Proc. 12th Annual Symposium on Algorithms (ESA’04). Vol 3221. Berlin, Heidelberg: Springer; 2004:544-555. doi:10.1007/978-3-540-30140-0_49' apa: 'Nüsken, M., & Ziegler, M. (2004). Fast Multipoint Evaluation of Bivariate Polynomials. In Proc. 12th Annual Symposium on Algorithms (ESA’04) (Vol. 3221, pp. 544–555). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-540-30140-0_49' bibtex: '@inproceedings{Nüsken_Ziegler_2004, place={Berlin, Heidelberg}, title={Fast Multipoint Evaluation of Bivariate Polynomials}, volume={3221}, DOI={10.1007/978-3-540-30140-0_49}, booktitle={Proc. 12th Annual Symposium on Algorithms (ESA’04)}, publisher={Springer}, author={Nüsken, Michael and Ziegler, Martin}, year={2004}, pages={544–555} }' chicago: 'Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate Polynomials.” In Proc. 12th Annual Symposium on Algorithms (ESA’04), 3221:544–55. Berlin, Heidelberg: Springer, 2004. https://doi.org/10.1007/978-3-540-30140-0_49.' ieee: M. Nüsken and M. Ziegler, “Fast Multipoint Evaluation of Bivariate Polynomials,” in Proc. 12th Annual Symposium on Algorithms (ESA’04), 2004, vol. 3221, pp. 544–555. mla: Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate Polynomials.” Proc. 12th Annual Symposium on Algorithms (ESA’04), vol. 3221, Springer, 2004, pp. 544–55, doi:10.1007/978-3-540-30140-0_49. short: 'M. Nüsken, M. Ziegler, in: Proc. 12th Annual Symposium on Algorithms (ESA’04), Springer, Berlin, Heidelberg, 2004, pp. 544–555.' date_created: 2020-08-25T11:25:11Z date_updated: 2022-01-06T06:53:28Z department: - _id: '63' doi: 10.1007/978-3-540-30140-0_49 intvolume: ' 3221' language: - iso: eng page: 544-555 place: Berlin, Heidelberg publication: Proc. 12th Annual Symposium on Algorithms (ESA'04) publication_identifier: isbn: - '9783540230250' - '9783540301400' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: Fast Multipoint Evaluation of Bivariate Polynomials type: conference user_id: '15415' volume: 3221 year: '2004' ... --- _id: '18279' abstract: - lang: eng text: 'For $c in REAL$, a $c$-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most $c$ times their geometric distance. Based on this property to approximate a complete weighted graph, sparse spanners have found many applications, e.g., in FPTAS, geometric searching, and radio networks. For geometric searching, it turned out to suffice whether the radius rather than the length of some path between any two vertices is bounded relatively to their geometric distance; this is the defining property of weak spanners. Finally regarding radio network applications, a power spanner accounts for the total energy afforded for a wireless transmission with the requirement that the sum of the squares of the lengths of some path between any two planar vertices must be bounded relatively to the square of their geometric distance (or higher powers up to 6 or even 8).

While it is known that any $c$-spanner is also both a weak $C_1$-spanner and a $C_2$-power spanner (for appropriate $C_1,C_2$ depending only on $c$ but not on the graph under consideration), we show that the converse fails: There exists a family of $c_1$-power spanners that are no weak $C$-spanners and also a family of weak $c_2$-spanners that are no $C$-spanners for any fixed $C$ (and thus no uniform spanners, either). However the deepest result of the present work reveals that, surprisingly, any weak spanner is also a uniform power spanner. We further generalize the latter notion by considering $(c,delta)$-power spanners where the sum of the $delta$-th powers of the lengths has to be bounded; so $(cdot,2)$-power spanners coincide with the usual power spanners and $(cdot,1)$-power spanners are classical spanners. Interestingly, these $(cdot,delta)$-power spanners form a strict hierarchy where the above results still hold for any $deltageq2$; some even hold for $delta>1$ while counterexamples reveal others to fail for $delta<2$. In fact we show that in general every self-similar curve of fractal dimension $d>delta$ is no $(C,delta)$-power spanner for any fixed $C$. ' author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Klaus full_name: Volbert, Klaus last_name: Volbert - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Schindelhauer C, Volbert K, Ziegler M. Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In: Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04). Vol 3341. Berlin, Heidelberg: Springer ; 2004:805-821. doi:10.1007/978-3-540-30551-4_69' apa: 'Schindelhauer, C., Volbert, K., & Ziegler, M. (2004). Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04) (Vol. 3341, pp. 805–821). Berlin, Heidelberg: Springer . https://doi.org/10.1007/978-3-540-30551-4_69' bibtex: '@inproceedings{Schindelhauer_Volbert_Ziegler_2004, place={Berlin, Heidelberg}, title={Spanners, Weak Spanners, and Power Spanners for Wireless Networks}, volume={3341}, DOI={10.1007/978-3-540-30551-4_69}, booktitle={Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04)}, publisher={Springer }, author={Schindelhauer, Christian and Volbert, Klaus and Ziegler, Martin}, year={2004}, pages={805–821} }' chicago: 'Schindelhauer, Christian, Klaus Volbert, and Martin Ziegler. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.” In Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), 3341:805–21. Berlin, Heidelberg: Springer , 2004. https://doi.org/10.1007/978-3-540-30551-4_69.' ieee: C. Schindelhauer, K. Volbert, and M. Ziegler, “Spanners, Weak Spanners, and Power Spanners for Wireless Networks,” in Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), 2004, vol. 3341, pp. 805–821. mla: Schindelhauer, Christian, et al. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.” Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), vol. 3341, Springer , 2004, pp. 805–21, doi:10.1007/978-3-540-30551-4_69. short: 'C. Schindelhauer, K. Volbert, M. Ziegler, in: Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), Springer , Berlin, Heidelberg, 2004, pp. 805–821.' date_created: 2020-08-25T12:30:19Z date_updated: 2022-01-06T06:53:28Z department: - _id: '63' doi: 10.1007/978-3-540-30551-4_69 intvolume: ' 3341' language: - iso: eng page: 805-821 place: Berlin, Heidelberg publication: Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC'04) publication_identifier: isbn: - '9783540241317' - '9783540305514' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: 'Springer ' status: public title: Spanners, Weak Spanners, and Power Spanners for Wireless Networks type: conference user_id: '15415' volume: 3341 year: '2004' ... --- _id: '16474' abstract: - lang: eng text: "Given n distinct points p1, p2, ... , pn in the plane, the map labeling\r\nproblem with four squares is to place n axis-parallel equi-sized squares Q1, ... ,Qn\r\nof maximum possible size such that pi is a corner of Qi and no two squares overlap.\r\nThis problem is NP-hard and no algorithm with approximation ratio better\r\nthan 1/2 exists unless P = NP [10].\r\nIn this paper, we consider a scenario where we want to visualize the information\r\ngathered by smart dust, i.e. by a large set of simple devices, each consisting of\r\na sensor and a sender that can gather sensor data and send it to a central station.\r\nOur task is to label (the positions of) these sensors in a way described by the\r\nlabeling problem above. Since these devices are not positioned accurately (for\r\nexample, they might be dropped from an airplane), this gives rise to consider the\r\nmap labeling problem under the assumption, that the positions of the points are\r\nnot fixed precisely, but perturbed by random noise. In other words, we consider\r\nthe smoothed complexity of the map labeling problem. We present an algorithm\r\nthat, under such an assumption and Gaussian random noise with sufficiently large\r\nvariance, has linear smoothed complexity." author: - first_name: Vikas full_name: Bansal, Vikas last_name: Bansal - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Bansal V, Meyer auf der Heide F, Sohler C. Labeling Smart Dust. In: 12th Annual European Symposium on Algorithms (ESA 2004). Vol 3221. Lecture Notes in Computer Science. Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30140-0_9' apa: Bansal, V., Meyer auf der Heide, F., & Sohler, C. (2004). Labeling Smart Dust. In 12th Annual European Symposium on Algorithms (ESA 2004) (Vol. 3221). Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_9 bibtex: '@inproceedings{Bansal_Meyer auf der Heide_Sohler_2004, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Labeling Smart Dust}, volume={3221}, DOI={10.1007/978-3-540-30140-0_9}, booktitle={12th Annual European Symposium on Algorithms (ESA 2004)}, author={Bansal, Vikas and Meyer auf der Heide, Friedhelm and Sohler, Christian}, year={2004}, collection={Lecture Notes in Computer Science} }' chicago: Bansal, Vikas, Friedhelm Meyer auf der Heide, and Christian Sohler. “Labeling Smart Dust.” In 12th Annual European Symposium on Algorithms (ESA 2004), Vol. 3221. Lecture Notes in Computer Science. Berlin, Heidelberg, 2004. https://doi.org/10.1007/978-3-540-30140-0_9. ieee: V. Bansal, F. Meyer auf der Heide, and C. Sohler, “Labeling Smart Dust,” in 12th Annual European Symposium on Algorithms (ESA 2004), 2004, vol. 3221. mla: Bansal, Vikas, et al. “Labeling Smart Dust.” 12th Annual European Symposium on Algorithms (ESA 2004), vol. 3221, 2004, doi:10.1007/978-3-540-30140-0_9. short: 'V. Bansal, F. Meyer auf der Heide, C. Sohler, in: 12th Annual European Symposium on Algorithms (ESA 2004), Berlin, Heidelberg, 2004.' date_created: 2020-04-08T11:07:57Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/978-3-540-30140-0_9 intvolume: ' 3221' language: - iso: eng place: Berlin, Heidelberg publication: 12th Annual European Symposium on Algorithms (ESA 2004) publication_identifier: isbn: - '9783540230250' - '9783540301400' issn: - 0302-9743 - 1611-3349 publication_status: published series_title: Lecture Notes in Computer Science status: public title: Labeling Smart Dust type: conference user_id: '15415' volume: 3221 year: '2004' ... --- _id: '13618' author: - first_name: Herbert full_name: Walder, Herbert last_name: Walder - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: 'Walder H, Platzner M. A Runtime Environment for Reconfigurable Hardware Operating Systems. In: Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL). Berlin, Heidelberg: Springer; 2004:831-835. doi:10.1007/978-3-540-30117-2_84' apa: 'Walder, H., & Platzner, M. (2004). A Runtime Environment for Reconfigurable Hardware Operating Systems. In Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL) (pp. 831–835). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-540-30117-2_84' bibtex: '@inproceedings{Walder_Platzner_2004, place={Berlin, Heidelberg}, title={A Runtime Environment for Reconfigurable Hardware Operating Systems}, DOI={10.1007/978-3-540-30117-2_84}, booktitle={Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL)}, publisher={Springer}, author={Walder, Herbert and Platzner, Marco}, year={2004}, pages={831–835} }' chicago: 'Walder, Herbert, and Marco Platzner. “A Runtime Environment for Reconfigurable Hardware Operating Systems.” In Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL), 831–35. Berlin, Heidelberg: Springer, 2004. https://doi.org/10.1007/978-3-540-30117-2_84.' ieee: H. Walder and M. Platzner, “A Runtime Environment for Reconfigurable Hardware Operating Systems,” in Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL), 2004, pp. 831–835. mla: Walder, Herbert, and Marco Platzner. “A Runtime Environment for Reconfigurable Hardware Operating Systems.” Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL), Springer, 2004, pp. 831–35, doi:10.1007/978-3-540-30117-2_84. short: 'H. Walder, M. Platzner, in: Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL), Springer, Berlin, Heidelberg, 2004, pp. 831–835.' date_created: 2019-10-04T21:28:56Z date_updated: 2022-01-06T06:51:40Z department: - _id: '78' doi: 10.1007/978-3-540-30117-2_84 extern: '1' language: - iso: eng page: 831-835 place: Berlin, Heidelberg publication: Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL) publication_identifier: isbn: - '9783540229896' - '9783540301172' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: A Runtime Environment for Reconfigurable Hardware Operating Systems type: conference user_id: '398' year: '2004' ... --- _id: '3016' 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. New Partial Key Exposure Attacks on RSA. In: Advances in Cryptology - CRYPTO 2003. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:27-43. doi:10.1007/978-3-540-45146-4_2' apa: 'Blömer, J., & May, A. (2003). New Partial Key Exposure Attacks on RSA. In Advances in Cryptology - CRYPTO 2003 (pp. 27–43). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45146-4_2' bibtex: '@inbook{Blömer_May_2003, place={Berlin, Heidelberg}, title={New Partial Key Exposure Attacks on RSA}, DOI={10.1007/978-3-540-45146-4_2}, booktitle={Advances in Cryptology - CRYPTO 2003}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2003}, pages={27–43} }' chicago: 'Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” In Advances in Cryptology - CRYPTO 2003, 27–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/10.1007/978-3-540-45146-4_2.' ieee: 'J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in Advances in Cryptology - CRYPTO 2003, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.' mla: Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, 2003, pp. 27–43, doi:10.1007/978-3-540-45146-4_2. short: 'J. Blömer, A. May, in: Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 27–43.' date_created: 2018-06-05T08:24:11Z date_updated: 2022-01-06T06:58:51Z department: - _id: '64' doi: 10.1007/978-3-540-45146-4_2 page: 27-43 place: Berlin, Heidelberg publication: Advances in Cryptology - CRYPTO 2003 publication_identifier: isbn: - '9783540406747' - '9783540451464' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg status: public title: New Partial Key Exposure Attacks on RSA type: book_chapter user_id: '25078' year: '2003' ...