[{"citation":{"mla":"Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.” <i>Journal of Universal Computer Science (J.UCS)</i>, no. 6, 2006, pp. 654--671, doi:<a href=\"https://doi.org/10.3217/jucs-012-06-0654\">10.3217/jucs-012-06-0654</a>.","bibtex":"@article{Blömer_2006, title={Randomness and Secrecy - A Brief Introduction}, DOI={<a href=\"https://doi.org/10.3217/jucs-012-06-0654\">10.3217/jucs-012-06-0654</a>}, number={6}, journal={Journal of Universal Computer Science (J.UCS)}, author={Blömer, Johannes}, year={2006}, pages={654--671} }","ama":"Blömer J. Randomness and Secrecy - A Brief Introduction. <i>Journal of Universal Computer Science (JUCS)</i>. 2006;(6):654--671. doi:<a href=\"https://doi.org/10.3217/jucs-012-06-0654\">10.3217/jucs-012-06-0654</a>","ieee":"J. Blömer, “Randomness and Secrecy - A Brief Introduction,” <i>Journal of Universal Computer Science (J.UCS)</i>, no. 6, pp. 654--671, 2006.","apa":"Blömer, J. (2006). Randomness and Secrecy - A Brief Introduction. <i>Journal of Universal Computer Science (J.UCS)</i>, (6), 654--671. <a href=\"https://doi.org/10.3217/jucs-012-06-0654\">https://doi.org/10.3217/jucs-012-06-0654</a>","short":"J. Blömer, Journal of Universal Computer Science (J.UCS) (2006) 654--671.","chicago":"Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.” <i>Journal of Universal Computer Science (J.UCS)</i>, no. 6 (2006): 654--671. <a href=\"https://doi.org/10.3217/jucs-012-06-0654\">https://doi.org/10.3217/jucs-012-06-0654</a>."},"issue":"6","publication":"Journal of Universal Computer Science (J.UCS)","abstract":[{"lang":"eng","text":"We give a brief introduction to probabilistic encryptions. This serves as an example how randomness plays a pivotal role in cryptographic systems that satisfy advanced security concepts."}],"date_created":"2018-06-05T08:13:39Z","department":[{"_id":"64"}],"type":"journal_article","author":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"year":"2006","status":"public","title":"Randomness and Secrecy - A Brief Introduction","date_updated":"2022-01-06T06:58:50Z","publication_status":"published","_id":"3003","page":"654--671","doi":"10.3217/jucs-012-06-0654","user_id":"25078"},{"user_id":"25078","doi":"10.1007/11889700_11","publisher":"Springer Berlin Heidelberg","_id":"3004","page":"106-120","publication_status":"published","date_updated":"2022-01-06T06:58:50Z","publication_identifier":{"isbn":["9783540462507","9783540462514"],"issn":["0302-9743","1611-3349"]},"author":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"},{"last_name":"Krummel","first_name":"Volker","full_name":"Krummel, Volker"}],"title":"Fault Based Collision Attacks on AES","year":"2006","status":"public","department":[{"_id":"64"}],"type":"book_chapter","date_created":"2018-06-05T08:14:42Z","place":"Berlin, Heidelberg","citation":{"ieee":"J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 106–120.","apa":"Blömer, J., &#38; Krummel, V. (2006). Fault Based Collision Attacks on AES. In <i>Lecture Notes in Computer Science</i> (pp. 106–120). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11889700_11\">https://doi.org/10.1007/11889700_11</a>","mla":"Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp. 106–20, doi:<a href=\"https://doi.org/10.1007/11889700_11\">10.1007/11889700_11</a>.","bibtex":"@inbook{Blömer_Krummel_2006, place={Berlin, Heidelberg}, title={Fault Based Collision Attacks on AES}, DOI={<a href=\"https://doi.org/10.1007/11889700_11\">10.1007/11889700_11</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Krummel, Volker}, year={2006}, pages={106–120} }","chicago":"Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” In <i>Lecture Notes in Computer Science</i>, 106–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11889700_11\">https://doi.org/10.1007/11889700_11</a>.","ama":"Blömer J, Krummel V. Fault Based Collision Attacks on AES. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:106-120. doi:<a href=\"https://doi.org/10.1007/11889700_11\">10.1007/11889700_11</a>","short":"J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120."},"publication":"Lecture Notes in Computer Science"},{"doi":"10.1007/11889700_2","user_id":"25078","publisher":"Springer Berlin Heidelberg","_id":"3005","page":"13-23","date_updated":"2022-01-06T06:58:50Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540462507","9783540462514"]},"author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"full_name":"Otto, Martin","first_name":"Martin","last_name":"Otto"}],"status":"public","year":"2006","title":"Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered","department":[{"_id":"64"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2018-06-05T08:15:48Z","citation":{"ieee":"J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 13–23.","apa":"Blömer, J., &#38; Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In <i>Lecture Notes in Computer Science</i> (pp. 13–23). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11889700_2\">https://doi.org/10.1007/11889700_2</a>","short":"J. Blömer, M. Otto, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 13–23.","chicago":"Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” In <i>Lecture Notes in Computer Science</i>, 13–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11889700_2\">https://doi.org/10.1007/11889700_2</a>.","mla":"Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp. 13–23, doi:<a href=\"https://doi.org/10.1007/11889700_2\">10.1007/11889700_2</a>.","bibtex":"@inbook{Blömer_Otto_2006, place={Berlin, Heidelberg}, title={Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered}, DOI={<a href=\"https://doi.org/10.1007/11889700_2\">10.1007/11889700_2</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Otto, Martin}, year={2006}, pages={13–23} }","ama":"Blömer J, Otto M. Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:13-23. doi:<a href=\"https://doi.org/10.1007/11889700_2\">10.1007/11889700_2</a>"},"publication":"Lecture Notes in Computer Science"},{"type":"book_chapter","department":[{"_id":"64"}],"file":[{"date_created":"2018-06-05T08:18:56Z","creator":"feidens","file_id":"3009","success":1,"content_type":"application/pdf","file_name":"SignChangeFaultAttacksOnECC.pdf","access_level":"closed","file_size":259146,"relation":"main_file","date_updated":"2018-06-05T08:18:56Z"}],"date_created":"2018-06-05T08:17:12Z","publication":"Lecture Notes in Computer Science","doi":"10.1007/11889700_4","publication_status":"published","date_updated":"2022-01-06T06:58:50Z","title":"Sign Change Fault Attacks on Elliptic Curve Cryptosystems","year":"2006","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Martin","last_name":"Otto","full_name":"Otto, Martin"},{"last_name":"Seifert","first_name":"Jean-Pierre","full_name":"Seifert, Jean-Pierre"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540462507","9783540462514"]},"place":"Berlin, Heidelberg","file_date_updated":"2018-06-05T08:18:56Z","citation":{"ieee":"J. Blömer, M. Otto, and J.-P. Seifert, “Sign Change Fault Attacks on Elliptic Curve Cryptosystems,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 36–52.","apa":"Blömer, J., Otto, M., &#38; Seifert, J.-P. (2006). Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In <i>Lecture Notes in Computer Science</i> (pp. 36–52). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11889700_4\">https://doi.org/10.1007/11889700_4</a>","mla":"Blömer, Johannes, et al. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp. 36–52, doi:<a href=\"https://doi.org/10.1007/11889700_4\">10.1007/11889700_4</a>.","bibtex":"@inbook{Blömer_Otto_Seifert_2006, place={Berlin, Heidelberg}, title={Sign Change Fault Attacks on Elliptic Curve Cryptosystems}, DOI={<a href=\"https://doi.org/10.1007/11889700_4\">10.1007/11889700_4</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}, year={2006}, pages={36–52} }","ama":"Blömer J, Otto M, Seifert J-P. Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:36-52. doi:<a href=\"https://doi.org/10.1007/11889700_4\">10.1007/11889700_4</a>","short":"J. Blömer, M. Otto, J.-P. Seifert, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 36–52.","chicago":"Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.” In <i>Lecture Notes in Computer Science</i>, 36–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11889700_4\">https://doi.org/10.1007/11889700_4</a>."},"user_id":"25078","ddc":["000"],"page":"36-52","publisher":"Springer Berlin Heidelberg","_id":"3007","has_accepted_license":"1","status":"public"},{"citation":{"short":"A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, in: 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06), 2006.","chicago":"Brinkmann, Andre, Sascha  Effert, Michael Heidebuer, and Mario Vodisek. “Influence of Adaptive Data Layouts on Performance in Dynamically Changing Storage Environments.” In <i>14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)</i>, 2006. <a href=\"https://doi.org/10.1109/pdp.2006.44\">https://doi.org/10.1109/pdp.2006.44</a>.","apa":"Brinkmann, A., Effert, S., Heidebuer, M., &#38; Vodisek, M. (2006). Influence of adaptive data layouts on performance in dynamically changing storage environments. <i>14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)</i>. <a href=\"https://doi.org/10.1109/pdp.2006.44\">https://doi.org/10.1109/pdp.2006.44</a>","ieee":"A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Influence of adaptive data layouts on performance in dynamically changing storage environments,” 2006, doi: <a href=\"https://doi.org/10.1109/pdp.2006.44\">10.1109/pdp.2006.44</a>.","ama":"Brinkmann A, Effert S, Heidebuer M, Vodisek M. Influence of adaptive data layouts on performance in dynamically changing storage environments. In: <i>14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)</i>. ; 2006. doi:<a href=\"https://doi.org/10.1109/pdp.2006.44\">10.1109/pdp.2006.44</a>","bibtex":"@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_2006, title={Influence of adaptive data layouts on performance in dynamically changing storage environments}, DOI={<a href=\"https://doi.org/10.1109/pdp.2006.44\">10.1109/pdp.2006.44</a>}, booktitle={14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)}, author={Brinkmann, Andre and Effert, Sascha  and Heidebuer, Michael and Vodisek, Mario}, year={2006} }","mla":"Brinkmann, Andre, et al. “Influence of Adaptive Data Layouts on Performance in Dynamically Changing Storage Environments.” <i>14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)</i>, 2006, doi:<a href=\"https://doi.org/10.1109/pdp.2006.44\">10.1109/pdp.2006.44</a>."},"publication":"14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06)","abstract":[{"lang":"eng","text":"For most of today's IT environments, the tremendous need for storage capacity in combination with a required minimum I/O performance has become highly critical. In dynamically growing environments, a storage management solution's underlying data distribution scheme has great impact to the overall system I/O performance. The evaluation of a number of open system storage visualization solutions and volume managers has shown that all of them lack the ability to automatically adapt to changing access patterns and storage infrastructures; many of them require an error prone manual re-layout of the data blocks, or rely on a very time consuming re-striping of all available data. This paper evaluates the performance of conventional data distribution approaches compared to the adaptive virtualization solution V:DRIVE in dynamically changing storage environments. Changes of the storage infrastructure are normally not considered in benchmark results, but can have a significant impact on storage performance. Using synthetic benchmarks, V:DRIVE is compared in such changing environments with the non-adaptive Linux logical volume manager (LVM). The performance results of our tests clearly outline the necessity of adaptive data distribution schemes."}],"date_created":"2021-10-28T08:33:09Z","department":[{"_id":"63"},{"_id":"26"}],"type":"conference","author":[{"full_name":"Brinkmann, Andre","last_name":"Brinkmann","first_name":"Andre"},{"last_name":"Effert","first_name":"Sascha ","full_name":"Effert, Sascha "},{"first_name":"Michael","last_name":"Heidebuer","full_name":"Heidebuer, Michael"},{"full_name":"Vodisek, Mario","last_name":"Vodisek","first_name":"Mario"}],"title":"Influence of adaptive data layouts on performance in dynamically changing storage environments","status":"public","year":"2006","publication_status":"published","date_updated":"2022-01-06T06:57:31Z","_id":"26988","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1109/pdp.2006.44"},{"date_updated":"2022-01-06T06:54:42Z","author":[{"id":"683","full_name":"Meyer, Matthias","first_name":"Matthias","last_name":"Meyer"}],"title":"Pattern-based Reengineering of Software Systems","status":"public","year":"2006","user_id":"5786","publisher":"IEEE Computer Society","_id":"20950","language":[{"iso":"eng"}],"page":"305-306","citation":{"bibtex":"@inproceedings{Meyer_2006, title={Pattern-based Reengineering of Software Systems}, booktitle={Proceedings of the 13th Working Conference on Reverse Engineering (WCRE 2006), Benevento, Italy}, publisher={IEEE Computer Society}, author={Meyer, Matthias}, year={2006}, pages={305–306} }","ama":"Meyer M. Pattern-based Reengineering of Software Systems. In: <i>Proceedings of the 13th Working Conference on Reverse Engineering (WCRE 2006), Benevento, Italy</i>. IEEE Computer Society; 2006:305-306.","mla":"Meyer, Matthias. “Pattern-Based Reengineering of Software Systems.” <i>Proceedings of the 13th Working Conference on Reverse Engineering (WCRE 2006), Benevento, Italy</i>, IEEE Computer Society, 2006, pp. 305–06.","chicago":"Meyer, Matthias. “Pattern-Based Reengineering of Software Systems.” In <i>Proceedings of the 13th Working Conference on Reverse Engineering (WCRE 2006), Benevento, Italy</i>, 305–6. IEEE Computer Society, 2006.","short":"M. Meyer, in: Proceedings of the 13th Working Conference on Reverse Engineering (WCRE 2006), Benevento, Italy, IEEE Computer Society, 2006, pp. 305–306.","ieee":"M. Meyer, “Pattern-based Reengineering of Software Systems,” in <i>Proceedings of the 13th Working Conference on Reverse Engineering (WCRE 2006), Benevento, Italy</i>, 2006, pp. 305–306.","apa":"Meyer, M. (2006). Pattern-based Reengineering of Software Systems. <i>Proceedings of the 13th Working Conference on Reverse Engineering (WCRE 2006), Benevento, Italy</i>, 305–306."},"publication":"Proceedings of the 13th Working Conference on Reverse Engineering (WCRE 2006), Benevento, Italy","department":[{"_id":"76"}],"type":"conference","date_created":"2021-01-13T10:19:54Z"},{"date_updated":"2022-01-06T06:54:42Z","author":[{"full_name":"Giese, Holger","last_name":"Giese","first_name":"Holger"},{"id":"683","first_name":"Matthias","last_name":"Meyer","full_name":"Meyer, Matthias"},{"last_name":"Wagner","first_name":"Robert","full_name":"Wagner, Robert"}],"year":"2006","title":"A Prototype for Guideline Checking and Model Transformation in Matlab/Simulink","status":"public","volume":"tr-ri-06-275","user_id":"5786","language":[{"iso":"eng"}],"_id":"20951","publisher":"University of Paderborn","series_title":"Technical Report","page":"56-60","citation":{"ama":"Giese H, Meyer M, Wagner R. A Prototype for Guideline Checking and Model Transformation in Matlab/Simulink. In: <i>Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany</i>. Vol tr-ri-06-275. Technical Report. University of Paderborn; 2006:56-60.","bibtex":"@inproceedings{Giese_Meyer_Wagner_2006, series={Technical Report}, title={A Prototype for Guideline Checking and Model Transformation in Matlab/Simulink}, volume={tr-ri-06-275}, booktitle={Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany}, publisher={University of Paderborn}, author={Giese, Holger and Meyer, Matthias and Wagner, Robert}, year={2006}, pages={56–60}, collection={Technical Report} }","mla":"Giese, Holger, et al. “A Prototype for Guideline Checking and Model Transformation in Matlab/Simulink.” <i>Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany</i>, vol. tr-ri-06-275, University of Paderborn, 2006, pp. 56–60.","chicago":"Giese, Holger, Matthias Meyer, and Robert Wagner. “A Prototype for Guideline Checking and Model Transformation in Matlab/Simulink.” In <i>Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany</i>, tr-ri-06-275:56–60. Technical Report. University of Paderborn, 2006.","short":"H. Giese, M. Meyer, R. Wagner, in: Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany, University of Paderborn, 2006, pp. 56–60.","apa":"Giese, H., Meyer, M., &#38; Wagner, R. (2006). A Prototype for Guideline Checking and Model Transformation in Matlab/Simulink. <i>Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany</i>, <i>tr-ri-06-275</i>, 56–60.","ieee":"H. Giese, M. Meyer, and R. Wagner, “A Prototype for Guideline Checking and Model Transformation in Matlab/Simulink,” in <i>Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany</i>, 2006, vol. tr-ri-06-275, pp. 56–60."},"publication":"Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany","department":[{"_id":"76"}],"type":"conference","date_created":"2021-01-13T10:20:33Z"},{"author":[{"last_name":"Tichy","first_name":"Matthias","full_name":"Tichy, Matthias"},{"full_name":"Meyer, Matthias","first_name":"Matthias","last_name":"Meyer","id":"683"},{"full_name":"Giese, Holger","last_name":"Giese","first_name":"Holger"}],"status":"public","title":"On Semantic Issues in Story Diagrams","year":"2006","date_updated":"2022-01-06T06:54:42Z","_id":"20952","publisher":"University of Paderborn","series_title":"Technical Report","language":[{"iso":"eng"}],"page":"10-14","volume":"tr-ri-06-275","user_id":"5786","citation":{"short":"M. Tichy, M. Meyer, H. Giese, in: Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany, University of Paderborn, 2006, pp. 10–14.","ama":"Tichy M, Meyer M, Giese H. On Semantic Issues in Story Diagrams. In: <i>Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany</i>. Vol tr-ri-06-275. Technical Report. University of Paderborn; 2006:10-14.","chicago":"Tichy, Matthias, Matthias Meyer, and Holger Giese. “On Semantic Issues in Story Diagrams.” In <i>Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany</i>, tr-ri-06-275:10–14. Technical Report. University of Paderborn, 2006.","bibtex":"@inproceedings{Tichy_Meyer_Giese_2006, series={Technical Report}, title={On Semantic Issues in Story Diagrams}, volume={tr-ri-06-275}, booktitle={Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany}, publisher={University of Paderborn}, author={Tichy, Matthias and Meyer, Matthias and Giese, Holger}, year={2006}, pages={10–14}, collection={Technical Report} }","apa":"Tichy, M., Meyer, M., &#38; Giese, H. (2006). On Semantic Issues in Story Diagrams. <i>Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany</i>, <i>tr-ri-06-275</i>, 10–14.","mla":"Tichy, Matthias, et al. “On Semantic Issues in Story Diagrams.” <i>Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany</i>, vol. tr-ri-06-275, University of Paderborn, 2006, pp. 10–14.","ieee":"M. Tichy, M. Meyer, and H. Giese, “On Semantic Issues in Story Diagrams,” in <i>Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany</i>, 2006, vol. tr-ri-06-275, pp. 10–14."},"publication":"Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany","date_created":"2021-01-13T10:21:09Z","department":[{"_id":"76"}],"type":"conference"},{"type":"bachelorsthesis","department":[{"_id":"76"}],"date_created":"2021-01-13T10:59:29Z","citation":{"apa":"Holtmann, J. (2006). <i>Entwicklung von Geschäftsprozessmustern zur Qualitätssicherung</i>. University of Paderborn.","ieee":"J. Holtmann, <i>Entwicklung von Geschäftsprozessmustern zur Qualitätssicherung</i>. University of Paderborn, 2006.","chicago":"Holtmann, Jörg. <i>Entwicklung von Geschäftsprozessmustern Zur Qualitätssicherung</i>. University of Paderborn, 2006.","short":"J. Holtmann, Entwicklung von Geschäftsprozessmustern Zur Qualitätssicherung, University of Paderborn, 2006.","mla":"Holtmann, Jörg. <i>Entwicklung von Geschäftsprozessmustern Zur Qualitätssicherung</i>. University of Paderborn, 2006.","ama":"Holtmann J. <i>Entwicklung von Geschäftsprozessmustern Zur Qualitätssicherung</i>. University of Paderborn; 2006.","bibtex":"@book{Holtmann_2006, title={Entwicklung von Geschäftsprozessmustern zur Qualitätssicherung}, publisher={University of Paderborn}, author={Holtmann, Jörg}, year={2006} }"},"user_id":"5786","publisher":"University of Paderborn","_id":"20967","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:42Z","title":"Entwicklung von Geschäftsprozessmustern zur Qualitätssicherung","year":"2006","status":"public","author":[{"orcid":"0000-0001-6141-4571","first_name":"Jörg","last_name":"Holtmann","full_name":"Holtmann, Jörg","id":"3875"}]},{"author":[{"full_name":"Ateniese, Giuseppe","last_name":"Ateniese","first_name":"Giuseppe"},{"full_name":"Riley, Chris","last_name":"Riley","first_name":"Chris"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"year":"2006","title":"Survivable Monitoring in Dynamic Networks","status":"public","date_updated":"2022-01-06T06:54:45Z","_id":"2110","page":"1242--1254","doi":"10.1109/TMC.2006.138","user_id":"15504","citation":{"mla":"Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” <i>IEEE Trans. Mob. Comput.</i>, no. 9, 2006, pp. 1242--1254, doi:<a href=\"https://doi.org/10.1109/TMC.2006.138\">10.1109/TMC.2006.138</a>.","ama":"Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks. <i>IEEE Trans Mob Comput</i>. 2006;(9):1242--1254. doi:<a href=\"https://doi.org/10.1109/TMC.2006.138\">10.1109/TMC.2006.138</a>","bibtex":"@article{Ateniese_Riley_Scheideler_2006, title={Survivable Monitoring in Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1109/TMC.2006.138\">10.1109/TMC.2006.138</a>}, number={9}, journal={IEEE Trans. Mob. Comput.}, author={Ateniese, Giuseppe and Riley, Chris and Scheideler, Christian}, year={2006}, pages={1242--1254} }","apa":"Ateniese, G., Riley, C., &#38; Scheideler, C. (2006). Survivable Monitoring in Dynamic Networks. <i>IEEE Trans. Mob. Comput.</i>, (9), 1242--1254. <a href=\"https://doi.org/10.1109/TMC.2006.138\">https://doi.org/10.1109/TMC.2006.138</a>","ieee":"G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” <i>IEEE Trans. Mob. Comput.</i>, no. 9, pp. 1242--1254, 2006.","chicago":"Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.” <i>IEEE Trans. Mob. Comput.</i>, no. 9 (2006): 1242--1254. <a href=\"https://doi.org/10.1109/TMC.2006.138\">https://doi.org/10.1109/TMC.2006.138</a>.","short":"G. Ateniese, C. Riley, C. Scheideler, IEEE Trans. Mob. Comput. (2006) 1242--1254."},"publication":"IEEE Trans. Mob. Comput.","issue":"9","date_created":"2018-04-03T05:21:30Z","department":[{"_id":"79"}],"type":"journal_article"},{"title":"Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds","status":"public","year":"2006","author":[{"full_name":"Kothapalli, Kishore","first_name":"Kishore","last_name":"Kothapalli"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Melih","last_name":"Onus","full_name":"Onus, Melih"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"date_updated":"2022-01-06T06:54:46Z","has_accepted_license":"1","urn":"21110","_id":"2111","ddc":["040"],"user_id":"15504","publication":"IPDPS","file_date_updated":"2018-04-13T09:57:03Z","citation":{"mla":"Kothapalli, Kishore, et al. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” <i>IPDPS</i>, 2006.","ama":"Kothapalli K, Scheideler C, Onus M, Schindelhauer C. Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In: <i>IPDPS</i>. ; 2006.","bibtex":"@inproceedings{Kothapalli_Scheideler_Onus_Schindelhauer_2006, title={Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds}, booktitle={IPDPS}, author={Kothapalli, Kishore and Scheideler, Christian and Onus, Melih and Schindelhauer, Christian}, year={2006} }","apa":"Kothapalli, K., Scheideler, C., Onus, M., &#38; Schindelhauer, C. (2006). Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In <i>IPDPS</i>.","ieee":"K. Kothapalli, C. Scheideler, M. Onus, and C. Schindelhauer, “Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds,” in <i>IPDPS</i>, 2006.","chicago":"Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Christian Schindelhauer. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” In <i>IPDPS</i>, 2006.","short":"K. Kothapalli, C. Scheideler, M. Onus, C. Schindelhauer, in: IPDPS, 2006."},"file":[{"file_id":"2334","content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-13T09:57:03Z","file_name":"IPDPS06.pdf","file_size":192708,"access_level":"open_access","date_created":"2018-04-13T09:57:03Z","creator":"florida"}],"date_created":"2018-04-03T05:22:43Z","type":"conference","oa":"1","department":[{"_id":"79"}]},{"file_date_updated":"2018-04-13T09:57:51Z","publication":"OPODIS","citation":{"mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” <i>OPODIS</i>, 2006, pp. 275--289.","bibtex":"@inproceedings{Awerbuch_Scheideler_2006, series={Lecture Notes in Computer Science}, title={Robust Random Number Generation for Peer-to-Peer Systems}, booktitle={OPODIS}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2006}, pages={275--289}, collection={Lecture Notes in Computer Science} }","ama":"Awerbuch B, Scheideler C. Robust Random Number Generation for Peer-to-Peer Systems. In: <i>OPODIS</i>. Lecture Notes in Computer Science. ; 2006:275--289.","ieee":"B. Awerbuch and C. Scheideler, “Robust Random Number Generation for Peer-to-Peer Systems,” in <i>OPODIS</i>, 2006, pp. 275--289.","apa":"Awerbuch, B., &#38; Scheideler, C. (2006). Robust Random Number Generation for Peer-to-Peer Systems. In <i>OPODIS</i> (pp. 275--289).","short":"B. Awerbuch, C. Scheideler, in: OPODIS, 2006, pp. 275--289.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” In <i>OPODIS</i>, 275--289. Lecture Notes in Computer Science, 2006."},"type":"conference","department":[{"_id":"79"}],"oa":"1","file":[{"creator":"florida","date_created":"2018-04-13T09:57:51Z","file_name":"OPODIS06.pdf","access_level":"open_access","file_size":198976,"relation":"main_file","date_updated":"2018-04-13T09:57:51Z","file_id":"2335","content_type":"application/pdf"}],"date_created":"2018-04-03T05:23:39Z","date_updated":"2022-01-06T06:54:46Z","has_accepted_license":"1","title":"Robust Random Number Generation for Peer-to-Peer Systems","status":"public","year":"2006","author":[{"full_name":"Awerbuch, Baruch","last_name":"Awerbuch","first_name":"Baruch"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"user_id":"15504","ddc":["040"],"page":"275--289","_id":"2112","urn":"21128","series_title":"Lecture Notes in Computer Science"},{"date_updated":"2022-01-06T06:54:46Z","has_accepted_license":"1","status":"public","year":"2006","title":"Towards a scalable and robust DHT","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"user_id":"15504","ddc":["040"],"page":"318--327","_id":"2113","urn":"21137","file_date_updated":"2018-04-13T10:00:09Z","publication":"SPAA","citation":{"short":"B. Awerbuch, C. Scheideler, in: SPAA, 2006, pp. 318--327.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” In <i>SPAA</i>, 318--327, 2006.","apa":"Awerbuch, B., &#38; Scheideler, C. (2006). Towards a scalable and robust DHT. In <i>SPAA</i> (pp. 318--327).","ieee":"B. Awerbuch and C. Scheideler, “Towards a scalable and robust DHT,” in <i>SPAA</i>, 2006, pp. 318--327.","ama":"Awerbuch B, Scheideler C. Towards a scalable and robust DHT. In: <i>SPAA</i>. ; 2006:318--327.","bibtex":"@inproceedings{Awerbuch_Scheideler_2006, title={Towards a scalable and robust DHT}, booktitle={SPAA}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2006}, pages={318--327} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” <i>SPAA</i>, 2006, pp. 318--327."},"type":"conference","department":[{"_id":"79"}],"oa":"1","file":[{"creator":"florida","date_created":"2018-04-13T10:00:09Z","access_level":"open_access","file_size":144588,"file_name":"SPAA06.pdf","date_updated":"2018-04-13T10:00:09Z","relation":"main_file","content_type":"application/pdf","file_id":"2337"}],"date_created":"2018-04-03T05:24:22Z"},{"editor":[{"last_name":"Rammig","first_name":"Franz-Josef","full_name":"Rammig, Franz-Josef"},{"full_name":"Dangelmaier, Wilhelm","first_name":"Wilhelm","last_name":"Dangelmaier"},{"id":"126","first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"},{"full_name":"Mertsching, Bärbel","first_name":"Bärbel","last_name":"Mertsching"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Trächtler, Ansgar","first_name":"Ansgar","last_name":"Trächtler"}],"user_id":"15415","_id":"17417","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","language":[{"iso":"eng"}],"series_title":"Proceedings of the 6th International Heinz Nixdorf Symposium","date_updated":"2022-01-06T06:53:11Z","year":"2006","status":"public","title":"Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems","department":[{"_id":"63"},{"_id":"26"}],"type":"conference_editor","date_created":"2020-07-27T13:00:52Z","place":"Paderborn","abstract":[{"text":"We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality.","lang":"eng"}],"citation":{"bibtex":"@book{Rammig_Dangelmaier_Karl_Mertsching_Meyer auf der Heide_Trächtler_2006, place={Paderborn}, series={Proceedings of the 6th International Heinz Nixdorf Symposium}, title={Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, year={2006}, collection={Proceedings of the 6th International Heinz Nixdorf Symposium} }","chicago":"Rammig, Franz-Josef, Wilhelm Dangelmaier, Holger Karl, Bärbel Mertsching, Friedhelm Meyer auf der Heide, and Ansgar Trächtler, eds. <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Proceedings of the 6th International Heinz Nixdorf Symposium. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006.","short":"F.-J. Rammig, W. Dangelmaier, H. Karl, B. Mertsching, F. Meyer auf der Heide, A. Trächtler, eds., Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","ama":"Rammig F-J, Dangelmaier W, Karl H, Mertsching B, Meyer auf der Heide F, Trächtler A, eds. <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2006.","ieee":"F.-J. Rammig, W. Dangelmaier, H. Karl, B. Mertsching, F. Meyer auf der Heide, and A. Trächtler, Eds., <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006.","mla":"Rammig, Franz-Josef, et al., editors. <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006.","apa":"Rammig, F.-J., Dangelmaier, W., Karl, H., Mertsching, B., Meyer auf der Heide, F., &#38; Trächtler, A. (Eds.). (2006). <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts."}},{"citation":{"ama":"Monien B, Meyer auf der Heide F. <i>New Trends in Parallel and Distributed Computing</i>. Vol 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.","bibtex":"@book{Monien_Meyer auf der Heide_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={New trends in parallel and distributed computing}, volume={181}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Monien, Burkhard and Meyer auf der Heide, Friedhelm}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Monien, Burkhard, and Friedhelm Meyer auf der Heide. <i>New Trends in Parallel and Distributed Computing</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","short":"B. Monien, F. Meyer auf der Heide, New Trends in Parallel and Distributed Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","chicago":"Monien, Burkhard, and Friedhelm Meyer auf der Heide. <i>New Trends in Parallel and Distributed Computing</i>. Vol. 181. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","apa":"Monien, B., &#38; Meyer auf der Heide, F. (2006). <i>New trends in parallel and distributed computing</i> (Vol. 181). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"B. Monien and F. Meyer auf der Heide, <i>New trends in parallel and distributed computing</i>, vol. 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006."},"date_created":"2020-07-30T09:18:30Z","department":[{"_id":"63"},{"_id":"26"}],"type":"book","publication_identifier":{"isbn":["978-3-939350-00-2"]},"author":[{"full_name":"Monien, Burkhard","last_name":"Monien","first_name":"Burkhard"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"title":"New trends in parallel and distributed computing","status":"public","year":"2006","intvolume":"       181","date_updated":"2022-01-06T06:53:12Z","_id":"17475","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","volume":181,"alternative_title":["6th international Heinz Nixdorf symposium, January 17 - 18, 2006, Heinz Nixdorf MuseumsForum: within the scope of the {DFG} Collaborative Research Centre 376 Massively Parallel Computing: algorithms, design, methods, applications"],"user_id":"5786"},{"title":"Directional Communication in Mobile Ad Hoc Networks","status":"public","year":"2006","author":[{"full_name":"Grünewald, Matthias","first_name":"Matthias","last_name":"Grünewald"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Rührup, Stefan","last_name":"Rührup","first_name":"Stefan"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"},{"full_name":"Volbert, Klaus","first_name":"Klaus","last_name":"Volbert"}],"date_updated":"2022-01-06T06:53:16Z","page":"225-234","_id":"17619","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"15415","publication":"New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium","citation":{"ama":"Grünewald M, Meyer auf der Heide F, Rührup S, Schindelhauer C, Volbert K. Directional Communication in Mobile Ad Hoc Networks. In: <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2006:225-234.","bibtex":"@inproceedings{Grünewald_Meyer auf der Heide_Rührup_Schindelhauer_Volbert_2006, place={Paderborn}, title={Directional Communication in Mobile Ad Hoc Networks}, booktitle={New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Grünewald, Matthias and Meyer auf der Heide, Friedhelm and Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}, year={2006}, pages={225–234} }","mla":"Grünewald, Matthias, et al. “Directional Communication in Mobile Ad Hoc Networks.” <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006, pp. 225–34.","chicago":"Grünewald, Matthias, Friedhelm Meyer auf der Heide, Stefan Rührup, Christian Schindelhauer, and Klaus Volbert. “Directional Communication in Mobile Ad Hoc Networks.” In <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>, 225–34. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006.","short":"M. Grünewald, F. Meyer auf der Heide, S. Rührup, C. Schindelhauer, K. Volbert, in: New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006, pp. 225–234.","apa":"Grünewald, M., Meyer auf der Heide, F., Rührup, S., Schindelhauer, C., &#38; Volbert, K. (2006). Directional Communication in Mobile Ad Hoc Networks. <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>, 225–234.","ieee":"M. Grünewald, F. Meyer auf der Heide, S. Rührup, C. Schindelhauer, and K. Volbert, “Directional Communication in Mobile Ad Hoc Networks,” in <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>, 2006, pp. 225–234."},"date_created":"2020-08-05T09:36:46Z","place":"Paderborn","type":"conference","department":[{"_id":"63"},{"_id":"26"}]},{"citation":{"mla":"Sohler, Christian, et al. “Computing Clustering Coefficients in Data Streams.” <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>, 2006.","bibtex":"@inproceedings{Sohler_Frahling_Marchetti-Spaccamela_Leonardi_Buriol_2006, title={Computing Clustering Coefficients in Data Streams}, booktitle={Proceedings of  the European Conference on Complex Systems (ECCS’06)}, author={Sohler, Christian and Frahling, Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and Buriol, Luciana}, year={2006} }","ama":"Sohler C, Frahling G, Marchetti-Spaccamela A, Leonardi S, Buriol L. Computing Clustering Coefficients in Data Streams. In: <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>. ; 2006.","ieee":"C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, and L. Buriol, “Computing Clustering Coefficients in Data Streams,” in <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>, 2006.","apa":"Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., &#38; Buriol, L. (2006). Computing Clustering Coefficients in Data Streams. In <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>.","chicago":"Sohler, Christian, Gereon Frahling, Alberto Marchetti-Spaccamela, Stefano Leonardi, and Luciana Buriol. “Computing Clustering Coefficients in Data Streams.” In <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>, 2006.","short":"C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, L. Buriol, in: Proceedings of  the European Conference on Complex Systems (ECCS’06), 2006."},"publication":"Proceedings of  the European Conference on Complex Systems (ECCS'06)","abstract":[{"lang":"eng","text":"We present random sampling algorithms that with probability at least 1 - δ compute a (1 ± ǫ)- approximation of the clustering coefficient, the transitiv ity coefficient, and of the number of bipartite cliques in a graph given as a stream of edges. Our methods can be extended to approximately count the number of occurences of fixed constant-size subgraphs. Our a lgorithms only require one pass over the input stream and their storage space depends only on structural parameters of the graphs, the approxi- mation guarantee, and the confidence probability. For examp le, the algorithms to compute the clustering and transitivity coefficient depend on that coefficient but n ot on the size of the graph. Since many large social networks have small clustering and transitivity coe fficient, our algorithms use space independent of the size of the input for these graphs. We implemented our algorithms and evaluated their performance on networks from different appli- cation domains. The sizes of the considered input graphs varied from about 8, 000 nodes and 40, 000 edges to about 135 million nodes and more than 1 billion edges. For both algorithms we run experiments with a sample set size varying from 100, 000 to 1, 000, 000 to evaluate running time and approximation guarantee. Our algorithms appear to be time efficient for the se sample sizes."}],"date_created":"2020-08-31T08:25:01Z","department":[{"_id":"63"}],"type":"conference","author":[{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"},{"first_name":"Gereon","last_name":"Frahling","full_name":"Frahling, Gereon"},{"first_name":"Alberto","last_name":"Marchetti-Spaccamela","full_name":"Marchetti-Spaccamela, Alberto"},{"full_name":"Leonardi, Stefano","last_name":"Leonardi","first_name":"Stefano"},{"full_name":"Buriol, Luciana","last_name":"Buriol","first_name":"Luciana"}],"title":"Computing Clustering Coefficients in Data Streams","status":"public","year":"2006","date_updated":"2022-01-06T06:53:50Z","language":[{"iso":"eng"}],"_id":"18676","user_id":"15415"},{"citation":{"apa":"Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., &#38; Buriol, L. (2006). Counting Triangles in Data Streams. In Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS) (Ed.).","ieee":"C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, and L. Buriol, “Counting Triangles in Data Streams,” 2006.","chicago":"Sohler, Christian, Gereon Frahling, Alberto Marchetti-Spaccamela, Stefano Leonardi, and Luciana Buriol. “Counting Triangles in Data Streams.” edited by Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), 2006.","short":"C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, L. Buriol, in: Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS) (Ed.), 2006.","mla":"Sohler, Christian, et al. <i>Counting Triangles in Data Streams</i>. Edited by Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), 2006.","ama":"Sohler C, Frahling G, Marchetti-Spaccamela A, Leonardi S, Buriol L. Counting Triangles in Data Streams. In: Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), ed. ; 2006.","bibtex":"@inproceedings{Sohler_Frahling_Marchetti-Spaccamela_Leonardi_Buriol_2006, title={Counting Triangles in Data Streams}, author={Sohler, Christian and Frahling, Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and Buriol, Luciana}, editor={Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS)Editor}, year={2006} }"},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-01T10:34:00Z","date_updated":"2022-01-06T06:53:51Z","title":"Counting Triangles in Data Streams","year":"2006","status":"public","corporate_editor":["Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS)"],"author":[{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"},{"first_name":"Gereon","last_name":"Frahling","full_name":"Frahling, Gereon"},{"last_name":"Marchetti-Spaccamela","first_name":"Alberto","full_name":"Marchetti-Spaccamela, Alberto"},{"last_name":"Leonardi","first_name":"Stefano","full_name":"Leonardi, Stefano"},{"full_name":"Buriol, Luciana","first_name":"Luciana","last_name":"Buriol"}],"user_id":"15415","_id":"18745","language":[{"iso":"eng"}]},{"date_created":"2020-09-01T10:38:29Z","department":[{"_id":"63"}],"type":"conference","citation":{"chicago":"Sohler, Christian, Joachim Gehweiler, and Christiane Lammersen. “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem.” In <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2006.","short":"C. Sohler, J. Gehweiler, C. Lammersen, in: Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006.","ieee":"C. Sohler, J. Gehweiler, and C. Lammersen, “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem,” in <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2006.","apa":"Sohler, C., Gehweiler, J., &#38; Lammersen, C. (2006). A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. In <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>.","bibtex":"@inproceedings{Sohler_Gehweiler_Lammersen_2006, title={A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem}, booktitle={Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Sohler, Christian and Gehweiler, Joachim and Lammersen, Christiane}, year={2006} }","ama":"Sohler C, Gehweiler J, Lammersen C. A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. In: <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2006.","mla":"Sohler, Christian, et al. “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem.” <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2006."},"publication":"Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","abstract":[{"text":"In this paper, we present a randomized constant factor approximation\r\nalgorithm for the metric minimum facility location problem with uniform\r\ncosts and demands in a distributed setting, in which every point can\r\nopen a facility. In particular, our distributed algorithm uses three\r\ncommunication rounds with message sizes bounded to O(log n) bits where\r\nn is the number of points. We also extend our algorithm to constant\r\npowers of metric spaces, where we also obtain a randomized constant\r\nfactor approximation algorithm.","lang":"eng"}],"language":[{"iso":"eng"}],"_id":"18746","user_id":"15415","author":[{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"},{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"},{"full_name":"Lammersen, Christiane","last_name":"Lammersen","first_name":"Christiane"}],"year":"2006","title":"A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem","status":"public","date_updated":"2022-01-06T06:53:51Z"},{"publication_status":"published","date_updated":"2022-01-06T06:53:54Z","title":"Power-Aware Collective Tree Exploration","status":"public","year":"2006","author":[{"last_name":"Dynia","first_name":"Miroslaw","full_name":"Dynia, Miroslaw"},{"first_name":"Miroslaw","last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540327653","9783540327660"]},"user_id":"15415","doi":"10.1007/11682127_24","page":"341--351","_id":"18926","language":[{"iso":"eng"}],"issue":"3894","publication":"Architecture of Computing Systems - ARCS","citation":{"mla":"Dynia, Miroslaw, et al. “Power-Aware Collective Tree Exploration.” <i>Architecture of Computing Systems - ARCS</i>, no. 3894, 2006, pp. 341--351, doi:<a href=\"https://doi.org/10.1007/11682127_24\">10.1007/11682127_24</a>.","ama":"Dynia M, Korzeniowski M, Schindelhauer C. Power-Aware Collective Tree Exploration. In: <i>Architecture of Computing Systems - ARCS</i>. ; 2006:341--351. doi:<a href=\"https://doi.org/10.1007/11682127_24\">10.1007/11682127_24</a>","bibtex":"@inproceedings{Dynia_Korzeniowski_Schindelhauer_2006, title={Power-Aware Collective Tree Exploration}, DOI={<a href=\"https://doi.org/10.1007/11682127_24\">10.1007/11682127_24</a>}, number={3894}, booktitle={Architecture of Computing Systems - ARCS}, author={Dynia, Miroslaw and Korzeniowski, Miroslaw and Schindelhauer, Christian}, year={2006}, pages={341--351} }","apa":"Dynia, M., Korzeniowski, M., &#38; Schindelhauer, C. (2006). Power-Aware Collective Tree Exploration. In <i>Architecture of Computing Systems - ARCS</i> (pp. 341--351). <a href=\"https://doi.org/10.1007/11682127_24\">https://doi.org/10.1007/11682127_24</a>","ieee":"M. Dynia, M. Korzeniowski, and C. Schindelhauer, “Power-Aware Collective Tree Exploration,” in <i>Architecture of Computing Systems - ARCS</i>, 2006, no. 3894, pp. 341--351.","chicago":"Dynia, Miroslaw, Miroslaw Korzeniowski, and Christian Schindelhauer. “Power-Aware Collective Tree Exploration.” In <i>Architecture of Computing Systems - ARCS</i>, 341--351, 2006. <a href=\"https://doi.org/10.1007/11682127_24\">https://doi.org/10.1007/11682127_24</a>.","short":"M. Dynia, M. Korzeniowski, C. Schindelhauer, in: Architecture of Computing Systems - ARCS, 2006, pp. 341--351."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-03T10:13:56Z"}]