[{"author":[{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"title":"Refinement and Consistency in Component Models with Multiple Views","status":"public","year":"2004","date_updated":"2022-01-06T06:59:06Z","_id":"3233","series_title":"Lecture Notes in Computer Science","page":"84--102","editor":[{"last_name":"H. Reussner","first_name":"Ralf","full_name":"H. Reussner, Ralf"},{"full_name":"A. Stafford, Judith","last_name":"A. Stafford","first_name":"Judith"},{"first_name":"Clemens","last_name":"A. Szyperski","full_name":"A. Szyperski, Clemens"}],"doi":"10.1007/11786160_5","user_id":"29719","citation":{"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.","chicago":"Wehrheim, Heike. “Refinement and Consistency in Component Models with Multiple Views.” In <i>Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers</i>, edited by Ralf H. Reussner, Judith A. Stafford, and Clemens A. Szyperski, 84--102. Lecture Notes in Computer Science, 2004. <a href=\"https://doi.org/10.1007/11786160_5\">https://doi.org/10.1007/11786160_5</a>.","apa":"Wehrheim, H. (2004). Refinement and Consistency in Component Models with Multiple Views. In R. H. Reussner, J. A. Stafford, &#38; C. A. Szyperski (Eds.), <i>Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers</i> (pp. 84--102). <a href=\"https://doi.org/10.1007/11786160_5\">https://doi.org/10.1007/11786160_5</a>","ieee":"H. Wehrheim, “Refinement and Consistency in Component Models with Multiple Views,” in <i>Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers</i>, 2004, pp. 84--102.","ama":"Wehrheim H. Refinement and Consistency in Component Models with Multiple Views. In: H. Reussner R, A. Stafford J, A. Szyperski C, eds. <i>Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers</i>. Lecture Notes in Computer Science. ; 2004:84--102. doi:<a href=\"https://doi.org/10.1007/11786160_5\">10.1007/11786160_5</a>","bibtex":"@inproceedings{Wehrheim_2004, series={Lecture Notes in Computer Science}, title={Refinement and Consistency in Component Models with Multiple Views}, DOI={<a href=\"https://doi.org/10.1007/11786160_5\">10.1007/11786160_5</a>}, 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} }","mla":"Wehrheim, Heike. “Refinement and Consistency in Component Models with Multiple Views.” <i>Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers</i>, edited by Ralf H. Reussner et al., 2004, pp. 84--102, doi:<a href=\"https://doi.org/10.1007/11786160_5\">10.1007/11786160_5</a>."},"publication":"Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers","date_created":"2018-06-14T06:46:31Z","department":[{"_id":"77"}],"type":"conference"},{"publication":"Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings","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. <i>Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings</i>. Lecture Notes in Computer Science. ; 2004:267--286. doi:<a href=\"https://doi.org/10.1007/978-3-540-24756-2_15\">10.1007/978-3-540-24756-2_15</a>","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={<a href=\"https://doi.org/10.1007/978-3-540-24756-2_15\">10.1007/978-3-540-24756-2_15</a>}, 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} }","mla":"Möller, Michael, et al. “Linking {CSP-OZ} with {UML} and Java: {A} Case Study.” <i>Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings</i>, edited by Eerke A. Boiten et al., 2004, pp. 267--286, doi:<a href=\"https://doi.org/10.1007/978-3-540-24756-2_15\">10.1007/978-3-540-24756-2_15</a>.","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.","chicago":"Möller, Michael, Ernst-Rüdiger Olderog, Holger Rasch, and Heike Wehrheim. “Linking {CSP-OZ} with {UML} and Java: {A} Case Study.” In <i>Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings</i>, edited by Eerke A. Boiten, John Derrick, and Graeme Smith, 267--286. Lecture Notes in Computer Science, 2004. <a href=\"https://doi.org/10.1007/978-3-540-24756-2_15\">https://doi.org/10.1007/978-3-540-24756-2_15</a>.","apa":"Möller, M., Olderog, E.-R., Rasch, H., &#38; Wehrheim, H. (2004). Linking {CSP-OZ} with {UML} and Java: {A} Case Study. In E. A. Boiten, J. Derrick, &#38; G. Smith (Eds.), <i>Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings</i> (pp. 267--286). <a href=\"https://doi.org/10.1007/978-3-540-24756-2_15\">https://doi.org/10.1007/978-3-540-24756-2_15</a>","ieee":"M. Möller, E.-R. Olderog, H. Rasch, and H. Wehrheim, “Linking {CSP-OZ} with {UML} and Java: {A} Case Study,” in <i>Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings</i>, 2004, pp. 267--286."},"type":"conference","department":[{"_id":"77"}],"date_created":"2018-06-14T06:47:35Z","date_updated":"2022-01-06T06:59:06Z","year":"2004","status":"public","title":"Linking {CSP-OZ} with {UML} and Java: {A} Case Study","author":[{"full_name":"Möller, Michael","last_name":"Möller","first_name":"Michael"},{"first_name":"Ernst-Rüdiger","last_name":"Olderog","full_name":"Olderog, Ernst-Rüdiger"},{"full_name":"Rasch, Holger","first_name":"Holger","last_name":"Rasch"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"user_id":"29719","doi":"10.1007/978-3-540-24756-2_15","editor":[{"full_name":"A. Boiten, Eerke","first_name":"Eerke","last_name":"A. Boiten"},{"full_name":"Derrick, John","last_name":"Derrick","first_name":"John"},{"full_name":"Smith, Graeme","last_name":"Smith","first_name":"Graeme"}],"page":"267--286","_id":"3234","series_title":"Lecture Notes in Computer Science"},{"citation":{"mla":"Wehrheim, Heike. “Refinement and Consistency in Multiview Models.” <i>Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004</i>, edited by Jean B{\\’{e}}zivin and Reiko Heckel, 2004.","ama":"Wehrheim H. Refinement and Consistency in Multiview Models. In: B{\\’{e}}zivin J, Heckel R, eds. <i>Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004</i>. Dagstuhl Seminar Proceedings. ; 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} }","apa":"Wehrheim, H. (2004). Refinement and Consistency in Multiview Models. In J. B{\\’{e}}zivin &#38; R. Heckel (Eds.), <i>Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004</i>.","ieee":"H. Wehrheim, “Refinement and Consistency in Multiview Models,” in <i>Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004</i>, 2004.","chicago":"Wehrheim, Heike. “Refinement and Consistency in Multiview Models.” In <i>Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004</i>, edited by Jean B{\\’{e}}zivin and Reiko Heckel. Dagstuhl Seminar Proceedings, 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."},"publication":"Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004","department":[{"_id":"77"}],"type":"conference","date_created":"2018-06-14T06:48:55Z","date_updated":"2022-01-06T06:59:06Z","author":[{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"title":"Refinement and Consistency in Multiview Models","status":"public","year":"2004","editor":[{"full_name":"B{\\'{e}}zivin, Jean","first_name":"Jean","last_name":"B{\\'{e}}zivin"},{"full_name":"Heckel, Reiko","last_name":"Heckel","first_name":"Reiko"}],"user_id":"29719","_id":"3235","series_title":"Dagstuhl Seminar Proceedings"},{"user_id":"25078","doi":"10.1007/978-3-540-30564-4_5","publisher":"Springer Berlin Heidelberg","_id":"3011","page":"69-83","publication_status":"published","date_updated":"2022-01-06T06:58:51Z","author":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"},{"full_name":"Guajardo, Jorge","last_name":"Guajardo","first_name":"Jorge"},{"full_name":"Krummel, Volker","last_name":"Krummel","first_name":"Volker"}],"publication_identifier":{"isbn":["9783540243274","9783540305644"],"issn":["0302-9743","1611-3349"]},"status":"public","year":"2004","title":"Provably Secure Masking of AES","department":[{"_id":"64"}],"type":"book_chapter","date_created":"2018-06-05T08:20:20Z","place":"Berlin, Heidelberg","citation":{"ama":"Blömer J, Guajardo J, Krummel V. Provably Secure Masking of AES. In: <i>Selected Areas in Cryptography</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:69-83. doi:<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>","bibtex":"@inbook{Blömer_Guajardo_Krummel_2004, place={Berlin, Heidelberg}, title={Provably Secure Masking of AES}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>}, booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Guajardo, Jorge and Krummel, Volker}, year={2004}, pages={69–83} }","mla":"Blömer, Johannes, et al. “Provably Secure Masking of AES.” <i>Selected Areas in Cryptography</i>, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>.","chicago":"Blömer, Johannes, Jorge Guajardo, and Volker Krummel. “Provably Secure Masking of AES.” In <i>Selected Areas in Cryptography</i>, 69–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">https://doi.org/10.1007/978-3-540-30564-4_5</a>.","short":"J. Blömer, J. Guajardo, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 69–83.","apa":"Blömer, J., Guajardo, J., &#38; Krummel, V. (2004). Provably Secure Masking of AES. In <i>Selected Areas in Cryptography</i> (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">https://doi.org/10.1007/978-3-540-30564-4_5</a>","ieee":"J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,” in <i>Selected Areas in Cryptography</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 69–83."},"publication":"Selected Areas in Cryptography"},{"citation":{"chicago":"Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” In <i>Public Key Cryptography – PKC 2004</i>, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">https://doi.org/10.1007/978-3-540-24632-9_1</a>.","short":"J. Blömer, A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 1–13.","ieee":"J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in <i>Public Key Cryptography – PKC 2004</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 1–13.","apa":"Blömer, J., &#38; May, A. (2004). A Generalized Wiener Attack on RSA. In <i>Public Key Cryptography – PKC 2004</i> (pp. 1–13). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">https://doi.org/10.1007/978-3-540-24632-9_1</a>","bibtex":"@inbook{Blömer_May_2004, place={Berlin, Heidelberg}, title={A Generalized Wiener Attack on RSA}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">10.1007/978-3-540-24632-9_1</a>}, booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2004}, pages={1–13} }","ama":"Blömer J, May A. A Generalized Wiener Attack on RSA. In: <i>Public Key Cryptography – PKC 2004</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:1-13. doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">10.1007/978-3-540-24632-9_1</a>","mla":"Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” <i>Public Key Cryptography – PKC 2004</i>, Springer Berlin Heidelberg, 2004, pp. 1–13, doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">10.1007/978-3-540-24632-9_1</a>."},"file_date_updated":"2018-06-05T08:21:31Z","place":"Berlin, Heidelberg","has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"25078","publisher":"Springer Berlin Heidelberg","_id":"3012","page":"1-13","publication":"Public Key Cryptography – PKC 2004","department":[{"_id":"64"}],"type":"book_chapter","date_created":"2018-06-05T08:20:59Z","file":[{"creator":"feidens","date_created":"2018-06-05T08:21:31Z","file_name":"keys.pdf","access_level":"closed","file_size":198120,"relation":"main_file","date_updated":"2018-06-05T08:21:31Z","file_id":"3013","success":1,"content_type":"application/pdf"}],"date_updated":"2022-01-06T06:58:51Z","publication_status":"published","publication_identifier":{"isbn":["9783540210184","9783540246329"],"issn":["0302-9743","1611-3349"]},"author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"full_name":"May, Alexander","first_name":"Alexander","last_name":"May"}],"year":"2004","title":"A Generalized Wiener Attack on RSA","doi":"10.1007/978-3-540-24632-9_1"},{"title":"Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q","year":"2004","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540210184","9783540246329"]},"author":[{"full_name":"May, Alexander","first_name":"Alexander","last_name":"May"}],"date_updated":"2022-01-06T06:58:51Z","publication_status":"published","page":"218-230","_id":"3014","publisher":"Springer Berlin Heidelberg","doi":"10.1007/978-3-540-24632-9_16","user_id":"25078","publication":"Public Key Cryptography – PKC 2004","citation":{"chicago":"May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^{r}q.” In <i>Public Key Cryptography – PKC 2004</i>, 218–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">https://doi.org/10.1007/978-3-540-24632-9_16</a>.","ama":"May A. Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q. In: <i>Public Key Cryptography – PKC 2004</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:218-230. doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">10.1007/978-3-540-24632-9_16</a>","short":"A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 218–230.","bibtex":"@inbook{May_2004, place={Berlin, Heidelberg}, title={Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">10.1007/978-3-540-24632-9_16</a>}, booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg}, author={May, Alexander}, year={2004}, pages={218–230} }","apa":"May, A. (2004). Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q. In <i>Public Key Cryptography – PKC 2004</i> (pp. 218–230). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">https://doi.org/10.1007/978-3-540-24632-9_16</a>","mla":"May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^{r}q.” <i>Public Key Cryptography – PKC 2004</i>, Springer Berlin Heidelberg, 2004, pp. 218–30, doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">10.1007/978-3-540-24632-9_16</a>.","ieee":"A. May, “Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q,” in <i>Public Key Cryptography – PKC 2004</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 218–230."},"place":"Berlin, Heidelberg","date_created":"2018-06-05T08:22:02Z","type":"book_chapter","department":[{"_id":"64"}]},{"publication":"Advances in Cryptology – CRYPTO 2004","citation":{"ama":"May A. Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In: <i>Advances in Cryptology – CRYPTO 2004</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:213-219. doi:<a href=\"https://doi.org/10.1007/978-3-540-28628-8_13\">10.1007/978-3-540-28628-8_13</a>","bibtex":"@inbook{May_2004, place={Berlin, Heidelberg}, title={Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-28628-8_13\">10.1007/978-3-540-28628-8_13</a>}, booktitle={Advances in Cryptology – CRYPTO 2004}, publisher={Springer Berlin Heidelberg}, author={May, Alexander}, year={2004}, pages={213–219} }","mla":"May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.” <i>Advances in Cryptology – CRYPTO 2004</i>, Springer Berlin Heidelberg, 2004, pp. 213–19, doi:<a href=\"https://doi.org/10.1007/978-3-540-28628-8_13\">10.1007/978-3-540-28628-8_13</a>.","short":"A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 213–219.","chicago":"May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.” In <i>Advances in Cryptology – CRYPTO 2004</i>, 213–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-28628-8_13\">https://doi.org/10.1007/978-3-540-28628-8_13</a>.","apa":"May, A. (2004). Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In <i>Advances in Cryptology – CRYPTO 2004</i> (pp. 213–219). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-28628-8_13\">https://doi.org/10.1007/978-3-540-28628-8_13</a>","ieee":"A. May, “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring,” in <i>Advances in Cryptology – CRYPTO 2004</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 213–219."},"place":"Berlin, Heidelberg","date_created":"2018-06-05T08:23:43Z","type":"book_chapter","department":[{"_id":"64"}],"year":"2004","title":"Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring","status":"public","publication_identifier":{"isbn":["9783540226680","9783540286288"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"May","first_name":"Alexander","full_name":"May, Alexander"}],"date_updated":"2022-01-06T06:58:51Z","publication_status":"published","page":"213-219","publisher":"Springer Berlin Heidelberg","_id":"3015","doi":"10.1007/978-3-540-28628-8_13","user_id":"25078"},{"date_created":"2018-06-05T08:24:48Z","department":[{"_id":"64"}],"type":"conference","citation":{"ieee":"J. Blömer, M. Otto, and J.-P. Seifert, “A new CRT-RSA algorithm secure against bellcore attacks,” in <i>Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03</i>, 2004.","apa":"Blömer, J., Otto, M., &#38; Seifert, J.-P. (2004). A new CRT-RSA algorithm secure against bellcore attacks. In <i>Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03</i>. ACM Press. <a href=\"https://doi.org/10.1145/948109.948151\">https://doi.org/10.1145/948109.948151</a>","chicago":"Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.” In <i>Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03</i>. ACM Press, 2004. <a href=\"https://doi.org/10.1145/948109.948151\">https://doi.org/10.1145/948109.948151</a>.","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.","mla":"Blömer, Johannes, et al. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.” <i>Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03</i>, ACM Press, 2004, doi:<a href=\"https://doi.org/10.1145/948109.948151\">10.1145/948109.948151</a>.","bibtex":"@inproceedings{Blömer_Otto_Seifert_2004, title={A new CRT-RSA algorithm secure against bellcore attacks}, DOI={<a href=\"https://doi.org/10.1145/948109.948151\">10.1145/948109.948151</a>}, 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} }","ama":"Blömer J, Otto M, Seifert J-P. A new CRT-RSA algorithm secure against bellcore attacks. In: <i>Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03</i>. ACM Press; 2004. doi:<a href=\"https://doi.org/10.1145/948109.948151\">10.1145/948109.948151</a>"},"publication":"Proceedings of the 10th ACM conference on Computer and communication security  - CCS '03","publisher":"ACM Press","_id":"3017","doi":"10.1145/948109.948151","user_id":"25078","author":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"},{"full_name":"Otto, Martin","last_name":"Otto","first_name":"Martin"},{"first_name":"Jean-Pierre","last_name":"Seifert","full_name":"Seifert, Jean-Pierre"}],"publication_identifier":{"isbn":["1581137389"]},"title":"A new CRT-RSA algorithm secure against bellcore attacks","status":"public","year":"2004","date_updated":"2022-01-06T06:58:51Z","publication_status":"published"},{"author":[{"first_name":"Stefan","last_name":"Rührup","full_name":"Rührup, Stefan"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"title":"Traffic and Hop Efficient Position-based Routing using a Cell Structure","year":"2004","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:57:32Z","language":[{"iso":"eng"}],"_id":"26992","ddc":["000"],"user_id":"15415","citation":{"mla":"Rührup, Stefan, and Christian Schindelhauer. <i>Traffic and Hop Efficient Position-Based Routing Using a Cell Structure</i>. 2004.","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} }","ama":"Rührup S, Schindelhauer C. <i>Traffic and Hop Efficient Position-Based Routing Using a Cell Structure</i>.; 2004.","ieee":"S. Rührup and C. Schindelhauer, <i>Traffic and Hop Efficient Position-based Routing using a Cell Structure</i>. Heinz Nixdorf Institut, Universität Paderborn, 2004.","apa":"Rührup, S., &#38; Schindelhauer, C. (2004). <i>Traffic and Hop Efficient Position-based Routing using a Cell Structure</i>.","short":"S. Rührup, C. Schindelhauer, Traffic and Hop Efficient Position-Based Routing Using a Cell Structure, Heinz Nixdorf Institut, Universität Paderborn, 2004.","chicago":"Rührup, Stefan, and Christian Schindelhauer. <i>Traffic and Hop Efficient Position-Based Routing Using a Cell Structure</i>. Heinz Nixdorf Institut, Universität Paderborn, 2004."},"file_date_updated":"2021-10-28T11:58:56Z","place":"Heinz Nixdorf Institut, Universität Paderborn","date_created":"2021-10-28T11:59:31Z","file":[{"content_type":"application/pdf","success":1,"file_id":"26993","date_updated":"2021-10-28T11:58:56Z","relation":"main_file","access_level":"closed","file_size":234517,"file_name":"techreport-hniid-2024.pdf","date_created":"2021-10-28T11:58:56Z","creator":"koala"}],"department":[{"_id":"63"},{"_id":"26"}],"type":"report"},{"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."}],"citation":{"chicago":"Niere, Jörrg, Matthias Meyer, and Lothar Wendehals. <i>User-Driven Adaption in Rule-Based Pattern Recognition</i>. Paderborn, Germany, 2004.","short":"J. Niere, M. Meyer, L. Wendehals, User-Driven Adaption in Rule-Based Pattern Recognition, Paderborn, Germany, 2004.","apa":"Niere, J., Meyer, M., &#38; Wendehals, L. (2004). <i>User-driven adaption in rule-based pattern recognition</i>.","ieee":"J. Niere, M. Meyer, and L. Wendehals, <i>User-driven adaption in rule-based pattern recognition</i>. Paderborn, Germany, 2004.","ama":"Niere J, Meyer M, Wendehals L. <i>User-Driven Adaption in Rule-Based Pattern Recognition</i>.; 2004.","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} }","mla":"Niere, Jörrg, et al. <i>User-Driven Adaption in Rule-Based Pattern Recognition</i>. 2004."},"department":[{"_id":"76"}],"type":"report","date_created":"2021-01-13T10:00:00Z","place":"Paderborn, Germany","date_updated":"2022-01-06T06:54:41Z","author":[{"last_name":"Niere","first_name":"Jörrg","full_name":"Niere, Jörrg"},{"id":"683","full_name":"Meyer, Matthias","last_name":"Meyer","first_name":"Matthias"},{"last_name":"Wendehals","first_name":"Lothar","full_name":"Wendehals, Lothar"}],"year":"2004","status":"public","title":"User-driven adaption in rule-based pattern recognition","user_id":"5786","_id":"20933","language":[{"iso":"eng"}]},{"publication":"Algorithmica","issue":"3","citation":{"ieee":"P. Kolman and C. Scheideler, “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem,” <i>Algorithmica</i>, no. 3, pp. 209--233, 2004.","apa":"Kolman, P., &#38; Scheideler, C. (2004). Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. <i>Algorithmica</i>, (3), 209--233. <a href=\"https://doi.org/10.1007/s00453-004-1086-1\">https://doi.org/10.1007/s00453-004-1086-1</a>","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” <i>Algorithmica</i>, no. 3 (2004): 209--233. <a href=\"https://doi.org/10.1007/s00453-004-1086-1\">https://doi.org/10.1007/s00453-004-1086-1</a>.","short":"P. Kolman, C. Scheideler, Algorithmica (2004) 209--233.","mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” <i>Algorithmica</i>, no. 3, 2004, pp. 209--233, doi:<a href=\"https://doi.org/10.1007/s00453-004-1086-1\">10.1007/s00453-004-1086-1</a>.","bibtex":"@article{Kolman_Scheideler_2004, title={Simple On-Line Algorithms for the Maximum Disjoint Paths Problem}, DOI={<a href=\"https://doi.org/10.1007/s00453-004-1086-1\">10.1007/s00453-004-1086-1</a>}, number={3}, journal={Algorithmica}, author={Kolman, Petr and Scheideler, Christian}, year={2004}, pages={209--233} }","ama":"Kolman P, Scheideler C. Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. <i>Algorithmica</i>. 2004;(3):209--233. doi:<a href=\"https://doi.org/10.1007/s00453-004-1086-1\">10.1007/s00453-004-1086-1</a>"},"type":"journal_article","department":[{"_id":"79"}],"date_created":"2018-04-03T05:30:23Z","date_updated":"2022-01-06T06:54:49Z","year":"2004","status":"public","title":"Simple On-Line Algorithms for the Maximum Disjoint Paths Problem","author":[{"last_name":"Kolman","first_name":"Petr","full_name":"Kolman, Petr"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"user_id":"15504","doi":"10.1007/s00453-004-1086-1","page":"209--233","_id":"2119"},{"oa":"1","citation":{"apa":"Awerbuch, B., &#38; Scheideler, C. (2004). Group Spreading: A Protocol for Provably Secure Distributed Name Service. In <i>ICALP</i> (Vol. 3142, pp. 183--195).","ieee":"B. Awerbuch and C. Scheideler, “Group Spreading: A Protocol for Provably Secure Distributed Name Service,” in <i>ICALP</i>, 2004, vol. 3142, pp. 183--195.","short":"B. Awerbuch, C. Scheideler, in: ICALP, 2004, pp. 183--195.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” In <i>ICALP</i>, 3142:183--195. Lecture Notes in Computer Science, 2004.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” <i>ICALP</i>, vol. 3142, 2004, pp. 183--195.","ama":"Awerbuch B, Scheideler C. Group Spreading: A Protocol for Provably Secure Distributed Name Service. In: <i>ICALP</i>. Vol 3142. Lecture Notes in Computer Science. ; 2004: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} }"},"file_date_updated":"2018-04-12T09:20:16Z","volume":3142,"ddc":["040"],"user_id":"15504","_id":"2120","urn":"21200","page":"183--195","has_accepted_license":"1","status":"public","department":[{"_id":"79"}],"type":"conference","date_created":"2018-04-03T05:31:04Z","file":[{"relation":"main_file","date_updated":"2018-04-12T09:20:16Z","file_name":"ICALP-04.pdf","access_level":"open_access","file_size":145383,"file_id":"2312","content_type":"application/pdf","creator":"florida","date_created":"2018-04-12T09:20:16Z"}],"publication":"ICALP","series_title":"Lecture Notes in Computer Science","intvolume":"      3142","date_updated":"2022-01-06T06:54:49Z","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"title":"Group Spreading: A Protocol for Provably Secure Distributed Name Service","year":"2004"},{"has_accepted_license":"1","date_updated":"2022-01-06T06:54:50Z","author":[{"full_name":"Riley, Chris","last_name":"Riley","first_name":"Chris"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"title":"A Distributed Hash Table for Computational Grids","status":"public","year":"2004","user_id":"15504","ddc":["040"],"_id":"2121","urn":"21212","citation":{"ieee":"C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,” in <i>IPDPS</i>, 2004.","apa":"Riley, C., &#38; Scheideler, C. (2004). A Distributed Hash Table for Computational Grids. In <i>IPDPS</i>.","short":"C. Riley, C. Scheideler, in: IPDPS, 2004.","chicago":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” In <i>IPDPS</i>, 2004.","mla":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” <i>IPDPS</i>, 2004.","bibtex":"@inproceedings{Riley_Scheideler_2004, title={A Distributed Hash Table for Computational Grids}, booktitle={IPDPS}, author={Riley, Chris and Scheideler, Christian}, year={2004} }","ama":"Riley C, Scheideler C. A Distributed Hash Table for Computational Grids. In: <i>IPDPS</i>. ; 2004."},"file_date_updated":"2018-04-12T09:50:26Z","publication":"IPDPS","department":[{"_id":"79"}],"oa":"1","type":"conference","date_created":"2018-04-03T05:31:59Z","file":[{"file_name":"IPDPS-04.pdf","file_size":91542,"access_level":"open_access","relation":"main_file","date_updated":"2018-04-12T09:50:26Z","file_id":"2316","content_type":"application/pdf","creator":"florida","date_created":"2018-04-12T09:50:26Z"}]},{"status":"public","has_accepted_license":"1","_id":"2122","urn":"21229","page":"237--249","volume":3279,"user_id":"15504","ddc":["040"],"citation":{"chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” In <i>IPTPS</i>, 3279:237--249. Lecture Notes in Computer Science, 2004.","short":"B. Awerbuch, C. Scheideler, in: IPTPS, 2004, pp. 237--249.","apa":"Awerbuch, B., &#38; Scheideler, C. (2004). Robust Distributed Name Service. In <i>IPTPS</i> (Vol. 3279, pp. 237--249).","ieee":"B. Awerbuch and C. Scheideler, “Robust Distributed Name Service,” in <i>IPTPS</i>, 2004, vol. 3279, pp. 237--249.","ama":"Awerbuch B, Scheideler C. Robust Distributed Name Service. In: <i>IPTPS</i>. Vol 3279. Lecture Notes in Computer Science. ; 2004: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} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” <i>IPTPS</i>, vol. 3279, 2004, pp. 237--249."},"file_date_updated":"2018-04-12T11:39:38Z","oa":"1","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"title":"Robust Distributed Name Service","year":"2004","intvolume":"      3279","date_updated":"2022-01-06T06:54:50Z","series_title":"Lecture Notes in Computer Science","publication":"IPTPS","date_created":"2018-04-03T05:32:33Z","file":[{"file_id":"2318","content_type":"application/pdf","file_name":"IPTPS-04.pdf","file_size":136987,"access_level":"open_access","relation":"main_file","date_updated":"2018-04-12T11:39:38Z","date_created":"2018-04-12T11:39:38Z","creator":"florida"}],"department":[{"_id":"79"}],"type":"conference"},{"file":[{"date_created":"2018-04-12T11:38:22Z","creator":"florida","content_type":"application/pdf","file_id":"2317","access_level":"open_access","file_size":255111,"file_name":"IIAW-04.pdf","date_updated":"2018-04-12T11:38:22Z","relation":"main_file"}],"date_created":"2018-04-03T05:33:37Z","type":"conference","oa":"1","department":[{"_id":"79"}],"publication":"IWIA","file_date_updated":"2018-04-12T11:38:22Z","citation":{"chicago":"Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.” In <i>IWIA</i>, 33--47, 2004.","short":"G. Ateniese, C. Riley, C. Scheideler, in: IWIA, 2004, pp. 33--47.","ieee":"G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” in <i>IWIA</i>, 2004, pp. 33--47.","apa":"Ateniese, G., Riley, C., &#38; Scheideler, C. (2004). Survivable Monitoring in Dynamic Networks. In <i>IWIA</i> (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} }","ama":"Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks. In: <i>IWIA</i>. ; 2004:33--47.","mla":"Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” <i>IWIA</i>, 2004, pp. 33--47."},"page":"33--47","_id":"2123","urn":"21238","ddc":["040"],"user_id":"15504","status":"public","year":"2004","title":"Survivable Monitoring in Dynamic Networks","author":[{"full_name":"Ateniese, Giuseppe","last_name":"Ateniese","first_name":"Giuseppe"},{"first_name":"Chris","last_name":"Riley","full_name":"Riley, Chris"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T06:54:50Z","has_accepted_license":"1"},{"file":[{"file_id":"2323","content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-13T08:36:08Z","file_name":"SODA-04.pdf","file_size":193831,"access_level":"open_access","date_created":"2018-04-13T08:36:08Z","creator":"florida"}],"date_created":"2018-04-03T05:34:17Z","type":"conference","department":[{"_id":"79"}],"oa":"1","file_date_updated":"2018-04-13T08:36:08Z","publication":"SODA","citation":{"chicago":"Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” In <i>SODA</i>, 318--327, 2004.","short":"B. Awerbuch, C. Scheideler, in: SODA, 2004, pp. 318--327.","ama":"Awerbuch B, Scheideler C. The hyperring: a low-congestion deterministic data structure for distributed environments. In: <i>SODA</i>. ; 2004: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} }","apa":"Awerbuch, B., &#38; Scheideler, C. (2004). The hyperring: a low-congestion deterministic data structure for distributed environments. In <i>SODA</i> (pp. 318--327).","mla":"Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” <i>SODA</i>, 2004, pp. 318--327.","ieee":"B. Awerbuch and C. Scheideler, “The hyperring: a low-congestion deterministic data structure for distributed environments,” in <i>SODA</i>, 2004, pp. 318--327."},"page":"318--327","_id":"2124","urn":"21247","user_id":"15504","ddc":["040"],"title":"The hyperring: a low-congestion deterministic data structure for distributed environments","year":"2004","status":"public","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-01-06T06:54:51Z","has_accepted_license":"1"},{"file_date_updated":"2018-04-12T09:41:38Z","publication":"SPAA","citation":{"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} }","ama":"Awerbuch B, Scheideler C. Consistent and compact data management in distributed storage systems. In: <i>SPAA</i>. ; 2004:44--53.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” <i>SPAA</i>, 2004, pp. 44--53.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” In <i>SPAA</i>, 44--53, 2004.","short":"B. Awerbuch, C. Scheideler, in: SPAA, 2004, pp. 44--53.","ieee":"B. Awerbuch and C. Scheideler, “Consistent and compact data management in distributed storage systems,” in <i>SPAA</i>, 2004, pp. 44--53.","apa":"Awerbuch, B., &#38; Scheideler, C. (2004). Consistent and compact data management in distributed storage systems. In <i>SPAA</i> (pp. 44--53)."},"file":[{"file_id":"2315","content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-12T09:41:38Z","file_name":"AS-SPAA-04.pdf","file_size":170429,"access_level":"open_access","date_created":"2018-04-12T09:41:38Z","creator":"florida"}],"date_created":"2018-04-03T05:34:56Z","type":"conference","department":[{"_id":"79"}],"oa":"1","year":"2004","title":"Consistent and compact data management in distributed storage systems","status":"public","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-01-06T06:54:51Z","has_accepted_license":"1","page":"44--53","urn":"21256","_id":"2125","user_id":"15504","ddc":["040"]},{"publication":"SPAA","file_date_updated":"2018-04-12T09:40:42Z","citation":{"short":"A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, M. Thober, in: SPAA, 2004, pp. 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 <i>SPAA</i>, 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 <i>SPAA</i>, 2004, pp. 170--179.","apa":"Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., &#38; Thober, M. (2004). Pagoda: a dynamic overlay network for routing, data management, and multicasting. In <i>SPAA</i> (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} }","ama":"Bhargava A, Kothapalli K, Riley C, Scheideler C, Thober M. Pagoda: a dynamic overlay network for routing, data management, and multicasting. In: <i>SPAA</i>. ; 2004:170--179.","mla":"Bhargava, Ankur, et al. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” <i>SPAA</i>, 2004, pp. 170--179."},"type":"conference","oa":"1","department":[{"_id":"79"}],"file":[{"creator":"florida","date_created":"2018-04-12T09:40:12Z","file_size":118175,"access_level":"open_access","file_name":"BKRST-SPAA-04.pdf","date_updated":"2018-04-12T09:40:42Z","relation":"main_file","content_type":"application/pdf","file_id":"2314"}],"date_created":"2018-04-03T05:35:31Z","date_updated":"2022-01-06T06:54:52Z","has_accepted_license":"1","status":"public","title":"Pagoda: a dynamic overlay network for routing, data management, and multicasting","year":"2004","author":[{"last_name":"Bhargava","first_name":"Ankur","full_name":"Bhargava, Ankur"},{"last_name":"Kothapalli","first_name":"Kishore","full_name":"Kothapalli, Kishore"},{"last_name":"Riley","first_name":"Chris","full_name":"Riley, Chris"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Thober","first_name":"Mark","full_name":"Thober, Mark"}],"ddc":["040"],"user_id":"15504","page":"170--179","_id":"2126","urn":"21266"},{"type":"conference","oa":"1","department":[{"_id":"79"}],"file":[{"creator":"florida","date_created":"2018-04-12T09:21:24Z","date_updated":"2018-04-12T09:21:24Z","relation":"main_file","file_size":197503,"access_level":"open_access","file_name":"BBCES-SPAA-04.pdf","content_type":"application/pdf","file_id":"2313"}],"date_created":"2018-04-03T05:36:11Z","publication":"SPAA","file_date_updated":"2018-04-12T09:21:24Z","citation":{"mla":"Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” <i>SPAA</i>, ACM, 2004, pp. 286--293.","ama":"Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The effect of faults on network expansion. In: <i>SPAA</i>. ACM; 2004:286--293.","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} }","apa":"Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., &#38; Scheideler, C. (2004). The effect of faults on network expansion. In <i>SPAA</i> (pp. 286--293). ACM.","ieee":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The effect of faults on network expansion,” in <i>SPAA</i>, 2004, pp. 286--293.","chicago":"Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and Christian Scheideler. “The Effect of Faults on Network Expansion.” In <i>SPAA</i>, 286--293. ACM, 2004.","short":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, in: SPAA, ACM, 2004, pp. 286--293."},"ddc":["040"],"user_id":"15504","page":"286--293","_id":"2127","urn":"21276","publisher":"ACM","date_updated":"2022-01-06T06:54:52Z","has_accepted_license":"1","title":"The effect of faults on network expansion","status":"public","year":"2004","author":[{"full_name":"Bagchi, Amitabha","last_name":"Bagchi","first_name":"Amitabha"},{"last_name":"Bhargava","first_name":"Ankur","full_name":"Bhargava, Ankur"},{"full_name":"Chaudhary, Amitabh","first_name":"Amitabh","last_name":"Chaudhary"},{"full_name":"Eppstein, David","first_name":"David","last_name":"Eppstein"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}]},{"publication":"21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA","citation":{"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.","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 <i>21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA</i>, 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 <i>21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA</i>, 2004, pp. 153--157.","apa":"Brinkmann, A., Heidebuer, M., Meyer auf der Heide, F., Rückert, U., Salzwedel, K., &#38; Vodisek, M. (2004). V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. In B. Kobler &#38; P. C. Hariharan (Eds.), <i>21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA</i> (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} }","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. <i>21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA</i>. IEEE; 2004:153--157.","mla":"Brinkmann, André, et al. “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.” <i>21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA</i>, edited by Ben Kobler and P. C. Hariharan, IEEE, 2004, pp. 153--157."},"date_created":"2020-06-26T13:30:51Z","type":"conference","department":[{"_id":"63"}],"title":"V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System","year":"2004","status":"public","author":[{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"last_name":"Heidebuer","first_name":"Michael","full_name":"Heidebuer, Michael"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Ulrich ","last_name":"Rückert","full_name":"Rückert, Ulrich "},{"full_name":"Salzwedel, Kay","last_name":"Salzwedel","first_name":"Kay"},{"last_name":"Vodisek","first_name":"Mario","full_name":"Vodisek, Mario"}],"date_updated":"2022-01-06T06:53:08Z","page":"153--157","_id":"17346","language":[{"iso":"eng"}],"publisher":"IEEE","user_id":"15415","editor":[{"last_name":"Kobler","first_name":"Ben","full_name":"Kobler, Ben"},{"full_name":"Hariharan, P. C.","last_name":"Hariharan","first_name":"P. C."}]}]