[{"publication":"Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)","type":"conference","status":"public","_id":"19891","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"year":"2004","page":"567-576","citation":{"bibtex":"@inproceedings{Klein_Zachmann_2004, title={Point Cloud Collision Detection}, booktitle={Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)}, author={Klein, Jan and Zachmann, Gabriel}, year={2004}, pages={567–576} }","short":"J. Klein, G. Zachmann, in: Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004), 2004, pp. 567–576.","mla":"Klein, Jan, and Gabriel Zachmann. “Point Cloud Collision Detection.” <i>Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)</i>, 2004, pp. 567–76.","apa":"Klein, J., &#38; Zachmann, G. (2004). Point Cloud Collision Detection. In <i>Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)</i> (pp. 567–576).","ieee":"J. Klein and G. Zachmann, “Point Cloud Collision Detection,” in <i>Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)</i>, 2004, pp. 567–576.","chicago":"Klein, Jan, and Gabriel Zachmann. “Point Cloud Collision Detection.” In <i>Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)</i>, 567–76, 2004.","ama":"Klein J, Zachmann G. Point Cloud Collision Detection. In: <i>Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)</i>. ; 2004:567-576."},"date_updated":"2022-01-06T06:54:14Z","date_created":"2020-10-05T13:49:10Z","author":[{"last_name":"Klein","full_name":"Klein, Jan","first_name":"Jan"},{"first_name":"Gabriel","last_name":"Zachmann","full_name":"Zachmann, Gabriel"}],"title":"Point Cloud Collision Detection"},{"author":[{"id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"date_created":"2018-04-17T14:45:57Z","date_updated":"2022-01-06T06:56:08Z","publisher":"CSREA Press","title":"Virtualization of Hardware – Introduction and Survey","page":"63-69","citation":{"bibtex":"@inproceedings{Plessl_Platzner_2004, title={Virtualization of Hardware – Introduction and Survey}, booktitle={Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}, publisher={CSREA Press}, author={Plessl, Christian and Platzner, Marco}, year={2004}, pages={63–69} }","short":"C. Plessl, M. Platzner, in: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA), CSREA Press, 2004, pp. 63–69.","mla":"Plessl, Christian, and Marco Platzner. “Virtualization of Hardware – Introduction and Survey.” <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, CSREA Press, 2004, pp. 63–69.","apa":"Plessl, C., &#38; Platzner, M. (2004). Virtualization of Hardware – Introduction and Survey. In <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i> (pp. 63–69). CSREA Press.","ama":"Plessl C, Platzner M. Virtualization of Hardware – Introduction and Survey. In: <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>. CSREA Press; 2004:63-69.","chicago":"Plessl, Christian, and Marco Platzner. “Virtualization of Hardware – Introduction and Survey.” In <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, 63–69. CSREA Press, 2004.","ieee":"C. Plessl and M. Platzner, “Virtualization of Hardware – Introduction and Survey,” in <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, 2004, pp. 63–69."},"year":"2004","department":[{"_id":"518"},{"_id":"78"}],"user_id":"24135","_id":"2415","keyword":["hardware virtualization"],"publication":"Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)","type":"conference","status":"public","abstract":[{"lang":"eng","text":"In this paper we introduce to virtualization of hardware on reconfigurable devices. We identify three main approaches denoted with temporal partitioning, virtualized execution, and virtual machine. For each virtualization approach, we discuss the application models, the required execution architectures, the design tools and the run-time systems. Then, we survey a selection of important projects in the field. "}]},{"_id":"2416","department":[{"_id":"27"},{"_id":"69"}],"user_id":"24135","publication":"Proc. Int. Conf. on Enterprise Information Systems (ICEIS)","type":"conference","status":"public","date_updated":"2022-01-06T06:56:08Z","author":[{"first_name":"Sven","full_name":"Groppe, Sven","last_name":"Groppe"},{"first_name":"Stefan","full_name":"Böttcher, Stefan","last_name":"Böttcher"},{"first_name":"Georg","last_name":"Birkenheuer","full_name":"Birkenheuer, Georg"}],"date_created":"2018-04-17T14:48:54Z","title":"Efficient Querying of Transformed XML Documents","year":"2004","page":"241-250","citation":{"ama":"Groppe S, Böttcher S, Birkenheuer G. Efficient Querying of Transformed XML Documents. In: <i>Proc. Int. Conf. on Enterprise Information Systems (ICEIS)</i>. ; 2004:241-250.","ieee":"S. Groppe, S. Böttcher, and G. Birkenheuer, “Efficient Querying of Transformed XML Documents,” in <i>Proc. Int. Conf. on Enterprise Information Systems (ICEIS)</i>, 2004, pp. 241–250.","chicago":"Groppe, Sven, Stefan Böttcher, and Georg Birkenheuer. “Efficient Querying of Transformed XML Documents.” In <i>Proc. Int. Conf. on Enterprise Information Systems (ICEIS)</i>, 241–50, 2004.","short":"S. Groppe, S. Böttcher, G. Birkenheuer, in: Proc. Int. Conf. on Enterprise Information Systems (ICEIS), 2004, pp. 241–250.","bibtex":"@inproceedings{Groppe_Böttcher_Birkenheuer_2004, title={Efficient Querying of Transformed XML Documents}, booktitle={Proc. Int. Conf. on Enterprise Information Systems (ICEIS)}, author={Groppe, Sven and Böttcher, Stefan and Birkenheuer, Georg}, year={2004}, pages={241–250} }","mla":"Groppe, Sven, et al. “Efficient Querying of Transformed XML Documents.” <i>Proc. Int. Conf. on Enterprise Information Systems (ICEIS)</i>, 2004, pp. 241–50.","apa":"Groppe, S., Böttcher, S., &#38; Birkenheuer, G. (2004). Efficient Querying of Transformed XML Documents. In <i>Proc. Int. Conf. on Enterprise Information Systems (ICEIS)</i> (pp. 241–250)."}},{"year":"2004","citation":{"ieee":"S. Groppe, S. Böttcher, R. Heckel, and G. Birkenheuer, “Using XSLT Stylesheets to Transform XPath Queries,” in <i>Proc. East-European Conf. on Advances in Databases and Information Systems (ADBIS)</i>, 2004.","chicago":"Groppe, Sven, Stefan Böttcher, Reiko Heckel, and Georg Birkenheuer. “Using XSLT Stylesheets to Transform XPath Queries.” In <i>Proc. East-European Conf. on Advances in Databases and Information Systems (ADBIS)</i>, 2004.","ama":"Groppe S, Böttcher S, Heckel R, Birkenheuer G. Using XSLT Stylesheets to Transform XPath Queries. In: <i>Proc. East-European Conf. on Advances in Databases and Information Systems (ADBIS)</i>. ; 2004.","apa":"Groppe, S., Böttcher, S., Heckel, R., &#38; Birkenheuer, G. (2004). Using XSLT Stylesheets to Transform XPath Queries. In <i>Proc. East-European Conf. on Advances in Databases and Information Systems (ADBIS)</i>.","bibtex":"@inproceedings{Groppe_Böttcher_Heckel_Birkenheuer_2004, title={Using XSLT Stylesheets to Transform XPath Queries}, booktitle={Proc. East-European Conf. on Advances in Databases and Information Systems (ADBIS)}, author={Groppe, Sven and Böttcher, Stefan and Heckel, Reiko and Birkenheuer, Georg}, year={2004} }","mla":"Groppe, Sven, et al. “Using XSLT Stylesheets to Transform XPath Queries.” <i>Proc. East-European Conf. on Advances in Databases and Information Systems (ADBIS)</i>, 2004.","short":"S. Groppe, S. Böttcher, R. Heckel, G. Birkenheuer, in: Proc. East-European Conf. on Advances in Databases and Information Systems (ADBIS), 2004."},"date_updated":"2022-01-06T06:56:08Z","date_created":"2018-04-17T14:50:15Z","author":[{"first_name":"Sven","last_name":"Groppe","full_name":"Groppe, Sven"},{"last_name":"Böttcher","full_name":"Böttcher, Stefan","first_name":"Stefan"},{"last_name":"Heckel","full_name":"Heckel, Reiko","first_name":"Reiko"},{"first_name":"Georg","full_name":"Birkenheuer, Georg","last_name":"Birkenheuer"}],"title":"Using XSLT Stylesheets to Transform XPath Queries","publication":"Proc. East-European Conf. on Advances in Databases and Information Systems (ADBIS)","type":"conference","status":"public","_id":"2417","department":[{"_id":"27"},{"_id":"69"}],"user_id":"24135"},{"status":"public","publication":"Proceedings of the 2004 joint workshop on Foundations of mobile computing  - DIALM-POMC '04","type":"conference","language":[{"iso":"eng"}],"_id":"26411","department":[{"_id":"63"},{"_id":"26"}],"user_id":"15415","year":"2004","citation":{"ama":"Volbert K. Experimental analysis of adjustable sectorized topologies for static ad hoc networks. In: <i>Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing  - DIALM-POMC ’04</i>. ; 2004. doi:<a href=\"https://doi.org/10.1145/1022630.1022646\">10.1145/1022630.1022646</a>","ieee":"K. Volbert, “Experimental analysis of adjustable sectorized topologies for static ad hoc networks,” 2004, doi: <a href=\"https://doi.org/10.1145/1022630.1022646\">10.1145/1022630.1022646</a>.","chicago":"Volbert, Klaus. “Experimental Analysis of Adjustable Sectorized Topologies for Static Ad Hoc Networks.” In <i>Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing  - DIALM-POMC ’04</i>, 2004. <a href=\"https://doi.org/10.1145/1022630.1022646\">https://doi.org/10.1145/1022630.1022646</a>.","bibtex":"@inproceedings{Volbert_2004, title={Experimental analysis of adjustable sectorized topologies for static ad hoc networks}, DOI={<a href=\"https://doi.org/10.1145/1022630.1022646\">10.1145/1022630.1022646</a>}, booktitle={Proceedings of the 2004 joint workshop on Foundations of mobile computing  - DIALM-POMC ’04}, author={Volbert, Klaus}, year={2004} }","short":"K. Volbert, in: Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing  - DIALM-POMC ’04, 2004.","mla":"Volbert, Klaus. “Experimental Analysis of Adjustable Sectorized Topologies for Static Ad Hoc Networks.” <i>Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing  - DIALM-POMC ’04</i>, 2004, doi:<a href=\"https://doi.org/10.1145/1022630.1022646\">10.1145/1022630.1022646</a>.","apa":"Volbert, K. (2004). Experimental analysis of adjustable sectorized topologies for static ad hoc networks. <i>Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing  - DIALM-POMC ’04</i>. <a href=\"https://doi.org/10.1145/1022630.1022646\">https://doi.org/10.1145/1022630.1022646</a>"},"publication_status":"published","title":"Experimental analysis of adjustable sectorized topologies for static ad hoc networks","doi":"10.1145/1022630.1022646","date_updated":"2022-01-06T06:57:20Z","date_created":"2021-10-18T15:34:55Z","author":[{"last_name":"Volbert","full_name":"Volbert, Klaus","first_name":"Klaus"}]},{"status":"public","editor":[{"first_name":"Ralf","full_name":"H. Reussner, Ralf","last_name":"H. Reussner"},{"full_name":"A. Stafford, Judith","last_name":"A. Stafford","first_name":"Judith"},{"full_name":"A. Szyperski, Clemens","last_name":"A. Szyperski","first_name":"Clemens"}],"type":"conference","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","user_id":"29719","department":[{"_id":"77"}],"_id":"3233","citation":{"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>","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.","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>.","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>","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.","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>."},"page":"84--102","year":"2004","doi":"10.1007/11786160_5","title":"Refinement and Consistency in Component Models with Multiple Views","date_created":"2018-06-14T06:46:31Z","author":[{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_updated":"2022-01-06T06:59:06Z"},{"publication":"Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings","type":"conference","editor":[{"full_name":"A. Boiten, Eerke","last_name":"A. Boiten","first_name":"Eerke"},{"full_name":"Derrick, John","last_name":"Derrick","first_name":"John"},{"first_name":"Graeme","last_name":"Smith","full_name":"Smith, Graeme"}],"status":"public","_id":"3234","department":[{"_id":"77"}],"user_id":"29719","series_title":"Lecture Notes in Computer Science","year":"2004","page":"267--286","citation":{"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.","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>.","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} }","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>","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>.","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.","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>"},"date_updated":"2022-01-06T06:59:06Z","date_created":"2018-06-14T06:47:35Z","author":[{"first_name":"Michael","last_name":"Möller","full_name":"Möller, Michael"},{"full_name":"Olderog, Ernst-Rüdiger","last_name":"Olderog","first_name":"Ernst-Rüdiger"},{"last_name":"Rasch","full_name":"Rasch, Holger","first_name":"Holger"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"title":"Linking {CSP-OZ} with {UML} and Java: {A} Case Study","doi":"10.1007/978-3-540-24756-2_15"},{"date_created":"2018-06-14T06:48:55Z","author":[{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_updated":"2022-01-06T06:59:06Z","title":"Refinement and Consistency in Multiview Models","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.","short":"H. Wehrheim, in: J. B{\\’{e}}zivin, R. Heckel (Eds.), Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004, 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.","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."},"year":"2004","department":[{"_id":"77"}],"user_id":"29719","series_title":"Dagstuhl Seminar Proceedings","_id":"3235","publication":"Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004","type":"conference","status":"public","editor":[{"first_name":"Jean","last_name":"B{\\'{e}}zivin","full_name":"B{\\'{e}}zivin, Jean"},{"full_name":"Heckel, Reiko","last_name":"Heckel","first_name":"Reiko"}]},{"citation":{"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.","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>.","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>","apa":"Blömer, J., Guajardo, J., &#38; Krummel, V. (2004). Provably Secure Masking of AES. In <i>Selected Areas in Cryptography</i> (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">https://doi.org/10.1007/978-3-540-30564-4_5</a>","mla":"Blömer, Johannes, et al. “Provably Secure Masking of AES.” <i>Selected Areas in Cryptography</i>, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>.","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} }","short":"J. Blömer, J. Guajardo, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 69–83."},"page":"69-83","place":"Berlin, Heidelberg","year":"2004","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540243274","9783540305644"]},"doi":"10.1007/978-3-540-30564-4_5","title":"Provably Secure Masking of AES","date_created":"2018-06-05T08:20:20Z","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"last_name":"Guajardo","full_name":"Guajardo, Jorge","first_name":"Jorge"},{"full_name":"Krummel, Volker","last_name":"Krummel","first_name":"Volker"}],"date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","status":"public","type":"book_chapter","publication":"Selected Areas in Cryptography","user_id":"25078","department":[{"_id":"64"}],"_id":"3011"},{"ddc":["000"],"file_date_updated":"2018-06-05T08:21:31Z","_id":"3012","user_id":"25078","department":[{"_id":"64"}],"file":[{"file_size":198120,"file_id":"3013","file_name":"keys.pdf","access_level":"closed","date_updated":"2018-06-05T08:21:31Z","creator":"feidens","date_created":"2018-06-05T08:21:31Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"book_chapter","publication":"Public Key Cryptography – PKC 2004","title":"A Generalized Wiener Attack on RSA","doi":"10.1007/978-3-540-24632-9_1","publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:51Z","date_created":"2018-06-05T08:20:59Z","author":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"},{"full_name":"May, Alexander","last_name":"May","first_name":"Alexander"}],"year":"2004","place":"Berlin, Heidelberg","citation":{"ieee":"J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in <i>Public Key Cryptography – PKC 2004</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 1–13.","chicago":"Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” In <i>Public Key Cryptography – PKC 2004</i>, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">https://doi.org/10.1007/978-3-540-24632-9_1</a>.","ama":"Blömer J, May A. A Generalized Wiener Attack on RSA. In: <i>Public Key Cryptography – PKC 2004</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:1-13. doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">10.1007/978-3-540-24632-9_1</a>","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} }","short":"J. Blömer, A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 1–13.","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>.","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>"},"page":"1-13","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540210184","9783540246329"]}},{"department":[{"_id":"64"}],"user_id":"25078","_id":"3014","publication":"Public Key Cryptography – PKC 2004","type":"book_chapter","status":"public","date_created":"2018-06-05T08:22:02Z","author":[{"first_name":"Alexander","full_name":"May, Alexander","last_name":"May"}],"date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","doi":"10.1007/978-3-540-24632-9_16","title":"Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q","publication_identifier":{"isbn":["9783540210184","9783540246329"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"218-230","citation":{"ama":"May A. Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q. In: <i>Public Key Cryptography – PKC 2004</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:218-230. doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">10.1007/978-3-540-24632-9_16</a>","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.","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>.","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>","short":"A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 218–230.","bibtex":"@inbook{May_2004, place={Berlin, Heidelberg}, title={Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">10.1007/978-3-540-24632-9_16</a>}, booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg}, author={May, Alexander}, year={2004}, pages={218–230} }","mla":"May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^{r}q.” <i>Public Key Cryptography – PKC 2004</i>, Springer Berlin Heidelberg, 2004, pp. 218–30, doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">10.1007/978-3-540-24632-9_16</a>."},"year":"2004","place":"Berlin, Heidelberg"},{"status":"public","type":"book_chapter","publication":"Advances in Cryptology – CRYPTO 2004","_id":"3015","user_id":"25078","department":[{"_id":"64"}],"place":"Berlin, Heidelberg","year":"2004","citation":{"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.","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} }","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>","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>","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>.","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."},"page":"213-219","publication_status":"published","publication_identifier":{"isbn":["9783540226680","9783540286288"],"issn":["0302-9743","1611-3349"]},"title":"Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring","doi":"10.1007/978-3-540-28628-8_13","date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","date_created":"2018-06-05T08:23:43Z","author":[{"full_name":"May, Alexander","last_name":"May","first_name":"Alexander"}]},{"publication_status":"published","publication_identifier":{"isbn":["1581137389"]},"citation":{"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>","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.","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} }","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>.","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>","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.","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>."},"year":"2004","author":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"},{"first_name":"Martin","last_name":"Otto","full_name":"Otto, Martin"},{"last_name":"Seifert","full_name":"Seifert, Jean-Pierre","first_name":"Jean-Pierre"}],"date_created":"2018-06-05T08:24:48Z","date_updated":"2022-01-06T06:58:51Z","publisher":"ACM Press","doi":"10.1145/948109.948151","title":"A new CRT-RSA algorithm secure against bellcore attacks","type":"conference","publication":"Proceedings of the 10th ACM conference on Computer and communication security  - CCS '03","status":"public","user_id":"25078","department":[{"_id":"64"}],"_id":"3017"},{"author":[{"first_name":"Stefan","last_name":"Rührup","full_name":"Rührup, Stefan"},{"first_name":"Christian","full_name":"Schindelhauer, Christian","last_name":"Schindelhauer"}],"date_created":"2021-10-28T11:59:31Z","date_updated":"2022-01-06T06:57:32Z","title":"Traffic and Hop Efficient Position-based Routing using a Cell Structure","has_accepted_license":"1","citation":{"short":"S. Rührup, C. Schindelhauer, Traffic and Hop Efficient Position-Based Routing Using a Cell Structure, Heinz Nixdorf Institut, Universität Paderborn, 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} }","mla":"Rührup, Stefan, and Christian Schindelhauer. <i>Traffic and Hop Efficient Position-Based Routing Using a Cell Structure</i>. 2004.","apa":"Rührup, S., &#38; Schindelhauer, C. (2004). <i>Traffic and Hop Efficient Position-based Routing using a Cell Structure</i>.","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.","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.","ama":"Rührup S, Schindelhauer C. <i>Traffic and Hop Efficient Position-Based Routing Using a Cell Structure</i>.; 2004."},"year":"2004","place":"Heinz Nixdorf Institut, Universität Paderborn","department":[{"_id":"63"},{"_id":"26"}],"user_id":"15415","_id":"26992","language":[{"iso":"eng"}],"file_date_updated":"2021-10-28T11:58:56Z","ddc":["000"],"type":"report","status":"public","file":[{"date_created":"2021-10-28T11:58:56Z","creator":"koala","date_updated":"2021-10-28T11:58:56Z","file_id":"26993","access_level":"closed","file_name":"techreport-hniid-2024.pdf","file_size":234517,"content_type":"application/pdf","relation":"main_file","success":1}]},{"abstract":[{"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.","lang":"eng"}],"status":"public","type":"report","language":[{"iso":"eng"}],"_id":"20933","department":[{"_id":"76"}],"user_id":"5786","year":"2004","place":"Paderborn, Germany","citation":{"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.","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>.","ama":"Niere J, Meyer M, Wendehals L. <i>User-Driven Adaption in Rule-Based Pattern Recognition</i>.; 2004.","ieee":"J. Niere, M. Meyer, and L. Wendehals, <i>User-driven adaption in rule-based pattern recognition</i>. Paderborn, Germany, 2004.","chicago":"Niere, Jörrg, Matthias Meyer, and Lothar Wendehals. <i>User-Driven Adaption in Rule-Based Pattern Recognition</i>. Paderborn, Germany, 2004."},"title":"User-driven adaption in rule-based pattern recognition","date_updated":"2022-01-06T06:54:41Z","date_created":"2021-01-13T10:00:00Z","author":[{"full_name":"Niere, Jörrg","last_name":"Niere","first_name":"Jörrg"},{"full_name":"Meyer, Matthias","id":"683","last_name":"Meyer","first_name":"Matthias"},{"first_name":"Lothar","last_name":"Wendehals","full_name":"Wendehals, Lothar"}]},{"doi":"10.1007/s00453-004-1086-1","title":"Simple On-Line Algorithms for the Maximum Disjoint Paths Problem","author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-04-03T05:30:23Z","date_updated":"2022-01-06T06:54:49Z","page":"209--233","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.","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>.","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>","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} }","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>"},"year":"2004","issue":"3","department":[{"_id":"79"}],"user_id":"15504","_id":"2119","status":"public","publication":"Algorithmica","type":"journal_article"},{"date_created":"2018-04-03T05:31:04Z","title":"Group Spreading: A Protocol for Provably Secure Distributed Name Service","year":"2004","ddc":["040"],"publication":"ICALP","file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2018-04-12T09:20:16Z","creator":"florida","date_updated":"2018-04-12T09:20:16Z","file_name":"ICALP-04.pdf","file_id":"2312","access_level":"open_access","file_size":145383}],"date_updated":"2022-01-06T06:54:49Z","oa":"1","author":[{"first_name":"Baruch","last_name":"Awerbuch","full_name":"Awerbuch, Baruch"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"volume":3142,"has_accepted_license":"1","citation":{"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.","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.","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.","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).","short":"B. Awerbuch, C. Scheideler, in: ICALP, 2004, pp. 183--195.","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.","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} }"},"page":"183--195","intvolume":"      3142","_id":"2120","series_title":"Lecture Notes in Computer Science","user_id":"15504","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:20:16Z","type":"conference","urn":"21200","status":"public"},{"date_updated":"2022-01-06T06:54:50Z","oa":"1","date_created":"2018-04-03T05:31:59Z","author":[{"first_name":"Chris","last_name":"Riley","full_name":"Riley, Chris"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"title":"A Distributed Hash Table for Computational Grids","has_accepted_license":"1","year":"2004","citation":{"ama":"Riley C, Scheideler C. A Distributed Hash Table for Computational Grids. In: <i>IPDPS</i>. ; 2004.","ieee":"C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,” in <i>IPDPS</i>, 2004.","chicago":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” In <i>IPDPS</i>, 2004.","short":"C. Riley, C. Scheideler, in: IPDPS, 2004.","bibtex":"@inproceedings{Riley_Scheideler_2004, title={A Distributed Hash Table for Computational Grids}, booktitle={IPDPS}, author={Riley, Chris and Scheideler, Christian}, year={2004} }","mla":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” <i>IPDPS</i>, 2004.","apa":"Riley, C., &#38; Scheideler, C. (2004). A Distributed Hash Table for Computational Grids. In <i>IPDPS</i>."},"_id":"2121","department":[{"_id":"79"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-04-12T09:50:26Z","publication":"IPDPS","type":"conference","urn":"21212","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","creator":"florida","date_created":"2018-04-12T09:50:26Z","date_updated":"2018-04-12T09:50:26Z","file_name":"IPDPS-04.pdf","access_level":"open_access","file_id":"2316","file_size":91542}]},{"file_date_updated":"2018-04-12T11:39:38Z","ddc":["040"],"user_id":"15504","series_title":"Lecture Notes in Computer Science","department":[{"_id":"79"}],"_id":"2122","file":[{"relation":"main_file","content_type":"application/pdf","file_size":136987,"access_level":"open_access","file_name":"IPTPS-04.pdf","file_id":"2318","date_updated":"2018-04-12T11:39:38Z","date_created":"2018-04-12T11:39:38Z","creator":"florida"}],"status":"public","urn":"21229","type":"conference","publication":"IPTPS","title":"Robust Distributed Name Service","date_created":"2018-04-03T05:32:33Z","author":[{"full_name":"Awerbuch, Baruch","last_name":"Awerbuch","first_name":"Baruch"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"volume":3279,"oa":"1","date_updated":"2022-01-06T06:54:50Z","citation":{"ama":"Awerbuch B, Scheideler C. Robust Distributed Name Service. In: <i>IPTPS</i>. Vol 3279. Lecture Notes in Computer Science. ; 2004:237--249.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” In <i>IPTPS</i>, 3279:237--249. Lecture Notes in Computer Science, 2004.","ieee":"B. Awerbuch and C. Scheideler, “Robust Distributed Name Service,” in <i>IPTPS</i>, 2004, vol. 3279, pp. 237--249.","apa":"Awerbuch, B., &#38; Scheideler, C. (2004). Robust Distributed Name Service. In <i>IPTPS</i> (Vol. 3279, pp. 237--249).","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” <i>IPTPS</i>, vol. 3279, 2004, 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} }","short":"B. Awerbuch, C. Scheideler, in: IPTPS, 2004, pp. 237--249."},"page":"237--249","intvolume":"      3279","year":"2004","has_accepted_license":"1"},{"year":"2004","page":"33--47","citation":{"ama":"Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks. In: <i>IWIA</i>. ; 2004:33--47.","ieee":"G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” in <i>IWIA</i>, 2004, pp. 33--47.","chicago":"Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.” In <i>IWIA</i>, 33--47, 2004.","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} }","short":"G. Ateniese, C. Riley, C. Scheideler, in: IWIA, 2004, pp. 33--47.","mla":"Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” <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)."},"has_accepted_license":"1","title":"Survivable Monitoring in Dynamic Networks","oa":"1","date_updated":"2022-01-06T06:54:50Z","date_created":"2018-04-03T05:33:37Z","author":[{"full_name":"Ateniese, Giuseppe","last_name":"Ateniese","first_name":"Giuseppe"},{"last_name":"Riley","full_name":"Riley, Chris","first_name":"Chris"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"urn":"21238","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-12T11:38:22Z","creator":"florida","date_created":"2018-04-12T11:38:22Z","file_size":255111,"access_level":"open_access","file_id":"2317","file_name":"IIAW-04.pdf"}],"publication":"IWIA","type":"conference","ddc":["040"],"file_date_updated":"2018-04-12T11:38:22Z","_id":"2123","department":[{"_id":"79"}],"user_id":"15504"}]