[{"_id":"18280","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proc. CiE 2005: New Computational Paradigms","abstract":[{"lang":"eng","text":"The sometimes so-called Main Theorem of Recursive Analysis implies that any computable real function is necessarily continuous. We consider three relaxations of this common notion of real computability for the purpose of treating also discontinuous functions f:R->R:<br>*) non-deterministic computation;<br>*) relativized computation, specifically given access to oracles like 0' or 0'';<br>*) encoding input x and/or output y=f(x) in weaker ways according to the Real Arithmetic Hierarchy.<br>It turns out that, among these approaches, only the first one provides the required power."}],"status":"public","publisher":"Springer","date_updated":"2022-01-06T06:53:28Z","author":[{"first_name":"Martin","full_name":"Ziegler, Martin","last_name":"Ziegler"}],"date_created":"2020-08-25T12:38:49Z","volume":3526,"title":"Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism","doi":"10.1007/11494645_68","publication_status":"published","publication_identifier":{"isbn":["9783540261797","9783540322665"],"issn":["0302-9743","1611-3349"]},"year":"2005","citation":{"apa":"Ziegler, M. (2005). Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In <i>Proc. CiE 2005: New Computational Paradigms</i> (Vol. 3526, pp. 562–571). Springer. <a href=\"https://doi.org/10.1007/11494645_68\">https://doi.org/10.1007/11494645_68</a>","bibtex":"@inproceedings{Ziegler_2005, title={Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism}, volume={3526}, DOI={<a href=\"https://doi.org/10.1007/11494645_68\">10.1007/11494645_68</a>}, booktitle={Proc. CiE 2005: New Computational Paradigms}, publisher={Springer}, author={Ziegler, Martin}, year={2005}, pages={562–571} }","mla":"Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.” <i>Proc. CiE 2005: New Computational Paradigms</i>, vol. 3526, Springer, 2005, pp. 562–71, doi:<a href=\"https://doi.org/10.1007/11494645_68\">10.1007/11494645_68</a>.","short":"M. Ziegler, in: Proc. CiE 2005: New Computational Paradigms, Springer, 2005, pp. 562–571.","chicago":"Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.” In <i>Proc. CiE 2005: New Computational Paradigms</i>, 3526:562–71. Springer, 2005. <a href=\"https://doi.org/10.1007/11494645_68\">https://doi.org/10.1007/11494645_68</a>.","ieee":"M. Ziegler, “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism,” in <i>Proc. CiE 2005: New Computational Paradigms</i>, 2005, vol. 3526, pp. 562–571.","ama":"Ziegler M. Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In: <i>Proc. CiE 2005: New Computational Paradigms</i>. Vol 3526. Springer; 2005:562-571. doi:<a href=\"https://doi.org/10.1007/11494645_68\">10.1007/11494645_68</a>"},"page":"562-571","intvolume":"      3526"},{"publication_status":"published","publication_identifier":{"isbn":["9783540290681","9783540319061"],"issn":["0302-9743","1611-3349"]},"year":"2005","place":"Berlin, Heidelberg","citation":{"ieee":"M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Dynamic Load Balancing in Distributed Hash Tables,” in <i>Peer-to-Peer Systems IV</i>, Berlin, Heidelberg, 2005.","chicago":"Bienkowski, Marcin, Miroslaw Korzeniowski, and Friedhelm Meyer auf der Heide. “Dynamic Load Balancing in Distributed Hash Tables.” In <i>Peer-to-Peer Systems IV</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11558989_20\">https://doi.org/10.1007/11558989_20</a>.","ama":"Bienkowski M, Korzeniowski M, Meyer auf der Heide F. Dynamic Load Balancing in Distributed Hash Tables. In: <i>Peer-to-Peer Systems IV</i>. Berlin, Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11558989_20\">10.1007/11558989_20</a>","apa":"Bienkowski, M., Korzeniowski, M., &#38; Meyer auf der Heide, F. (2005). Dynamic Load Balancing in Distributed Hash Tables. In <i>Peer-to-Peer Systems IV</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11558989_20\">https://doi.org/10.1007/11558989_20</a>","short":"M. Bienkowski, M. Korzeniowski, F. Meyer auf der Heide, in: Peer-to-Peer Systems IV, Berlin, Heidelberg, 2005.","mla":"Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.” <i>Peer-to-Peer Systems IV</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11558989_20\">10.1007/11558989_20</a>.","bibtex":"@inbook{Bienkowski_Korzeniowski_Meyer auf der Heide_2005, place={Berlin, Heidelberg}, title={Dynamic Load Balancing in Distributed Hash Tables}, DOI={<a href=\"https://doi.org/10.1007/11558989_20\">10.1007/11558989_20</a>}, booktitle={Peer-to-Peer Systems IV}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, year={2005} }"},"date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-08T09:18:56Z","author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw","first_name":"Miroslaw"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"title":"Dynamic Load Balancing in Distributed Hash Tables","doi":"10.1007/11558989_20","type":"book_chapter","publication":"Peer-to-Peer Systems IV","status":"public","_id":"16468","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"author":[{"last_name":"Bienkowski","full_name":"Bienkowski, Marcin","first_name":"Marcin"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-04-08T09:23:36Z","date_updated":"2022-01-06T06:52:50Z","doi":"10.1007/11549345_1","title":"Page Migration in Dynamic Networks","publication_identifier":{"isbn":["9783540287025","9783540318675"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"ama":"Bienkowski M, Meyer auf der Heide F. Page Migration in Dynamic Networks. In: <i>Mathematical Foundations of Computer Science 2005</i>. Berlin, Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11549345_1\">10.1007/11549345_1</a>","ieee":"M. Bienkowski and F. Meyer auf der Heide, “Page Migration in Dynamic Networks,” in <i>Mathematical Foundations of Computer Science 2005</i>, Berlin, Heidelberg, 2005.","chicago":"Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” In <i>Mathematical Foundations of Computer Science 2005</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11549345_1\">https://doi.org/10.1007/11549345_1</a>.","apa":"Bienkowski, M., &#38; Meyer auf der Heide, F. (2005). Page Migration in Dynamic Networks. In <i>Mathematical Foundations of Computer Science 2005</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11549345_1\">https://doi.org/10.1007/11549345_1</a>","bibtex":"@inbook{Bienkowski_Meyer auf der Heide_2005, place={Berlin, Heidelberg}, title={Page Migration in Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1007/11549345_1\">10.1007/11549345_1</a>}, booktitle={Mathematical Foundations of Computer Science 2005}, author={Bienkowski, Marcin and Meyer auf der Heide, Friedhelm}, year={2005} }","mla":"Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” <i>Mathematical Foundations of Computer Science 2005</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11549345_1\">10.1007/11549345_1</a>.","short":"M. Bienkowski, F. Meyer auf der Heide, in: Mathematical Foundations of Computer Science 2005, Berlin, Heidelberg, 2005."},"place":"Berlin, Heidelberg","year":"2005","department":[{"_id":"63"}],"user_id":"15415","_id":"16469","language":[{"iso":"eng"}],"publication":"Mathematical Foundations of Computer Science 2005","type":"book_chapter","status":"public"},{"title":"A Web Computing Environment for Parallel Algorithms in Java","doi":"10.1007/11752578_96","date_updated":"2022-01-06T06:52:50Z","author":[{"full_name":"Bonorden, Olaf","last_name":"Bonorden","first_name":"Olaf"},{"first_name":"Joachim","last_name":"Gehweiler","full_name":"Gehweiler, Joachim"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-08T09:25:44Z","year":"2005","citation":{"ieee":"O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “A Web Computing Environment for Parallel Algorithms in Java,” in <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 801–808.","chicago":"Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “A Web Computing Environment for Parallel Algorithms in Java.” In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 801–8, 2005. <a href=\"https://doi.org/10.1007/11752578_96\">https://doi.org/10.1007/11752578_96</a>.","ama":"Bonorden O, Gehweiler J, Meyer auf der Heide F. A Web Computing Environment for Parallel Algorithms in Java. In: <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>. ; 2005:801-808. doi:<a href=\"https://doi.org/10.1007/11752578_96\">10.1007/11752578_96</a>","apa":"Bonorden, O., Gehweiler, J., &#38; Meyer auf der Heide, F. (2005). A Web Computing Environment for Parallel Algorithms in Java. In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i> (pp. 801–808). <a href=\"https://doi.org/10.1007/11752578_96\">https://doi.org/10.1007/11752578_96</a>","bibtex":"@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={A Web Computing Environment for Parallel Algorithms in Java}, DOI={<a href=\"https://doi.org/10.1007/11752578_96\">10.1007/11752578_96</a>}, booktitle={Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, year={2005}, pages={801–808} }","short":"O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, in: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–808.","mla":"Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.” <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 801–08, doi:<a href=\"https://doi.org/10.1007/11752578_96\">10.1007/11752578_96</a>."},"page":"801-808","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540341413","9783540341420"]},"language":[{"iso":"eng"}],"_id":"16470","user_id":"15415","department":[{"_id":"63"}],"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"}],"status":"public","type":"conference","publication":"Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)"},{"author":[{"last_name":"Bonorden","full_name":"Bonorden, Olaf","first_name":"Olaf"},{"first_name":"Joachim","full_name":"Gehweiler, Joachim","last_name":"Gehweiler"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-08T09:30:12Z","date_updated":"2022-01-06T06:52:50Z","doi":"10.1007/11752578_101","title":"Load Balancing Strategies in a Web Computing Environment","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540341413","9783540341420"]},"citation":{"mla":"Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.” <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 839–46, doi:<a href=\"https://doi.org/10.1007/11752578_101\">10.1007/11752578_101</a>.","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.","bibtex":"@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={Load Balancing Strategies in a Web Computing Environment}, DOI={<a href=\"https://doi.org/10.1007/11752578_101\">10.1007/11752578_101</a>}, booktitle={Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, year={2005}, pages={839–846} }","apa":"Bonorden, O., Gehweiler, J., &#38; Meyer auf der Heide, F. (2005). Load Balancing Strategies in a Web Computing Environment. In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i> (pp. 839–846). <a href=\"https://doi.org/10.1007/11752578_101\">https://doi.org/10.1007/11752578_101</a>","ieee":"O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “Load Balancing Strategies in a Web Computing Environment,” in <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 839–846.","chicago":"Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “Load Balancing Strategies in a Web Computing Environment.” In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 839–46, 2005. <a href=\"https://doi.org/10.1007/11752578_101\">https://doi.org/10.1007/11752578_101</a>.","ama":"Bonorden O, Gehweiler J, Meyer auf der Heide F. Load Balancing Strategies in a Web Computing Environment. In: <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>. ; 2005:839-846. doi:<a href=\"https://doi.org/10.1007/11752578_101\">10.1007/11752578_101</a>"},"page":"839-846","year":"2005","user_id":"15415","department":[{"_id":"63"}],"_id":"16471","language":[{"iso":"eng"}],"type":"conference","publication":"Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)","status":"public","abstract":[{"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.","lang":"eng"}]},{"date_updated":"2022-01-06T06:52:16Z","publisher":"Springer","date_created":"2019-11-22T09:27:24Z","author":[{"first_name":"Stefan","last_name":"Böttcher","id":"624","full_name":"Böttcher, Stefan"},{"first_name":"Rita","full_name":"Steinmetz, Rita","id":"14961","last_name":"Steinmetz"}],"title":"Detecting Privacy Violations in Sensitive XML Databases","doi":"10.1007/11552338_10","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540287988","9783540319740"]},"year":"2005","citation":{"ama":"Böttcher S, Steinmetz R. Detecting Privacy Violations in Sensitive XML Databases. In: <i>Secure Data Management, Second VLDB Workshop, SDM 2005</i>. Springer; 2005:143-154. doi:<a href=\"https://doi.org/10.1007/11552338_10\">10.1007/11552338_10</a>","chicago":"Böttcher, Stefan, and Rita Steinmetz. “Detecting Privacy Violations in Sensitive XML Databases.” In <i>Secure Data Management, Second VLDB Workshop, SDM 2005</i>, 143–54. Springer, 2005. <a href=\"https://doi.org/10.1007/11552338_10\">https://doi.org/10.1007/11552338_10</a>.","ieee":"S. Böttcher and R. Steinmetz, “Detecting Privacy Violations in Sensitive XML Databases,” in <i>Secure Data Management, Second VLDB Workshop, SDM 2005</i>, 2005, pp. 143–154.","short":"S. Böttcher, R. Steinmetz, in: Secure Data Management, Second VLDB Workshop, SDM 2005, Springer, 2005, pp. 143–154.","bibtex":"@inproceedings{Böttcher_Steinmetz_2005, title={Detecting Privacy Violations in Sensitive XML Databases}, DOI={<a href=\"https://doi.org/10.1007/11552338_10\">10.1007/11552338_10</a>}, booktitle={Secure Data Management, Second VLDB Workshop, SDM 2005}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2005}, pages={143–154} }","mla":"Böttcher, Stefan, and Rita Steinmetz. “Detecting Privacy Violations in Sensitive XML Databases.” <i>Secure Data Management, Second VLDB Workshop, SDM 2005</i>, Springer, 2005, pp. 143–54, doi:<a href=\"https://doi.org/10.1007/11552338_10\">10.1007/11552338_10</a>.","apa":"Böttcher, S., &#38; Steinmetz, R. (2005). Detecting Privacy Violations in Sensitive XML Databases. In <i>Secure Data Management, Second VLDB Workshop, SDM 2005</i> (pp. 143–154). Springer. <a href=\"https://doi.org/10.1007/11552338_10\">https://doi.org/10.1007/11552338_10</a>"},"page":"143-154","_id":"15156","user_id":"14961","department":[{"_id":"69"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Secure Data Management, Second VLDB Workshop, SDM 2005","status":"public"},{"publication_identifier":{"isbn":["9783540230922","9783540302179"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"2004","citation":{"ama":"Briest P, Brockhoff D, Degener B, et al. The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In: <i>Parallel Problem Solving from Nature - PPSN VIII</i>. Berlin, Heidelberg; 2004. doi:<a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">10.1007/978-3-540-30217-9_4</a>","ieee":"P. Briest <i>et al.</i>, “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes,” in <i>Parallel Problem Solving from Nature - PPSN VIII</i>, 2004.","chicago":"Briest, Patrick, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.” In <i>Parallel Problem Solving from Nature - PPSN VIII</i>. Berlin, Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">https://doi.org/10.1007/978-3-540-30217-9_4</a>.","apa":"Briest, P., Brockhoff, D., Degener, B., Englert, M., Gunia, C., Heering, O., … Wegener, I. (2004). The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In <i>Parallel Problem Solving from Nature - PPSN VIII</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">https://doi.org/10.1007/978-3-540-30217-9_4</a>","mla":"Briest, Patrick, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.” <i>Parallel Problem Solving from Nature - PPSN VIII</i>, 2004, doi:<a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">10.1007/978-3-540-30217-9_4</a>.","bibtex":"@inproceedings{Briest_Brockhoff_Degener_Englert_Gunia_Heering_Jansen_Leifhelm_Plociennik_Röglin_et al._2004, place={Berlin, Heidelberg}, title={The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">10.1007/978-3-540-30217-9_4</a>}, booktitle={Parallel Problem Solving from Nature - PPSN VIII}, author={Briest, Patrick and Brockhoff, Dimo and Degener, Bastian and Englert, Matthias and Gunia, Christian and Heering, Oliver and Jansen, Thomas and Leifhelm, Michael and Plociennik, Kai and Röglin, Heiko and et al.}, year={2004} }","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_updated":"2022-01-06T06:54:10Z","date_created":"2020-09-25T10:41:37Z","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","last_name":"Englert","full_name":"Englert, Matthias"},{"first_name":"Christian","full_name":"Gunia, Christian","last_name":"Gunia"},{"first_name":"Oliver","full_name":"Heering, Oliver","last_name":"Heering"},{"full_name":"Jansen, Thomas","last_name":"Jansen","first_name":"Thomas"},{"first_name":"Michael","last_name":"Leifhelm","full_name":"Leifhelm, Michael"},{"last_name":"Plociennik","full_name":"Plociennik, Kai","first_name":"Kai"},{"first_name":"Heiko","full_name":"Röglin, Heiko","last_name":"Röglin"},{"first_name":"Andrea","last_name":"Schweer","full_name":"Schweer, Andrea"},{"full_name":"Sudholt, Dirk","last_name":"Sudholt","first_name":"Dirk"},{"full_name":"Tannenbaum, Stefan","last_name":"Tannenbaum","first_name":"Stefan"},{"first_name":"Ingo","full_name":"Wegener, Ingo","last_name":"Wegener"}],"title":"The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes","doi":"10.1007/978-3-540-30217-9_4","publication":"Parallel Problem Solving from Nature - PPSN VIII","type":"conference","status":"public","_id":"19692","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"department":[{"_id":"64"}],"user_id":"25078","_id":"3011","publication":"Selected Areas in Cryptography","type":"book_chapter","status":"public","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"full_name":"Guajardo, Jorge","last_name":"Guajardo","first_name":"Jorge"},{"last_name":"Krummel","full_name":"Krummel, Volker","first_name":"Volker"}],"date_created":"2018-06-05T08:20:20Z","publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:51Z","doi":"10.1007/978-3-540-30564-4_5","title":"Provably Secure Masking of AES","publication_identifier":{"isbn":["9783540243274","9783540305644"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"69-83","citation":{"apa":"Blömer, J., Guajardo, J., &#38; Krummel, V. (2004). Provably Secure Masking of AES. In <i>Selected Areas in Cryptography</i> (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">https://doi.org/10.1007/978-3-540-30564-4_5</a>","mla":"Blömer, Johannes, et al. “Provably Secure Masking of AES.” <i>Selected Areas in Cryptography</i>, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>.","short":"J. Blömer, J. Guajardo, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 69–83.","bibtex":"@inbook{Blömer_Guajardo_Krummel_2004, place={Berlin, Heidelberg}, title={Provably Secure Masking of AES}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>}, booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Guajardo, Jorge and Krummel, Volker}, year={2004}, pages={69–83} }","ama":"Blömer J, Guajardo J, Krummel V. Provably Secure Masking of AES. In: <i>Selected Areas in Cryptography</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:69-83. doi:<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>","chicago":"Blömer, Johannes, Jorge Guajardo, and Volker Krummel. “Provably Secure Masking of AES.” In <i>Selected Areas in Cryptography</i>, 69–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">https://doi.org/10.1007/978-3-540-30564-4_5</a>.","ieee":"J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,” in <i>Selected Areas in Cryptography</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 69–83."},"year":"2004","place":"Berlin, Heidelberg"},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540210184","9783540246329"]},"has_accepted_license":"1","publication_status":"published","page":"1-13","citation":{"ieee":"J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in <i>Public Key Cryptography – PKC 2004</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 1–13.","chicago":"Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” In <i>Public Key Cryptography – PKC 2004</i>, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">https://doi.org/10.1007/978-3-540-24632-9_1</a>.","ama":"Blömer J, May A. A Generalized Wiener Attack on RSA. In: <i>Public Key Cryptography – PKC 2004</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:1-13. doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">10.1007/978-3-540-24632-9_1</a>","apa":"Blömer, J., &#38; May, A. (2004). A Generalized Wiener Attack on RSA. In <i>Public Key Cryptography – PKC 2004</i> (pp. 1–13). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">https://doi.org/10.1007/978-3-540-24632-9_1</a>","mla":"Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” <i>Public Key Cryptography – PKC 2004</i>, Springer Berlin Heidelberg, 2004, pp. 1–13, doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">10.1007/978-3-540-24632-9_1</a>.","short":"J. Blömer, A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 1–13.","bibtex":"@inbook{Blömer_May_2004, place={Berlin, Heidelberg}, title={A Generalized Wiener Attack on RSA}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">10.1007/978-3-540-24632-9_1</a>}, booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2004}, pages={1–13} }"},"year":"2004","place":"Berlin, Heidelberg","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"first_name":"Alexander","full_name":"May, Alexander","last_name":"May"}],"date_created":"2018-06-05T08:20:59Z","publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:51Z","doi":"10.1007/978-3-540-24632-9_1","title":"A Generalized Wiener Attack on RSA","publication":"Public Key Cryptography – PKC 2004","type":"book_chapter","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"feidens","date_created":"2018-06-05T08:21:31Z","date_updated":"2018-06-05T08:21:31Z","access_level":"closed","file_name":"keys.pdf","file_id":"3013","file_size":198120}],"department":[{"_id":"64"}],"user_id":"25078","_id":"3012","file_date_updated":"2018-06-05T08:21:31Z","ddc":["000"]},{"type":"book_chapter","publication":"Public Key Cryptography – PKC 2004","status":"public","user_id":"25078","department":[{"_id":"64"}],"_id":"3014","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540210184","9783540246329"]},"citation":{"ama":"May A. Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q. In: <i>Public Key Cryptography – PKC 2004</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:218-230. doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">10.1007/978-3-540-24632-9_16</a>","chicago":"May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^{r}q.” In <i>Public Key Cryptography – PKC 2004</i>, 218–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">https://doi.org/10.1007/978-3-540-24632-9_16</a>.","ieee":"A. May, “Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q,” in <i>Public Key Cryptography – PKC 2004</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 218–230.","short":"A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 218–230.","bibtex":"@inbook{May_2004, place={Berlin, Heidelberg}, title={Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">10.1007/978-3-540-24632-9_16</a>}, booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg}, author={May, Alexander}, year={2004}, pages={218–230} }","mla":"May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^{r}q.” <i>Public Key Cryptography – PKC 2004</i>, Springer Berlin Heidelberg, 2004, pp. 218–30, doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">10.1007/978-3-540-24632-9_16</a>.","apa":"May, A. (2004). Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q. In <i>Public Key Cryptography – PKC 2004</i> (pp. 218–230). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">https://doi.org/10.1007/978-3-540-24632-9_16</a>"},"page":"218-230","year":"2004","place":"Berlin, Heidelberg","author":[{"first_name":"Alexander","full_name":"May, Alexander","last_name":"May"}],"date_created":"2018-06-05T08:22:02Z","date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","doi":"10.1007/978-3-540-24632-9_16","title":"Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q"},{"title":"Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring","doi":"10.1007/978-3-540-28628-8_13","date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","author":[{"full_name":"May, Alexander","last_name":"May","first_name":"Alexander"}],"date_created":"2018-06-05T08:23:43Z","year":"2004","place":"Berlin, Heidelberg","page":"213-219","citation":{"apa":"May, A. (2004). Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In <i>Advances in Cryptology – CRYPTO 2004</i> (pp. 213–219). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-28628-8_13\">https://doi.org/10.1007/978-3-540-28628-8_13</a>","mla":"May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.” <i>Advances in Cryptology – CRYPTO 2004</i>, Springer Berlin Heidelberg, 2004, pp. 213–19, doi:<a href=\"https://doi.org/10.1007/978-3-540-28628-8_13\">10.1007/978-3-540-28628-8_13</a>.","bibtex":"@inbook{May_2004, place={Berlin, Heidelberg}, title={Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-28628-8_13\">10.1007/978-3-540-28628-8_13</a>}, booktitle={Advances in Cryptology – CRYPTO 2004}, publisher={Springer Berlin Heidelberg}, author={May, Alexander}, year={2004}, pages={213–219} }","short":"A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 213–219.","ama":"May A. Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In: <i>Advances in Cryptology – CRYPTO 2004</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:213-219. doi:<a href=\"https://doi.org/10.1007/978-3-540-28628-8_13\">10.1007/978-3-540-28628-8_13</a>","ieee":"A. May, “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring,” in <i>Advances in Cryptology – CRYPTO 2004</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 213–219.","chicago":"May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.” In <i>Advances in Cryptology – CRYPTO 2004</i>, 213–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-28628-8_13\">https://doi.org/10.1007/978-3-540-28628-8_13</a>."},"publication_identifier":{"isbn":["9783540226680","9783540286288"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","_id":"3015","department":[{"_id":"64"}],"user_id":"25078","status":"public","publication":"Advances in Cryptology – CRYPTO 2004","type":"book_chapter"},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"18778","status":"public","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 &#916;. Our results are parametrized by the variance of the noise distribution. For large variance we essentially consider the average case for distribution &#916; 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.<br>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 &#963;² and the uniform distribution in a hypercube of side length &epsilon. For these noise distributions we show upper bounds of O( (1/ &#963; )^d * log^3/2 * d - 1 n ) and O( ( (n log n) / &#949; )^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."}],"publication":"Proceedings of the 12th European Symposium on Algorithms (ESA'04)","type":"conference","doi":"10.1007/978-3-540-30140-0_25","title":"Extreme Points Under Random Noise","date_created":"2020-09-01T12:26:47Z","author":[{"last_name":"Damerow","full_name":"Damerow, Valentina","first_name":"Valentina"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"date_updated":"2022-01-06T06:53:52Z","citation":{"ieee":"V. Damerow and C. Sohler, “Extreme Points Under Random Noise,” in <i>Proceedings of the 12th European Symposium on Algorithms (ESA’04)</i>, 2004.","chicago":"Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random Noise.” In <i>Proceedings of the 12th European Symposium on Algorithms (ESA’04)</i>. Berlin, Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30140-0_25\">https://doi.org/10.1007/978-3-540-30140-0_25</a>.","ama":"Damerow V, Sohler C. Extreme Points Under Random Noise. In: <i>Proceedings of the 12th European Symposium on Algorithms (ESA’04)</i>. Berlin, Heidelberg; 2004. doi:<a href=\"https://doi.org/10.1007/978-3-540-30140-0_25\">10.1007/978-3-540-30140-0_25</a>","bibtex":"@inproceedings{Damerow_Sohler_2004, place={Berlin, Heidelberg}, title={Extreme Points Under Random Noise}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30140-0_25\">10.1007/978-3-540-30140-0_25</a>}, booktitle={Proceedings of the 12th European Symposium on Algorithms (ESA’04)}, author={Damerow, Valentina and Sohler, Christian}, year={2004} }","short":"V. Damerow, C. Sohler, in: Proceedings of the 12th European Symposium on Algorithms (ESA’04), Berlin, Heidelberg, 2004.","mla":"Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random Noise.” <i>Proceedings of the 12th European Symposium on Algorithms (ESA’04)</i>, 2004, doi:<a href=\"https://doi.org/10.1007/978-3-540-30140-0_25\">10.1007/978-3-540-30140-0_25</a>.","apa":"Damerow, V., &#38; Sohler, C. (2004). Extreme Points Under Random Noise. In <i>Proceedings of the 12th European Symposium on Algorithms (ESA’04)</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30140-0_25\">https://doi.org/10.1007/978-3-540-30140-0_25</a>"},"place":"Berlin, Heidelberg","year":"2004","publication_identifier":{"isbn":["9783540230250","9783540301400"],"issn":["0302-9743","1611-3349"]},"publication_status":"published"},{"year":"2004","date_created":"2020-08-25T11:25:11Z","publisher":"Springer","title":"Fast Multipoint Evaluation of Bivariate Polynomials","publication":"Proc. 12th Annual Symposium on Algorithms (ESA'04)","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."}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540230250","9783540301400"]},"publication_status":"published","page":"544-555","intvolume":"      3221","citation":{"ieee":"M. Nüsken and M. Ziegler, “Fast Multipoint Evaluation of Bivariate Polynomials,” in <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i>, 2004, vol. 3221, pp. 544–555.","chicago":"Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate Polynomials.” In <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i>, 3221:544–55. Berlin, Heidelberg: Springer, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30140-0_49\">https://doi.org/10.1007/978-3-540-30140-0_49</a>.","ama":"Nüsken M, Ziegler M. Fast Multipoint Evaluation of Bivariate Polynomials. In: <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i>. Vol 3221. Berlin, Heidelberg: Springer; 2004:544-555. doi:<a href=\"https://doi.org/10.1007/978-3-540-30140-0_49\">10.1007/978-3-540-30140-0_49</a>","mla":"Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate Polynomials.” <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i>, vol. 3221, Springer, 2004, pp. 544–55, doi:<a href=\"https://doi.org/10.1007/978-3-540-30140-0_49\">10.1007/978-3-540-30140-0_49</a>.","bibtex":"@inproceedings{Nüsken_Ziegler_2004, place={Berlin, Heidelberg}, title={Fast Multipoint Evaluation of Bivariate Polynomials}, volume={3221}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30140-0_49\">10.1007/978-3-540-30140-0_49</a>}, booktitle={Proc. 12th Annual Symposium on Algorithms (ESA’04)}, publisher={Springer}, author={Nüsken, Michael and Ziegler, Martin}, year={2004}, pages={544–555} }","short":"M. Nüsken, M. Ziegler, in: Proc. 12th Annual Symposium on Algorithms (ESA’04), Springer, Berlin, Heidelberg, 2004, pp. 544–555.","apa":"Nüsken, M., &#38; Ziegler, M. (2004). Fast Multipoint Evaluation of Bivariate Polynomials. In <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i> (Vol. 3221, pp. 544–555). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-30140-0_49\">https://doi.org/10.1007/978-3-540-30140-0_49</a>"},"place":"Berlin, Heidelberg","volume":3221,"author":[{"first_name":"Michael","last_name":"Nüsken","full_name":"Nüsken, Michael"},{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"date_updated":"2022-01-06T06:53:28Z","doi":"10.1007/978-3-540-30140-0_49","type":"conference","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"18263"},{"publication_identifier":{"isbn":["9783540241317","9783540305514"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"805-821","intvolume":"      3341","citation":{"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.","bibtex":"@inproceedings{Schindelhauer_Volbert_Ziegler_2004, place={Berlin, Heidelberg}, title={Spanners, Weak Spanners, and Power Spanners for Wireless Networks}, volume={3341}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30551-4_69\">10.1007/978-3-540-30551-4_69</a>}, 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} }","mla":"Schindelhauer, Christian, et al. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.” <i>Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04)</i>, vol. 3341, Springer , 2004, pp. 805–21, doi:<a href=\"https://doi.org/10.1007/978-3-540-30551-4_69\">10.1007/978-3-540-30551-4_69</a>.","apa":"Schindelhauer, C., Volbert, K., &#38; Ziegler, M. (2004). Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In <i>Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04)</i> (Vol. 3341, pp. 805–821). Berlin, Heidelberg: Springer . <a href=\"https://doi.org/10.1007/978-3-540-30551-4_69\">https://doi.org/10.1007/978-3-540-30551-4_69</a>","ama":"Schindelhauer C, Volbert K, Ziegler M. Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In: <i>Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04)</i>. Vol 3341. Berlin, Heidelberg: Springer ; 2004:805-821. doi:<a href=\"https://doi.org/10.1007/978-3-540-30551-4_69\">10.1007/978-3-540-30551-4_69</a>","chicago":"Schindelhauer, Christian, Klaus Volbert, and Martin Ziegler. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.” In <i>Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04)</i>, 3341:805–21. Berlin, Heidelberg: Springer , 2004. <a href=\"https://doi.org/10.1007/978-3-540-30551-4_69\">https://doi.org/10.1007/978-3-540-30551-4_69</a>.","ieee":"C. Schindelhauer, K. Volbert, and M. Ziegler, “Spanners, Weak Spanners, and Power Spanners for Wireless Networks,” in <i>Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04)</i>, 2004, vol. 3341, pp. 805–821."},"place":"Berlin, Heidelberg","volume":3341,"author":[{"first_name":"Christian","full_name":"Schindelhauer, Christian","last_name":"Schindelhauer"},{"first_name":"Klaus","full_name":"Volbert, Klaus","last_name":"Volbert"},{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"date_updated":"2022-01-06T06:53:28Z","doi":"10.1007/978-3-540-30551-4_69","type":"conference","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"18279","year":"2004","date_created":"2020-08-25T12:30:19Z","publisher":"Springer ","title":"Spanners, Weak Spanners, and Power Spanners for Wireless Networks","publication":"Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC'04)","abstract":[{"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).<br><br>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$. ","lang":"eng"}],"language":[{"iso":"eng"}]},{"citation":{"ama":"Bansal V, Meyer auf der Heide F, Sohler C. Labeling Smart Dust. In: <i>12th Annual European Symposium on Algorithms (ESA 2004)</i>. Vol 3221. Lecture Notes in Computer Science. Berlin, Heidelberg; 2004. doi:<a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">10.1007/978-3-540-30140-0_9</a>","chicago":"Bansal, Vikas, Friedhelm Meyer auf der Heide, and Christian Sohler. “Labeling Smart Dust.” In <i>12th Annual European Symposium on Algorithms (ESA 2004)</i>, Vol. 3221. Lecture Notes in Computer Science. Berlin, Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">https://doi.org/10.1007/978-3-540-30140-0_9</a>.","ieee":"V. Bansal, F. Meyer auf der Heide, and C. Sohler, “Labeling Smart Dust,” in <i>12th Annual European Symposium on Algorithms (ESA 2004)</i>, 2004, vol. 3221.","mla":"Bansal, Vikas, et al. “Labeling Smart Dust.” <i>12th Annual European Symposium on Algorithms (ESA 2004)</i>, vol. 3221, 2004, doi:<a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">10.1007/978-3-540-30140-0_9</a>.","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={<a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">10.1007/978-3-540-30140-0_9</a>}, 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} }","short":"V. Bansal, F. Meyer auf der Heide, C. Sohler, in: 12th Annual European Symposium on Algorithms (ESA 2004), Berlin, Heidelberg, 2004.","apa":"Bansal, V., Meyer auf der Heide, F., &#38; Sohler, C. (2004). Labeling Smart Dust. In <i>12th Annual European Symposium on Algorithms (ESA 2004)</i> (Vol. 3221). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">https://doi.org/10.1007/978-3-540-30140-0_9</a>"},"intvolume":"      3221","year":"2004","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"isbn":["9783540230250","9783540301400"],"issn":["0302-9743","1611-3349"]},"doi":"10.1007/978-3-540-30140-0_9","title":"Labeling Smart Dust","author":[{"last_name":"Bansal","full_name":"Bansal, Vikas","first_name":"Vikas"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"}],"date_created":"2020-04-08T11:07:57Z","volume":3221,"date_updated":"2022-01-06T06:52:50Z","status":"public","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."}],"type":"conference","publication":"12th Annual European Symposium on Algorithms (ESA 2004)","language":[{"iso":"eng"}],"user_id":"15415","series_title":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"_id":"16474"},{"date_created":"2019-10-04T21:28:56Z","author":[{"full_name":"Walder, Herbert","last_name":"Walder","first_name":"Herbert"},{"first_name":"Marco","last_name":"Platzner","id":"398","full_name":"Platzner, Marco"}],"publisher":"Springer","date_updated":"2022-01-06T06:51:40Z","doi":"10.1007/978-3-540-30117-2_84","title":"A Runtime Environment for Reconfigurable Hardware Operating Systems","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540229896","9783540301172"]},"citation":{"apa":"Walder, H., &#38; Platzner, M. (2004). A Runtime Environment for Reconfigurable Hardware Operating Systems. In <i>Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL)</i> (pp. 831–835). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-30117-2_84\">https://doi.org/10.1007/978-3-540-30117-2_84</a>","mla":"Walder, Herbert, and Marco Platzner. “A Runtime Environment for Reconfigurable Hardware Operating Systems.” <i>Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL)</i>, Springer, 2004, pp. 831–35, doi:<a href=\"https://doi.org/10.1007/978-3-540-30117-2_84\">10.1007/978-3-540-30117-2_84</a>.","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.","bibtex":"@inproceedings{Walder_Platzner_2004, place={Berlin, Heidelberg}, title={A Runtime Environment for Reconfigurable Hardware Operating Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30117-2_84\">10.1007/978-3-540-30117-2_84</a>}, 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} }","ieee":"H. Walder and M. Platzner, “A Runtime Environment for Reconfigurable Hardware Operating Systems,” in <i>Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL)</i>, 2004, pp. 831–835.","chicago":"Walder, Herbert, and Marco Platzner. “A Runtime Environment for Reconfigurable Hardware Operating Systems.” In <i>Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL)</i>, 831–35. Berlin, Heidelberg: Springer, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30117-2_84\">https://doi.org/10.1007/978-3-540-30117-2_84</a>.","ama":"Walder H, Platzner M. A Runtime Environment for Reconfigurable Hardware Operating Systems. In: <i>Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL)</i>. Berlin, Heidelberg: Springer; 2004:831-835. doi:<a href=\"https://doi.org/10.1007/978-3-540-30117-2_84\">10.1007/978-3-540-30117-2_84</a>"},"page":"831-835","year":"2004","place":"Berlin, Heidelberg","user_id":"398","department":[{"_id":"78"}],"_id":"13618","extern":"1","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL)","status":"public"},{"citation":{"bibtex":"@article{Salzwedel_2003, title={Algorithmic Approaches for Storage Networks}, volume={2625}, DOI={<a href=\"https://doi.org/10.1007/3-540-36574-5_12\">10.1007/3-540-36574-5_12</a>}, journal={Algorithms for Memory Hierarchies}, author={Salzwedel, Kay A.}, year={2003} }","mla":"Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.” <i>Algorithms for Memory Hierarchies</i>, vol. 2625, 2003, doi:<a href=\"https://doi.org/10.1007/3-540-36574-5_12\">10.1007/3-540-36574-5_12</a>.","short":"K.A. Salzwedel, Algorithms for Memory Hierarchies 2625 (2003).","apa":"Salzwedel, K. A. (2003). Algorithmic Approaches for Storage Networks. <i>Algorithms for Memory Hierarchies</i>, <i>2625</i>. <a href=\"https://doi.org/10.1007/3-540-36574-5_12\">https://doi.org/10.1007/3-540-36574-5_12</a>","ama":"Salzwedel KA. Algorithmic Approaches for Storage Networks. <i>Algorithms for Memory Hierarchies</i>. 2003;2625. doi:<a href=\"https://doi.org/10.1007/3-540-36574-5_12\">10.1007/3-540-36574-5_12</a>","chicago":"Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.” <i>Algorithms for Memory Hierarchies</i> 2625 (2003). <a href=\"https://doi.org/10.1007/3-540-36574-5_12\">https://doi.org/10.1007/3-540-36574-5_12</a>.","ieee":"K. A. Salzwedel, “Algorithmic Approaches for Storage Networks,” <i>Algorithms for Memory Hierarchies</i>, vol. 2625, 2003."},"intvolume":"      2625","year":"2003","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540008835","9783540365747"]},"doi":"10.1007/3-540-36574-5_12","title":"Algorithmic Approaches for Storage Networks","author":[{"last_name":"Salzwedel","full_name":"Salzwedel, Kay A.","first_name":"Kay A."}],"date_created":"2020-09-30T10:27:11Z","volume":2625,"date_updated":"2022-01-06T06:54:12Z","status":"public","type":"journal_article","publication":"Algorithms for Memory Hierarchies","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"19785"},{"place":"Berlin, Heidelberg","year":"2003","page":"27-43","citation":{"ama":"Blömer J, May A. New Partial Key Exposure Attacks on RSA. In: <i>Advances in Cryptology - CRYPTO 2003</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:27-43. doi:<a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">10.1007/978-3-540-45146-4_2</a>","ieee":"J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in <i>Advances in Cryptology - CRYPTO 2003</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.","chicago":"Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” In <i>Advances in Cryptology - CRYPTO 2003</i>, 27–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">https://doi.org/10.1007/978-3-540-45146-4_2</a>.","bibtex":"@inbook{Blömer_May_2003, place={Berlin, Heidelberg}, title={New Partial Key Exposure Attacks on RSA}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">10.1007/978-3-540-45146-4_2</a>}, booktitle={Advances in Cryptology - CRYPTO 2003}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2003}, pages={27–43} }","mla":"Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” <i>Advances in Cryptology - CRYPTO 2003</i>, Springer Berlin Heidelberg, 2003, pp. 27–43, doi:<a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">10.1007/978-3-540-45146-4_2</a>.","short":"J. Blömer, A. May, in: Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 27–43.","apa":"Blömer, J., &#38; May, A. (2003). New Partial Key Exposure Attacks on RSA. In <i>Advances in Cryptology - CRYPTO 2003</i> (pp. 27–43). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">https://doi.org/10.1007/978-3-540-45146-4_2</a>"},"publication_identifier":{"isbn":["9783540406747","9783540451464"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","title":"New Partial Key Exposure Attacks on RSA","doi":"10.1007/978-3-540-45146-4_2","date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","date_created":"2018-06-05T08:24:11Z","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"}],"status":"public","publication":"Advances in Cryptology - CRYPTO 2003","type":"book_chapter","_id":"3016","department":[{"_id":"64"}],"user_id":"25078"},{"title":"Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)","doi":"10.1007/978-3-540-45126-6_12","date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"full_name":"Seifert, Jean-Pierre","last_name":"Seifert","first_name":"Jean-Pierre"}],"date_created":"2018-06-05T08:25:18Z","year":"2003","place":"Berlin, Heidelberg","page":"162-181","citation":{"apa":"Blömer, J., &#38; Seifert, J.-P. (2003). Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In <i>Financial Cryptography</i> (pp. 162–181). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">https://doi.org/10.1007/978-3-540-45126-6_12</a>","bibtex":"@inbook{Blömer_Seifert_2003, place={Berlin, Heidelberg}, title={Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">10.1007/978-3-540-45126-6_12</a>}, booktitle={Financial Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Seifert, Jean-Pierre}, year={2003}, pages={162–181} }","short":"J. Blömer, J.-P. Seifert, in: Financial Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 162–181.","mla":"Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” <i>Financial Cryptography</i>, Springer Berlin Heidelberg, 2003, pp. 162–81, doi:<a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">10.1007/978-3-540-45126-6_12</a>.","chicago":"Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” In <i>Financial Cryptography</i>, 162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">https://doi.org/10.1007/978-3-540-45126-6_12</a>.","ieee":"J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in <i>Financial Cryptography</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 162–181.","ama":"Blömer J, Seifert J-P. Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In: <i>Financial Cryptography</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:162-181. doi:<a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">10.1007/978-3-540-45126-6_12</a>"},"publication_identifier":{"isbn":["9783540406631","9783540451266"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","_id":"3018","department":[{"_id":"64"}],"user_id":"25078","status":"public","publication":"Financial Cryptography","type":"book_chapter"},{"abstract":[{"text":"Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on FAST FOURIER TRANSFORM, they for instance multiply two polynomials of degree up to N or multi-evaluate one at N points simultaneously within quasi-linear time O(N polylog N). An extension to (and in fact the mere definition of) polynomials over fields R and C to the SKEW-field H of quaternions is promising but still missing. The present work proposes three approaches which in the commutative case coincide but for H turn out to differ, each one satisfying some desirable properties while lacking others. For each notion, we devise algorithms for according arithmetic; these are quasi-optimal in that their running times match lower complexity bounds up to polylogarithmic factors.","lang":"eng"}],"status":"public","type":"conference","publication":"Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC'03)","language":[{"iso":"eng"}],"_id":"18196","user_id":"15415","series_title":"Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg","department":[{"_id":"63"}],"year":"2003","citation":{"apa":"Ziegler, M. (2003). Quasi-optimal Arithmetic for Quaternion Polynomials. In <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i> (pp. 705–715). <a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">https://doi.org/10.1007/978-3-540-24587-2_72</a>","short":"M. Ziegler, in: Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–715.","bibtex":"@inproceedings{Ziegler_2003, series={Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg}, title={Quasi-optimal Arithmetic for Quaternion Polynomials}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">10.1007/978-3-540-24587-2_72</a>}, booktitle={Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)}, author={Ziegler, Martin}, year={2003}, pages={705–715}, collection={Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg} }","mla":"Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>, 2003, pp. 705–15, doi:<a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">10.1007/978-3-540-24587-2_72</a>.","ama":"Ziegler M. Quasi-optimal Arithmetic for Quaternion Polynomials. In: <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. ; 2003:705-715. doi:<a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">10.1007/978-3-540-24587-2_72</a>","ieee":"M. Ziegler, “Quasi-optimal Arithmetic for Quaternion Polynomials,” in <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>, 2003, pp. 705–715.","chicago":"Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” In <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>, 705–15. Lecture Notes in Computer Science, Vol 2906. Springer, Berlin, Heidelberg, 2003. <a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">https://doi.org/10.1007/978-3-540-24587-2_72</a>."},"page":"705-715","publication_status":"published","publication_identifier":{"isbn":["9783540206958","9783540245872"],"issn":["0302-9743","1611-3349"]},"title":"Quasi-optimal Arithmetic for Quaternion Polynomials","doi":"10.1007/978-3-540-24587-2_72","date_updated":"2022-01-06T06:53:27Z","author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"date_created":"2020-08-24T14:18:19Z"}]