--- _id: '3233' author: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Wehrheim H. Refinement and Consistency in Component Models with Multiple Views. In: H. Reussner R, A. Stafford J, A. Szyperski C, eds. Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers. Lecture Notes in Computer Science. ; 2004:84--102. doi:10.1007/11786160_5' apa: Wehrheim, H. (2004). Refinement and Consistency in Component Models with Multiple Views. In R. H. Reussner, J. A. Stafford, & C. A. Szyperski (Eds.), Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers (pp. 84--102). https://doi.org/10.1007/11786160_5 bibtex: '@inproceedings{Wehrheim_2004, series={Lecture Notes in Computer Science}, title={Refinement and Consistency in Component Models with Multiple Views}, DOI={10.1007/11786160_5}, booktitle={Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers}, author={Wehrheim, Heike}, editor={H. Reussner, Ralf and A. Stafford, Judith and A. Szyperski, ClemensEditors}, year={2004}, pages={84--102}, collection={Lecture Notes in Computer Science} }' chicago: Wehrheim, Heike. “Refinement and Consistency in Component Models with Multiple Views.” In Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers, edited by Ralf H. Reussner, Judith A. Stafford, and Clemens A. Szyperski, 84--102. Lecture Notes in Computer Science, 2004. https://doi.org/10.1007/11786160_5. ieee: H. Wehrheim, “Refinement and Consistency in Component Models with Multiple Views,” in Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers, 2004, pp. 84--102. mla: Wehrheim, Heike. “Refinement and Consistency in Component Models with Multiple Views.” Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers, edited by Ralf H. Reussner et al., 2004, pp. 84--102, doi:10.1007/11786160_5. short: 'H. Wehrheim, in: R. H. Reussner, J. A. Stafford, C. A. Szyperski (Eds.), Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers, 2004, pp. 84--102.' date_created: 2018-06-14T06:46:31Z date_updated: 2022-01-06T06:59:06Z department: - _id: '77' doi: 10.1007/11786160_5 editor: - first_name: Ralf full_name: H. Reussner, Ralf last_name: H. Reussner - first_name: Judith full_name: A. Stafford, Judith last_name: A. Stafford - first_name: Clemens full_name: A. Szyperski, Clemens last_name: A. Szyperski page: 84--102 publication: Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers series_title: Lecture Notes in Computer Science status: public title: Refinement and Consistency in Component Models with Multiple Views type: conference user_id: '29719' 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: '3235' author: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Wehrheim H. Refinement and Consistency in Multiview Models. In: B{\’{e}}zivin J, Heckel R, eds. Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004. Dagstuhl Seminar Proceedings. ; 2004.' apa: Wehrheim, H. (2004). Refinement and Consistency in Multiview Models. In J. B{\’{e}}zivin & R. Heckel (Eds.), Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004. bibtex: '@inproceedings{Wehrheim_2004, series={Dagstuhl Seminar Proceedings}, title={Refinement and Consistency in Multiview Models}, booktitle={Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004}, author={Wehrheim, Heike}, editor={B{\’{e}}zivin, Jean and Heckel, ReikoEditors}, year={2004}, collection={Dagstuhl Seminar Proceedings} }' chicago: Wehrheim, Heike. “Refinement and Consistency in Multiview Models.” In Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004, edited by Jean B{\’{e}}zivin and Reiko Heckel. Dagstuhl Seminar Proceedings, 2004. ieee: H. Wehrheim, “Refinement and Consistency in Multiview Models,” in Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004, 2004. mla: Wehrheim, Heike. “Refinement and Consistency in Multiview Models.” Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004, edited by Jean B{\’{e}}zivin and Reiko Heckel, 2004. short: 'H. Wehrheim, in: J. B{\’{e}}zivin, R. Heckel (Eds.), Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004, 2004.' date_created: 2018-06-14T06:48:55Z date_updated: 2022-01-06T06:59:06Z department: - _id: '77' editor: - first_name: Jean full_name: B{\'{e}}zivin, Jean last_name: B{\'{e}}zivin - first_name: Reiko full_name: Heckel, Reiko last_name: Heckel publication: Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004 series_title: Dagstuhl Seminar Proceedings status: public title: Refinement and Consistency in Multiview Models 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: '3017' author: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer - first_name: Martin full_name: Otto, Martin last_name: Otto - first_name: Jean-Pierre full_name: Seifert, Jean-Pierre last_name: Seifert citation: ama: 'Blömer J, Otto M, Seifert J-P. A new CRT-RSA algorithm secure against bellcore attacks. In: Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03. ACM Press; 2004. doi:10.1145/948109.948151' apa: Blömer, J., Otto, M., & Seifert, J.-P. (2004). A new CRT-RSA algorithm secure against bellcore attacks. In Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03. ACM Press. https://doi.org/10.1145/948109.948151 bibtex: '@inproceedings{Blömer_Otto_Seifert_2004, title={A new CRT-RSA algorithm secure against bellcore attacks}, DOI={10.1145/948109.948151}, booktitle={Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03}, publisher={ACM Press}, author={Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}, year={2004} }' chicago: Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.” In Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03. ACM Press, 2004. https://doi.org/10.1145/948109.948151. ieee: J. Blömer, M. Otto, and J.-P. Seifert, “A new CRT-RSA algorithm secure against bellcore attacks,” in Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03, 2004. mla: Blömer, Johannes, et al. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.” Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03, ACM Press, 2004, doi:10.1145/948109.948151. short: 'J. Blömer, M. Otto, J.-P. Seifert, in: Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03, ACM Press, 2004.' date_created: 2018-06-05T08:24:48Z date_updated: 2022-01-06T06:58:51Z department: - _id: '64' doi: 10.1145/948109.948151 publication: Proceedings of the 10th ACM conference on Computer and communication security - CCS '03 publication_identifier: isbn: - '1581137389' publication_status: published publisher: ACM Press status: public title: A new CRT-RSA algorithm secure against bellcore attacks type: conference user_id: '25078' year: '2004' ... --- _id: '26992' author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: Rührup S, Schindelhauer C. Traffic and Hop Efficient Position-Based Routing Using a Cell Structure.; 2004. apa: Rührup, S., & Schindelhauer, C. (2004). Traffic and Hop Efficient Position-based Routing using a Cell Structure. bibtex: '@book{Rührup_Schindelhauer_2004, place={Heinz Nixdorf Institut, Universität Paderborn}, title={Traffic and Hop Efficient Position-based Routing using a Cell Structure}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2004} }' chicago: Rührup, Stefan, and Christian Schindelhauer. Traffic and Hop Efficient Position-Based Routing Using a Cell Structure. Heinz Nixdorf Institut, Universität Paderborn, 2004. ieee: S. Rührup and C. Schindelhauer, Traffic and Hop Efficient Position-based Routing using a Cell Structure. Heinz Nixdorf Institut, Universität Paderborn, 2004. mla: Rührup, Stefan, and Christian Schindelhauer. Traffic and Hop Efficient Position-Based Routing Using a Cell Structure. 2004. short: S. Rührup, C. Schindelhauer, Traffic and Hop Efficient Position-Based Routing Using a Cell Structure, Heinz Nixdorf Institut, Universität Paderborn, 2004. date_created: 2021-10-28T11:59:31Z date_updated: 2022-01-06T06:57:32Z ddc: - '000' department: - _id: '63' - _id: '26' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2021-10-28T11:58:56Z date_updated: 2021-10-28T11:58:56Z file_id: '26993' file_name: techreport-hniid-2024.pdf file_size: 234517 relation: main_file success: 1 file_date_updated: 2021-10-28T11:58:56Z has_accepted_license: '1' language: - iso: eng place: Heinz Nixdorf Institut, Universität Paderborn status: public title: Traffic and Hop Efficient Position-based Routing using a Cell Structure type: report user_id: '15415' year: '2004' ... --- _id: '20933' abstract: - lang: eng text: Today, in software intensive projects a huge amount of the budget flows into the analysis of the already existing system. The reason for the high costs results mainly from the fact that analyses are often made manually or with automatic tool support, which is inappropriate for analyzing large systems. Semi-automatic analysis approaches usually use a notion of fuzziness to overcome this limitation, but inherit the problem of selecting appropriate initial values. In this paper we present an approach to adapt the initial values of our semi-automatic reverse engineering process. We provide the reverse engineer with accuracy information for results produced by a rule-based inference algorithm. Based on the changes of the results done by the reverse engineer we automatically adapt a credibility value of each rule, which previously has been used to compute the accuracy of the result. The adaption fits seamlessly into our overall analysis process. First tests show that it is suitable for the calibration of our fuzzyfied rule-based pattern recognition approach. author: - first_name: Jörrg full_name: Niere, Jörrg last_name: Niere - first_name: Matthias full_name: Meyer, Matthias id: '683' last_name: Meyer - first_name: Lothar full_name: Wendehals, Lothar last_name: Wendehals citation: ama: Niere J, Meyer M, Wendehals L. User-Driven Adaption in Rule-Based Pattern Recognition.; 2004. apa: Niere, J., Meyer, M., & Wendehals, L. (2004). User-driven adaption in rule-based pattern recognition. bibtex: '@book{Niere_Meyer_Wendehals_2004, place={Paderborn, Germany}, title={User-driven adaption in rule-based pattern recognition}, author={Niere, Jörrg and Meyer, Matthias and Wendehals, Lothar}, year={2004} }' chicago: Niere, Jörrg, Matthias Meyer, and Lothar Wendehals. User-Driven Adaption in Rule-Based Pattern Recognition. Paderborn, Germany, 2004. ieee: J. Niere, M. Meyer, and L. Wendehals, User-driven adaption in rule-based pattern recognition. Paderborn, Germany, 2004. mla: Niere, Jörrg, et al. User-Driven Adaption in Rule-Based Pattern Recognition. 2004. short: J. Niere, M. Meyer, L. Wendehals, User-Driven Adaption in Rule-Based Pattern Recognition, Paderborn, Germany, 2004. date_created: 2021-01-13T10:00:00Z date_updated: 2022-01-06T06:54:41Z department: - _id: '76' language: - iso: eng place: Paderborn, Germany status: public title: User-driven adaption in rule-based pattern recognition type: report user_id: '5786' year: '2004' ... --- _id: '2119' author: - first_name: Petr full_name: Kolman, Petr last_name: Kolman - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: Kolman P, Scheideler C. Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica. 2004;(3):209--233. doi:10.1007/s00453-004-1086-1 apa: Kolman, P., & Scheideler, C. (2004). Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica, (3), 209--233. https://doi.org/10.1007/s00453-004-1086-1 bibtex: '@article{Kolman_Scheideler_2004, title={Simple On-Line Algorithms for the Maximum Disjoint Paths Problem}, DOI={10.1007/s00453-004-1086-1}, number={3}, journal={Algorithmica}, author={Kolman, Petr and Scheideler, Christian}, year={2004}, pages={209--233} }' chicago: 'Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” Algorithmica, no. 3 (2004): 209--233. https://doi.org/10.1007/s00453-004-1086-1.' ieee: P. Kolman and C. Scheideler, “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem,” Algorithmica, no. 3, pp. 209--233, 2004. mla: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” Algorithmica, no. 3, 2004, pp. 209--233, doi:10.1007/s00453-004-1086-1. short: P. Kolman, C. Scheideler, Algorithmica (2004) 209--233. date_created: 2018-04-03T05:30:23Z date_updated: 2022-01-06T06:54:49Z department: - _id: '79' doi: 10.1007/s00453-004-1086-1 issue: '3' page: 209--233 publication: Algorithmica status: public title: Simple On-Line Algorithms for the Maximum Disjoint Paths Problem type: journal_article user_id: '15504' year: '2004' ... --- _id: '2120' author: - first_name: Baruch full_name: Awerbuch, Baruch last_name: Awerbuch - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Awerbuch B, Scheideler C. Group Spreading: A Protocol for Provably Secure Distributed Name Service. In: ICALP. Vol 3142. Lecture Notes in Computer Science. ; 2004:183--195.' apa: 'Awerbuch, B., & Scheideler, C. (2004). Group Spreading: A Protocol for Provably Secure Distributed Name Service. In ICALP (Vol. 3142, pp. 183--195).' bibtex: '@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer Science}, title={Group Spreading: A Protocol for Provably Secure Distributed Name Service}, volume={3142}, booktitle={ICALP}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={183--195}, collection={Lecture Notes in Computer Science} }' chicago: 'Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” In ICALP, 3142:183--195. Lecture Notes in Computer Science, 2004.' ieee: 'B. Awerbuch and C. Scheideler, “Group Spreading: A Protocol for Provably Secure Distributed Name Service,” in ICALP, 2004, vol. 3142, pp. 183--195.' mla: 'Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” ICALP, vol. 3142, 2004, pp. 183--195.' short: 'B. Awerbuch, C. Scheideler, in: ICALP, 2004, pp. 183--195.' date_created: 2018-04-03T05:31:04Z date_updated: 2022-01-06T06:54:49Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:20:16Z date_updated: 2018-04-12T09:20:16Z file_id: '2312' file_name: ICALP-04.pdf file_size: 145383 relation: main_file file_date_updated: 2018-04-12T09:20:16Z has_accepted_license: '1' intvolume: ' 3142' oa: '1' page: 183--195 publication: ICALP series_title: Lecture Notes in Computer Science status: public title: 'Group Spreading: A Protocol for Provably Secure Distributed Name Service' type: conference urn: '21200' user_id: '15504' volume: 3142 year: '2004' ... --- _id: '2121' author: - first_name: Chris full_name: Riley, Chris last_name: Riley - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Riley C, Scheideler C. A Distributed Hash Table for Computational Grids. In: IPDPS. ; 2004.' apa: Riley, C., & Scheideler, C. (2004). A Distributed Hash Table for Computational Grids. In IPDPS. bibtex: '@inproceedings{Riley_Scheideler_2004, title={A Distributed Hash Table for Computational Grids}, booktitle={IPDPS}, author={Riley, Chris and Scheideler, Christian}, year={2004} }' chicago: Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” In IPDPS, 2004. ieee: C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,” in IPDPS, 2004. mla: Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” IPDPS, 2004. short: 'C. Riley, C. Scheideler, in: IPDPS, 2004.' date_created: 2018-04-03T05:31:59Z date_updated: 2022-01-06T06:54:50Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:50:26Z date_updated: 2018-04-12T09:50:26Z file_id: '2316' file_name: IPDPS-04.pdf file_size: 91542 relation: main_file file_date_updated: 2018-04-12T09:50:26Z has_accepted_license: '1' oa: '1' publication: IPDPS status: public title: A Distributed Hash Table for Computational Grids type: conference urn: '21212' user_id: '15504' year: '2004' ... --- _id: '2122' author: - first_name: Baruch full_name: Awerbuch, Baruch last_name: Awerbuch - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Awerbuch B, Scheideler C. Robust Distributed Name Service. In: IPTPS. Vol 3279. Lecture Notes in Computer Science. ; 2004:237--249.' apa: Awerbuch, B., & Scheideler, C. (2004). Robust Distributed Name Service. In IPTPS (Vol. 3279, pp. 237--249). bibtex: '@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer Science}, title={Robust Distributed Name Service}, volume={3279}, booktitle={IPTPS}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={237--249}, collection={Lecture Notes in Computer Science} }' chicago: Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” In IPTPS, 3279:237--249. Lecture Notes in Computer Science, 2004. ieee: B. Awerbuch and C. Scheideler, “Robust Distributed Name Service,” in IPTPS, 2004, vol. 3279, pp. 237--249. mla: Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” IPTPS, vol. 3279, 2004, pp. 237--249. short: 'B. Awerbuch, C. Scheideler, in: IPTPS, 2004, pp. 237--249.' date_created: 2018-04-03T05:32:33Z date_updated: 2022-01-06T06:54:50Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T11:39:38Z date_updated: 2018-04-12T11:39:38Z file_id: '2318' file_name: IPTPS-04.pdf file_size: 136987 relation: main_file file_date_updated: 2018-04-12T11:39:38Z has_accepted_license: '1' intvolume: ' 3279' oa: '1' page: 237--249 publication: IPTPS series_title: Lecture Notes in Computer Science status: public title: Robust Distributed Name Service type: conference urn: '21229' user_id: '15504' volume: 3279 year: '2004' ... --- _id: '2123' author: - first_name: Giuseppe full_name: Ateniese, Giuseppe last_name: Ateniese - first_name: Chris full_name: Riley, Chris last_name: Riley - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks. In: IWIA. ; 2004:33--47.' apa: Ateniese, G., Riley, C., & Scheideler, C. (2004). Survivable Monitoring in Dynamic Networks. In IWIA (pp. 33--47). bibtex: '@inproceedings{Ateniese_Riley_Scheideler_2004, title={Survivable Monitoring in Dynamic Networks}, booktitle={IWIA}, author={Ateniese, Giuseppe and Riley, Chris and Scheideler, Christian}, year={2004}, pages={33--47} }' chicago: Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.” In IWIA, 33--47, 2004. ieee: G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” in IWIA, 2004, pp. 33--47. mla: Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IWIA, 2004, pp. 33--47. short: 'G. Ateniese, C. Riley, C. Scheideler, in: IWIA, 2004, pp. 33--47.' date_created: 2018-04-03T05:33:37Z date_updated: 2022-01-06T06:54:50Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T11:38:22Z date_updated: 2018-04-12T11:38:22Z file_id: '2317' file_name: IIAW-04.pdf file_size: 255111 relation: main_file file_date_updated: 2018-04-12T11:38:22Z has_accepted_license: '1' oa: '1' page: 33--47 publication: IWIA status: public title: Survivable Monitoring in Dynamic Networks type: conference urn: '21238' user_id: '15504' year: '2004' ... --- _id: '2124' author: - first_name: Baruch full_name: Awerbuch, Baruch last_name: Awerbuch - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Awerbuch B, Scheideler C. The hyperring: a low-congestion deterministic data structure for distributed environments. In: SODA. ; 2004:318--327.' apa: 'Awerbuch, B., & Scheideler, C. (2004). The hyperring: a low-congestion deterministic data structure for distributed environments. In SODA (pp. 318--327).' bibtex: '@inproceedings{Awerbuch_Scheideler_2004, title={The hyperring: a low-congestion deterministic data structure for distributed environments}, booktitle={SODA}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={318--327} }' chicago: 'Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” In SODA, 318--327, 2004.' ieee: 'B. Awerbuch and C. Scheideler, “The hyperring: a low-congestion deterministic data structure for distributed environments,” in SODA, 2004, pp. 318--327.' mla: 'Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” SODA, 2004, pp. 318--327.' short: 'B. Awerbuch, C. Scheideler, in: SODA, 2004, pp. 318--327.' date_created: 2018-04-03T05:34:17Z date_updated: 2022-01-06T06:54:51Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-13T08:36:08Z date_updated: 2018-04-13T08:36:08Z file_id: '2323' file_name: SODA-04.pdf file_size: 193831 relation: main_file file_date_updated: 2018-04-13T08:36:08Z has_accepted_license: '1' oa: '1' page: 318--327 publication: SODA status: public title: 'The hyperring: a low-congestion deterministic data structure for distributed environments' type: conference urn: '21247' user_id: '15504' year: '2004' ... --- _id: '2125' author: - first_name: Baruch full_name: Awerbuch, Baruch last_name: Awerbuch - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Awerbuch B, Scheideler C. Consistent and compact data management in distributed storage systems. In: SPAA. ; 2004:44--53.' apa: Awerbuch, B., & Scheideler, C. (2004). Consistent and compact data management in distributed storage systems. In SPAA (pp. 44--53). bibtex: '@inproceedings{Awerbuch_Scheideler_2004, title={Consistent and compact data management in distributed storage systems}, booktitle={SPAA}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={44--53} }' chicago: Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” In SPAA, 44--53, 2004. ieee: B. Awerbuch and C. Scheideler, “Consistent and compact data management in distributed storage systems,” in SPAA, 2004, pp. 44--53. mla: Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” SPAA, 2004, pp. 44--53. short: 'B. Awerbuch, C. Scheideler, in: SPAA, 2004, pp. 44--53.' date_created: 2018-04-03T05:34:56Z date_updated: 2022-01-06T06:54:51Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:41:38Z date_updated: 2018-04-12T09:41:38Z file_id: '2315' file_name: AS-SPAA-04.pdf file_size: 170429 relation: main_file file_date_updated: 2018-04-12T09:41:38Z has_accepted_license: '1' oa: '1' page: 44--53 publication: SPAA status: public title: Consistent and compact data management in distributed storage systems type: conference urn: '21256' user_id: '15504' year: '2004' ... --- _id: '2126' author: - first_name: Ankur full_name: Bhargava, Ankur last_name: Bhargava - first_name: Kishore full_name: Kothapalli, Kishore last_name: Kothapalli - first_name: Chris full_name: Riley, Chris last_name: Riley - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Mark full_name: Thober, Mark last_name: Thober citation: ama: 'Bhargava A, Kothapalli K, Riley C, Scheideler C, Thober M. Pagoda: a dynamic overlay network for routing, data management, and multicasting. In: SPAA. ; 2004:170--179.' apa: 'Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., & Thober, M. (2004). Pagoda: a dynamic overlay network for routing, data management, and multicasting. In SPAA (pp. 170--179).' bibtex: '@inproceedings{Bhargava_Kothapalli_Riley_Scheideler_Thober_2004, title={Pagoda: a dynamic overlay network for routing, data management, and multicasting}, booktitle={SPAA}, author={Bhargava, Ankur and Kothapalli, Kishore and Riley, Chris and Scheideler, Christian and Thober, Mark}, year={2004}, pages={170--179} }' chicago: 'Bhargava, Ankur, Kishore Kothapalli, Chris Riley, Christian Scheideler, and Mark Thober. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” In SPAA, 170--179, 2004.' ieee: 'A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, and M. Thober, “Pagoda: a dynamic overlay network for routing, data management, and multicasting,” in SPAA, 2004, pp. 170--179.' mla: 'Bhargava, Ankur, et al. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” SPAA, 2004, pp. 170--179.' short: 'A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, M. Thober, in: SPAA, 2004, pp. 170--179.' date_created: 2018-04-03T05:35:31Z date_updated: 2022-01-06T06:54:52Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:40:12Z date_updated: 2018-04-12T09:40:42Z file_id: '2314' file_name: BKRST-SPAA-04.pdf file_size: 118175 relation: main_file file_date_updated: 2018-04-12T09:40:42Z has_accepted_license: '1' oa: '1' page: 170--179 publication: SPAA status: public title: 'Pagoda: a dynamic overlay network for routing, data management, and multicasting' type: conference urn: '21266' user_id: '15504' year: '2004' ... --- _id: '2127' author: - first_name: Amitabha full_name: Bagchi, Amitabha last_name: Bagchi - first_name: Ankur full_name: Bhargava, Ankur last_name: Bhargava - first_name: Amitabh full_name: Chaudhary, Amitabh last_name: Chaudhary - first_name: David full_name: Eppstein, David last_name: Eppstein - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The effect of faults on network expansion. In: SPAA. ACM; 2004:286--293.' apa: Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., & Scheideler, C. (2004). The effect of faults on network expansion. In SPAA (pp. 286--293). ACM. bibtex: '@inproceedings{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2004, title={The effect of faults on network expansion}, booktitle={SPAA}, publisher={ACM}, author={Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2004}, pages={286--293} }' chicago: Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and Christian Scheideler. “The Effect of Faults on Network Expansion.” In SPAA, 286--293. ACM, 2004. ieee: A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The effect of faults on network expansion,” in SPAA, 2004, pp. 286--293. mla: Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” SPAA, ACM, 2004, pp. 286--293. short: 'A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, in: SPAA, ACM, 2004, pp. 286--293.' date_created: 2018-04-03T05:36:11Z date_updated: 2022-01-06T06:54:52Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:21:24Z date_updated: 2018-04-12T09:21:24Z file_id: '2313' file_name: BBCES-SPAA-04.pdf file_size: 197503 relation: main_file file_date_updated: 2018-04-12T09:21:24Z has_accepted_license: '1' oa: '1' page: 286--293 publication: SPAA publisher: ACM status: public title: The effect of faults on network expansion type: conference urn: '21276' user_id: '15504' year: '2004' ... --- _id: '17346' author: - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Michael full_name: Heidebuer, Michael last_name: Heidebuer - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: 'Ulrich ' full_name: 'Rückert, Ulrich ' last_name: Rückert - first_name: Kay full_name: Salzwedel, Kay last_name: Salzwedel - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek citation: ama: 'Brinkmann A, Heidebuer M, Meyer auf der Heide F, Rückert U, Salzwedel K, Vodisek M. V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. In: Kobler B, Hariharan PC, eds. 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA. IEEE; 2004:153--157.' apa: Brinkmann, A., Heidebuer, M., Meyer auf der Heide, F., Rückert, U., Salzwedel, K., & Vodisek, M. (2004). V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. In B. Kobler & P. C. Hariharan (Eds.), 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA (pp. 153--157). IEEE. bibtex: '@inproceedings{Brinkmann_Heidebuer_Meyer auf der Heide_Rückert_Salzwedel_Vodisek_2004, title={V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System}, booktitle={21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA}, publisher={IEEE}, author={Brinkmann, André and Heidebuer, Michael and Meyer auf der Heide, Friedhelm and Rückert, Ulrich and Salzwedel, Kay and Vodisek, Mario}, editor={Kobler, Ben and Hariharan, P. C.Editors}, year={2004}, pages={153--157} }' chicago: Brinkmann, André, Michael Heidebuer, Friedhelm Meyer auf der Heide, Ulrich Rückert, Kay Salzwedel, and Mario Vodisek. “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.” In 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA, edited by Ben Kobler and P. C. Hariharan, 153--157. IEEE, 2004. ieee: A. Brinkmann, M. Heidebuer, F. Meyer auf der Heide, U. Rückert, K. Salzwedel, and M. Vodisek, “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System,” in 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA, 2004, pp. 153--157. mla: Brinkmann, André, et al. “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.” 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA, edited by Ben Kobler and P. C. Hariharan, IEEE, 2004, pp. 153--157. short: 'A. Brinkmann, M. Heidebuer, F. Meyer auf der Heide, U. Rückert, K. Salzwedel, M. Vodisek, in: B. Kobler, P.C. Hariharan (Eds.), 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA, IEEE, 2004, pp. 153--157.' date_created: 2020-06-26T13:30:51Z date_updated: 2022-01-06T06:53:08Z department: - _id: '63' editor: - first_name: Ben full_name: Kobler, Ben last_name: Kobler - first_name: P. C. full_name: Hariharan, P. C. last_name: Hariharan language: - iso: eng page: 153--157 publication: 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA publisher: IEEE status: public title: V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System type: conference user_id: '15415' year: '2004' ...