--- _id: '37210' author: - first_name: Jutta full_name: Weber, Jutta id: '31494' last_name: Weber citation: ama: Weber J. Helpless Machines and True Loving Caregivers. A Feminist Critique of Recent Trends in Human-Robot Interaction. Journal of Information, Communication and Ethics in Society Vol 3, Issue 4, Paper 6. Published online 2005:209-218. apa: Weber, J. (2005). Helpless Machines and True Loving Caregivers. A Feminist Critique of Recent Trends in Human-Robot Interaction. Journal of Information, Communication and Ethics in Society. Vol. 3, Issue 4, Paper 6, 209–218. bibtex: '@article{Weber_2005, title={Helpless Machines and True Loving Caregivers. A Feminist Critique of Recent Trends in Human-Robot Interaction}, journal={Journal of Information, Communication and Ethics in Society. Vol. 3, Issue 4, Paper 6}, author={Weber, Jutta}, year={2005}, pages={209–218} }' chicago: Weber, Jutta. “Helpless Machines and True Loving Caregivers. A Feminist Critique of Recent Trends in Human-Robot Interaction.” Journal of Information, Communication and Ethics in Society. Vol. 3, Issue 4, Paper 6, 2005, 209–18. ieee: J. Weber, “Helpless Machines and True Loving Caregivers. A Feminist Critique of Recent Trends in Human-Robot Interaction,” Journal of Information, Communication and Ethics in Society. Vol. 3, Issue 4, Paper 6, pp. 209–218, 2005. mla: Weber, Jutta. “Helpless Machines and True Loving Caregivers. A Feminist Critique of Recent Trends in Human-Robot Interaction.” Journal of Information, Communication and Ethics in Society. Vol. 3, Issue 4, Paper 6, 2005, pp. 209–18. short: J. Weber, Journal of Information, Communication and Ethics in Society. Vol. 3, Issue 4, Paper 6 (2005) 209–218. date_created: 2023-01-18T06:59:48Z date_updated: 2023-01-18T07:00:00Z department: - _id: '411' extern: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://juttaweber.eu/wordpress/wp-content/uploads/2021/03/Weber_Helpless-Machines.pdf oa: '1' page: 209-218 publication: Journal of Information, Communication and Ethics in Society. Vol. 3, Issue 4, Paper 6 status: public title: Helpless Machines and True Loving Caregivers. A Feminist Critique of Recent Trends in Human-Robot Interaction type: journal_article user_id: '14932' year: '2005' ... --- _id: '41634' abstract: - lang: eng text: Am Beispiel bolivianischer Migrantinnen in der Global City Buenos Aires wird das Phänomen der Feminisierung der Migration in Lateinamerika und dessen Bedeutung für die Konstitution translokaler sozialer Räume untersucht. Im Mittelpunkt einer {\glq}dichten Beschreibung’ pluri-lokaler Alltagswelten stehen dabei ökonomische Netzwerke und translokale Lebensentwürfe von Arbeiterinnen in illegalen Textilsweatshops und Frauen der Töchtergeneration. Analysiert werden einerseits die alltagsweltlichen sozialen Praktiken von Migrantinnen, die zu einer Kon-stitution eines translokalen und kulturell hybriden Raumes zwischen den beiden Nationalgesell-schaften Bolivien und Argentinien Raumes beitragen und andererseits Prozesse und Dynamiken der Neuaushandlung von ethnischen Identitäten in einem solchen Raum. Probing into the lives of female Bolivian migrants in the global city Buenos Aires, this empirical research explores feminisation of migration in Latin America analysing its significance for the constitution of translocal social spaces. Applying {\grq}thick description’ to the migrants’ pluri-local life worlds, the study closely examines how Bolivian women in Buenos Aires, partly working in illegal sweatshops and partly second generation migrants, establish economic networks and set up their translocal life plans. Thus the analysis of the migrants’ everyday social practices, such as work and leisure, yields insight not only into the constitution of a translocal and cultur-ally hybrid social space between the two countries, but also into dynamics of re-negotiation of ethnic identities within this space. author: - first_name: Anna full_name: Spiegel, Anna id: '97205' last_name: Spiegel orcid: 0000-0002-4326-8141 citation: ama: 'Spiegel A. Alltagswelten in Translokalen Räumen : Bolivianische Migrantinnen in Buenos Aires. IKO; 2005.' apa: 'Spiegel, A. (2005). Alltagswelten in translokalen Räumen : Bolivianische Migrantinnen in Buenos Aires. IKO.' bibtex: '@book{Spiegel_2005, title={Alltagswelten in translokalen Räumen : Bolivianische Migrantinnen in Buenos Aires}, publisher={IKO}, author={Spiegel, Anna}, year={2005} }' chicago: 'Spiegel, Anna. Alltagswelten in Translokalen Räumen : Bolivianische Migrantinnen in Buenos Aires. IKO, 2005.' ieee: 'A. Spiegel, Alltagswelten in translokalen Räumen : Bolivianische Migrantinnen in Buenos Aires. IKO, 2005.' mla: 'Spiegel, Anna. Alltagswelten in Translokalen Räumen : Bolivianische Migrantinnen in Buenos Aires. IKO, 2005.' short: 'A. Spiegel, Alltagswelten in Translokalen Räumen : Bolivianische Migrantinnen in Buenos Aires, IKO, 2005.' date_created: 2023-02-03T12:36:17Z date_updated: 2023-02-06T11:29:34Z department: - _id: '476' extern: '1' keyword: - Alltag - Bolivianische Einwanderin - Buenos Aires - Ethnizität language: - iso: eng publication_identifier: isbn: - 3-88939-764-6 publisher: IKO status: public title: 'Alltagswelten in translokalen Räumen : Bolivianische Migrantinnen in Buenos Aires' type: book user_id: '97205' year: '2005' ... --- _id: '44188' alternative_title: - Text im Kontext. Beiträge zur 6. Arbeitstagung schwedischer Germanisten in Göteborg author: - first_name: Inez full_name: Müller, Inez id: '26755' last_name: Müller citation: ama: 'Müller I. Schreiben gegen den Tod - George Taboris metaautobiographishes Erzählen in “Autodafé.” In: Bareis A, ed. Universität Göteborg; 2005:10.' apa: Müller, I. (2005). Schreiben gegen den Tod - George Taboris metaautobiographishes Erzählen in “Autodafé” (A. Bareis, Ed.; p. 10). Universität Göteborg. bibtex: '@inproceedings{Müller_2005, place={Göteborg}, title={Schreiben gegen den Tod - George Taboris metaautobiographishes Erzählen in “Autodafé”}, publisher={Universität Göteborg}, author={Müller, Inez}, editor={Bareis, Alexander}, year={2005}, pages={10} }' chicago: 'Müller, Inez. “Schreiben gegen den Tod - George Taboris metaautobiographishes Erzählen in ‘Autodafé.’” edited by Alexander Bareis, 10. Göteborg: Universität Göteborg, 2005.' ieee: I. Müller, “Schreiben gegen den Tod - George Taboris metaautobiographishes Erzählen in ‘Autodafé,’” 2005, p. 10. mla: Müller, Inez. Schreiben gegen den Tod - George Taboris metaautobiographishes Erzählen in “Autodafé.” Edited by Alexander Bareis, Universität Göteborg, 2005, p. 10. short: 'I. Müller, in: A. Bareis (Ed.), Universität Göteborg, Göteborg, 2005, p. 10.' date_created: 2023-04-26T09:18:21Z date_updated: 2025-05-23T13:10:14Z ddc: - '430' department: - _id: '5' editor: - first_name: Alexander full_name: Bareis, Alexander last_name: Bareis extern: '1' file: - access_level: closed content_type: application/pdf creator: inmu date_created: 2025-05-23T13:08:50Z date_updated: 2025-05-23T13:08:50Z file_id: '60029' file_name: Inez_Mueller_George_Tabori_TextimKontext6_2004.pdf file_size: 1195306 relation: main_file success: 1 file_date_updated: 2025-05-23T13:08:50Z has_accepted_license: '1' language: - iso: ger page: '10' place: Göteborg publication_identifier: isbn: - 9173465216, 9789173465212 publication_status: published publisher: Universität Göteborg status: public title: Schreiben gegen den Tod - George Taboris metaautobiographishes Erzählen in "Autodafé" type: conference user_id: '26755' year: '2005' ... --- _id: '33823' author: - first_name: Grant full_name: Martin, Grant last_name: Martin - first_name: Wolfgang full_name: Müller, Wolfgang id: '16243' last_name: Müller citation: ama: 'Martin G, Müller W. When Worlds Collide: Can UML help SoC Design? In: Martin G, Müller W, eds. UML for SoC Design. Kluwer; 2005:1-15.' apa: 'Martin, G., & Müller, W. (2005). When Worlds Collide: Can UML help SoC Design? In G. Martin & W. Müller (Eds.), UML for SoC Design (pp. 1–15). Kluwer.' bibtex: '@inbook{Martin_Müller_2005, title={When Worlds Collide: Can UML help SoC Design?}, booktitle={UML for SoC Design}, publisher={Kluwer}, author={Martin, Grant and Müller, Wolfgang}, editor={Martin, Grant and Müller, Wolfgang}, year={2005}, pages={1–15} }' chicago: 'Martin, Grant, and Wolfgang Müller. “When Worlds Collide: Can UML Help SoC Design?” In UML for SoC Design, edited by Grant Martin and Wolfgang Müller, 1–15. Kluwer, 2005.' ieee: 'G. Martin and W. Müller, “When Worlds Collide: Can UML help SoC Design?,” in UML for SoC Design, G. Martin and W. Müller, Eds. Kluwer, 2005, pp. 1–15.' mla: 'Martin, Grant, and Wolfgang Müller. “When Worlds Collide: Can UML Help SoC Design?” UML for SoC Design, edited by Grant Martin and Wolfgang Müller, Kluwer, 2005, pp. 1–15.' short: 'G. Martin, W. Müller, in: G. Martin, W. Müller (Eds.), UML for SoC Design, Kluwer, 2005, pp. 1–15.' date_created: 2022-10-20T09:12:00Z date_updated: 2025-02-26T14:45:43Z editor: - first_name: Grant full_name: Martin, Grant last_name: Martin - first_name: Wolfgang full_name: Müller, Wolfgang last_name: Müller language: - iso: eng page: 1-15 publication: UML for SoC Design publication_identifier: isbn: - 0-387-25744-6 publisher: Kluwer status: public title: 'When Worlds Collide: Can UML help SoC Design?' type: book_chapter user_id: '5786' 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: '3234' author: - first_name: Michael full_name: Möller, Michael last_name: Möller - first_name: Ernst-Rüdiger full_name: Olderog, Ernst-Rüdiger last_name: Olderog - first_name: Holger full_name: Rasch, Holger last_name: Rasch - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Möller M, Olderog E-R, Rasch H, Wehrheim H. Linking {CSP-OZ} with {UML} and Java: {A} Case Study. In: A. Boiten E, Derrick J, Smith G, eds. Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings. Lecture Notes in Computer Science. ; 2004:267--286. doi:10.1007/978-3-540-24756-2_15' apa: 'Möller, M., Olderog, E.-R., Rasch, H., & Wehrheim, H. (2004). Linking {CSP-OZ} with {UML} and Java: {A} Case Study. In E. A. Boiten, J. Derrick, & G. Smith (Eds.), Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings (pp. 267--286). https://doi.org/10.1007/978-3-540-24756-2_15' bibtex: '@inproceedings{Möller_Olderog_Rasch_Wehrheim_2004, series={Lecture Notes in Computer Science}, title={Linking {CSP-OZ} with {UML} and Java: {A} Case Study}, DOI={10.1007/978-3-540-24756-2_15}, booktitle={Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings}, author={Möller, Michael and Olderog, Ernst-Rüdiger and Rasch, Holger and Wehrheim, Heike}, editor={A. Boiten, Eerke and Derrick, John and Smith, GraemeEditors}, year={2004}, pages={267--286}, collection={Lecture Notes in Computer Science} }' chicago: 'Möller, Michael, Ernst-Rüdiger Olderog, Holger Rasch, and Heike Wehrheim. “Linking {CSP-OZ} with {UML} and Java: {A} Case Study.” In Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings, edited by Eerke A. Boiten, John Derrick, and Graeme Smith, 267--286. Lecture Notes in Computer Science, 2004. https://doi.org/10.1007/978-3-540-24756-2_15.' ieee: 'M. Möller, E.-R. Olderog, H. Rasch, and H. Wehrheim, “Linking {CSP-OZ} with {UML} and Java: {A} Case Study,” in Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings, 2004, pp. 267--286.' mla: 'Möller, Michael, et al. “Linking {CSP-OZ} with {UML} and Java: {A} Case Study.” Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings, edited by Eerke A. Boiten et al., 2004, pp. 267--286, doi:10.1007/978-3-540-24756-2_15.' short: 'M. Möller, E.-R. Olderog, H. Rasch, H. Wehrheim, in: E. A. Boiten, J. Derrick, G. Smith (Eds.), Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings, 2004, pp. 267--286.' date_created: 2018-06-14T06:47:35Z date_updated: 2022-01-06T06:59:06Z department: - _id: '77' doi: 10.1007/978-3-540-24756-2_15 editor: - first_name: Eerke full_name: A. Boiten, Eerke last_name: A. Boiten - first_name: John full_name: Derrick, John last_name: Derrick - first_name: Graeme full_name: Smith, Graeme last_name: Smith page: 267--286 publication: Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings series_title: Lecture Notes in Computer Science status: public title: 'Linking {CSP-OZ} with {UML} and Java: {A} Case Study' type: conference user_id: '29719' 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: '21166' author: - first_name: Gerson full_name: Meschut, Gerson id: '32056' last_name: Meschut orcid: 0000-0002-2763-1246 - first_name: M. full_name: Goede, M. last_name: Goede citation: ama: 'Meschut G, Goede M. New material and design concepts for constructions of vehicles – challenges for thermal an cold joining techniques. In: Tagungsband Zur 9. International Aachen Welding Conference: Joining in Traffic and Transportation Industry – Processes, Progress, Applications. Aachen; 2004:37-47.' apa: 'Meschut, G., & Goede, M. (2004). New material and design concepts for constructions of vehicles – challenges for thermal an cold joining techniques. In Tagungsband zur 9. International Aachen Welding Conference: Joining in Traffic and Transportation Industry – Processes, Progress, Applications (pp. 37–47). Aachen.' bibtex: '@inproceedings{Meschut_Goede_2004, place={Aachen}, title={New material and design concepts for constructions of vehicles – challenges for thermal an cold joining techniques}, booktitle={Tagungsband zur 9. International Aachen Welding Conference: Joining in Traffic and Transportation Industry – Processes, Progress, Applications}, author={Meschut, Gerson and Goede, M.}, year={2004}, pages={37–47} }' chicago: 'Meschut, Gerson, and M. Goede. “New Material and Design Concepts for Constructions of Vehicles – Challenges for Thermal an Cold Joining Techniques.” In Tagungsband Zur 9. International Aachen Welding Conference: Joining in Traffic and Transportation Industry – Processes, Progress, Applications, 37–47. Aachen, 2004.' ieee: 'G. Meschut and M. Goede, “New material and design concepts for constructions of vehicles – challenges for thermal an cold joining techniques,” in Tagungsband zur 9. International Aachen Welding Conference: Joining in Traffic and Transportation Industry – Processes, Progress, Applications, Aachen, 2004, pp. 37–47.' mla: 'Meschut, Gerson, and M. Goede. “New Material and Design Concepts for Constructions of Vehicles – Challenges for Thermal an Cold Joining Techniques.” Tagungsband Zur 9. International Aachen Welding Conference: Joining in Traffic and Transportation Industry – Processes, Progress, Applications, 2004, pp. 37–47.' short: 'G. Meschut, M. Goede, in: Tagungsband Zur 9. International Aachen Welding Conference: Joining in Traffic and Transportation Industry – Processes, Progress, Applications, Aachen, 2004, pp. 37–47.' conference: end_date: 2004-06-30 location: Aachen name: '9. International Aachen Welding Conference: Joining in Traffic and Transportation Industry – Processes, Progress, Applications' start_date: 2004-06-29 date_created: 2021-02-03T13:19:21Z date_updated: 2022-01-06T06:54:48Z department: - _id: '157' language: - iso: eng page: 37-47 place: Aachen publication: 'Tagungsband zur 9. International Aachen Welding Conference: Joining in Traffic and Transportation Industry – Processes, Progress, Applications' publication_identifier: isbn: - ISBN 3-8322-2840-3 status: public title: New material and design concepts for constructions of vehicles – challenges for thermal an cold joining techniques type: conference user_id: '68518' year: '2004' ... --- _id: '21218' author: - first_name: C. full_name: Bye, C. last_name: Bye - first_name: T. full_name: Draht, T. last_name: Draht - first_name: J. full_name: Küting, J. last_name: Küting - first_name: R. full_name: Lübbers, R. last_name: Lübbers - first_name: Gerson full_name: Meschut, Gerson id: '32056' last_name: Meschut orcid: 0000-0002-2763-1246 - first_name: M. full_name: Ruther, M. last_name: Ruther citation: ama: 'Bye C, Draht T, Küting J, Lübbers R, Meschut G, Ruther M. Fügen von Kunststoffen im strukturellen Leichtbau. In: Tagungsband Zum 11. Paderborner Symposium Fügetechnik „Mechanisches Fügen Und Kleben“. Paderborn; 2004:22-43.' apa: Bye, C., Draht, T., Küting, J., Lübbers, R., Meschut, G., & Ruther, M. (2004). Fügen von Kunststoffen im strukturellen Leichtbau. In Tagungsband zum 11. Paderborner Symposium Fügetechnik „Mechanisches Fügen und Kleben“ (pp. 22–43). Paderborn. bibtex: '@inproceedings{Bye_Draht_Küting_Lübbers_Meschut_Ruther_2004, place={Paderborn}, title={Fügen von Kunststoffen im strukturellen Leichtbau}, booktitle={Tagungsband zum 11. Paderborner Symposium Fügetechnik „Mechanisches Fügen und Kleben“}, author={Bye, C. and Draht, T. and Küting, J. and Lübbers, R. and Meschut, Gerson and Ruther, M.}, year={2004}, pages={22–43} }' chicago: Bye, C., T. Draht, J. Küting, R. Lübbers, Gerson Meschut, and M. Ruther. “Fügen von Kunststoffen Im Strukturellen Leichtbau.” In Tagungsband Zum 11. Paderborner Symposium Fügetechnik „Mechanisches Fügen Und Kleben“, 22–43. Paderborn, 2004. ieee: C. Bye, T. Draht, J. Küting, R. Lübbers, G. Meschut, and M. Ruther, “Fügen von Kunststoffen im strukturellen Leichtbau,” in Tagungsband zum 11. Paderborner Symposium Fügetechnik „Mechanisches Fügen und Kleben“, Paderborn, 2004, pp. 22–43. mla: Bye, C., et al. “Fügen von Kunststoffen Im Strukturellen Leichtbau.” Tagungsband Zum 11. Paderborner Symposium Fügetechnik „Mechanisches Fügen Und Kleben“, 2004, pp. 22–43. short: 'C. Bye, T. Draht, J. Küting, R. Lübbers, G. Meschut, M. Ruther, in: Tagungsband Zum 11. Paderborner Symposium Fügetechnik „Mechanisches Fügen Und Kleben“, Paderborn, 2004, pp. 22–43.' conference: end_date: 2004-11-25 location: Paderborn name: 11. Paderborner Symposium Fügetechnik „Mechanisches Fügen und Kleben“ start_date: 2004-11-24 date_created: 2021-02-14T13:30:40Z date_updated: 2022-01-06T06:54:50Z department: - _id: '157' language: - iso: eng page: 22-43 place: Paderborn publication: Tagungsband zum 11. Paderborner Symposium Fügetechnik „Mechanisches Fügen und Kleben“ publication_identifier: isbn: - ISBN 3-9809524-I-X status: public title: Fügen von Kunststoffen im strukturellen Leichtbau type: conference user_id: '68518' 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: '19143' author: - first_name: Eva- Maria full_name: Seng, Eva- Maria id: '499' last_name: Seng citation: ama: 'Seng E-M. Einleitung „in der zeit“ – kunst aus sachsen-anhalt 2004. In: Katalog der Landeskunstausstellung Sachsen-Anhalts in Magdeburg 2004. Halle; 2004.' apa: Seng, E.-M. (2004). Einleitung „in der zeit“ – kunst aus sachsen-anhalt 2004. In Katalog der Landeskunstausstellung Sachsen-Anhalts in Magdeburg 2004. Halle. bibtex: '@inbook{Seng_2004, place={Halle}, title={Einleitung „in der zeit“ – kunst aus sachsen-anhalt 2004}, booktitle={Katalog der Landeskunstausstellung Sachsen-Anhalts in Magdeburg 2004}, author={Seng, Eva- Maria}, year={2004} }' chicago: Seng, Eva- Maria. “Einleitung „in der zeit“ – kunst aus sachsen-anhalt 2004.” In Katalog der Landeskunstausstellung Sachsen-Anhalts in Magdeburg 2004. Halle, 2004. ieee: E.-M. Seng, “Einleitung „in der zeit“ – kunst aus sachsen-anhalt 2004,” in Katalog der Landeskunstausstellung Sachsen-Anhalts in Magdeburg 2004, Halle, 2004. mla: Seng, Eva-Maria. “Einleitung „in der zeit“ – kunst aus sachsen-anhalt 2004.” Katalog der Landeskunstausstellung Sachsen-Anhalts in Magdeburg 2004, 2004. short: 'E.-M. Seng, in: Katalog der Landeskunstausstellung Sachsen-Anhalts in Magdeburg 2004, Halle, 2004.' date_created: 2020-09-08T12:45:50Z date_updated: 2022-01-06T06:53:58Z department: - _id: '443' extern: '1' language: - iso: ger place: Halle publication: Katalog der Landeskunstausstellung Sachsen-Anhalts in Magdeburg 2004 status: public title: Einleitung „in der zeit“ – kunst aus sachsen-anhalt 2004 type: book_chapter user_id: '21240' 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: '852' author: - first_name: Vlado full_name: Handziski, Vlado last_name: Handziski - first_name: Andreas full_name: Köpke, Andreas last_name: Köpke - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: Christian full_name: Frank, Christian last_name: Frank - first_name: Witold full_name: Drytkiewicz, Witold last_name: Drytkiewicz citation: ama: 'Handziski V, Köpke A, Karl H, Frank C, Drytkiewicz W. Improving the Energy Efficiency of Directed Diffusion Using Passive Clustering. In: Wireless Sensor Networks, First European Workshop, EWSN 2004, Berlin, Germany, January 19-21, 2004, Proceedings. ; 2004:172--187. doi:10.1007/978-3-540-24606-0_12' apa: Handziski, V., Köpke, A., Karl, H., Frank, C., & Drytkiewicz, W. (2004). Improving the Energy Efficiency of Directed Diffusion Using Passive Clustering. In Wireless Sensor Networks, First European Workshop, EWSN 2004, Berlin, Germany, January 19-21, 2004, Proceedings (pp. 172--187). https://doi.org/10.1007/978-3-540-24606-0_12 bibtex: '@inproceedings{Handziski_Köpke_Karl_Frank_Drytkiewicz_2004, title={Improving the Energy Efficiency of Directed Diffusion Using Passive Clustering}, DOI={10.1007/978-3-540-24606-0_12}, booktitle={Wireless Sensor Networks, First European Workshop, EWSN 2004, Berlin, Germany, January 19-21, 2004, Proceedings}, author={Handziski, Vlado and Köpke, Andreas and Karl, Holger and Frank, Christian and Drytkiewicz, Witold}, year={2004}, pages={172--187} }' chicago: Handziski, Vlado, Andreas Köpke, Holger Karl, Christian Frank, and Witold Drytkiewicz. “Improving the Energy Efficiency of Directed Diffusion Using Passive Clustering.” In Wireless Sensor Networks, First European Workshop, EWSN 2004, Berlin, Germany, January 19-21, 2004, Proceedings, 172--187, 2004. https://doi.org/10.1007/978-3-540-24606-0_12. ieee: V. Handziski, A. Köpke, H. Karl, C. Frank, and W. Drytkiewicz, “Improving the Energy Efficiency of Directed Diffusion Using Passive Clustering,” in Wireless Sensor Networks, First European Workshop, EWSN 2004, Berlin, Germany, January 19-21, 2004, Proceedings, 2004, pp. 172--187. mla: Handziski, Vlado, et al. “Improving the Energy Efficiency of Directed Diffusion Using Passive Clustering.” Wireless Sensor Networks, First European Workshop, EWSN 2004, Berlin, Germany, January 19-21, 2004, Proceedings, 2004, pp. 172--187, doi:10.1007/978-3-540-24606-0_12. short: 'V. Handziski, A. Köpke, H. Karl, C. Frank, W. Drytkiewicz, in: Wireless Sensor Networks, First European Workshop, EWSN 2004, Berlin, Germany, January 19-21, 2004, Proceedings, 2004, pp. 172--187.' date_created: 2017-11-27T10:22:27Z date_updated: 2022-01-06T07:03:56Z department: - _id: '75' doi: 10.1007/978-3-540-24606-0_12 page: 172--187 publication: Wireless Sensor Networks, First European Workshop, EWSN 2004, Berlin, Germany, January 19-21, 2004, Proceedings status: public title: Improving the Energy Efficiency of Directed Diffusion Using Passive Clustering type: conference user_id: '15572' year: '2004' ... --- _id: '854' author: - first_name: Christian full_name: Frank, Christian last_name: Frank - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Frank C, Karl H. Consistency challenges of service discovery in mobile ad hoc networks. In: Proceedings of the 7th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2004, Venice, Italy, October 4-6, 2004. ; 2004:105--114. doi:10.1145/1023663.1023684' apa: Frank, C., & Karl, H. (2004). Consistency challenges of service discovery in mobile ad hoc networks. In Proceedings of the 7th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2004, Venice, Italy, October 4-6, 2004 (pp. 105--114). https://doi.org/10.1145/1023663.1023684 bibtex: '@inproceedings{Frank_Karl_2004, title={Consistency challenges of service discovery in mobile ad hoc networks}, DOI={10.1145/1023663.1023684}, booktitle={Proceedings of the 7th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2004, Venice, Italy, October 4-6, 2004}, author={Frank, Christian and Karl, Holger}, year={2004}, pages={105--114} }' chicago: Frank, Christian, and Holger Karl. “Consistency Challenges of Service Discovery in Mobile Ad Hoc Networks.” In Proceedings of the 7th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2004, Venice, Italy, October 4-6, 2004, 105--114, 2004. https://doi.org/10.1145/1023663.1023684. ieee: C. Frank and H. Karl, “Consistency challenges of service discovery in mobile ad hoc networks,” in Proceedings of the 7th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2004, Venice, Italy, October 4-6, 2004, 2004, pp. 105--114. mla: Frank, Christian, and Holger Karl. “Consistency Challenges of Service Discovery in Mobile Ad Hoc Networks.” Proceedings of the 7th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2004, Venice, Italy, October 4-6, 2004, 2004, pp. 105--114, doi:10.1145/1023663.1023684. short: 'C. Frank, H. Karl, in: Proceedings of the 7th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2004, Venice, Italy, October 4-6, 2004, 2004, pp. 105--114.' date_created: 2017-11-27T10:22:27Z date_updated: 2022-01-06T07:03:56Z department: - _id: '75' doi: 10.1145/1023663.1023684 page: 105--114 publication: Proceedings of the 7th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2004, Venice, Italy, October 4-6, 2004 status: public title: Consistency challenges of service discovery in mobile ad hoc networks type: conference user_id: '15572' year: '2004' ... --- _id: '855' author: - first_name: Laura full_name: Marie Feeney, Laura last_name: Marie Feeney - first_name: Daniel full_name: Hollos, Daniel last_name: Hollos - first_name: Martin full_name: Kubisch, Martin last_name: Kubisch - first_name: Seble full_name: Mengesha, Seble last_name: Mengesha - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Marie Feeney L, Hollos D, Kubisch M, Mengesha S, Karl H. A Geometric Derivation of the Probability of Finding a Relay in Multi-rate Networks. In: NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004, Proceedings. ; 2004:1312--1317. doi:10.1007/978-3-540-24693-0_112' apa: Marie Feeney, L., Hollos, D., Kubisch, M., Mengesha, S., & Karl, H. (2004). A Geometric Derivation of the Probability of Finding a Relay in Multi-rate Networks. In NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004, Proceedings (pp. 1312--1317). https://doi.org/10.1007/978-3-540-24693-0_112 bibtex: '@inproceedings{Marie Feeney_Hollos_Kubisch_Mengesha_Karl_2004, title={A Geometric Derivation of the Probability of Finding a Relay in Multi-rate Networks}, DOI={10.1007/978-3-540-24693-0_112}, booktitle={NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004, Proceedings}, author={Marie Feeney, Laura and Hollos, Daniel and Kubisch, Martin and Mengesha, Seble and Karl, Holger}, year={2004}, pages={1312--1317} }' chicago: Marie Feeney, Laura, Daniel Hollos, Martin Kubisch, Seble Mengesha, and Holger Karl. “A Geometric Derivation of the Probability of Finding a Relay in Multi-Rate Networks.” In NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004, Proceedings, 1312--1317, 2004. https://doi.org/10.1007/978-3-540-24693-0_112. ieee: L. Marie Feeney, D. Hollos, M. Kubisch, S. Mengesha, and H. Karl, “A Geometric Derivation of the Probability of Finding a Relay in Multi-rate Networks,” in NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004, Proceedings, 2004, pp. 1312--1317. mla: Marie Feeney, Laura, et al. “A Geometric Derivation of the Probability of Finding a Relay in Multi-Rate Networks.” NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004, Proceedings, 2004, pp. 1312--1317, doi:10.1007/978-3-540-24693-0_112. short: 'L. Marie Feeney, D. Hollos, M. Kubisch, S. Mengesha, H. Karl, in: NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004, Proceedings, 2004, pp. 1312--1317.' date_created: 2017-11-27T10:22:27Z date_updated: 2022-01-06T07:03:56Z department: - _id: '75' doi: 10.1007/978-3-540-24693-0_112 page: 1312--1317 publication: NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004, Proceedings status: public title: A Geometric Derivation of the Probability of Finding a Relay in Multi-rate Networks type: conference user_id: '15572' year: '2004' ... --- _id: '859' citation: ama: Karl H, Willig A, Wolisz A, eds. Wireless Sensor Networks. First European Workshop, {EWSN} 2004, Berlin, Germany, January 19-21, 2004, Proceedings; 2004. doi:10.1007/b94854 apa: Karl, H., Willig, A., & Wolisz, A. (Eds.). (2004). Wireless Sensor Networks. First European Workshop, {EWSN} 2004, Berlin, Germany, January 19-21, 2004, Proceedings. https://doi.org/10.1007/b94854 bibtex: '@book{Karl_Willig_Wolisz_2004, series={Lecture Notes in Computer Science}, title={Wireless Sensor Networks}, DOI={10.1007/b94854}, publisher={First European Workshop, {EWSN} 2004, Berlin, Germany, January 19-21, 2004, Proceedings}, year={2004}, collection={Lecture Notes in Computer Science} }' chicago: Karl, Holger, Andreas Willig, and Adam Wolisz, eds. Wireless Sensor Networks. Lecture Notes in Computer Science. First European Workshop, {EWSN} 2004, Berlin, Germany, January 19-21, 2004, Proceedings, 2004. https://doi.org/10.1007/b94854. ieee: H. Karl, A. Willig, and A. Wolisz, Eds., Wireless Sensor Networks. First European Workshop, {EWSN} 2004, Berlin, Germany, January 19-21, 2004, Proceedings, 2004. mla: Karl, Holger, et al., editors. Wireless Sensor Networks. First European Workshop, {EWSN} 2004, Berlin, Germany, January 19-21, 2004, Proceedings, 2004, doi:10.1007/b94854. short: H. Karl, A. Willig, A. Wolisz, eds., Wireless Sensor Networks, First European Workshop, {EWSN} 2004, Berlin, Germany, January 19-21, 2004, Proceedings, 2004. date_created: 2017-11-27T10:22:27Z date_updated: 2022-01-06T07:03:57Z department: - _id: '75' doi: 10.1007/b94854 editor: - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: Andreas full_name: Willig, Andreas last_name: Willig - first_name: Adam full_name: Wolisz, Adam last_name: Wolisz publication_identifier: isbn: - 3-540-20825-9 publisher: First European Workshop, {EWSN} 2004, Berlin, Germany, January 19-21, 2004, Proceedings series_title: Lecture Notes in Computer Science status: public title: Wireless Sensor Networks type: conference_editor user_id: '15572' year: '2004' ...